/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/openssl/s3_srvr.blast.11.i.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 15:24:43,068 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 15:24:43,070 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 15:24:43,113 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 15:24:43,113 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 15:24:43,114 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 15:24:43,117 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 15:24:43,119 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 15:24:43,121 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 15:24:43,122 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 15:24:43,123 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 15:24:43,123 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 15:24:43,124 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 15:24:43,128 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 15:24:43,129 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 15:24:43,131 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 15:24:43,132 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 15:24:43,132 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 15:24:43,134 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 15:24:43,139 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 15:24:43,141 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 15:24:43,142 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 15:24:43,142 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 15:24:43,143 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 15:24:43,144 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 15:24:43,150 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 15:24:43,150 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 15:24:43,151 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 15:24:43,151 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 15:24:43,152 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 15:24:43,153 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 15:24:43,153 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 15:24:43,154 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 15:24:43,155 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 15:24:43,155 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 15:24:43,156 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 15:24:43,156 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 15:24:43,157 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 15:24:43,157 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 15:24:43,157 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 15:24:43,158 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 15:24:43,159 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 15:24:43,159 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 15:24:43,169 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 15:24:43,169 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 15:24:43,170 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 15:24:43,170 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 15:24:43,171 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 15:24:43,171 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 15:24:43,171 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 15:24:43,171 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 15:24:43,171 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 15:24:43,172 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 15:24:43,172 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 15:24:43,172 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 15:24:43,172 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 15:24:43,172 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 15:24:43,172 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 15:24:43,172 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 15:24:43,173 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 15:24:43,173 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 15:24:43,173 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 15:24:43,173 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 15:24:43,173 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 15:24:43,173 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 15:24:43,173 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 15:24:43,374 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 15:24:43,393 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 15:24:43,395 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 15:24:43,396 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 15:24:43,396 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 15:24:43,397 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_srvr.blast.11.i.cil-1.c [2022-04-08 15:24:43,445 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44bef75c1/b1b4c74c50054bd89262d8014dac8ddf/FLAG232296cbd [2022-04-08 15:24:43,876 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 15:24:43,877 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.11.i.cil-1.c [2022-04-08 15:24:43,891 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44bef75c1/b1b4c74c50054bd89262d8014dac8ddf/FLAG232296cbd [2022-04-08 15:24:44,211 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44bef75c1/b1b4c74c50054bd89262d8014dac8ddf [2022-04-08 15:24:44,213 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 15:24:44,214 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 15:24:44,215 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 15:24:44,216 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 15:24:44,221 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 15:24:44,222 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 03:24:44" (1/1) ... [2022-04-08 15:24:44,223 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13484f1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:24:44, skipping insertion in model container [2022-04-08 15:24:44,223 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 03:24:44" (1/1) ... [2022-04-08 15:24:44,229 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 15:24:44,289 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 15:24:44,613 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.11.i.cil-1.c[74369,74382] [2022-04-08 15:24:44,621 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 15:24:44,632 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 15:24:44,759 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.11.i.cil-1.c[74369,74382] [2022-04-08 15:24:44,762 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 15:24:44,789 INFO L208 MainTranslator]: Completed translation [2022-04-08 15:24:44,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:24:44 WrapperNode [2022-04-08 15:24:44,790 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 15:24:44,791 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 15:24:44,791 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 15:24:44,792 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 15:24:44,801 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:24:44" (1/1) ... [2022-04-08 15:24:44,801 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:24:44" (1/1) ... [2022-04-08 15:24:44,834 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:24:44" (1/1) ... [2022-04-08 15:24:44,834 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:24:44" (1/1) ... [2022-04-08 15:24:44,912 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:24:44" (1/1) ... [2022-04-08 15:24:44,923 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:24:44" (1/1) ... [2022-04-08 15:24:44,926 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:24:44" (1/1) ... [2022-04-08 15:24:44,931 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 15:24:44,932 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 15:24:44,932 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 15:24:44,932 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 15:24:44,933 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:24:44" (1/1) ... [2022-04-08 15:24:44,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 15:24:44,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 15:24:44,959 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 15:24:44,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 15:24:44,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 15:24:44,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 15:24:44,998 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 15:24:44,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2022-04-08 15:24:44,998 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2022-04-08 15:24:44,999 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 15:24:44,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2022-04-08 15:24:44,999 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-08 15:24:44,999 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-08 15:24:44,999 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-08 15:24:44,999 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 15:24:44,999 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 15:24:44,999 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 15:24:44,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 15:24:45,000 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-08 15:24:45,000 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-08 15:24:45,000 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 15:24:45,000 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-08 15:24:45,000 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-08 15:24:45,000 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-08 15:24:45,000 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2022-04-08 15:24:45,000 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-08 15:24:45,001 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2022-04-08 15:24:45,001 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2022-04-08 15:24:45,001 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-08 15:24:45,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-08 15:24:45,001 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 15:24:45,001 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-08 15:24:45,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 15:24:45,001 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-08 15:24:45,001 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 15:24:45,002 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-08 15:24:45,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-08 15:24:45,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 15:24:45,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 15:24:45,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 15:24:45,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-08 15:24:45,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-08 15:24:45,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-08 15:24:45,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-08 15:24:45,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 15:24:45,141 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 15:24:45,142 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 15:24:45,804 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 15:24:46,326 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2022-04-08 15:24:46,326 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2022-04-08 15:24:46,337 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 15:24:46,348 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 15:24:46,348 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 15:24:46,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:24:46 BoogieIcfgContainer [2022-04-08 15:24:46,350 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 15:24:46,352 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 15:24:46,353 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 15:24:46,355 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 15:24:46,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 03:24:44" (1/3) ... [2022-04-08 15:24:46,356 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13c5b07e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:24:46, skipping insertion in model container [2022-04-08 15:24:46,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:24:44" (2/3) ... [2022-04-08 15:24:46,357 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13c5b07e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:24:46, skipping insertion in model container [2022-04-08 15:24:46,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:24:46" (3/3) ... [2022-04-08 15:24:46,367 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.11.i.cil-1.c [2022-04-08 15:24:46,378 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 15:24:46,378 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 15:24:46,425 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 15:24:46,430 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 15:24:46,430 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 15:24:46,450 INFO L276 IsEmpty]: Start isEmpty. Operand has 158 states, 150 states have (on average 1.7066666666666668) internal successors, (256), 151 states have internal predecessors, (256), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 15:24:46,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-08 15:24:46,461 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:24:46,461 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:24:46,462 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:24:46,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:24:46,465 INFO L85 PathProgramCache]: Analyzing trace with hash -671352377, now seen corresponding path program 1 times [2022-04-08 15:24:46,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:24:46,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1636728885] [2022-04-08 15:24:46,479 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 15:24:46,480 INFO L85 PathProgramCache]: Analyzing trace with hash -671352377, now seen corresponding path program 2 times [2022-04-08 15:24:46,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:24:46,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687182641] [2022-04-08 15:24:46,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:24:46,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:24:46,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:24:46,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:24:46,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:24:46,978 INFO L290 TraceCheckUtils]: 0: Hoare triple {168#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {161#true} is VALID [2022-04-08 15:24:46,978 INFO L290 TraceCheckUtils]: 1: Hoare triple {161#true} assume true; {161#true} is VALID [2022-04-08 15:24:46,978 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {161#true} {161#true} #690#return; {161#true} is VALID [2022-04-08 15:24:46,980 INFO L272 TraceCheckUtils]: 0: Hoare triple {161#true} call ULTIMATE.init(); {168#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:24:46,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {168#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {161#true} is VALID [2022-04-08 15:24:46,981 INFO L290 TraceCheckUtils]: 2: Hoare triple {161#true} assume true; {161#true} is VALID [2022-04-08 15:24:46,981 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {161#true} {161#true} #690#return; {161#true} is VALID [2022-04-08 15:24:46,981 INFO L272 TraceCheckUtils]: 4: Hoare triple {161#true} call #t~ret161 := main(); {161#true} is VALID [2022-04-08 15:24:46,981 INFO L290 TraceCheckUtils]: 5: Hoare triple {161#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {161#true} is VALID [2022-04-08 15:24:46,982 INFO L290 TraceCheckUtils]: 6: Hoare triple {161#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {161#true} is VALID [2022-04-08 15:24:46,982 INFO L272 TraceCheckUtils]: 7: Hoare triple {161#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {161#true} is VALID [2022-04-08 15:24:46,985 INFO L290 TraceCheckUtils]: 8: Hoare triple {161#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:24:46,986 INFO L290 TraceCheckUtils]: 9: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:24:46,987 INFO L290 TraceCheckUtils]: 10: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:24:46,987 INFO L290 TraceCheckUtils]: 11: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:24:46,988 INFO L290 TraceCheckUtils]: 12: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:24:46,988 INFO L290 TraceCheckUtils]: 13: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:24:46,989 INFO L290 TraceCheckUtils]: 14: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:24:46,990 INFO L290 TraceCheckUtils]: 15: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:24:46,990 INFO L290 TraceCheckUtils]: 16: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:24:46,991 INFO L290 TraceCheckUtils]: 17: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:24:46,991 INFO L290 TraceCheckUtils]: 18: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:24:46,992 INFO L290 TraceCheckUtils]: 19: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:24:46,993 INFO L290 TraceCheckUtils]: 20: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:24:46,993 INFO L290 TraceCheckUtils]: 21: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:24:46,994 INFO L290 TraceCheckUtils]: 22: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:24:46,994 INFO L290 TraceCheckUtils]: 23: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:24:46,995 INFO L290 TraceCheckUtils]: 24: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:24:46,995 INFO L290 TraceCheckUtils]: 25: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:24:46,996 INFO L290 TraceCheckUtils]: 26: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:24:46,997 INFO L290 TraceCheckUtils]: 27: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:24:46,997 INFO L290 TraceCheckUtils]: 28: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:24:46,998 INFO L290 TraceCheckUtils]: 29: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:24:46,998 INFO L290 TraceCheckUtils]: 30: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:24:46,999 INFO L290 TraceCheckUtils]: 31: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:24:47,000 INFO L290 TraceCheckUtils]: 32: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {167#(not (= |ssl3_accept_#t~mem64| 8544))} is VALID [2022-04-08 15:24:47,000 INFO L290 TraceCheckUtils]: 33: Hoare triple {167#(not (= |ssl3_accept_#t~mem64| 8544))} assume 8544 == #t~mem64;havoc #t~mem64; {162#false} is VALID [2022-04-08 15:24:47,000 INFO L290 TraceCheckUtils]: 34: Hoare triple {162#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {162#false} is VALID [2022-04-08 15:24:47,001 INFO L290 TraceCheckUtils]: 35: Hoare triple {162#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {162#false} is VALID [2022-04-08 15:24:47,001 INFO L290 TraceCheckUtils]: 36: Hoare triple {162#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {162#false} is VALID [2022-04-08 15:24:47,001 INFO L290 TraceCheckUtils]: 37: Hoare triple {162#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {162#false} is VALID [2022-04-08 15:24:47,001 INFO L290 TraceCheckUtils]: 38: Hoare triple {162#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {162#false} is VALID [2022-04-08 15:24:47,001 INFO L290 TraceCheckUtils]: 39: Hoare triple {162#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {162#false} is VALID [2022-04-08 15:24:47,002 INFO L290 TraceCheckUtils]: 40: Hoare triple {162#false} assume 7 == ~blastFlag~0; {162#false} is VALID [2022-04-08 15:24:47,002 INFO L290 TraceCheckUtils]: 41: Hoare triple {162#false} assume !false; {162#false} is VALID [2022-04-08 15:24:47,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 15:24:47,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:24:47,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687182641] [2022-04-08 15:24:47,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687182641] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:24:47,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:24:47,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:24:47,007 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:24:47,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1636728885] [2022-04-08 15:24:47,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1636728885] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:24:47,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:24:47,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:24:47,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957433854] [2022-04-08 15:24:47,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:24:47,013 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-08 15:24:47,015 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:24:47,021 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:24:47,081 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:24:47,082 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:24:47,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:24:47,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:24:47,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:24:47,118 INFO L87 Difference]: Start difference. First operand has 158 states, 150 states have (on average 1.7066666666666668) internal successors, (256), 151 states have internal predecessors, (256), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:24:49,781 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:24:55,143 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-08 15:24:58,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:24:58,420 INFO L93 Difference]: Finished difference Result 430 states and 727 transitions. [2022-04-08 15:24:58,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:24:58,421 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-08 15:24:58,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:24:58,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:24:58,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 727 transitions. [2022-04-08 15:24:58,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:24:58,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 727 transitions. [2022-04-08 15:24:58,454 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 727 transitions. [2022-04-08 15:24:59,054 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 727 edges. 727 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:24:59,072 INFO L225 Difference]: With dead ends: 430 [2022-04-08 15:24:59,072 INFO L226 Difference]: Without dead ends: 261 [2022-04-08 15:24:59,075 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 15:24:59,077 INFO L913 BasicCegarLoop]: 157 mSDtfsCounter, 167 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s 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, 5.0s IncrementalHoareTripleChecker+Time [2022-04-08 15:24:59,078 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [167 Valid, 461 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-04-08 15:24:59,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-04-08 15:24:59,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 170. [2022-04-08 15:24:59,133 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:24:59,137 INFO L82 GeneralOperation]: Start isEquivalent. First operand 261 states. Second operand has 170 states, 165 states have (on average 1.5818181818181818) internal successors, (261), 165 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:24:59,138 INFO L74 IsIncluded]: Start isIncluded. First operand 261 states. Second operand has 170 states, 165 states have (on average 1.5818181818181818) internal successors, (261), 165 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:24:59,139 INFO L87 Difference]: Start difference. First operand 261 states. Second operand has 170 states, 165 states have (on average 1.5818181818181818) internal successors, (261), 165 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:24:59,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:24:59,154 INFO L93 Difference]: Finished difference Result 261 states and 400 transitions. [2022-04-08 15:24:59,154 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 400 transitions. [2022-04-08 15:24:59,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:24:59,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:24:59,162 INFO L74 IsIncluded]: Start isIncluded. First operand has 170 states, 165 states have (on average 1.5818181818181818) internal successors, (261), 165 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 261 states. [2022-04-08 15:24:59,163 INFO L87 Difference]: Start difference. First operand has 170 states, 165 states have (on average 1.5818181818181818) internal successors, (261), 165 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 261 states. [2022-04-08 15:24:59,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:24:59,176 INFO L93 Difference]: Finished difference Result 261 states and 400 transitions. [2022-04-08 15:24:59,176 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 400 transitions. [2022-04-08 15:24:59,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:24:59,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:24:59,178 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:24:59,178 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:24:59,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 165 states have (on average 1.5818181818181818) internal successors, (261), 165 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:24:59,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 265 transitions. [2022-04-08 15:24:59,188 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 265 transitions. Word has length 42 [2022-04-08 15:24:59,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:24:59,188 INFO L478 AbstractCegarLoop]: Abstraction has 170 states and 265 transitions. [2022-04-08 15:24:59,189 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:24:59,189 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 170 states and 265 transitions. [2022-04-08 15:24:59,419 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 265 edges. 265 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:24:59,420 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 265 transitions. [2022-04-08 15:24:59,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-08 15:24:59,421 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:24:59,421 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:24:59,421 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 15:24:59,421 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:24:59,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:24:59,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1244096364, now seen corresponding path program 1 times [2022-04-08 15:24:59,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:24:59,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [396694857] [2022-04-08 15:24:59,423 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 15:24:59,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1244096364, now seen corresponding path program 2 times [2022-04-08 15:24:59,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:24:59,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483541821] [2022-04-08 15:24:59,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:24:59,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:24:59,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:24:59,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:24:59,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:24:59,686 INFO L290 TraceCheckUtils]: 0: Hoare triple {1902#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {1895#true} is VALID [2022-04-08 15:24:59,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {1895#true} assume true; {1895#true} is VALID [2022-04-08 15:24:59,687 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1895#true} {1895#true} #690#return; {1895#true} is VALID [2022-04-08 15:24:59,688 INFO L272 TraceCheckUtils]: 0: Hoare triple {1895#true} call ULTIMATE.init(); {1902#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:24:59,691 INFO L290 TraceCheckUtils]: 1: Hoare triple {1902#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {1895#true} is VALID [2022-04-08 15:24:59,691 INFO L290 TraceCheckUtils]: 2: Hoare triple {1895#true} assume true; {1895#true} is VALID [2022-04-08 15:24:59,691 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1895#true} {1895#true} #690#return; {1895#true} is VALID [2022-04-08 15:24:59,691 INFO L272 TraceCheckUtils]: 4: Hoare triple {1895#true} call #t~ret161 := main(); {1895#true} is VALID [2022-04-08 15:24:59,691 INFO L290 TraceCheckUtils]: 5: Hoare triple {1895#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {1895#true} is VALID [2022-04-08 15:24:59,692 INFO L290 TraceCheckUtils]: 6: Hoare triple {1895#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {1895#true} is VALID [2022-04-08 15:24:59,693 INFO L272 TraceCheckUtils]: 7: Hoare triple {1895#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {1895#true} is VALID [2022-04-08 15:24:59,696 INFO L290 TraceCheckUtils]: 8: Hoare triple {1895#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:24:59,697 INFO L290 TraceCheckUtils]: 9: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:24:59,698 INFO L290 TraceCheckUtils]: 10: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:24:59,698 INFO L290 TraceCheckUtils]: 11: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:24:59,699 INFO L290 TraceCheckUtils]: 12: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:24:59,699 INFO L290 TraceCheckUtils]: 13: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:24:59,700 INFO L290 TraceCheckUtils]: 14: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:24:59,700 INFO L290 TraceCheckUtils]: 15: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:24:59,701 INFO L290 TraceCheckUtils]: 16: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:24:59,702 INFO L290 TraceCheckUtils]: 17: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:24:59,702 INFO L290 TraceCheckUtils]: 18: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:24:59,703 INFO L290 TraceCheckUtils]: 19: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:24:59,703 INFO L290 TraceCheckUtils]: 20: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:24:59,704 INFO L290 TraceCheckUtils]: 21: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:24:59,704 INFO L290 TraceCheckUtils]: 22: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:24:59,705 INFO L290 TraceCheckUtils]: 23: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:24:59,705 INFO L290 TraceCheckUtils]: 24: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:24:59,706 INFO L290 TraceCheckUtils]: 25: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:24:59,706 INFO L290 TraceCheckUtils]: 26: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:24:59,707 INFO L290 TraceCheckUtils]: 27: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:24:59,707 INFO L290 TraceCheckUtils]: 28: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:24:59,708 INFO L290 TraceCheckUtils]: 29: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:24:59,708 INFO L290 TraceCheckUtils]: 30: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:24:59,709 INFO L290 TraceCheckUtils]: 31: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:24:59,709 INFO L290 TraceCheckUtils]: 32: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:24:59,710 INFO L290 TraceCheckUtils]: 33: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {1901#(not (= |ssl3_accept_#t~mem65| 8545))} is VALID [2022-04-08 15:24:59,710 INFO L290 TraceCheckUtils]: 34: Hoare triple {1901#(not (= |ssl3_accept_#t~mem65| 8545))} assume 8545 == #t~mem65;havoc #t~mem65; {1896#false} is VALID [2022-04-08 15:24:59,711 INFO L290 TraceCheckUtils]: 35: Hoare triple {1896#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {1896#false} is VALID [2022-04-08 15:24:59,711 INFO L290 TraceCheckUtils]: 36: Hoare triple {1896#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {1896#false} is VALID [2022-04-08 15:24:59,711 INFO L290 TraceCheckUtils]: 37: Hoare triple {1896#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {1896#false} is VALID [2022-04-08 15:24:59,711 INFO L290 TraceCheckUtils]: 38: Hoare triple {1896#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {1896#false} is VALID [2022-04-08 15:24:59,711 INFO L290 TraceCheckUtils]: 39: Hoare triple {1896#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {1896#false} is VALID [2022-04-08 15:24:59,712 INFO L290 TraceCheckUtils]: 40: Hoare triple {1896#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {1896#false} is VALID [2022-04-08 15:24:59,712 INFO L290 TraceCheckUtils]: 41: Hoare triple {1896#false} assume 7 == ~blastFlag~0; {1896#false} is VALID [2022-04-08 15:24:59,712 INFO L290 TraceCheckUtils]: 42: Hoare triple {1896#false} assume !false; {1896#false} is VALID [2022-04-08 15:24:59,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 15:24:59,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:24:59,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483541821] [2022-04-08 15:24:59,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483541821] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:24:59,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:24:59,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:24:59,714 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:24:59,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [396694857] [2022-04-08 15:24:59,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [396694857] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:24:59,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:24:59,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:24:59,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871687070] [2022-04-08 15:24:59,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:24:59,720 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-08 15:24:59,720 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:24:59,720 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:24:59,761 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:24:59,761 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:24:59,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:24:59,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:24:59,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:24:59,762 INFO L87 Difference]: Start difference. First operand 170 states and 265 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:25:01,750 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:25:04,677 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:25:06,685 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:25:10,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:25:10,339 INFO L93 Difference]: Finished difference Result 444 states and 697 transitions. [2022-04-08 15:25:10,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:25:10,340 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-08 15:25:10,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:25:10,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:25:10,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 597 transitions. [2022-04-08 15:25:10,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:25:10,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 597 transitions. [2022-04-08 15:25:10,352 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 597 transitions. [2022-04-08 15:25:10,797 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 597 edges. 597 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:25:10,804 INFO L225 Difference]: With dead ends: 444 [2022-04-08 15:25:10,804 INFO L226 Difference]: Without dead ends: 289 [2022-04-08 15:25:10,805 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 15:25:10,806 INFO L913 BasicCegarLoop]: 117 mSDtfsCounter, 134 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 64 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-04-08 15:25:10,806 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 342 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 476 Invalid, 1 Unknown, 0 Unchecked, 6.1s Time] [2022-04-08 15:25:10,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2022-04-08 15:25:10,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 199. [2022-04-08 15:25:10,820 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:25:10,821 INFO L82 GeneralOperation]: Start isEquivalent. First operand 289 states. Second operand has 199 states, 194 states have (on average 1.6134020618556701) internal successors, (313), 194 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:25:10,821 INFO L74 IsIncluded]: Start isIncluded. First operand 289 states. Second operand has 199 states, 194 states have (on average 1.6134020618556701) internal successors, (313), 194 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:25:10,822 INFO L87 Difference]: Start difference. First operand 289 states. Second operand has 199 states, 194 states have (on average 1.6134020618556701) internal successors, (313), 194 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:25:10,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:25:10,831 INFO L93 Difference]: Finished difference Result 289 states and 450 transitions. [2022-04-08 15:25:10,831 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 450 transitions. [2022-04-08 15:25:10,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:25:10,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:25:10,832 INFO L74 IsIncluded]: Start isIncluded. First operand has 199 states, 194 states have (on average 1.6134020618556701) internal successors, (313), 194 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 289 states. [2022-04-08 15:25:10,833 INFO L87 Difference]: Start difference. First operand has 199 states, 194 states have (on average 1.6134020618556701) internal successors, (313), 194 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 289 states. [2022-04-08 15:25:10,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:25:10,842 INFO L93 Difference]: Finished difference Result 289 states and 450 transitions. [2022-04-08 15:25:10,842 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 450 transitions. [2022-04-08 15:25:10,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:25:10,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:25:10,843 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:25:10,843 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:25:10,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 194 states have (on average 1.6134020618556701) internal successors, (313), 194 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:25:10,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 317 transitions. [2022-04-08 15:25:10,850 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 317 transitions. Word has length 43 [2022-04-08 15:25:10,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:25:10,850 INFO L478 AbstractCegarLoop]: Abstraction has 199 states and 317 transitions. [2022-04-08 15:25:10,850 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:25:10,850 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 199 states and 317 transitions. [2022-04-08 15:25:11,072 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 317 edges. 317 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:25:11,073 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 317 transitions. [2022-04-08 15:25:11,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-08 15:25:11,074 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:25:11,074 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:25:11,074 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 15:25:11,074 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:25:11,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:25:11,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1913847322, now seen corresponding path program 1 times [2022-04-08 15:25:11,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:25:11,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1752124089] [2022-04-08 15:25:11,075 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 15:25:11,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1913847322, now seen corresponding path program 2 times [2022-04-08 15:25:11,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:25:11,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082878337] [2022-04-08 15:25:11,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:25:11,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:25:11,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:25:11,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:25:11,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:25:11,335 INFO L290 TraceCheckUtils]: 0: Hoare triple {3778#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {3771#true} is VALID [2022-04-08 15:25:11,335 INFO L290 TraceCheckUtils]: 1: Hoare triple {3771#true} assume true; {3771#true} is VALID [2022-04-08 15:25:11,335 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3771#true} {3771#true} #690#return; {3771#true} is VALID [2022-04-08 15:25:11,336 INFO L272 TraceCheckUtils]: 0: Hoare triple {3771#true} call ULTIMATE.init(); {3778#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:25:11,337 INFO L290 TraceCheckUtils]: 1: Hoare triple {3778#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {3771#true} is VALID [2022-04-08 15:25:11,337 INFO L290 TraceCheckUtils]: 2: Hoare triple {3771#true} assume true; {3771#true} is VALID [2022-04-08 15:25:11,337 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3771#true} {3771#true} #690#return; {3771#true} is VALID [2022-04-08 15:25:11,337 INFO L272 TraceCheckUtils]: 4: Hoare triple {3771#true} call #t~ret161 := main(); {3771#true} is VALID [2022-04-08 15:25:11,337 INFO L290 TraceCheckUtils]: 5: Hoare triple {3771#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {3771#true} is VALID [2022-04-08 15:25:11,337 INFO L290 TraceCheckUtils]: 6: Hoare triple {3771#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {3771#true} is VALID [2022-04-08 15:25:11,337 INFO L272 TraceCheckUtils]: 7: Hoare triple {3771#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {3771#true} is VALID [2022-04-08 15:25:11,341 INFO L290 TraceCheckUtils]: 8: Hoare triple {3771#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-08 15:25:11,342 INFO L290 TraceCheckUtils]: 9: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-08 15:25:11,343 INFO L290 TraceCheckUtils]: 10: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-08 15:25:11,346 INFO L290 TraceCheckUtils]: 11: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-08 15:25:11,346 INFO L290 TraceCheckUtils]: 12: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-08 15:25:11,347 INFO L290 TraceCheckUtils]: 13: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-08 15:25:11,347 INFO L290 TraceCheckUtils]: 14: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !false; {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-08 15:25:11,348 INFO L290 TraceCheckUtils]: 15: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-08 15:25:11,348 INFO L290 TraceCheckUtils]: 16: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-08 15:25:11,349 INFO L290 TraceCheckUtils]: 17: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-08 15:25:11,349 INFO L290 TraceCheckUtils]: 18: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-08 15:25:11,350 INFO L290 TraceCheckUtils]: 19: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-08 15:25:11,350 INFO L290 TraceCheckUtils]: 20: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-08 15:25:11,351 INFO L290 TraceCheckUtils]: 21: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-08 15:25:11,351 INFO L290 TraceCheckUtils]: 22: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-08 15:25:11,352 INFO L290 TraceCheckUtils]: 23: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-08 15:25:11,353 INFO L290 TraceCheckUtils]: 24: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-08 15:25:11,353 INFO L290 TraceCheckUtils]: 25: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-08 15:25:11,354 INFO L290 TraceCheckUtils]: 26: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-08 15:25:11,354 INFO L290 TraceCheckUtils]: 27: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-08 15:25:11,355 INFO L290 TraceCheckUtils]: 28: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-08 15:25:11,355 INFO L290 TraceCheckUtils]: 29: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-08 15:25:11,356 INFO L290 TraceCheckUtils]: 30: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-08 15:25:11,356 INFO L290 TraceCheckUtils]: 31: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-08 15:25:11,357 INFO L290 TraceCheckUtils]: 32: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-08 15:25:11,357 INFO L290 TraceCheckUtils]: 33: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-08 15:25:11,358 INFO L290 TraceCheckUtils]: 34: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-08 15:25:11,358 INFO L290 TraceCheckUtils]: 35: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-08 15:25:11,358 INFO L290 TraceCheckUtils]: 36: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-08 15:25:11,359 INFO L290 TraceCheckUtils]: 37: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-08 15:25:11,359 INFO L290 TraceCheckUtils]: 38: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-08 15:25:11,360 INFO L290 TraceCheckUtils]: 39: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-08 15:25:11,360 INFO L290 TraceCheckUtils]: 40: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-08 15:25:11,361 INFO L290 TraceCheckUtils]: 41: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-08 15:25:11,361 INFO L290 TraceCheckUtils]: 42: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-08 15:25:11,362 INFO L290 TraceCheckUtils]: 43: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {3777#(not (= |ssl3_accept_#t~mem75| 8640))} is VALID [2022-04-08 15:25:11,362 INFO L290 TraceCheckUtils]: 44: Hoare triple {3777#(not (= |ssl3_accept_#t~mem75| 8640))} assume 8640 == #t~mem75;havoc #t~mem75; {3772#false} is VALID [2022-04-08 15:25:11,363 INFO L290 TraceCheckUtils]: 45: Hoare triple {3772#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {3772#false} is VALID [2022-04-08 15:25:11,363 INFO L290 TraceCheckUtils]: 46: Hoare triple {3772#false} assume !(4 == ~blastFlag~0); {3772#false} is VALID [2022-04-08 15:25:11,363 INFO L290 TraceCheckUtils]: 47: Hoare triple {3772#false} assume 5 == ~blastFlag~0; {3772#false} is VALID [2022-04-08 15:25:11,363 INFO L290 TraceCheckUtils]: 48: Hoare triple {3772#false} assume !false; {3772#false} is VALID [2022-04-08 15:25:11,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 15:25:11,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:25:11,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082878337] [2022-04-08 15:25:11,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082878337] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:25:11,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:25:11,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:25:11,364 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:25:11,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1752124089] [2022-04-08 15:25:11,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1752124089] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:25:11,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:25:11,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:25:11,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325968419] [2022-04-08 15:25:11,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:25:11,365 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-08 15:25:11,365 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:25:11,366 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:25:11,405 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:25:11,405 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:25:11,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:25:11,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:25:11,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:25:11,406 INFO L87 Difference]: Start difference. First operand 199 states and 317 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:25:14,914 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:25:19,847 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:25:21,874 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:25:23,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:25:23,161 INFO L93 Difference]: Finished difference Result 503 states and 800 transitions. [2022-04-08 15:25:23,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:25:23,162 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-08 15:25:23,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:25:23,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:25:23,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 597 transitions. [2022-04-08 15:25:23,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:25:23,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 597 transitions. [2022-04-08 15:25:23,173 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 597 transitions. [2022-04-08 15:25:23,606 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 597 edges. 597 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:25:23,613 INFO L225 Difference]: With dead ends: 503 [2022-04-08 15:25:23,613 INFO L226 Difference]: Without dead ends: 319 [2022-04-08 15:25:23,614 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 15:25:23,615 INFO L913 BasicCegarLoop]: 118 mSDtfsCounter, 123 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 61 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-04-08 15:25:23,615 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 344 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 479 Invalid, 2 Unknown, 0 Unchecked, 6.9s Time] [2022-04-08 15:25:23,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-04-08 15:25:23,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 239. [2022-04-08 15:25:23,631 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:25:23,631 INFO L82 GeneralOperation]: Start isEquivalent. First operand 319 states. Second operand has 239 states, 234 states have (on average 1.641025641025641) internal successors, (384), 234 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:25:23,632 INFO L74 IsIncluded]: Start isIncluded. First operand 319 states. Second operand has 239 states, 234 states have (on average 1.641025641025641) internal successors, (384), 234 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:25:23,633 INFO L87 Difference]: Start difference. First operand 319 states. Second operand has 239 states, 234 states have (on average 1.641025641025641) internal successors, (384), 234 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:25:23,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:25:23,640 INFO L93 Difference]: Finished difference Result 319 states and 501 transitions. [2022-04-08 15:25:23,640 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 501 transitions. [2022-04-08 15:25:23,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:25:23,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:25:23,642 INFO L74 IsIncluded]: Start isIncluded. First operand has 239 states, 234 states have (on average 1.641025641025641) internal successors, (384), 234 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 319 states. [2022-04-08 15:25:23,642 INFO L87 Difference]: Start difference. First operand has 239 states, 234 states have (on average 1.641025641025641) internal successors, (384), 234 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 319 states. [2022-04-08 15:25:23,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:25:23,650 INFO L93 Difference]: Finished difference Result 319 states and 501 transitions. [2022-04-08 15:25:23,650 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 501 transitions. [2022-04-08 15:25:23,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:25:23,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:25:23,651 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:25:23,651 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:25:23,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 234 states have (on average 1.641025641025641) internal successors, (384), 234 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:25:23,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 388 transitions. [2022-04-08 15:25:23,658 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 388 transitions. Word has length 49 [2022-04-08 15:25:23,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:25:23,658 INFO L478 AbstractCegarLoop]: Abstraction has 239 states and 388 transitions. [2022-04-08 15:25:23,658 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:25:23,658 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 239 states and 388 transitions. [2022-04-08 15:25:23,936 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 388 edges. 388 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:25:23,937 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 388 transitions. [2022-04-08 15:25:23,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-08 15:25:23,937 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:25:23,937 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:25:23,938 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 15:25:23,938 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:25:23,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:25:23,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1017457862, now seen corresponding path program 1 times [2022-04-08 15:25:23,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:25:23,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [868446705] [2022-04-08 15:25:23,939 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 15:25:23,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1017457862, now seen corresponding path program 2 times [2022-04-08 15:25:23,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:25:23,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808652286] [2022-04-08 15:25:23,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:25:23,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:25:24,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:25:24,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:25:24,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:25:24,097 INFO L290 TraceCheckUtils]: 0: Hoare triple {5912#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {5905#true} is VALID [2022-04-08 15:25:24,097 INFO L290 TraceCheckUtils]: 1: Hoare triple {5905#true} assume true; {5905#true} is VALID [2022-04-08 15:25:24,097 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5905#true} {5905#true} #690#return; {5905#true} is VALID [2022-04-08 15:25:24,098 INFO L272 TraceCheckUtils]: 0: Hoare triple {5905#true} call ULTIMATE.init(); {5912#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:25:24,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {5912#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {5905#true} is VALID [2022-04-08 15:25:24,098 INFO L290 TraceCheckUtils]: 2: Hoare triple {5905#true} assume true; {5905#true} is VALID [2022-04-08 15:25:24,098 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5905#true} {5905#true} #690#return; {5905#true} is VALID [2022-04-08 15:25:24,098 INFO L272 TraceCheckUtils]: 4: Hoare triple {5905#true} call #t~ret161 := main(); {5905#true} is VALID [2022-04-08 15:25:24,098 INFO L290 TraceCheckUtils]: 5: Hoare triple {5905#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {5905#true} is VALID [2022-04-08 15:25:24,099 INFO L290 TraceCheckUtils]: 6: Hoare triple {5905#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {5905#true} is VALID [2022-04-08 15:25:24,099 INFO L272 TraceCheckUtils]: 7: Hoare triple {5905#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {5905#true} is VALID [2022-04-08 15:25:24,101 INFO L290 TraceCheckUtils]: 8: Hoare triple {5905#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:25:24,102 INFO L290 TraceCheckUtils]: 9: Hoare triple {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:25:24,103 INFO L290 TraceCheckUtils]: 10: Hoare triple {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:25:24,103 INFO L290 TraceCheckUtils]: 11: Hoare triple {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:25:24,104 INFO L290 TraceCheckUtils]: 12: Hoare triple {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:25:24,104 INFO L290 TraceCheckUtils]: 13: Hoare triple {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:25:24,104 INFO L290 TraceCheckUtils]: 14: Hoare triple {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:25:24,105 INFO L290 TraceCheckUtils]: 15: Hoare triple {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:25:24,105 INFO L290 TraceCheckUtils]: 16: Hoare triple {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:25:24,106 INFO L290 TraceCheckUtils]: 17: Hoare triple {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:25:24,106 INFO L290 TraceCheckUtils]: 18: Hoare triple {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:25:24,107 INFO L290 TraceCheckUtils]: 19: Hoare triple {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:25:24,107 INFO L290 TraceCheckUtils]: 20: Hoare triple {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:25:24,108 INFO L290 TraceCheckUtils]: 21: Hoare triple {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:25:24,108 INFO L290 TraceCheckUtils]: 22: Hoare triple {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:25:24,109 INFO L290 TraceCheckUtils]: 23: Hoare triple {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {5911#(= 8464 |ssl3_accept_#t~mem55|)} is VALID [2022-04-08 15:25:24,109 INFO L290 TraceCheckUtils]: 24: Hoare triple {5911#(= 8464 |ssl3_accept_#t~mem55|)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-08 15:25:24,109 INFO L290 TraceCheckUtils]: 25: Hoare triple {5906#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-08 15:25:24,109 INFO L290 TraceCheckUtils]: 26: Hoare triple {5906#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-08 15:25:24,109 INFO L290 TraceCheckUtils]: 27: Hoare triple {5906#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-08 15:25:24,109 INFO L290 TraceCheckUtils]: 28: Hoare triple {5906#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-08 15:25:24,110 INFO L290 TraceCheckUtils]: 29: Hoare triple {5906#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-08 15:25:24,110 INFO L290 TraceCheckUtils]: 30: Hoare triple {5906#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-08 15:25:24,110 INFO L290 TraceCheckUtils]: 31: Hoare triple {5906#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-08 15:25:24,110 INFO L290 TraceCheckUtils]: 32: Hoare triple {5906#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-08 15:25:24,110 INFO L290 TraceCheckUtils]: 33: Hoare triple {5906#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-08 15:25:24,110 INFO L290 TraceCheckUtils]: 34: Hoare triple {5906#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-08 15:25:24,110 INFO L290 TraceCheckUtils]: 35: Hoare triple {5906#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-08 15:25:24,110 INFO L290 TraceCheckUtils]: 36: Hoare triple {5906#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-08 15:25:24,110 INFO L290 TraceCheckUtils]: 37: Hoare triple {5906#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-08 15:25:24,111 INFO L290 TraceCheckUtils]: 38: Hoare triple {5906#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-08 15:25:24,111 INFO L290 TraceCheckUtils]: 39: Hoare triple {5906#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-08 15:25:24,111 INFO L290 TraceCheckUtils]: 40: Hoare triple {5906#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-08 15:25:24,111 INFO L290 TraceCheckUtils]: 41: Hoare triple {5906#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-08 15:25:24,111 INFO L290 TraceCheckUtils]: 42: Hoare triple {5906#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-08 15:25:24,111 INFO L290 TraceCheckUtils]: 43: Hoare triple {5906#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-08 15:25:24,111 INFO L290 TraceCheckUtils]: 44: Hoare triple {5906#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-08 15:25:24,112 INFO L290 TraceCheckUtils]: 45: Hoare triple {5906#false} assume 8641 == #t~mem76;havoc #t~mem76; {5906#false} is VALID [2022-04-08 15:25:24,112 INFO L290 TraceCheckUtils]: 46: Hoare triple {5906#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {5906#false} is VALID [2022-04-08 15:25:24,112 INFO L290 TraceCheckUtils]: 47: Hoare triple {5906#false} assume !(4 == ~blastFlag~0); {5906#false} is VALID [2022-04-08 15:25:24,112 INFO L290 TraceCheckUtils]: 48: Hoare triple {5906#false} assume 5 == ~blastFlag~0; {5906#false} is VALID [2022-04-08 15:25:24,112 INFO L290 TraceCheckUtils]: 49: Hoare triple {5906#false} assume !false; {5906#false} is VALID [2022-04-08 15:25:24,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 15:25:24,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:25:24,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808652286] [2022-04-08 15:25:24,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808652286] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:25:24,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:25:24,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:25:24,113 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:25:24,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [868446705] [2022-04-08 15:25:24,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [868446705] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:25:24,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:25:24,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:25:24,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518852525] [2022-04-08 15:25:24,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:25:24,114 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2022-04-08 15:25:24,114 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:25:24,114 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:25:24,158 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:25:24,158 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:25:24,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:25:24,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:25:24,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:25:24,159 INFO L87 Difference]: Start difference. First operand 239 states and 388 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:25:32,294 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:25:33,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:25:33,326 INFO L93 Difference]: Finished difference Result 491 states and 798 transitions. [2022-04-08 15:25:33,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:25:33,326 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2022-04-08 15:25:33,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:25:33,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:25:33,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 452 transitions. [2022-04-08 15:25:33,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:25:33,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 452 transitions. [2022-04-08 15:25:33,333 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 452 transitions. [2022-04-08 15:25:33,671 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 452 edges. 452 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:25:33,676 INFO L225 Difference]: With dead ends: 491 [2022-04-08 15:25:33,677 INFO L226 Difference]: Without dead ends: 267 [2022-04-08 15:25:33,677 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 15:25:33,678 INFO L913 BasicCegarLoop]: 186 mSDtfsCounter, 22 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s 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, 3.4s IncrementalHoareTripleChecker+Time [2022-04-08 15:25:33,678 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 481 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-04-08 15:25:33,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-04-08 15:25:33,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 250. [2022-04-08 15:25:33,691 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:25:33,691 INFO L82 GeneralOperation]: Start isEquivalent. First operand 267 states. Second operand has 250 states, 245 states have (on average 1.6448979591836734) internal successors, (403), 245 states have internal predecessors, (403), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:25:33,692 INFO L74 IsIncluded]: Start isIncluded. First operand 267 states. Second operand has 250 states, 245 states have (on average 1.6448979591836734) internal successors, (403), 245 states have internal predecessors, (403), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:25:33,693 INFO L87 Difference]: Start difference. First operand 267 states. Second operand has 250 states, 245 states have (on average 1.6448979591836734) internal successors, (403), 245 states have internal predecessors, (403), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:25:33,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:25:33,699 INFO L93 Difference]: Finished difference Result 267 states and 428 transitions. [2022-04-08 15:25:33,699 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 428 transitions. [2022-04-08 15:25:33,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:25:33,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:25:33,700 INFO L74 IsIncluded]: Start isIncluded. First operand has 250 states, 245 states have (on average 1.6448979591836734) internal successors, (403), 245 states have internal predecessors, (403), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 267 states. [2022-04-08 15:25:33,700 INFO L87 Difference]: Start difference. First operand has 250 states, 245 states have (on average 1.6448979591836734) internal successors, (403), 245 states have internal predecessors, (403), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 267 states. [2022-04-08 15:25:33,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:25:33,707 INFO L93 Difference]: Finished difference Result 267 states and 428 transitions. [2022-04-08 15:25:33,707 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 428 transitions. [2022-04-08 15:25:33,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:25:33,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:25:33,707 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:25:33,707 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:25:33,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 245 states have (on average 1.6448979591836734) internal successors, (403), 245 states have internal predecessors, (403), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:25:33,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 407 transitions. [2022-04-08 15:25:33,714 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 407 transitions. Word has length 50 [2022-04-08 15:25:33,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:25:33,714 INFO L478 AbstractCegarLoop]: Abstraction has 250 states and 407 transitions. [2022-04-08 15:25:33,714 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:25:33,714 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 407 transitions. [2022-04-08 15:25:34,035 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 407 edges. 407 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:25:34,035 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 407 transitions. [2022-04-08 15:25:34,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-08 15:25:34,036 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:25:34,036 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:25:34,036 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 15:25:34,036 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:25:34,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:25:34,037 INFO L85 PathProgramCache]: Analyzing trace with hash 516188517, now seen corresponding path program 1 times [2022-04-08 15:25:34,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:25:34,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [334152137] [2022-04-08 15:25:34,056 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:25:34,057 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:25:34,057 INFO L85 PathProgramCache]: Analyzing trace with hash 516188517, now seen corresponding path program 2 times [2022-04-08 15:25:34,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:25:34,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714133538] [2022-04-08 15:25:34,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:25:34,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:25:34,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:25:34,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:25:34,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:25:34,221 INFO L290 TraceCheckUtils]: 0: Hoare triple {7940#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {7933#true} is VALID [2022-04-08 15:25:34,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {7933#true} assume true; {7933#true} is VALID [2022-04-08 15:25:34,222 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7933#true} {7933#true} #690#return; {7933#true} is VALID [2022-04-08 15:25:34,222 INFO L272 TraceCheckUtils]: 0: Hoare triple {7933#true} call ULTIMATE.init(); {7940#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:25:34,222 INFO L290 TraceCheckUtils]: 1: Hoare triple {7940#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {7933#true} is VALID [2022-04-08 15:25:34,225 INFO L290 TraceCheckUtils]: 2: Hoare triple {7933#true} assume true; {7933#true} is VALID [2022-04-08 15:25:34,226 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7933#true} {7933#true} #690#return; {7933#true} is VALID [2022-04-08 15:25:34,226 INFO L272 TraceCheckUtils]: 4: Hoare triple {7933#true} call #t~ret161 := main(); {7933#true} is VALID [2022-04-08 15:25:34,226 INFO L290 TraceCheckUtils]: 5: Hoare triple {7933#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {7933#true} is VALID [2022-04-08 15:25:34,226 INFO L290 TraceCheckUtils]: 6: Hoare triple {7933#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {7933#true} is VALID [2022-04-08 15:25:34,226 INFO L272 TraceCheckUtils]: 7: Hoare triple {7933#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {7933#true} is VALID [2022-04-08 15:25:34,228 INFO L290 TraceCheckUtils]: 8: Hoare triple {7933#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:25:34,229 INFO L290 TraceCheckUtils]: 9: Hoare triple {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:25:34,230 INFO L290 TraceCheckUtils]: 10: Hoare triple {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:25:34,230 INFO L290 TraceCheckUtils]: 11: Hoare triple {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:25:34,231 INFO L290 TraceCheckUtils]: 12: Hoare triple {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:25:34,231 INFO L290 TraceCheckUtils]: 13: Hoare triple {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:25:34,232 INFO L290 TraceCheckUtils]: 14: Hoare triple {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:25:34,232 INFO L290 TraceCheckUtils]: 15: Hoare triple {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:25:34,232 INFO L290 TraceCheckUtils]: 16: Hoare triple {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:25:34,233 INFO L290 TraceCheckUtils]: 17: Hoare triple {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:25:34,233 INFO L290 TraceCheckUtils]: 18: Hoare triple {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:25:34,234 INFO L290 TraceCheckUtils]: 19: Hoare triple {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:25:34,234 INFO L290 TraceCheckUtils]: 20: Hoare triple {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {7939#(= 8464 |ssl3_accept_#t~mem52|)} is VALID [2022-04-08 15:25:34,234 INFO L290 TraceCheckUtils]: 21: Hoare triple {7939#(= 8464 |ssl3_accept_#t~mem52|)} assume 8480 == #t~mem52;havoc #t~mem52; {7934#false} is VALID [2022-04-08 15:25:34,235 INFO L290 TraceCheckUtils]: 22: Hoare triple {7934#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {7934#false} is VALID [2022-04-08 15:25:34,235 INFO L290 TraceCheckUtils]: 23: Hoare triple {7934#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8482, #t~mem91.base, 904 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {7934#false} is VALID [2022-04-08 15:25:34,235 INFO L290 TraceCheckUtils]: 24: Hoare triple {7934#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {7934#false} is VALID [2022-04-08 15:25:34,235 INFO L290 TraceCheckUtils]: 25: Hoare triple {7934#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {7934#false} is VALID [2022-04-08 15:25:34,235 INFO L290 TraceCheckUtils]: 26: Hoare triple {7934#false} ~skip~0 := 0; {7934#false} is VALID [2022-04-08 15:25:34,235 INFO L290 TraceCheckUtils]: 27: Hoare triple {7934#false} assume !false; {7934#false} is VALID [2022-04-08 15:25:34,235 INFO L290 TraceCheckUtils]: 28: Hoare triple {7934#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-08 15:25:34,235 INFO L290 TraceCheckUtils]: 29: Hoare triple {7934#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-08 15:25:34,236 INFO L290 TraceCheckUtils]: 30: Hoare triple {7934#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-08 15:25:34,236 INFO L290 TraceCheckUtils]: 31: Hoare triple {7934#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-08 15:25:34,236 INFO L290 TraceCheckUtils]: 32: Hoare triple {7934#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-08 15:25:34,236 INFO L290 TraceCheckUtils]: 33: Hoare triple {7934#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-08 15:25:34,236 INFO L290 TraceCheckUtils]: 34: Hoare triple {7934#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-08 15:25:34,237 INFO L290 TraceCheckUtils]: 35: Hoare triple {7934#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-08 15:25:34,237 INFO L290 TraceCheckUtils]: 36: Hoare triple {7934#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-08 15:25:34,237 INFO L290 TraceCheckUtils]: 37: Hoare triple {7934#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-08 15:25:34,237 INFO L290 TraceCheckUtils]: 38: Hoare triple {7934#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-08 15:25:34,237 INFO L290 TraceCheckUtils]: 39: Hoare triple {7934#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-08 15:25:34,237 INFO L290 TraceCheckUtils]: 40: Hoare triple {7934#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-08 15:25:34,237 INFO L290 TraceCheckUtils]: 41: Hoare triple {7934#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-08 15:25:34,237 INFO L290 TraceCheckUtils]: 42: Hoare triple {7934#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-08 15:25:34,237 INFO L290 TraceCheckUtils]: 43: Hoare triple {7934#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-08 15:25:34,238 INFO L290 TraceCheckUtils]: 44: Hoare triple {7934#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-08 15:25:34,238 INFO L290 TraceCheckUtils]: 45: Hoare triple {7934#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-08 15:25:34,238 INFO L290 TraceCheckUtils]: 46: Hoare triple {7934#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-08 15:25:34,241 INFO L290 TraceCheckUtils]: 47: Hoare triple {7934#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-08 15:25:34,242 INFO L290 TraceCheckUtils]: 48: Hoare triple {7934#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-08 15:25:34,247 INFO L290 TraceCheckUtils]: 49: Hoare triple {7934#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-08 15:25:34,248 INFO L290 TraceCheckUtils]: 50: Hoare triple {7934#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-08 15:25:34,248 INFO L290 TraceCheckUtils]: 51: Hoare triple {7934#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-08 15:25:34,248 INFO L290 TraceCheckUtils]: 52: Hoare triple {7934#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-08 15:25:34,249 INFO L290 TraceCheckUtils]: 53: Hoare triple {7934#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-08 15:25:34,249 INFO L290 TraceCheckUtils]: 54: Hoare triple {7934#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-08 15:25:34,249 INFO L290 TraceCheckUtils]: 55: Hoare triple {7934#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-08 15:25:34,249 INFO L290 TraceCheckUtils]: 56: Hoare triple {7934#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-08 15:25:34,249 INFO L290 TraceCheckUtils]: 57: Hoare triple {7934#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-08 15:25:34,249 INFO L290 TraceCheckUtils]: 58: Hoare triple {7934#false} assume 8641 == #t~mem76;havoc #t~mem76; {7934#false} is VALID [2022-04-08 15:25:34,249 INFO L290 TraceCheckUtils]: 59: Hoare triple {7934#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {7934#false} is VALID [2022-04-08 15:25:34,249 INFO L290 TraceCheckUtils]: 60: Hoare triple {7934#false} assume !(4 == ~blastFlag~0); {7934#false} is VALID [2022-04-08 15:25:34,249 INFO L290 TraceCheckUtils]: 61: Hoare triple {7934#false} assume 5 == ~blastFlag~0; {7934#false} is VALID [2022-04-08 15:25:34,250 INFO L290 TraceCheckUtils]: 62: Hoare triple {7934#false} assume !false; {7934#false} is VALID [2022-04-08 15:25:34,250 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 15:25:34,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:25:34,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714133538] [2022-04-08 15:25:34,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714133538] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:25:34,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:25:34,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:25:34,251 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:25:34,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [334152137] [2022-04-08 15:25:34,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [334152137] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:25:34,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:25:34,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:25:34,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336728023] [2022-04-08 15:25:34,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:25:34,252 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2022-04-08 15:25:34,252 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:25:34,252 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:25:34,301 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:25:34,301 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:25:34,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:25:34,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:25:34,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:25:34,303 INFO L87 Difference]: Start difference. First operand 250 states and 407 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:25:36,593 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:25:40,364 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:25:42,088 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:25:45,947 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:25:47,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:25:47,073 INFO L93 Difference]: Finished difference Result 491 states and 797 transitions. [2022-04-08 15:25:47,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:25:47,073 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2022-04-08 15:25:47,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:25:47,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:25:47,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 451 transitions. [2022-04-08 15:25:47,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:25:47,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 451 transitions. [2022-04-08 15:25:47,080 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 451 transitions. [2022-04-08 15:25:47,447 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 451 edges. 451 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:25:47,452 INFO L225 Difference]: With dead ends: 491 [2022-04-08 15:25:47,453 INFO L226 Difference]: Without dead ends: 267 [2022-04-08 15:25:47,454 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 15:25:47,454 INFO L913 BasicCegarLoop]: 187 mSDtfsCounter, 24 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-04-08 15:25:47,455 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 483 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2022-04-08 15:25:47,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-04-08 15:25:47,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 250. [2022-04-08 15:25:47,470 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:25:47,471 INFO L82 GeneralOperation]: Start isEquivalent. First operand 267 states. Second operand has 250 states, 245 states have (on average 1.6408163265306122) internal successors, (402), 245 states have internal predecessors, (402), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:25:47,471 INFO L74 IsIncluded]: Start isIncluded. First operand 267 states. Second operand has 250 states, 245 states have (on average 1.6408163265306122) internal successors, (402), 245 states have internal predecessors, (402), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:25:47,472 INFO L87 Difference]: Start difference. First operand 267 states. Second operand has 250 states, 245 states have (on average 1.6408163265306122) internal successors, (402), 245 states have internal predecessors, (402), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:25:47,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:25:47,478 INFO L93 Difference]: Finished difference Result 267 states and 427 transitions. [2022-04-08 15:25:47,480 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 427 transitions. [2022-04-08 15:25:47,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:25:47,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:25:47,481 INFO L74 IsIncluded]: Start isIncluded. First operand has 250 states, 245 states have (on average 1.6408163265306122) internal successors, (402), 245 states have internal predecessors, (402), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 267 states. [2022-04-08 15:25:47,482 INFO L87 Difference]: Start difference. First operand has 250 states, 245 states have (on average 1.6408163265306122) internal successors, (402), 245 states have internal predecessors, (402), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 267 states. [2022-04-08 15:25:47,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:25:47,488 INFO L93 Difference]: Finished difference Result 267 states and 427 transitions. [2022-04-08 15:25:47,488 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 427 transitions. [2022-04-08 15:25:47,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:25:47,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:25:47,489 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:25:47,489 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:25:47,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 245 states have (on average 1.6408163265306122) internal successors, (402), 245 states have internal predecessors, (402), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:25:47,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 406 transitions. [2022-04-08 15:25:47,496 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 406 transitions. Word has length 63 [2022-04-08 15:25:47,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:25:47,496 INFO L478 AbstractCegarLoop]: Abstraction has 250 states and 406 transitions. [2022-04-08 15:25:47,497 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:25:47,497 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 406 transitions. [2022-04-08 15:25:47,848 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 406 edges. 406 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:25:47,848 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 406 transitions. [2022-04-08 15:25:47,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-08 15:25:47,849 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:25:47,849 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:25:47,849 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-08 15:25:47,849 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:25:47,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:25:47,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1956023147, now seen corresponding path program 1 times [2022-04-08 15:25:47,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:25:47,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1686877416] [2022-04-08 15:25:47,876 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:25:47,876 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:25:47,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1956023147, now seen corresponding path program 2 times [2022-04-08 15:25:47,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:25:47,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232322322] [2022-04-08 15:25:47,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:25:47,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:25:47,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:25:48,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:25:48,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:25:48,043 INFO L290 TraceCheckUtils]: 0: Hoare triple {9968#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {9961#true} is VALID [2022-04-08 15:25:48,044 INFO L290 TraceCheckUtils]: 1: Hoare triple {9961#true} assume true; {9961#true} is VALID [2022-04-08 15:25:48,044 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9961#true} {9961#true} #690#return; {9961#true} is VALID [2022-04-08 15:25:48,045 INFO L272 TraceCheckUtils]: 0: Hoare triple {9961#true} call ULTIMATE.init(); {9968#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:25:48,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {9968#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {9961#true} is VALID [2022-04-08 15:25:48,045 INFO L290 TraceCheckUtils]: 2: Hoare triple {9961#true} assume true; {9961#true} is VALID [2022-04-08 15:25:48,045 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9961#true} {9961#true} #690#return; {9961#true} is VALID [2022-04-08 15:25:48,045 INFO L272 TraceCheckUtils]: 4: Hoare triple {9961#true} call #t~ret161 := main(); {9961#true} is VALID [2022-04-08 15:25:48,045 INFO L290 TraceCheckUtils]: 5: Hoare triple {9961#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {9961#true} is VALID [2022-04-08 15:25:48,046 INFO L290 TraceCheckUtils]: 6: Hoare triple {9961#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {9961#true} is VALID [2022-04-08 15:25:48,046 INFO L272 TraceCheckUtils]: 7: Hoare triple {9961#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {9961#true} is VALID [2022-04-08 15:25:48,048 INFO L290 TraceCheckUtils]: 8: Hoare triple {9961#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {9966#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:25:48,049 INFO L290 TraceCheckUtils]: 9: Hoare triple {9966#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {9966#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:25:48,049 INFO L290 TraceCheckUtils]: 10: Hoare triple {9966#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {9966#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:25:48,050 INFO L290 TraceCheckUtils]: 11: Hoare triple {9966#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {9966#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:25:48,050 INFO L290 TraceCheckUtils]: 12: Hoare triple {9966#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {9966#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:25:48,051 INFO L290 TraceCheckUtils]: 13: Hoare triple {9966#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {9966#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:25:48,051 INFO L290 TraceCheckUtils]: 14: Hoare triple {9966#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {9966#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:25:48,052 INFO L290 TraceCheckUtils]: 15: Hoare triple {9966#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {9967#(not (= 12292 |ssl3_accept_#t~mem47|))} is VALID [2022-04-08 15:25:48,052 INFO L290 TraceCheckUtils]: 16: Hoare triple {9967#(not (= 12292 |ssl3_accept_#t~mem47|))} assume 12292 == #t~mem47;havoc #t~mem47; {9962#false} is VALID [2022-04-08 15:25:48,052 INFO L290 TraceCheckUtils]: 17: Hoare triple {9962#false} call write~int(1, ~s.base, 60 + ~s.offset, 4); {9962#false} is VALID [2022-04-08 15:25:48,053 INFO L290 TraceCheckUtils]: 18: Hoare triple {9962#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {9962#false} is VALID [2022-04-08 15:25:48,053 INFO L290 TraceCheckUtils]: 19: Hoare triple {9962#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {9962#false} is VALID [2022-04-08 15:25:48,053 INFO L290 TraceCheckUtils]: 20: Hoare triple {9962#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {9962#false} is VALID [2022-04-08 15:25:48,053 INFO L290 TraceCheckUtils]: 21: Hoare triple {9962#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {9962#false} is VALID [2022-04-08 15:25:48,054 INFO L290 TraceCheckUtils]: 22: Hoare triple {9962#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {9962#false} is VALID [2022-04-08 15:25:48,054 INFO L290 TraceCheckUtils]: 23: Hoare triple {9962#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-08 15:25:48,054 INFO L290 TraceCheckUtils]: 24: Hoare triple {9962#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem89 := read~int(#t~mem88.base, 132 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 132 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-08 15:25:48,054 INFO L290 TraceCheckUtils]: 25: Hoare triple {9962#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {9962#false} is VALID [2022-04-08 15:25:48,054 INFO L290 TraceCheckUtils]: 26: Hoare triple {9962#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {9962#false} is VALID [2022-04-08 15:25:48,054 INFO L290 TraceCheckUtils]: 27: Hoare triple {9962#false} ~skip~0 := 0; {9962#false} is VALID [2022-04-08 15:25:48,054 INFO L290 TraceCheckUtils]: 28: Hoare triple {9962#false} assume !false; {9962#false} is VALID [2022-04-08 15:25:48,055 INFO L290 TraceCheckUtils]: 29: Hoare triple {9962#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-08 15:25:48,055 INFO L290 TraceCheckUtils]: 30: Hoare triple {9962#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-08 15:25:48,055 INFO L290 TraceCheckUtils]: 31: Hoare triple {9962#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-08 15:25:48,055 INFO L290 TraceCheckUtils]: 32: Hoare triple {9962#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-08 15:25:48,055 INFO L290 TraceCheckUtils]: 33: Hoare triple {9962#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-08 15:25:48,055 INFO L290 TraceCheckUtils]: 34: Hoare triple {9962#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-08 15:25:48,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-08 15:25:48,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-08 15:25:48,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-08 15:25:48,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-08 15:25:48,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-08 15:25:48,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-08 15:25:48,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-08 15:25:48,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-08 15:25:48,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-08 15:25:48,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-08 15:25:48,058 INFO L290 TraceCheckUtils]: 45: Hoare triple {9962#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-08 15:25:48,058 INFO L290 TraceCheckUtils]: 46: Hoare triple {9962#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-08 15:25:48,058 INFO L290 TraceCheckUtils]: 47: Hoare triple {9962#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-08 15:25:48,058 INFO L290 TraceCheckUtils]: 48: Hoare triple {9962#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-08 15:25:48,058 INFO L290 TraceCheckUtils]: 49: Hoare triple {9962#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-08 15:25:48,058 INFO L290 TraceCheckUtils]: 50: Hoare triple {9962#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-08 15:25:48,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-08 15:25:48,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-08 15:25:48,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-08 15:25:48,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-08 15:25:48,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-08 15:25:48,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-08 15:25:48,059 INFO L290 TraceCheckUtils]: 57: Hoare triple {9962#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-08 15:25:48,059 INFO L290 TraceCheckUtils]: 58: Hoare triple {9962#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-08 15:25:48,059 INFO L290 TraceCheckUtils]: 59: Hoare triple {9962#false} assume 8641 == #t~mem76;havoc #t~mem76; {9962#false} is VALID [2022-04-08 15:25:48,059 INFO L290 TraceCheckUtils]: 60: Hoare triple {9962#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {9962#false} is VALID [2022-04-08 15:25:48,059 INFO L290 TraceCheckUtils]: 61: Hoare triple {9962#false} assume !(4 == ~blastFlag~0); {9962#false} is VALID [2022-04-08 15:25:48,059 INFO L290 TraceCheckUtils]: 62: Hoare triple {9962#false} assume 5 == ~blastFlag~0; {9962#false} is VALID [2022-04-08 15:25:48,059 INFO L290 TraceCheckUtils]: 63: Hoare triple {9962#false} assume !false; {9962#false} is VALID [2022-04-08 15:25:48,061 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 15:25:48,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:25:48,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232322322] [2022-04-08 15:25:48,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232322322] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:25:48,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:25:48,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:25:48,062 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:25:48,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1686877416] [2022-04-08 15:25:48,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1686877416] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:25:48,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:25:48,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:25:48,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560590781] [2022-04-08 15:25:48,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:25:48,063 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-08 15:25:48,063 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:25:48,063 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:25:48,119 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:25:48,119 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:25:48,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:25:48,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:25:48,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:25:48,120 INFO L87 Difference]: Start difference. First operand 250 states and 406 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:25:49,699 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:25:53,248 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:25:55,253 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:25:56,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:25:56,638 INFO L93 Difference]: Finished difference Result 563 states and 907 transitions. [2022-04-08 15:25:56,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:25:56,638 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-08 15:25:56,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:25:56,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:25:56,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 595 transitions. [2022-04-08 15:25:56,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:25:56,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 595 transitions. [2022-04-08 15:25:56,646 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 595 transitions. [2022-04-08 15:25:57,134 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 595 edges. 595 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:25:57,142 INFO L225 Difference]: With dead ends: 563 [2022-04-08 15:25:57,142 INFO L226 Difference]: Without dead ends: 339 [2022-04-08 15:25:57,142 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 15:25:57,143 INFO L913 BasicCegarLoop]: 119 mSDtfsCounter, 151 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 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.5s IncrementalHoareTripleChecker+Time [2022-04-08 15:25:57,143 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 346 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 475 Invalid, 1 Unknown, 0 Unchecked, 5.5s Time] [2022-04-08 15:25:57,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-04-08 15:25:57,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 250. [2022-04-08 15:25:57,155 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:25:57,155 INFO L82 GeneralOperation]: Start isEquivalent. First operand 339 states. Second operand has 250 states, 245 states have (on average 1.6244897959183673) internal successors, (398), 245 states have internal predecessors, (398), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:25:57,156 INFO L74 IsIncluded]: Start isIncluded. First operand 339 states. Second operand has 250 states, 245 states have (on average 1.6244897959183673) internal successors, (398), 245 states have internal predecessors, (398), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:25:57,157 INFO L87 Difference]: Start difference. First operand 339 states. Second operand has 250 states, 245 states have (on average 1.6244897959183673) internal successors, (398), 245 states have internal predecessors, (398), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:25:57,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:25:57,164 INFO L93 Difference]: Finished difference Result 339 states and 534 transitions. [2022-04-08 15:25:57,164 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 534 transitions. [2022-04-08 15:25:57,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:25:57,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:25:57,166 INFO L74 IsIncluded]: Start isIncluded. First operand has 250 states, 245 states have (on average 1.6244897959183673) internal successors, (398), 245 states have internal predecessors, (398), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 339 states. [2022-04-08 15:25:57,166 INFO L87 Difference]: Start difference. First operand has 250 states, 245 states have (on average 1.6244897959183673) internal successors, (398), 245 states have internal predecessors, (398), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 339 states. [2022-04-08 15:25:57,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:25:57,174 INFO L93 Difference]: Finished difference Result 339 states and 534 transitions. [2022-04-08 15:25:57,174 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 534 transitions. [2022-04-08 15:25:57,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:25:57,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:25:57,175 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:25:57,175 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:25:57,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 245 states have (on average 1.6244897959183673) internal successors, (398), 245 states have internal predecessors, (398), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:25:57,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 402 transitions. [2022-04-08 15:25:57,182 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 402 transitions. Word has length 64 [2022-04-08 15:25:57,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:25:57,183 INFO L478 AbstractCegarLoop]: Abstraction has 250 states and 402 transitions. [2022-04-08 15:25:57,183 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:25:57,183 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 402 transitions. [2022-04-08 15:25:57,551 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 402 edges. 402 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:25:57,551 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 402 transitions. [2022-04-08 15:25:57,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-08 15:25:57,552 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:25:57,552 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:25:57,553 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-08 15:25:57,553 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:25:57,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:25:57,553 INFO L85 PathProgramCache]: Analyzing trace with hash -69119703, now seen corresponding path program 1 times [2022-04-08 15:25:57,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:25:57,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [156921347] [2022-04-08 15:25:57,578 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 15:25:57,578 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:25:57,578 INFO L85 PathProgramCache]: Analyzing trace with hash -69119703, now seen corresponding path program 2 times [2022-04-08 15:25:57,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:25:57,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825503614] [2022-04-08 15:25:57,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:25:57,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:25:57,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:25:57,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:25:57,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:25:57,715 INFO L290 TraceCheckUtils]: 0: Hoare triple {12284#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {12277#true} is VALID [2022-04-08 15:25:57,715 INFO L290 TraceCheckUtils]: 1: Hoare triple {12277#true} assume true; {12277#true} is VALID [2022-04-08 15:25:57,715 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12277#true} {12277#true} #690#return; {12277#true} is VALID [2022-04-08 15:25:57,716 INFO L272 TraceCheckUtils]: 0: Hoare triple {12277#true} call ULTIMATE.init(); {12284#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:25:57,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {12284#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {12277#true} is VALID [2022-04-08 15:25:57,716 INFO L290 TraceCheckUtils]: 2: Hoare triple {12277#true} assume true; {12277#true} is VALID [2022-04-08 15:25:57,716 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12277#true} {12277#true} #690#return; {12277#true} is VALID [2022-04-08 15:25:57,716 INFO L272 TraceCheckUtils]: 4: Hoare triple {12277#true} call #t~ret161 := main(); {12277#true} is VALID [2022-04-08 15:25:57,722 INFO L290 TraceCheckUtils]: 5: Hoare triple {12277#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {12277#true} is VALID [2022-04-08 15:25:57,722 INFO L290 TraceCheckUtils]: 6: Hoare triple {12277#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {12277#true} is VALID [2022-04-08 15:25:57,722 INFO L272 TraceCheckUtils]: 7: Hoare triple {12277#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {12277#true} is VALID [2022-04-08 15:25:57,725 INFO L290 TraceCheckUtils]: 8: Hoare triple {12277#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {12282#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-08 15:25:57,725 INFO L290 TraceCheckUtils]: 9: Hoare triple {12282#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {12282#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-08 15:25:57,726 INFO L290 TraceCheckUtils]: 10: Hoare triple {12282#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {12282#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-08 15:25:57,727 INFO L290 TraceCheckUtils]: 11: Hoare triple {12282#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {12282#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-08 15:25:57,727 INFO L290 TraceCheckUtils]: 12: Hoare triple {12282#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {12282#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-08 15:25:57,727 INFO L290 TraceCheckUtils]: 13: Hoare triple {12282#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {12282#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-08 15:25:57,728 INFO L290 TraceCheckUtils]: 14: Hoare triple {12282#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} assume !false; {12282#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-08 15:25:57,728 INFO L290 TraceCheckUtils]: 15: Hoare triple {12282#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {12282#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-08 15:25:57,729 INFO L290 TraceCheckUtils]: 16: Hoare triple {12282#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {12283#(not (= |ssl3_accept_#t~mem48| 16384))} is VALID [2022-04-08 15:25:57,729 INFO L290 TraceCheckUtils]: 17: Hoare triple {12283#(not (= |ssl3_accept_#t~mem48| 16384))} assume 16384 == #t~mem48;havoc #t~mem48; {12278#false} is VALID [2022-04-08 15:25:57,729 INFO L290 TraceCheckUtils]: 18: Hoare triple {12278#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {12278#false} is VALID [2022-04-08 15:25:57,729 INFO L290 TraceCheckUtils]: 19: Hoare triple {12278#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {12278#false} is VALID [2022-04-08 15:25:57,729 INFO L290 TraceCheckUtils]: 20: Hoare triple {12278#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {12278#false} is VALID [2022-04-08 15:25:57,729 INFO L290 TraceCheckUtils]: 21: Hoare triple {12278#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {12278#false} is VALID [2022-04-08 15:25:57,730 INFO L290 TraceCheckUtils]: 22: Hoare triple {12278#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {12278#false} is VALID [2022-04-08 15:25:57,730 INFO L290 TraceCheckUtils]: 23: Hoare triple {12278#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-08 15:25:57,730 INFO L290 TraceCheckUtils]: 24: Hoare triple {12278#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem89 := read~int(#t~mem88.base, 132 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 132 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-08 15:25:57,730 INFO L290 TraceCheckUtils]: 25: Hoare triple {12278#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {12278#false} is VALID [2022-04-08 15:25:57,730 INFO L290 TraceCheckUtils]: 26: Hoare triple {12278#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {12278#false} is VALID [2022-04-08 15:25:57,730 INFO L290 TraceCheckUtils]: 27: Hoare triple {12278#false} ~skip~0 := 0; {12278#false} is VALID [2022-04-08 15:25:57,730 INFO L290 TraceCheckUtils]: 28: Hoare triple {12278#false} assume !false; {12278#false} is VALID [2022-04-08 15:25:57,730 INFO L290 TraceCheckUtils]: 29: Hoare triple {12278#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-08 15:25:57,730 INFO L290 TraceCheckUtils]: 30: Hoare triple {12278#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-08 15:25:57,730 INFO L290 TraceCheckUtils]: 31: Hoare triple {12278#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-08 15:25:57,731 INFO L290 TraceCheckUtils]: 32: Hoare triple {12278#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-08 15:25:57,731 INFO L290 TraceCheckUtils]: 33: Hoare triple {12278#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-08 15:25:57,731 INFO L290 TraceCheckUtils]: 34: Hoare triple {12278#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-08 15:25:57,731 INFO L290 TraceCheckUtils]: 35: Hoare triple {12278#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-08 15:25:57,731 INFO L290 TraceCheckUtils]: 36: Hoare triple {12278#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-08 15:25:57,731 INFO L290 TraceCheckUtils]: 37: Hoare triple {12278#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-08 15:25:57,731 INFO L290 TraceCheckUtils]: 38: Hoare triple {12278#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-08 15:25:57,731 INFO L290 TraceCheckUtils]: 39: Hoare triple {12278#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-08 15:25:57,731 INFO L290 TraceCheckUtils]: 40: Hoare triple {12278#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-08 15:25:57,733 INFO L290 TraceCheckUtils]: 41: Hoare triple {12278#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-08 15:25:57,734 INFO L290 TraceCheckUtils]: 42: Hoare triple {12278#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-08 15:25:57,735 INFO L290 TraceCheckUtils]: 43: Hoare triple {12278#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-08 15:25:57,735 INFO L290 TraceCheckUtils]: 44: Hoare triple {12278#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-08 15:25:57,735 INFO L290 TraceCheckUtils]: 45: Hoare triple {12278#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-08 15:25:57,736 INFO L290 TraceCheckUtils]: 46: Hoare triple {12278#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-08 15:25:57,737 INFO L290 TraceCheckUtils]: 47: Hoare triple {12278#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-08 15:25:57,737 INFO L290 TraceCheckUtils]: 48: Hoare triple {12278#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-08 15:25:57,737 INFO L290 TraceCheckUtils]: 49: Hoare triple {12278#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-08 15:25:57,738 INFO L290 TraceCheckUtils]: 50: Hoare triple {12278#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-08 15:25:57,740 INFO L290 TraceCheckUtils]: 51: Hoare triple {12278#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-08 15:25:57,740 INFO L290 TraceCheckUtils]: 52: Hoare triple {12278#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-08 15:25:57,740 INFO L290 TraceCheckUtils]: 53: Hoare triple {12278#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-08 15:25:57,740 INFO L290 TraceCheckUtils]: 54: Hoare triple {12278#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-08 15:25:57,741 INFO L290 TraceCheckUtils]: 55: Hoare triple {12278#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-08 15:25:57,741 INFO L290 TraceCheckUtils]: 56: Hoare triple {12278#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-08 15:25:57,741 INFO L290 TraceCheckUtils]: 57: Hoare triple {12278#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-08 15:25:57,741 INFO L290 TraceCheckUtils]: 58: Hoare triple {12278#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-08 15:25:57,741 INFO L290 TraceCheckUtils]: 59: Hoare triple {12278#false} assume 8641 == #t~mem76;havoc #t~mem76; {12278#false} is VALID [2022-04-08 15:25:57,741 INFO L290 TraceCheckUtils]: 60: Hoare triple {12278#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {12278#false} is VALID [2022-04-08 15:25:57,741 INFO L290 TraceCheckUtils]: 61: Hoare triple {12278#false} assume !(4 == ~blastFlag~0); {12278#false} is VALID [2022-04-08 15:25:57,741 INFO L290 TraceCheckUtils]: 62: Hoare triple {12278#false} assume 5 == ~blastFlag~0; {12278#false} is VALID [2022-04-08 15:25:57,741 INFO L290 TraceCheckUtils]: 63: Hoare triple {12278#false} assume !false; {12278#false} is VALID [2022-04-08 15:25:57,742 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 15:25:57,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:25:57,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825503614] [2022-04-08 15:25:57,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825503614] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:25:57,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:25:57,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:25:57,743 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:25:57,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [156921347] [2022-04-08 15:25:57,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [156921347] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:25:57,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:25:57,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:25:57,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174311175] [2022-04-08 15:25:57,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:25:57,744 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-08 15:25:57,744 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:25:57,744 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:25:57,809 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:25:57,810 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:25:57,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:25:57,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:25:57,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:25:57,811 INFO L87 Difference]: Start difference. First operand 250 states and 402 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:25:59,976 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-08 15:26:03,497 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:26:07,139 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:26:10,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:26:10,168 INFO L93 Difference]: Finished difference Result 563 states and 900 transitions. [2022-04-08 15:26:10,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:26:10,168 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-08 15:26:10,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:26:10,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:26:10,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 594 transitions. [2022-04-08 15:26:10,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:26:10,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 594 transitions. [2022-04-08 15:26:10,175 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 594 transitions. [2022-04-08 15:26:10,621 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 594 edges. 594 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:26:10,629 INFO L225 Difference]: With dead ends: 563 [2022-04-08 15:26:10,629 INFO L226 Difference]: Without dead ends: 339 [2022-04-08 15:26:10,641 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 15:26:10,642 INFO L913 BasicCegarLoop]: 119 mSDtfsCounter, 149 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s 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, 5.9s IncrementalHoareTripleChecker+Time [2022-04-08 15:26:10,643 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 346 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2022-04-08 15:26:10,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-04-08 15:26:10,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 250. [2022-04-08 15:26:10,658 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:26:10,659 INFO L82 GeneralOperation]: Start isEquivalent. First operand 339 states. Second operand has 250 states, 245 states have (on average 1.6081632653061224) internal successors, (394), 245 states have internal predecessors, (394), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:26:10,660 INFO L74 IsIncluded]: Start isIncluded. First operand 339 states. Second operand has 250 states, 245 states have (on average 1.6081632653061224) internal successors, (394), 245 states have internal predecessors, (394), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:26:10,661 INFO L87 Difference]: Start difference. First operand 339 states. Second operand has 250 states, 245 states have (on average 1.6081632653061224) internal successors, (394), 245 states have internal predecessors, (394), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:26:10,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:26:10,670 INFO L93 Difference]: Finished difference Result 339 states and 530 transitions. [2022-04-08 15:26:10,670 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 530 transitions. [2022-04-08 15:26:10,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:26:10,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:26:10,671 INFO L74 IsIncluded]: Start isIncluded. First operand has 250 states, 245 states have (on average 1.6081632653061224) internal successors, (394), 245 states have internal predecessors, (394), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 339 states. [2022-04-08 15:26:10,672 INFO L87 Difference]: Start difference. First operand has 250 states, 245 states have (on average 1.6081632653061224) internal successors, (394), 245 states have internal predecessors, (394), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 339 states. [2022-04-08 15:26:10,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:26:10,680 INFO L93 Difference]: Finished difference Result 339 states and 530 transitions. [2022-04-08 15:26:10,680 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 530 transitions. [2022-04-08 15:26:10,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:26:10,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:26:10,680 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:26:10,681 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:26:10,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 245 states have (on average 1.6081632653061224) internal successors, (394), 245 states have internal predecessors, (394), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:26:10,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 398 transitions. [2022-04-08 15:26:10,687 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 398 transitions. Word has length 64 [2022-04-08 15:26:10,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:26:10,687 INFO L478 AbstractCegarLoop]: Abstraction has 250 states and 398 transitions. [2022-04-08 15:26:10,687 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:26:10,687 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 398 transitions. [2022-04-08 15:26:10,977 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 398 edges. 398 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:26:10,977 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 398 transitions. [2022-04-08 15:26:10,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-08 15:26:10,981 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:26:10,981 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:26:10,981 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-08 15:26:10,981 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:26:10,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:26:10,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1045887136, now seen corresponding path program 1 times [2022-04-08 15:26:10,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:26:10,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1682765640] [2022-04-08 15:26:11,002 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:26:11,002 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:26:11,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1045887136, now seen corresponding path program 2 times [2022-04-08 15:26:11,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:26:11,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865662809] [2022-04-08 15:26:11,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:26:11,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:26:11,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:26:11,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:26:11,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:26:11,120 INFO L290 TraceCheckUtils]: 0: Hoare triple {14600#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {14593#true} is VALID [2022-04-08 15:26:11,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {14593#true} assume true; {14593#true} is VALID [2022-04-08 15:26:11,121 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14593#true} {14593#true} #690#return; {14593#true} is VALID [2022-04-08 15:26:11,122 INFO L272 TraceCheckUtils]: 0: Hoare triple {14593#true} call ULTIMATE.init(); {14600#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:26:11,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {14600#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {14593#true} is VALID [2022-04-08 15:26:11,122 INFO L290 TraceCheckUtils]: 2: Hoare triple {14593#true} assume true; {14593#true} is VALID [2022-04-08 15:26:11,122 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14593#true} {14593#true} #690#return; {14593#true} is VALID [2022-04-08 15:26:11,122 INFO L272 TraceCheckUtils]: 4: Hoare triple {14593#true} call #t~ret161 := main(); {14593#true} is VALID [2022-04-08 15:26:11,122 INFO L290 TraceCheckUtils]: 5: Hoare triple {14593#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {14593#true} is VALID [2022-04-08 15:26:11,122 INFO L290 TraceCheckUtils]: 6: Hoare triple {14593#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {14593#true} is VALID [2022-04-08 15:26:11,122 INFO L272 TraceCheckUtils]: 7: Hoare triple {14593#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {14593#true} is VALID [2022-04-08 15:26:11,125 INFO L290 TraceCheckUtils]: 8: Hoare triple {14593#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:26:11,125 INFO L290 TraceCheckUtils]: 9: Hoare triple {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:26:11,126 INFO L290 TraceCheckUtils]: 10: Hoare triple {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:26:11,126 INFO L290 TraceCheckUtils]: 11: Hoare triple {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:26:11,127 INFO L290 TraceCheckUtils]: 12: Hoare triple {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:26:11,127 INFO L290 TraceCheckUtils]: 13: Hoare triple {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:26:11,128 INFO L290 TraceCheckUtils]: 14: Hoare triple {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:26:11,128 INFO L290 TraceCheckUtils]: 15: Hoare triple {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:26:11,129 INFO L290 TraceCheckUtils]: 16: Hoare triple {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:26:11,129 INFO L290 TraceCheckUtils]: 17: Hoare triple {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:26:11,129 INFO L290 TraceCheckUtils]: 18: Hoare triple {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:26:11,130 INFO L290 TraceCheckUtils]: 19: Hoare triple {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:26:11,130 INFO L290 TraceCheckUtils]: 20: Hoare triple {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:26:11,131 INFO L290 TraceCheckUtils]: 21: Hoare triple {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {14599#(= 8464 |ssl3_accept_#t~mem53|)} is VALID [2022-04-08 15:26:11,131 INFO L290 TraceCheckUtils]: 22: Hoare triple {14599#(= 8464 |ssl3_accept_#t~mem53|)} assume 8481 == #t~mem53;havoc #t~mem53; {14594#false} is VALID [2022-04-08 15:26:11,131 INFO L290 TraceCheckUtils]: 23: Hoare triple {14594#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {14594#false} is VALID [2022-04-08 15:26:11,131 INFO L290 TraceCheckUtils]: 24: Hoare triple {14594#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8482, #t~mem91.base, 904 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {14594#false} is VALID [2022-04-08 15:26:11,131 INFO L290 TraceCheckUtils]: 25: Hoare triple {14594#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {14594#false} is VALID [2022-04-08 15:26:11,131 INFO L290 TraceCheckUtils]: 26: Hoare triple {14594#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {14594#false} is VALID [2022-04-08 15:26:11,132 INFO L290 TraceCheckUtils]: 27: Hoare triple {14594#false} ~skip~0 := 0; {14594#false} is VALID [2022-04-08 15:26:11,132 INFO L290 TraceCheckUtils]: 28: Hoare triple {14594#false} assume !false; {14594#false} is VALID [2022-04-08 15:26:11,132 INFO L290 TraceCheckUtils]: 29: Hoare triple {14594#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-08 15:26:11,132 INFO L290 TraceCheckUtils]: 30: Hoare triple {14594#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-08 15:26:11,132 INFO L290 TraceCheckUtils]: 31: Hoare triple {14594#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-08 15:26:11,132 INFO L290 TraceCheckUtils]: 32: Hoare triple {14594#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-08 15:26:11,132 INFO L290 TraceCheckUtils]: 33: Hoare triple {14594#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-08 15:26:11,132 INFO L290 TraceCheckUtils]: 34: Hoare triple {14594#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-08 15:26:11,132 INFO L290 TraceCheckUtils]: 35: Hoare triple {14594#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-08 15:26:11,132 INFO L290 TraceCheckUtils]: 36: Hoare triple {14594#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-08 15:26:11,132 INFO L290 TraceCheckUtils]: 37: Hoare triple {14594#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-08 15:26:11,132 INFO L290 TraceCheckUtils]: 38: Hoare triple {14594#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-08 15:26:11,133 INFO L290 TraceCheckUtils]: 39: Hoare triple {14594#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-08 15:26:11,133 INFO L290 TraceCheckUtils]: 40: Hoare triple {14594#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-08 15:26:11,133 INFO L290 TraceCheckUtils]: 41: Hoare triple {14594#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-08 15:26:11,133 INFO L290 TraceCheckUtils]: 42: Hoare triple {14594#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-08 15:26:11,133 INFO L290 TraceCheckUtils]: 43: Hoare triple {14594#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-08 15:26:11,133 INFO L290 TraceCheckUtils]: 44: Hoare triple {14594#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-08 15:26:11,133 INFO L290 TraceCheckUtils]: 45: Hoare triple {14594#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-08 15:26:11,133 INFO L290 TraceCheckUtils]: 46: Hoare triple {14594#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-08 15:26:11,133 INFO L290 TraceCheckUtils]: 47: Hoare triple {14594#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-08 15:26:11,133 INFO L290 TraceCheckUtils]: 48: Hoare triple {14594#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-08 15:26:11,133 INFO L290 TraceCheckUtils]: 49: Hoare triple {14594#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-08 15:26:11,134 INFO L290 TraceCheckUtils]: 50: Hoare triple {14594#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-08 15:26:11,134 INFO L290 TraceCheckUtils]: 51: Hoare triple {14594#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-08 15:26:11,134 INFO L290 TraceCheckUtils]: 52: Hoare triple {14594#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-08 15:26:11,134 INFO L290 TraceCheckUtils]: 53: Hoare triple {14594#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-08 15:26:11,134 INFO L290 TraceCheckUtils]: 54: Hoare triple {14594#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-08 15:26:11,134 INFO L290 TraceCheckUtils]: 55: Hoare triple {14594#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-08 15:26:11,134 INFO L290 TraceCheckUtils]: 56: Hoare triple {14594#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-08 15:26:11,134 INFO L290 TraceCheckUtils]: 57: Hoare triple {14594#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-08 15:26:11,134 INFO L290 TraceCheckUtils]: 58: Hoare triple {14594#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-08 15:26:11,134 INFO L290 TraceCheckUtils]: 59: Hoare triple {14594#false} assume 8641 == #t~mem76;havoc #t~mem76; {14594#false} is VALID [2022-04-08 15:26:11,134 INFO L290 TraceCheckUtils]: 60: Hoare triple {14594#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {14594#false} is VALID [2022-04-08 15:26:11,134 INFO L290 TraceCheckUtils]: 61: Hoare triple {14594#false} assume !(4 == ~blastFlag~0); {14594#false} is VALID [2022-04-08 15:26:11,135 INFO L290 TraceCheckUtils]: 62: Hoare triple {14594#false} assume 5 == ~blastFlag~0; {14594#false} is VALID [2022-04-08 15:26:11,135 INFO L290 TraceCheckUtils]: 63: Hoare triple {14594#false} assume !false; {14594#false} is VALID [2022-04-08 15:26:11,135 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 15:26:11,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:26:11,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865662809] [2022-04-08 15:26:11,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865662809] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:26:11,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:26:11,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:26:11,136 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:26:11,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1682765640] [2022-04-08 15:26:11,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1682765640] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:26:11,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:26:11,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:26:11,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268463032] [2022-04-08 15:26:11,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:26:11,136 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-08 15:26:11,137 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:26:11,137 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:26:11,193 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:26:11,193 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:26:11,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:26:11,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:26:11,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:26:11,194 INFO L87 Difference]: Start difference. First operand 250 states and 398 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:26:13,892 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:26:16,765 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:26:22,450 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:26:23,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:26:23,439 INFO L93 Difference]: Finished difference Result 488 states and 779 transitions. [2022-04-08 15:26:23,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:26:23,440 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-08 15:26:23,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:26:23,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:26:23,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 445 transitions. [2022-04-08 15:26:23,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:26:23,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 445 transitions. [2022-04-08 15:26:23,448 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 445 transitions. [2022-04-08 15:26:23,757 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 445 edges. 445 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:26:23,761 INFO L225 Difference]: With dead ends: 488 [2022-04-08 15:26:23,761 INFO L226 Difference]: Without dead ends: 264 [2022-04-08 15:26:23,761 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 15:26:23,762 INFO L913 BasicCegarLoop]: 190 mSDtfsCounter, 20 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s 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, 5.1s IncrementalHoareTripleChecker+Time [2022-04-08 15:26:23,762 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 489 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-04-08 15:26:23,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2022-04-08 15:26:23,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 250. [2022-04-08 15:26:23,772 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:26:23,773 INFO L82 GeneralOperation]: Start isEquivalent. First operand 264 states. Second operand has 250 states, 245 states have (on average 1.6040816326530611) internal successors, (393), 245 states have internal predecessors, (393), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:26:23,773 INFO L74 IsIncluded]: Start isIncluded. First operand 264 states. Second operand has 250 states, 245 states have (on average 1.6040816326530611) internal successors, (393), 245 states have internal predecessors, (393), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:26:23,774 INFO L87 Difference]: Start difference. First operand 264 states. Second operand has 250 states, 245 states have (on average 1.6040816326530611) internal successors, (393), 245 states have internal predecessors, (393), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:26:23,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:26:23,779 INFO L93 Difference]: Finished difference Result 264 states and 415 transitions. [2022-04-08 15:26:23,779 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 415 transitions. [2022-04-08 15:26:23,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:26:23,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:26:23,780 INFO L74 IsIncluded]: Start isIncluded. First operand has 250 states, 245 states have (on average 1.6040816326530611) internal successors, (393), 245 states have internal predecessors, (393), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 264 states. [2022-04-08 15:26:23,781 INFO L87 Difference]: Start difference. First operand has 250 states, 245 states have (on average 1.6040816326530611) internal successors, (393), 245 states have internal predecessors, (393), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 264 states. [2022-04-08 15:26:23,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:26:23,786 INFO L93 Difference]: Finished difference Result 264 states and 415 transitions. [2022-04-08 15:26:23,786 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 415 transitions. [2022-04-08 15:26:23,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:26:23,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:26:23,787 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:26:23,787 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:26:23,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 245 states have (on average 1.6040816326530611) internal successors, (393), 245 states have internal predecessors, (393), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:26:23,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 397 transitions. [2022-04-08 15:26:23,794 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 397 transitions. Word has length 64 [2022-04-08 15:26:23,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:26:23,794 INFO L478 AbstractCegarLoop]: Abstraction has 250 states and 397 transitions. [2022-04-08 15:26:23,794 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:26:23,794 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 397 transitions. [2022-04-08 15:26:24,149 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 397 edges. 397 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:26:24,149 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 397 transitions. [2022-04-08 15:26:24,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-08 15:26:24,150 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:26:24,150 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:26:24,150 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-08 15:26:24,150 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:26:24,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:26:24,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1113447137, now seen corresponding path program 1 times [2022-04-08 15:26:24,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:26:24,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [314364482] [2022-04-08 15:26:24,164 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:26:24,164 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:26:24,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1113447137, now seen corresponding path program 2 times [2022-04-08 15:26:24,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:26:24,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127895379] [2022-04-08 15:26:24,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:26:24,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:26:24,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:26:24,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:26:24,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:26:24,327 INFO L290 TraceCheckUtils]: 0: Hoare triple {16616#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {16609#true} is VALID [2022-04-08 15:26:24,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {16609#true} assume true; {16609#true} is VALID [2022-04-08 15:26:24,327 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16609#true} {16609#true} #690#return; {16609#true} is VALID [2022-04-08 15:26:24,328 INFO L272 TraceCheckUtils]: 0: Hoare triple {16609#true} call ULTIMATE.init(); {16616#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:26:24,328 INFO L290 TraceCheckUtils]: 1: Hoare triple {16616#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {16609#true} is VALID [2022-04-08 15:26:24,328 INFO L290 TraceCheckUtils]: 2: Hoare triple {16609#true} assume true; {16609#true} is VALID [2022-04-08 15:26:24,328 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16609#true} {16609#true} #690#return; {16609#true} is VALID [2022-04-08 15:26:24,328 INFO L272 TraceCheckUtils]: 4: Hoare triple {16609#true} call #t~ret161 := main(); {16609#true} is VALID [2022-04-08 15:26:24,328 INFO L290 TraceCheckUtils]: 5: Hoare triple {16609#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {16609#true} is VALID [2022-04-08 15:26:24,328 INFO L290 TraceCheckUtils]: 6: Hoare triple {16609#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {16609#true} is VALID [2022-04-08 15:26:24,328 INFO L272 TraceCheckUtils]: 7: Hoare triple {16609#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {16609#true} is VALID [2022-04-08 15:26:24,331 INFO L290 TraceCheckUtils]: 8: Hoare triple {16609#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:26:24,331 INFO L290 TraceCheckUtils]: 9: Hoare triple {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:26:24,332 INFO L290 TraceCheckUtils]: 10: Hoare triple {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:26:24,332 INFO L290 TraceCheckUtils]: 11: Hoare triple {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:26:24,333 INFO L290 TraceCheckUtils]: 12: Hoare triple {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:26:24,333 INFO L290 TraceCheckUtils]: 13: Hoare triple {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:26:24,334 INFO L290 TraceCheckUtils]: 14: Hoare triple {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:26:24,334 INFO L290 TraceCheckUtils]: 15: Hoare triple {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:26:24,334 INFO L290 TraceCheckUtils]: 16: Hoare triple {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:26:24,335 INFO L290 TraceCheckUtils]: 17: Hoare triple {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:26:24,335 INFO L290 TraceCheckUtils]: 18: Hoare triple {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:26:24,336 INFO L290 TraceCheckUtils]: 19: Hoare triple {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:26:24,336 INFO L290 TraceCheckUtils]: 20: Hoare triple {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:26:24,336 INFO L290 TraceCheckUtils]: 21: Hoare triple {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:26:24,337 INFO L290 TraceCheckUtils]: 22: Hoare triple {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {16615#(= 8464 |ssl3_accept_#t~mem54|)} is VALID [2022-04-08 15:26:24,337 INFO L290 TraceCheckUtils]: 23: Hoare triple {16615#(= 8464 |ssl3_accept_#t~mem54|)} assume 8482 == #t~mem54;havoc #t~mem54; {16610#false} is VALID [2022-04-08 15:26:24,337 INFO L290 TraceCheckUtils]: 24: Hoare triple {16610#false} call write~int(3, ~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-08 15:26:24,338 INFO L290 TraceCheckUtils]: 25: Hoare triple {16610#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {16610#false} is VALID [2022-04-08 15:26:24,338 INFO L290 TraceCheckUtils]: 26: Hoare triple {16610#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {16610#false} is VALID [2022-04-08 15:26:24,338 INFO L290 TraceCheckUtils]: 27: Hoare triple {16610#false} ~skip~0 := 0; {16610#false} is VALID [2022-04-08 15:26:24,338 INFO L290 TraceCheckUtils]: 28: Hoare triple {16610#false} assume !false; {16610#false} is VALID [2022-04-08 15:26:24,338 INFO L290 TraceCheckUtils]: 29: Hoare triple {16610#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-08 15:26:24,338 INFO L290 TraceCheckUtils]: 30: Hoare triple {16610#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-08 15:26:24,338 INFO L290 TraceCheckUtils]: 31: Hoare triple {16610#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-08 15:26:24,338 INFO L290 TraceCheckUtils]: 32: Hoare triple {16610#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-08 15:26:24,338 INFO L290 TraceCheckUtils]: 33: Hoare triple {16610#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-08 15:26:24,338 INFO L290 TraceCheckUtils]: 34: Hoare triple {16610#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-08 15:26:24,338 INFO L290 TraceCheckUtils]: 35: Hoare triple {16610#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-08 15:26:24,339 INFO L290 TraceCheckUtils]: 36: Hoare triple {16610#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-08 15:26:24,339 INFO L290 TraceCheckUtils]: 37: Hoare triple {16610#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-08 15:26:24,339 INFO L290 TraceCheckUtils]: 38: Hoare triple {16610#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-08 15:26:24,339 INFO L290 TraceCheckUtils]: 39: Hoare triple {16610#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-08 15:26:24,339 INFO L290 TraceCheckUtils]: 40: Hoare triple {16610#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-08 15:26:24,339 INFO L290 TraceCheckUtils]: 41: Hoare triple {16610#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-08 15:26:24,339 INFO L290 TraceCheckUtils]: 42: Hoare triple {16610#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-08 15:26:24,339 INFO L290 TraceCheckUtils]: 43: Hoare triple {16610#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-08 15:26:24,339 INFO L290 TraceCheckUtils]: 44: Hoare triple {16610#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-08 15:26:24,339 INFO L290 TraceCheckUtils]: 45: Hoare triple {16610#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-08 15:26:24,339 INFO L290 TraceCheckUtils]: 46: Hoare triple {16610#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-08 15:26:24,339 INFO L290 TraceCheckUtils]: 47: Hoare triple {16610#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-08 15:26:24,340 INFO L290 TraceCheckUtils]: 48: Hoare triple {16610#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-08 15:26:24,340 INFO L290 TraceCheckUtils]: 49: Hoare triple {16610#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-08 15:26:24,340 INFO L290 TraceCheckUtils]: 50: Hoare triple {16610#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-08 15:26:24,340 INFO L290 TraceCheckUtils]: 51: Hoare triple {16610#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-08 15:26:24,340 INFO L290 TraceCheckUtils]: 52: Hoare triple {16610#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-08 15:26:24,340 INFO L290 TraceCheckUtils]: 53: Hoare triple {16610#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-08 15:26:24,340 INFO L290 TraceCheckUtils]: 54: Hoare triple {16610#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-08 15:26:24,340 INFO L290 TraceCheckUtils]: 55: Hoare triple {16610#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-08 15:26:24,340 INFO L290 TraceCheckUtils]: 56: Hoare triple {16610#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-08 15:26:24,340 INFO L290 TraceCheckUtils]: 57: Hoare triple {16610#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-08 15:26:24,340 INFO L290 TraceCheckUtils]: 58: Hoare triple {16610#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-08 15:26:24,340 INFO L290 TraceCheckUtils]: 59: Hoare triple {16610#false} assume 8641 == #t~mem76;havoc #t~mem76; {16610#false} is VALID [2022-04-08 15:26:24,341 INFO L290 TraceCheckUtils]: 60: Hoare triple {16610#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {16610#false} is VALID [2022-04-08 15:26:24,341 INFO L290 TraceCheckUtils]: 61: Hoare triple {16610#false} assume !(4 == ~blastFlag~0); {16610#false} is VALID [2022-04-08 15:26:24,341 INFO L290 TraceCheckUtils]: 62: Hoare triple {16610#false} assume 5 == ~blastFlag~0; {16610#false} is VALID [2022-04-08 15:26:24,341 INFO L290 TraceCheckUtils]: 63: Hoare triple {16610#false} assume !false; {16610#false} is VALID [2022-04-08 15:26:24,341 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 15:26:24,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:26:24,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127895379] [2022-04-08 15:26:24,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127895379] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:26:24,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:26:24,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:26:24,342 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:26:24,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [314364482] [2022-04-08 15:26:24,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [314364482] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:26:24,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:26:24,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:26:24,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900990915] [2022-04-08 15:26:24,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:26:24,343 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-08 15:26:24,343 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:26:24,343 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:26:24,400 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:26:24,400 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:26:24,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:26:24,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:26:24,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:26:24,401 INFO L87 Difference]: Start difference. First operand 250 states and 397 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:26:26,427 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:26:27,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:26:27,458 INFO L93 Difference]: Finished difference Result 487 states and 777 transitions. [2022-04-08 15:26:27,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:26:27,459 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-08 15:26:27,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:26:27,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:26:27,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 443 transitions. [2022-04-08 15:26:27,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:26:27,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 443 transitions. [2022-04-08 15:26:27,464 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 443 transitions. [2022-04-08 15:26:27,813 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 443 edges. 443 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:26:27,817 INFO L225 Difference]: With dead ends: 487 [2022-04-08 15:26:27,817 INFO L226 Difference]: Without dead ends: 263 [2022-04-08 15:26:27,817 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 15:26:27,817 INFO L913 BasicCegarLoop]: 191 mSDtfsCounter, 18 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 15:26:27,818 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 491 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 352 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 15:26:27,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-04-08 15:26:27,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 250. [2022-04-08 15:26:27,827 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:26:27,828 INFO L82 GeneralOperation]: Start isEquivalent. First operand 263 states. Second operand has 250 states, 245 states have (on average 1.6) internal successors, (392), 245 states have internal predecessors, (392), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:26:27,828 INFO L74 IsIncluded]: Start isIncluded. First operand 263 states. Second operand has 250 states, 245 states have (on average 1.6) internal successors, (392), 245 states have internal predecessors, (392), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:26:27,829 INFO L87 Difference]: Start difference. First operand 263 states. Second operand has 250 states, 245 states have (on average 1.6) internal successors, (392), 245 states have internal predecessors, (392), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:26:27,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:26:27,834 INFO L93 Difference]: Finished difference Result 263 states and 413 transitions. [2022-04-08 15:26:27,834 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 413 transitions. [2022-04-08 15:26:27,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:26:27,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:26:27,835 INFO L74 IsIncluded]: Start isIncluded. First operand has 250 states, 245 states have (on average 1.6) internal successors, (392), 245 states have internal predecessors, (392), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 263 states. [2022-04-08 15:26:27,835 INFO L87 Difference]: Start difference. First operand has 250 states, 245 states have (on average 1.6) internal successors, (392), 245 states have internal predecessors, (392), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 263 states. [2022-04-08 15:26:27,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:26:27,840 INFO L93 Difference]: Finished difference Result 263 states and 413 transitions. [2022-04-08 15:26:27,841 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 413 transitions. [2022-04-08 15:26:27,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:26:27,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:26:27,841 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:26:27,841 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:26:27,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 245 states have (on average 1.6) internal successors, (392), 245 states have internal predecessors, (392), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:26:27,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 396 transitions. [2022-04-08 15:26:27,847 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 396 transitions. Word has length 64 [2022-04-08 15:26:27,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:26:27,847 INFO L478 AbstractCegarLoop]: Abstraction has 250 states and 396 transitions. [2022-04-08 15:26:27,847 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:26:27,848 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 396 transitions. [2022-04-08 15:26:28,143 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 396 edges. 396 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:26:28,144 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 396 transitions. [2022-04-08 15:26:28,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-08 15:26:28,144 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:26:28,144 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:26:28,144 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-08 15:26:28,144 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:26:28,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:26:28,145 INFO L85 PathProgramCache]: Analyzing trace with hash -515776498, now seen corresponding path program 1 times [2022-04-08 15:26:28,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:26:28,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1452977091] [2022-04-08 15:26:28,164 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 15:26:28,165 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:26:28,165 INFO L85 PathProgramCache]: Analyzing trace with hash -515776498, now seen corresponding path program 2 times [2022-04-08 15:26:28,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:26:28,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735783734] [2022-04-08 15:26:28,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:26:28,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:26:28,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:26:28,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:26:28,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:26:28,308 INFO L290 TraceCheckUtils]: 0: Hoare triple {18628#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {18621#true} is VALID [2022-04-08 15:26:28,308 INFO L290 TraceCheckUtils]: 1: Hoare triple {18621#true} assume true; {18621#true} is VALID [2022-04-08 15:26:28,309 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18621#true} {18621#true} #690#return; {18621#true} is VALID [2022-04-08 15:26:28,309 INFO L272 TraceCheckUtils]: 0: Hoare triple {18621#true} call ULTIMATE.init(); {18628#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:26:28,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {18628#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {18621#true} is VALID [2022-04-08 15:26:28,310 INFO L290 TraceCheckUtils]: 2: Hoare triple {18621#true} assume true; {18621#true} is VALID [2022-04-08 15:26:28,310 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18621#true} {18621#true} #690#return; {18621#true} is VALID [2022-04-08 15:26:28,310 INFO L272 TraceCheckUtils]: 4: Hoare triple {18621#true} call #t~ret161 := main(); {18621#true} is VALID [2022-04-08 15:26:28,310 INFO L290 TraceCheckUtils]: 5: Hoare triple {18621#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {18621#true} is VALID [2022-04-08 15:26:28,310 INFO L290 TraceCheckUtils]: 6: Hoare triple {18621#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {18621#true} is VALID [2022-04-08 15:26:28,310 INFO L272 TraceCheckUtils]: 7: Hoare triple {18621#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {18621#true} is VALID [2022-04-08 15:26:28,312 INFO L290 TraceCheckUtils]: 8: Hoare triple {18621#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {18626#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:26:28,313 INFO L290 TraceCheckUtils]: 9: Hoare triple {18626#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {18626#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:26:28,314 INFO L290 TraceCheckUtils]: 10: Hoare triple {18626#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {18626#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:26:28,314 INFO L290 TraceCheckUtils]: 11: Hoare triple {18626#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {18626#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:26:28,315 INFO L290 TraceCheckUtils]: 12: Hoare triple {18626#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {18626#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:26:28,315 INFO L290 TraceCheckUtils]: 13: Hoare triple {18626#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {18626#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:26:28,315 INFO L290 TraceCheckUtils]: 14: Hoare triple {18626#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {18626#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:26:28,316 INFO L290 TraceCheckUtils]: 15: Hoare triple {18626#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {18626#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:26:28,316 INFO L290 TraceCheckUtils]: 16: Hoare triple {18626#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {18626#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:26:28,317 INFO L290 TraceCheckUtils]: 17: Hoare triple {18626#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {18627#(not (= 8192 |ssl3_accept_#t~mem49|))} is VALID [2022-04-08 15:26:28,317 INFO L290 TraceCheckUtils]: 18: Hoare triple {18627#(not (= 8192 |ssl3_accept_#t~mem49|))} assume 8192 == #t~mem49;havoc #t~mem49; {18622#false} is VALID [2022-04-08 15:26:28,317 INFO L290 TraceCheckUtils]: 19: Hoare triple {18622#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {18622#false} is VALID [2022-04-08 15:26:28,317 INFO L290 TraceCheckUtils]: 20: Hoare triple {18622#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {18622#false} is VALID [2022-04-08 15:26:28,317 INFO L290 TraceCheckUtils]: 21: Hoare triple {18622#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {18622#false} is VALID [2022-04-08 15:26:28,317 INFO L290 TraceCheckUtils]: 22: Hoare triple {18622#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {18622#false} is VALID [2022-04-08 15:26:28,318 INFO L290 TraceCheckUtils]: 23: Hoare triple {18622#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {18622#false} is VALID [2022-04-08 15:26:28,318 INFO L290 TraceCheckUtils]: 24: Hoare triple {18622#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-08 15:26:28,318 INFO L290 TraceCheckUtils]: 25: Hoare triple {18622#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem89 := read~int(#t~mem88.base, 132 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 132 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-08 15:26:28,318 INFO L290 TraceCheckUtils]: 26: Hoare triple {18622#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {18622#false} is VALID [2022-04-08 15:26:28,318 INFO L290 TraceCheckUtils]: 27: Hoare triple {18622#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {18622#false} is VALID [2022-04-08 15:26:28,318 INFO L290 TraceCheckUtils]: 28: Hoare triple {18622#false} ~skip~0 := 0; {18622#false} is VALID [2022-04-08 15:26:28,318 INFO L290 TraceCheckUtils]: 29: Hoare triple {18622#false} assume !false; {18622#false} is VALID [2022-04-08 15:26:28,318 INFO L290 TraceCheckUtils]: 30: Hoare triple {18622#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-08 15:26:28,318 INFO L290 TraceCheckUtils]: 31: Hoare triple {18622#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-08 15:26:28,318 INFO L290 TraceCheckUtils]: 32: Hoare triple {18622#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-08 15:26:28,319 INFO L290 TraceCheckUtils]: 33: Hoare triple {18622#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-08 15:26:28,319 INFO L290 TraceCheckUtils]: 34: Hoare triple {18622#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-08 15:26:28,319 INFO L290 TraceCheckUtils]: 35: Hoare triple {18622#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-08 15:26:28,319 INFO L290 TraceCheckUtils]: 36: Hoare triple {18622#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-08 15:26:28,319 INFO L290 TraceCheckUtils]: 37: Hoare triple {18622#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-08 15:26:28,319 INFO L290 TraceCheckUtils]: 38: Hoare triple {18622#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-08 15:26:28,319 INFO L290 TraceCheckUtils]: 39: Hoare triple {18622#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-08 15:26:28,319 INFO L290 TraceCheckUtils]: 40: Hoare triple {18622#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-08 15:26:28,319 INFO L290 TraceCheckUtils]: 41: Hoare triple {18622#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-08 15:26:28,319 INFO L290 TraceCheckUtils]: 42: Hoare triple {18622#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-08 15:26:28,319 INFO L290 TraceCheckUtils]: 43: Hoare triple {18622#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-08 15:26:28,320 INFO L290 TraceCheckUtils]: 44: Hoare triple {18622#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-08 15:26:28,320 INFO L290 TraceCheckUtils]: 45: Hoare triple {18622#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-08 15:26:28,320 INFO L290 TraceCheckUtils]: 46: Hoare triple {18622#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-08 15:26:28,320 INFO L290 TraceCheckUtils]: 47: Hoare triple {18622#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-08 15:26:28,320 INFO L290 TraceCheckUtils]: 48: Hoare triple {18622#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-08 15:26:28,320 INFO L290 TraceCheckUtils]: 49: Hoare triple {18622#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-08 15:26:28,320 INFO L290 TraceCheckUtils]: 50: Hoare triple {18622#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-08 15:26:28,320 INFO L290 TraceCheckUtils]: 51: Hoare triple {18622#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-08 15:26:28,320 INFO L290 TraceCheckUtils]: 52: Hoare triple {18622#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-08 15:26:28,320 INFO L290 TraceCheckUtils]: 53: Hoare triple {18622#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-08 15:26:28,320 INFO L290 TraceCheckUtils]: 54: Hoare triple {18622#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-08 15:26:28,320 INFO L290 TraceCheckUtils]: 55: Hoare triple {18622#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-08 15:26:28,321 INFO L290 TraceCheckUtils]: 56: Hoare triple {18622#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-08 15:26:28,321 INFO L290 TraceCheckUtils]: 57: Hoare triple {18622#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-08 15:26:28,321 INFO L290 TraceCheckUtils]: 58: Hoare triple {18622#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-08 15:26:28,321 INFO L290 TraceCheckUtils]: 59: Hoare triple {18622#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-08 15:26:28,321 INFO L290 TraceCheckUtils]: 60: Hoare triple {18622#false} assume 8641 == #t~mem76;havoc #t~mem76; {18622#false} is VALID [2022-04-08 15:26:28,321 INFO L290 TraceCheckUtils]: 61: Hoare triple {18622#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {18622#false} is VALID [2022-04-08 15:26:28,321 INFO L290 TraceCheckUtils]: 62: Hoare triple {18622#false} assume !(4 == ~blastFlag~0); {18622#false} is VALID [2022-04-08 15:26:28,321 INFO L290 TraceCheckUtils]: 63: Hoare triple {18622#false} assume 5 == ~blastFlag~0; {18622#false} is VALID [2022-04-08 15:26:28,321 INFO L290 TraceCheckUtils]: 64: Hoare triple {18622#false} assume !false; {18622#false} is VALID [2022-04-08 15:26:28,322 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 15:26:28,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:26:28,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735783734] [2022-04-08 15:26:28,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735783734] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:26:28,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:26:28,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:26:28,323 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:26:28,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1452977091] [2022-04-08 15:26:28,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1452977091] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:26:28,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:26:28,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:26:28,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843936757] [2022-04-08 15:26:28,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:26:28,323 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-08 15:26:28,324 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:26:28,324 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:26:28,385 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:26:28,385 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:26:28,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:26:28,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:26:28,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:26:28,386 INFO L87 Difference]: Start difference. First operand 250 states and 396 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:26:30,411 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:26:31,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:26:31,574 INFO L93 Difference]: Finished difference Result 563 states and 891 transitions. [2022-04-08 15:26:31,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:26:31,574 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-08 15:26:31,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:26:31,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:26:31,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 593 transitions. [2022-04-08 15:26:31,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:26:31,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 593 transitions. [2022-04-08 15:26:31,581 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 593 transitions. [2022-04-08 15:26:32,010 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 593 edges. 593 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:26:32,016 INFO L225 Difference]: With dead ends: 563 [2022-04-08 15:26:32,016 INFO L226 Difference]: Without dead ends: 339 [2022-04-08 15:26:32,017 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 15:26:32,017 INFO L913 BasicCegarLoop]: 119 mSDtfsCounter, 147 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-08 15:26:32,017 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 346 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 472 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-08 15:26:32,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-04-08 15:26:32,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 250. [2022-04-08 15:26:32,028 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:26:32,029 INFO L82 GeneralOperation]: Start isEquivalent. First operand 339 states. Second operand has 250 states, 245 states have (on average 1.583673469387755) internal successors, (388), 245 states have internal predecessors, (388), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:26:32,029 INFO L74 IsIncluded]: Start isIncluded. First operand 339 states. Second operand has 250 states, 245 states have (on average 1.583673469387755) internal successors, (388), 245 states have internal predecessors, (388), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:26:32,030 INFO L87 Difference]: Start difference. First operand 339 states. Second operand has 250 states, 245 states have (on average 1.583673469387755) internal successors, (388), 245 states have internal predecessors, (388), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:26:32,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:26:32,037 INFO L93 Difference]: Finished difference Result 339 states and 524 transitions. [2022-04-08 15:26:32,037 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 524 transitions. [2022-04-08 15:26:32,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:26:32,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:26:32,038 INFO L74 IsIncluded]: Start isIncluded. First operand has 250 states, 245 states have (on average 1.583673469387755) internal successors, (388), 245 states have internal predecessors, (388), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 339 states. [2022-04-08 15:26:32,038 INFO L87 Difference]: Start difference. First operand has 250 states, 245 states have (on average 1.583673469387755) internal successors, (388), 245 states have internal predecessors, (388), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 339 states. [2022-04-08 15:26:32,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:26:32,045 INFO L93 Difference]: Finished difference Result 339 states and 524 transitions. [2022-04-08 15:26:32,045 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 524 transitions. [2022-04-08 15:26:32,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:26:32,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:26:32,046 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:26:32,046 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:26:32,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 245 states have (on average 1.583673469387755) internal successors, (388), 245 states have internal predecessors, (388), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:26:32,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 392 transitions. [2022-04-08 15:26:32,052 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 392 transitions. Word has length 65 [2022-04-08 15:26:32,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:26:32,052 INFO L478 AbstractCegarLoop]: Abstraction has 250 states and 392 transitions. [2022-04-08 15:26:32,052 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:26:32,052 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 392 transitions. [2022-04-08 15:26:32,363 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 392 edges. 392 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:26:32,363 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 392 transitions. [2022-04-08 15:26:32,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-08 15:26:32,364 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:26:32,364 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:26:32,364 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-08 15:26:32,364 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:26:32,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:26:32,365 INFO L85 PathProgramCache]: Analyzing trace with hash -212472562, now seen corresponding path program 1 times [2022-04-08 15:26:32,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:26:32,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1022779576] [2022-04-08 15:26:32,388 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 15:26:32,388 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:26:32,388 INFO L85 PathProgramCache]: Analyzing trace with hash -212472562, now seen corresponding path program 2 times [2022-04-08 15:26:32,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:26:32,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906317556] [2022-04-08 15:26:32,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:26:32,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:26:32,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:26:32,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:26:32,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:26:32,527 INFO L290 TraceCheckUtils]: 0: Hoare triple {20944#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {20937#true} is VALID [2022-04-08 15:26:32,527 INFO L290 TraceCheckUtils]: 1: Hoare triple {20937#true} assume true; {20937#true} is VALID [2022-04-08 15:26:32,527 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20937#true} {20937#true} #690#return; {20937#true} is VALID [2022-04-08 15:26:32,528 INFO L272 TraceCheckUtils]: 0: Hoare triple {20937#true} call ULTIMATE.init(); {20944#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:26:32,528 INFO L290 TraceCheckUtils]: 1: Hoare triple {20944#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {20937#true} is VALID [2022-04-08 15:26:32,528 INFO L290 TraceCheckUtils]: 2: Hoare triple {20937#true} assume true; {20937#true} is VALID [2022-04-08 15:26:32,529 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20937#true} {20937#true} #690#return; {20937#true} is VALID [2022-04-08 15:26:32,529 INFO L272 TraceCheckUtils]: 4: Hoare triple {20937#true} call #t~ret161 := main(); {20937#true} is VALID [2022-04-08 15:26:32,529 INFO L290 TraceCheckUtils]: 5: Hoare triple {20937#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {20937#true} is VALID [2022-04-08 15:26:32,529 INFO L290 TraceCheckUtils]: 6: Hoare triple {20937#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {20937#true} is VALID [2022-04-08 15:26:32,529 INFO L272 TraceCheckUtils]: 7: Hoare triple {20937#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {20937#true} is VALID [2022-04-08 15:26:32,532 INFO L290 TraceCheckUtils]: 8: Hoare triple {20937#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:26:32,532 INFO L290 TraceCheckUtils]: 9: Hoare triple {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:26:32,533 INFO L290 TraceCheckUtils]: 10: Hoare triple {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:26:32,533 INFO L290 TraceCheckUtils]: 11: Hoare triple {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:26:32,534 INFO L290 TraceCheckUtils]: 12: Hoare triple {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:26:32,534 INFO L290 TraceCheckUtils]: 13: Hoare triple {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:26:32,535 INFO L290 TraceCheckUtils]: 14: Hoare triple {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:26:32,535 INFO L290 TraceCheckUtils]: 15: Hoare triple {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:26:32,535 INFO L290 TraceCheckUtils]: 16: Hoare triple {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:26:32,536 INFO L290 TraceCheckUtils]: 17: Hoare triple {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:26:32,536 INFO L290 TraceCheckUtils]: 18: Hoare triple {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {20943#(not (= 24576 |ssl3_accept_#t~mem50|))} is VALID [2022-04-08 15:26:32,537 INFO L290 TraceCheckUtils]: 19: Hoare triple {20943#(not (= 24576 |ssl3_accept_#t~mem50|))} assume 24576 == #t~mem50;havoc #t~mem50; {20938#false} is VALID [2022-04-08 15:26:32,537 INFO L290 TraceCheckUtils]: 20: Hoare triple {20938#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {20938#false} is VALID [2022-04-08 15:26:32,537 INFO L290 TraceCheckUtils]: 21: Hoare triple {20938#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {20938#false} is VALID [2022-04-08 15:26:32,537 INFO L290 TraceCheckUtils]: 22: Hoare triple {20938#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {20938#false} is VALID [2022-04-08 15:26:32,537 INFO L290 TraceCheckUtils]: 23: Hoare triple {20938#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {20938#false} is VALID [2022-04-08 15:26:32,537 INFO L290 TraceCheckUtils]: 24: Hoare triple {20938#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {20938#false} is VALID [2022-04-08 15:26:32,537 INFO L290 TraceCheckUtils]: 25: Hoare triple {20938#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-08 15:26:32,537 INFO L290 TraceCheckUtils]: 26: Hoare triple {20938#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem89 := read~int(#t~mem88.base, 132 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 132 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-08 15:26:32,537 INFO L290 TraceCheckUtils]: 27: Hoare triple {20938#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {20938#false} is VALID [2022-04-08 15:26:32,537 INFO L290 TraceCheckUtils]: 28: Hoare triple {20938#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {20938#false} is VALID [2022-04-08 15:26:32,537 INFO L290 TraceCheckUtils]: 29: Hoare triple {20938#false} ~skip~0 := 0; {20938#false} is VALID [2022-04-08 15:26:32,537 INFO L290 TraceCheckUtils]: 30: Hoare triple {20938#false} assume !false; {20938#false} is VALID [2022-04-08 15:26:32,538 INFO L290 TraceCheckUtils]: 31: Hoare triple {20938#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-08 15:26:32,538 INFO L290 TraceCheckUtils]: 32: Hoare triple {20938#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-08 15:26:32,538 INFO L290 TraceCheckUtils]: 33: Hoare triple {20938#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-08 15:26:32,538 INFO L290 TraceCheckUtils]: 34: Hoare triple {20938#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-08 15:26:32,538 INFO L290 TraceCheckUtils]: 35: Hoare triple {20938#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-08 15:26:32,538 INFO L290 TraceCheckUtils]: 36: Hoare triple {20938#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-08 15:26:32,538 INFO L290 TraceCheckUtils]: 37: Hoare triple {20938#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-08 15:26:32,538 INFO L290 TraceCheckUtils]: 38: Hoare triple {20938#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-08 15:26:32,538 INFO L290 TraceCheckUtils]: 39: Hoare triple {20938#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-08 15:26:32,538 INFO L290 TraceCheckUtils]: 40: Hoare triple {20938#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-08 15:26:32,538 INFO L290 TraceCheckUtils]: 41: Hoare triple {20938#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-08 15:26:32,538 INFO L290 TraceCheckUtils]: 42: Hoare triple {20938#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-08 15:26:32,539 INFO L290 TraceCheckUtils]: 43: Hoare triple {20938#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-08 15:26:32,539 INFO L290 TraceCheckUtils]: 44: Hoare triple {20938#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-08 15:26:32,539 INFO L290 TraceCheckUtils]: 45: Hoare triple {20938#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-08 15:26:32,539 INFO L290 TraceCheckUtils]: 46: Hoare triple {20938#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-08 15:26:32,539 INFO L290 TraceCheckUtils]: 47: Hoare triple {20938#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-08 15:26:32,539 INFO L290 TraceCheckUtils]: 48: Hoare triple {20938#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-08 15:26:32,539 INFO L290 TraceCheckUtils]: 49: Hoare triple {20938#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-08 15:26:32,539 INFO L290 TraceCheckUtils]: 50: Hoare triple {20938#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-08 15:26:32,539 INFO L290 TraceCheckUtils]: 51: Hoare triple {20938#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-08 15:26:32,539 INFO L290 TraceCheckUtils]: 52: Hoare triple {20938#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-08 15:26:32,539 INFO L290 TraceCheckUtils]: 53: Hoare triple {20938#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-08 15:26:32,540 INFO L290 TraceCheckUtils]: 54: Hoare triple {20938#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-08 15:26:32,540 INFO L290 TraceCheckUtils]: 55: Hoare triple {20938#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-08 15:26:32,540 INFO L290 TraceCheckUtils]: 56: Hoare triple {20938#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-08 15:26:32,540 INFO L290 TraceCheckUtils]: 57: Hoare triple {20938#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-08 15:26:32,540 INFO L290 TraceCheckUtils]: 58: Hoare triple {20938#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-08 15:26:32,540 INFO L290 TraceCheckUtils]: 59: Hoare triple {20938#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-08 15:26:32,540 INFO L290 TraceCheckUtils]: 60: Hoare triple {20938#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-08 15:26:32,540 INFO L290 TraceCheckUtils]: 61: Hoare triple {20938#false} assume 8641 == #t~mem76;havoc #t~mem76; {20938#false} is VALID [2022-04-08 15:26:32,540 INFO L290 TraceCheckUtils]: 62: Hoare triple {20938#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {20938#false} is VALID [2022-04-08 15:26:32,540 INFO L290 TraceCheckUtils]: 63: Hoare triple {20938#false} assume !(4 == ~blastFlag~0); {20938#false} is VALID [2022-04-08 15:26:32,540 INFO L290 TraceCheckUtils]: 64: Hoare triple {20938#false} assume 5 == ~blastFlag~0; {20938#false} is VALID [2022-04-08 15:26:32,540 INFO L290 TraceCheckUtils]: 65: Hoare triple {20938#false} assume !false; {20938#false} is VALID [2022-04-08 15:26:32,541 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 15:26:32,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:26:32,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906317556] [2022-04-08 15:26:32,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906317556] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:26:32,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:26:32,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:26:32,541 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:26:32,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1022779576] [2022-04-08 15:26:32,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1022779576] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:26:32,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:26:32,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:26:32,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665408068] [2022-04-08 15:26:32,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:26:32,542 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-08 15:26:32,542 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:26:32,543 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:26:32,593 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:26:32,594 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:26:32,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:26:32,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:26:32,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:26:32,595 INFO L87 Difference]: Start difference. First operand 250 states and 392 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:26:36,305 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:26:38,821 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:26:40,826 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:26:41,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:26:41,992 INFO L93 Difference]: Finished difference Result 563 states and 884 transitions. [2022-04-08 15:26:41,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:26:41,992 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-08 15:26:41,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:26:41,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:26:41,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 592 transitions. [2022-04-08 15:26:41,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:26:41,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 592 transitions. [2022-04-08 15:26:41,997 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 592 transitions. [2022-04-08 15:26:42,389 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 592 edges. 592 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:26:42,394 INFO L225 Difference]: With dead ends: 563 [2022-04-08 15:26:42,394 INFO L226 Difference]: Without dead ends: 339 [2022-04-08 15:26:42,394 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 15:26:42,394 INFO L913 BasicCegarLoop]: 119 mSDtfsCounter, 145 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-04-08 15:26:42,395 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 346 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 475 Invalid, 1 Unknown, 0 Unchecked, 5.8s Time] [2022-04-08 15:26:42,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-04-08 15:26:42,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 250. [2022-04-08 15:26:42,405 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:26:42,406 INFO L82 GeneralOperation]: Start isEquivalent. First operand 339 states. Second operand has 250 states, 245 states have (on average 1.5673469387755101) internal successors, (384), 245 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:26:42,406 INFO L74 IsIncluded]: Start isIncluded. First operand 339 states. Second operand has 250 states, 245 states have (on average 1.5673469387755101) internal successors, (384), 245 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:26:42,407 INFO L87 Difference]: Start difference. First operand 339 states. Second operand has 250 states, 245 states have (on average 1.5673469387755101) internal successors, (384), 245 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:26:42,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:26:42,414 INFO L93 Difference]: Finished difference Result 339 states and 520 transitions. [2022-04-08 15:26:42,414 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 520 transitions. [2022-04-08 15:26:42,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:26:42,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:26:42,415 INFO L74 IsIncluded]: Start isIncluded. First operand has 250 states, 245 states have (on average 1.5673469387755101) internal successors, (384), 245 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 339 states. [2022-04-08 15:26:42,416 INFO L87 Difference]: Start difference. First operand has 250 states, 245 states have (on average 1.5673469387755101) internal successors, (384), 245 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 339 states. [2022-04-08 15:26:42,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:26:42,423 INFO L93 Difference]: Finished difference Result 339 states and 520 transitions. [2022-04-08 15:26:42,423 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 520 transitions. [2022-04-08 15:26:42,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:26:42,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:26:42,424 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:26:42,424 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:26:42,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 245 states have (on average 1.5673469387755101) internal successors, (384), 245 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:26:42,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 388 transitions. [2022-04-08 15:26:42,429 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 388 transitions. Word has length 66 [2022-04-08 15:26:42,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:26:42,430 INFO L478 AbstractCegarLoop]: Abstraction has 250 states and 388 transitions. [2022-04-08 15:26:42,430 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:26:42,430 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 388 transitions. [2022-04-08 15:26:42,800 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 388 edges. 388 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:26:42,801 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 388 transitions. [2022-04-08 15:26:42,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-08 15:26:42,801 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:26:42,801 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:26:42,802 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-08 15:26:42,802 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:26:42,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:26:42,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1864777555, now seen corresponding path program 1 times [2022-04-08 15:26:42,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:26:42,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [937079212] [2022-04-08 15:26:42,827 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 15:26:42,828 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:26:42,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1864777555, now seen corresponding path program 2 times [2022-04-08 15:26:42,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:26:42,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698922737] [2022-04-08 15:26:42,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:26:42,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:26:42,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:26:42,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:26:42,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:26:42,972 INFO L290 TraceCheckUtils]: 0: Hoare triple {23260#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {23253#true} is VALID [2022-04-08 15:26:42,972 INFO L290 TraceCheckUtils]: 1: Hoare triple {23253#true} assume true; {23253#true} is VALID [2022-04-08 15:26:42,972 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23253#true} {23253#true} #690#return; {23253#true} is VALID [2022-04-08 15:26:42,973 INFO L272 TraceCheckUtils]: 0: Hoare triple {23253#true} call ULTIMATE.init(); {23260#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:26:42,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {23260#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {23253#true} is VALID [2022-04-08 15:26:42,973 INFO L290 TraceCheckUtils]: 2: Hoare triple {23253#true} assume true; {23253#true} is VALID [2022-04-08 15:26:42,973 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23253#true} {23253#true} #690#return; {23253#true} is VALID [2022-04-08 15:26:42,974 INFO L272 TraceCheckUtils]: 4: Hoare triple {23253#true} call #t~ret161 := main(); {23253#true} is VALID [2022-04-08 15:26:42,974 INFO L290 TraceCheckUtils]: 5: Hoare triple {23253#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {23253#true} is VALID [2022-04-08 15:26:42,974 INFO L290 TraceCheckUtils]: 6: Hoare triple {23253#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {23253#true} is VALID [2022-04-08 15:26:42,974 INFO L272 TraceCheckUtils]: 7: Hoare triple {23253#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {23253#true} is VALID [2022-04-08 15:26:42,976 INFO L290 TraceCheckUtils]: 8: Hoare triple {23253#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:26:42,977 INFO L290 TraceCheckUtils]: 9: Hoare triple {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:26:42,977 INFO L290 TraceCheckUtils]: 10: Hoare triple {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:26:42,978 INFO L290 TraceCheckUtils]: 11: Hoare triple {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:26:42,978 INFO L290 TraceCheckUtils]: 12: Hoare triple {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:26:42,979 INFO L290 TraceCheckUtils]: 13: Hoare triple {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:26:42,979 INFO L290 TraceCheckUtils]: 14: Hoare triple {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:26:42,979 INFO L290 TraceCheckUtils]: 15: Hoare triple {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:26:42,980 INFO L290 TraceCheckUtils]: 16: Hoare triple {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:26:42,980 INFO L290 TraceCheckUtils]: 17: Hoare triple {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:26:42,981 INFO L290 TraceCheckUtils]: 18: Hoare triple {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:26:42,981 INFO L290 TraceCheckUtils]: 19: Hoare triple {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {23259#(= 8464 |ssl3_accept_#t~mem51|)} is VALID [2022-04-08 15:26:42,981 INFO L290 TraceCheckUtils]: 20: Hoare triple {23259#(= 8464 |ssl3_accept_#t~mem51|)} assume 8195 == #t~mem51;havoc #t~mem51; {23254#false} is VALID [2022-04-08 15:26:42,982 INFO L290 TraceCheckUtils]: 21: Hoare triple {23254#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {23254#false} is VALID [2022-04-08 15:26:42,982 INFO L290 TraceCheckUtils]: 22: Hoare triple {23254#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {23254#false} is VALID [2022-04-08 15:26:42,982 INFO L290 TraceCheckUtils]: 23: Hoare triple {23254#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {23254#false} is VALID [2022-04-08 15:26:42,982 INFO L290 TraceCheckUtils]: 24: Hoare triple {23254#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {23254#false} is VALID [2022-04-08 15:26:42,982 INFO L290 TraceCheckUtils]: 25: Hoare triple {23254#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {23254#false} is VALID [2022-04-08 15:26:42,982 INFO L290 TraceCheckUtils]: 26: Hoare triple {23254#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-08 15:26:42,982 INFO L290 TraceCheckUtils]: 27: Hoare triple {23254#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem89 := read~int(#t~mem88.base, 132 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 132 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-08 15:26:42,982 INFO L290 TraceCheckUtils]: 28: Hoare triple {23254#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {23254#false} is VALID [2022-04-08 15:26:42,982 INFO L290 TraceCheckUtils]: 29: Hoare triple {23254#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {23254#false} is VALID [2022-04-08 15:26:42,982 INFO L290 TraceCheckUtils]: 30: Hoare triple {23254#false} ~skip~0 := 0; {23254#false} is VALID [2022-04-08 15:26:42,982 INFO L290 TraceCheckUtils]: 31: Hoare triple {23254#false} assume !false; {23254#false} is VALID [2022-04-08 15:26:42,982 INFO L290 TraceCheckUtils]: 32: Hoare triple {23254#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-08 15:26:42,983 INFO L290 TraceCheckUtils]: 33: Hoare triple {23254#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-08 15:26:42,983 INFO L290 TraceCheckUtils]: 34: Hoare triple {23254#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-08 15:26:42,983 INFO L290 TraceCheckUtils]: 35: Hoare triple {23254#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-08 15:26:42,983 INFO L290 TraceCheckUtils]: 36: Hoare triple {23254#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-08 15:26:42,983 INFO L290 TraceCheckUtils]: 37: Hoare triple {23254#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-08 15:26:42,983 INFO L290 TraceCheckUtils]: 38: Hoare triple {23254#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-08 15:26:42,983 INFO L290 TraceCheckUtils]: 39: Hoare triple {23254#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-08 15:26:42,983 INFO L290 TraceCheckUtils]: 40: Hoare triple {23254#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-08 15:26:42,983 INFO L290 TraceCheckUtils]: 41: Hoare triple {23254#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-08 15:26:42,983 INFO L290 TraceCheckUtils]: 42: Hoare triple {23254#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-08 15:26:42,983 INFO L290 TraceCheckUtils]: 43: Hoare triple {23254#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-08 15:26:42,984 INFO L290 TraceCheckUtils]: 44: Hoare triple {23254#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-08 15:26:42,984 INFO L290 TraceCheckUtils]: 45: Hoare triple {23254#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-08 15:26:42,984 INFO L290 TraceCheckUtils]: 46: Hoare triple {23254#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-08 15:26:42,984 INFO L290 TraceCheckUtils]: 47: Hoare triple {23254#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-08 15:26:42,984 INFO L290 TraceCheckUtils]: 48: Hoare triple {23254#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-08 15:26:42,984 INFO L290 TraceCheckUtils]: 49: Hoare triple {23254#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-08 15:26:42,984 INFO L290 TraceCheckUtils]: 50: Hoare triple {23254#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-08 15:26:42,997 INFO L290 TraceCheckUtils]: 51: Hoare triple {23254#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-08 15:26:42,997 INFO L290 TraceCheckUtils]: 52: Hoare triple {23254#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-08 15:26:42,997 INFO L290 TraceCheckUtils]: 53: Hoare triple {23254#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-08 15:26:42,997 INFO L290 TraceCheckUtils]: 54: Hoare triple {23254#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-08 15:26:42,997 INFO L290 TraceCheckUtils]: 55: Hoare triple {23254#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-08 15:26:42,998 INFO L290 TraceCheckUtils]: 56: Hoare triple {23254#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-08 15:26:42,998 INFO L290 TraceCheckUtils]: 57: Hoare triple {23254#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-08 15:26:42,998 INFO L290 TraceCheckUtils]: 58: Hoare triple {23254#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-08 15:26:42,998 INFO L290 TraceCheckUtils]: 59: Hoare triple {23254#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-08 15:26:42,998 INFO L290 TraceCheckUtils]: 60: Hoare triple {23254#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-08 15:26:42,998 INFO L290 TraceCheckUtils]: 61: Hoare triple {23254#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-08 15:26:42,998 INFO L290 TraceCheckUtils]: 62: Hoare triple {23254#false} assume 8641 == #t~mem76;havoc #t~mem76; {23254#false} is VALID [2022-04-08 15:26:42,998 INFO L290 TraceCheckUtils]: 63: Hoare triple {23254#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {23254#false} is VALID [2022-04-08 15:26:42,998 INFO L290 TraceCheckUtils]: 64: Hoare triple {23254#false} assume !(4 == ~blastFlag~0); {23254#false} is VALID [2022-04-08 15:26:42,998 INFO L290 TraceCheckUtils]: 65: Hoare triple {23254#false} assume 5 == ~blastFlag~0; {23254#false} is VALID [2022-04-08 15:26:42,998 INFO L290 TraceCheckUtils]: 66: Hoare triple {23254#false} assume !false; {23254#false} is VALID [2022-04-08 15:26:42,999 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 15:26:42,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:26:42,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698922737] [2022-04-08 15:26:42,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698922737] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:26:42,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:26:42,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:26:43,000 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:26:43,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [937079212] [2022-04-08 15:26:43,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [937079212] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:26:43,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:26:43,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:26:43,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121647748] [2022-04-08 15:26:43,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:26:43,001 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-08 15:26:43,001 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:26:43,001 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:26:43,071 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:26:43,071 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:26:43,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:26:43,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:26:43,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:26:43,073 INFO L87 Difference]: Start difference. First operand 250 states and 388 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:26:47,070 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:26:49,075 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:26:51,106 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:26:54,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:26:54,918 INFO L93 Difference]: Finished difference Result 477 states and 749 transitions. [2022-04-08 15:26:54,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:26:54,919 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-08 15:26:54,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:26:54,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:26:54,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 427 transitions. [2022-04-08 15:26:54,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:26:54,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 427 transitions. [2022-04-08 15:26:54,923 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 427 transitions. [2022-04-08 15:26:55,232 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 427 edges. 427 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:26:55,236 INFO L225 Difference]: With dead ends: 477 [2022-04-08 15:26:55,236 INFO L226 Difference]: Without dead ends: 253 [2022-04-08 15:26:55,237 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 15:26:55,237 INFO L913 BasicCegarLoop]: 198 mSDtfsCounter, 11 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 4 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-04-08 15:26:55,238 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 505 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 340 Invalid, 2 Unknown, 0 Unchecked, 7.2s Time] [2022-04-08 15:26:55,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-04-08 15:26:55,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 250. [2022-04-08 15:26:55,248 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:26:55,249 INFO L82 GeneralOperation]: Start isEquivalent. First operand 253 states. Second operand has 250 states, 245 states have (on average 1.563265306122449) internal successors, (383), 245 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:26:55,249 INFO L74 IsIncluded]: Start isIncluded. First operand 253 states. Second operand has 250 states, 245 states have (on average 1.563265306122449) internal successors, (383), 245 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:26:55,249 INFO L87 Difference]: Start difference. First operand 253 states. Second operand has 250 states, 245 states have (on average 1.563265306122449) internal successors, (383), 245 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:26:55,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:26:55,254 INFO L93 Difference]: Finished difference Result 253 states and 391 transitions. [2022-04-08 15:26:55,254 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 391 transitions. [2022-04-08 15:26:55,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:26:55,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:26:55,255 INFO L74 IsIncluded]: Start isIncluded. First operand has 250 states, 245 states have (on average 1.563265306122449) internal successors, (383), 245 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 253 states. [2022-04-08 15:26:55,255 INFO L87 Difference]: Start difference. First operand has 250 states, 245 states have (on average 1.563265306122449) internal successors, (383), 245 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 253 states. [2022-04-08 15:26:55,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:26:55,260 INFO L93 Difference]: Finished difference Result 253 states and 391 transitions. [2022-04-08 15:26:55,260 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 391 transitions. [2022-04-08 15:26:55,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:26:55,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:26:55,261 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:26:55,261 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:26:55,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 245 states have (on average 1.563265306122449) internal successors, (383), 245 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:26:55,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 387 transitions. [2022-04-08 15:26:55,267 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 387 transitions. Word has length 67 [2022-04-08 15:26:55,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:26:55,267 INFO L478 AbstractCegarLoop]: Abstraction has 250 states and 387 transitions. [2022-04-08 15:26:55,267 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:26:55,267 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 387 transitions. [2022-04-08 15:26:55,562 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 387 edges. 387 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:26:55,562 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 387 transitions. [2022-04-08 15:26:55,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-08 15:26:55,563 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:26:55,563 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:26:55,563 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-08 15:26:55,563 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:26:55,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:26:55,564 INFO L85 PathProgramCache]: Analyzing trace with hash 804207484, now seen corresponding path program 1 times [2022-04-08 15:26:55,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:26:55,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1523178662] [2022-04-08 15:26:55,591 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:26:55,592 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:26:55,592 INFO L85 PathProgramCache]: Analyzing trace with hash 804207484, now seen corresponding path program 2 times [2022-04-08 15:26:55,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:26:55,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510351380] [2022-04-08 15:26:55,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:26:55,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:26:55,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:26:55,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:26:55,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:26:55,728 INFO L290 TraceCheckUtils]: 0: Hoare triple {25232#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {25225#true} is VALID [2022-04-08 15:26:55,728 INFO L290 TraceCheckUtils]: 1: Hoare triple {25225#true} assume true; {25225#true} is VALID [2022-04-08 15:26:55,728 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25225#true} {25225#true} #690#return; {25225#true} is VALID [2022-04-08 15:26:55,729 INFO L272 TraceCheckUtils]: 0: Hoare triple {25225#true} call ULTIMATE.init(); {25232#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:26:55,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {25232#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {25225#true} is VALID [2022-04-08 15:26:55,730 INFO L290 TraceCheckUtils]: 2: Hoare triple {25225#true} assume true; {25225#true} is VALID [2022-04-08 15:26:55,730 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25225#true} {25225#true} #690#return; {25225#true} is VALID [2022-04-08 15:26:55,730 INFO L272 TraceCheckUtils]: 4: Hoare triple {25225#true} call #t~ret161 := main(); {25225#true} is VALID [2022-04-08 15:26:55,730 INFO L290 TraceCheckUtils]: 5: Hoare triple {25225#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {25225#true} is VALID [2022-04-08 15:26:55,730 INFO L290 TraceCheckUtils]: 6: Hoare triple {25225#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {25225#true} is VALID [2022-04-08 15:26:55,730 INFO L272 TraceCheckUtils]: 7: Hoare triple {25225#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {25225#true} is VALID [2022-04-08 15:26:55,730 INFO L290 TraceCheckUtils]: 8: Hoare triple {25225#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {25225#true} is VALID [2022-04-08 15:26:55,730 INFO L290 TraceCheckUtils]: 9: Hoare triple {25225#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {25225#true} is VALID [2022-04-08 15:26:55,730 INFO L290 TraceCheckUtils]: 10: Hoare triple {25225#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {25225#true} is VALID [2022-04-08 15:26:55,730 INFO L290 TraceCheckUtils]: 11: Hoare triple {25225#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {25225#true} is VALID [2022-04-08 15:26:55,730 INFO L290 TraceCheckUtils]: 12: Hoare triple {25225#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {25225#true} is VALID [2022-04-08 15:26:55,730 INFO L290 TraceCheckUtils]: 13: Hoare triple {25225#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {25225#true} is VALID [2022-04-08 15:26:55,731 INFO L290 TraceCheckUtils]: 14: Hoare triple {25225#true} assume !false; {25225#true} is VALID [2022-04-08 15:26:55,731 INFO L290 TraceCheckUtils]: 15: Hoare triple {25225#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {25225#true} is VALID [2022-04-08 15:26:55,731 INFO L290 TraceCheckUtils]: 16: Hoare triple {25225#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {25225#true} is VALID [2022-04-08 15:26:55,731 INFO L290 TraceCheckUtils]: 17: Hoare triple {25225#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {25225#true} is VALID [2022-04-08 15:26:55,731 INFO L290 TraceCheckUtils]: 18: Hoare triple {25225#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {25225#true} is VALID [2022-04-08 15:26:55,731 INFO L290 TraceCheckUtils]: 19: Hoare triple {25225#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {25225#true} is VALID [2022-04-08 15:26:55,731 INFO L290 TraceCheckUtils]: 20: Hoare triple {25225#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {25225#true} is VALID [2022-04-08 15:26:55,731 INFO L290 TraceCheckUtils]: 21: Hoare triple {25225#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {25225#true} is VALID [2022-04-08 15:26:55,731 INFO L290 TraceCheckUtils]: 22: Hoare triple {25225#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {25225#true} is VALID [2022-04-08 15:26:55,731 INFO L290 TraceCheckUtils]: 23: Hoare triple {25225#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {25225#true} is VALID [2022-04-08 15:26:55,731 INFO L290 TraceCheckUtils]: 24: Hoare triple {25225#true} assume 8464 == #t~mem55;havoc #t~mem55; {25225#true} is VALID [2022-04-08 15:26:55,731 INFO L290 TraceCheckUtils]: 25: Hoare triple {25225#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {25225#true} is VALID [2022-04-08 15:26:55,732 INFO L290 TraceCheckUtils]: 26: Hoare triple {25225#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {25225#true} is VALID [2022-04-08 15:26:55,733 INFO L290 TraceCheckUtils]: 27: Hoare triple {25225#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-08 15:26:55,733 INFO L290 TraceCheckUtils]: 28: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-08 15:26:55,734 INFO L290 TraceCheckUtils]: 29: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-08 15:26:55,734 INFO L290 TraceCheckUtils]: 30: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} ~skip~0 := 0; {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-08 15:26:55,734 INFO L290 TraceCheckUtils]: 31: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !false; {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-08 15:26:55,735 INFO L290 TraceCheckUtils]: 32: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-08 15:26:55,735 INFO L290 TraceCheckUtils]: 33: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-08 15:26:55,736 INFO L290 TraceCheckUtils]: 34: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-08 15:26:55,736 INFO L290 TraceCheckUtils]: 35: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-08 15:26:55,736 INFO L290 TraceCheckUtils]: 36: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-08 15:26:55,737 INFO L290 TraceCheckUtils]: 37: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-08 15:26:55,737 INFO L290 TraceCheckUtils]: 38: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-08 15:26:55,738 INFO L290 TraceCheckUtils]: 39: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-08 15:26:55,738 INFO L290 TraceCheckUtils]: 40: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-08 15:26:55,739 INFO L290 TraceCheckUtils]: 41: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-08 15:26:55,739 INFO L290 TraceCheckUtils]: 42: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-08 15:26:55,739 INFO L290 TraceCheckUtils]: 43: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-08 15:26:55,740 INFO L290 TraceCheckUtils]: 44: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-08 15:26:55,740 INFO L290 TraceCheckUtils]: 45: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-08 15:26:55,741 INFO L290 TraceCheckUtils]: 46: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-08 15:26:55,741 INFO L290 TraceCheckUtils]: 47: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-08 15:26:55,741 INFO L290 TraceCheckUtils]: 48: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-08 15:26:55,742 INFO L290 TraceCheckUtils]: 49: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-08 15:26:55,742 INFO L290 TraceCheckUtils]: 50: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-08 15:26:55,743 INFO L290 TraceCheckUtils]: 51: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-08 15:26:55,743 INFO L290 TraceCheckUtils]: 52: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-08 15:26:55,743 INFO L290 TraceCheckUtils]: 53: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-08 15:26:55,744 INFO L290 TraceCheckUtils]: 54: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-08 15:26:55,744 INFO L290 TraceCheckUtils]: 55: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-08 15:26:55,745 INFO L290 TraceCheckUtils]: 56: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-08 15:26:55,745 INFO L290 TraceCheckUtils]: 57: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-08 15:26:55,746 INFO L290 TraceCheckUtils]: 58: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-08 15:26:55,746 INFO L290 TraceCheckUtils]: 59: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-08 15:26:55,746 INFO L290 TraceCheckUtils]: 60: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-08 15:26:55,747 INFO L290 TraceCheckUtils]: 61: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {25231#(not (= |ssl3_accept_#t~mem76| 8641))} is VALID [2022-04-08 15:26:55,747 INFO L290 TraceCheckUtils]: 62: Hoare triple {25231#(not (= |ssl3_accept_#t~mem76| 8641))} assume 8641 == #t~mem76;havoc #t~mem76; {25226#false} is VALID [2022-04-08 15:26:55,747 INFO L290 TraceCheckUtils]: 63: Hoare triple {25226#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {25226#false} is VALID [2022-04-08 15:26:55,747 INFO L290 TraceCheckUtils]: 64: Hoare triple {25226#false} assume !(4 == ~blastFlag~0); {25226#false} is VALID [2022-04-08 15:26:55,747 INFO L290 TraceCheckUtils]: 65: Hoare triple {25226#false} assume 5 == ~blastFlag~0; {25226#false} is VALID [2022-04-08 15:26:55,748 INFO L290 TraceCheckUtils]: 66: Hoare triple {25226#false} assume !false; {25226#false} is VALID [2022-04-08 15:26:55,748 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 15:26:55,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:26:55,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510351380] [2022-04-08 15:26:55,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510351380] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:26:55,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:26:55,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:26:55,749 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:26:55,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1523178662] [2022-04-08 15:26:55,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1523178662] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:26:55,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:26:55,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:26:55,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879745218] [2022-04-08 15:26:55,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:26:55,749 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-08 15:26:55,750 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:26:55,750 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:26:55,812 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:26:55,812 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:26:55,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:26:55,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:26:55,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:26:55,813 INFO L87 Difference]: Start difference. First operand 250 states and 387 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:26:57,272 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:26:59,276 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:27:01,303 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:27:03,329 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:27:04,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:27:04,518 INFO L93 Difference]: Finished difference Result 563 states and 876 transitions. [2022-04-08 15:27:04,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:27:04,518 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-08 15:27:04,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:27:04,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:27:04,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 591 transitions. [2022-04-08 15:27:04,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:27:04,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 591 transitions. [2022-04-08 15:27:04,525 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 591 transitions. [2022-04-08 15:27:04,932 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 591 edges. 591 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:27:04,942 INFO L225 Difference]: With dead ends: 563 [2022-04-08 15:27:04,942 INFO L226 Difference]: Without dead ends: 339 [2022-04-08 15:27:04,943 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 15:27:04,945 INFO L913 BasicCegarLoop]: 129 mSDtfsCounter, 119 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 61 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2022-04-08 15:27:04,946 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 366 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 483 Invalid, 3 Unknown, 0 Unchecked, 7.6s Time] [2022-04-08 15:27:04,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-04-08 15:27:04,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 261. [2022-04-08 15:27:04,957 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:27:04,958 INFO L82 GeneralOperation]: Start isEquivalent. First operand 339 states. Second operand has 261 states, 256 states have (on average 1.578125) internal successors, (404), 256 states have internal predecessors, (404), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:27:04,958 INFO L74 IsIncluded]: Start isIncluded. First operand 339 states. Second operand has 261 states, 256 states have (on average 1.578125) internal successors, (404), 256 states have internal predecessors, (404), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:27:04,958 INFO L87 Difference]: Start difference. First operand 339 states. Second operand has 261 states, 256 states have (on average 1.578125) internal successors, (404), 256 states have internal predecessors, (404), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:27:04,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:27:04,965 INFO L93 Difference]: Finished difference Result 339 states and 518 transitions. [2022-04-08 15:27:04,965 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 518 transitions. [2022-04-08 15:27:04,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:27:04,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:27:04,966 INFO L74 IsIncluded]: Start isIncluded. First operand has 261 states, 256 states have (on average 1.578125) internal successors, (404), 256 states have internal predecessors, (404), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 339 states. [2022-04-08 15:27:04,967 INFO L87 Difference]: Start difference. First operand has 261 states, 256 states have (on average 1.578125) internal successors, (404), 256 states have internal predecessors, (404), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 339 states. [2022-04-08 15:27:04,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:27:04,974 INFO L93 Difference]: Finished difference Result 339 states and 518 transitions. [2022-04-08 15:27:04,974 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 518 transitions. [2022-04-08 15:27:04,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:27:04,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:27:04,974 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:27:04,974 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:27:04,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 256 states have (on average 1.578125) internal successors, (404), 256 states have internal predecessors, (404), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:27:04,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 408 transitions. [2022-04-08 15:27:04,980 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 408 transitions. Word has length 67 [2022-04-08 15:27:04,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:27:04,981 INFO L478 AbstractCegarLoop]: Abstraction has 261 states and 408 transitions. [2022-04-08 15:27:04,981 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:27:04,981 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 261 states and 408 transitions. [2022-04-08 15:27:05,296 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 408 edges. 408 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:27:05,296 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 408 transitions. [2022-04-08 15:27:05,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-08 15:27:05,297 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:27:05,297 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:27:05,298 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-08 15:27:05,298 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:27:05,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:27:05,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1127555326, now seen corresponding path program 1 times [2022-04-08 15:27:05,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:27:05,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [672395666] [2022-04-08 15:27:05,366 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:27:05,366 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:27:05,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1127555326, now seen corresponding path program 2 times [2022-04-08 15:27:05,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:27:05,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058684673] [2022-04-08 15:27:05,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:27:05,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:27:05,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:27:05,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:27:05,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:27:05,497 INFO L290 TraceCheckUtils]: 0: Hoare triple {27570#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {27563#true} is VALID [2022-04-08 15:27:05,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {27563#true} assume true; {27563#true} is VALID [2022-04-08 15:27:05,498 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27563#true} {27563#true} #690#return; {27563#true} is VALID [2022-04-08 15:27:05,498 INFO L272 TraceCheckUtils]: 0: Hoare triple {27563#true} call ULTIMATE.init(); {27570#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:27:05,499 INFO L290 TraceCheckUtils]: 1: Hoare triple {27570#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {27563#true} is VALID [2022-04-08 15:27:05,506 INFO L290 TraceCheckUtils]: 2: Hoare triple {27563#true} assume true; {27563#true} is VALID [2022-04-08 15:27:05,506 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27563#true} {27563#true} #690#return; {27563#true} is VALID [2022-04-08 15:27:05,506 INFO L272 TraceCheckUtils]: 4: Hoare triple {27563#true} call #t~ret161 := main(); {27563#true} is VALID [2022-04-08 15:27:05,506 INFO L290 TraceCheckUtils]: 5: Hoare triple {27563#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {27563#true} is VALID [2022-04-08 15:27:05,506 INFO L290 TraceCheckUtils]: 6: Hoare triple {27563#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {27563#true} is VALID [2022-04-08 15:27:05,506 INFO L272 TraceCheckUtils]: 7: Hoare triple {27563#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {27563#true} is VALID [2022-04-08 15:27:05,507 INFO L290 TraceCheckUtils]: 8: Hoare triple {27563#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {27563#true} is VALID [2022-04-08 15:27:05,507 INFO L290 TraceCheckUtils]: 9: Hoare triple {27563#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {27563#true} is VALID [2022-04-08 15:27:05,507 INFO L290 TraceCheckUtils]: 10: Hoare triple {27563#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {27563#true} is VALID [2022-04-08 15:27:05,507 INFO L290 TraceCheckUtils]: 11: Hoare triple {27563#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {27563#true} is VALID [2022-04-08 15:27:05,507 INFO L290 TraceCheckUtils]: 12: Hoare triple {27563#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {27563#true} is VALID [2022-04-08 15:27:05,507 INFO L290 TraceCheckUtils]: 13: Hoare triple {27563#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {27563#true} is VALID [2022-04-08 15:27:05,507 INFO L290 TraceCheckUtils]: 14: Hoare triple {27563#true} assume !false; {27563#true} is VALID [2022-04-08 15:27:05,507 INFO L290 TraceCheckUtils]: 15: Hoare triple {27563#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {27563#true} is VALID [2022-04-08 15:27:05,507 INFO L290 TraceCheckUtils]: 16: Hoare triple {27563#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {27563#true} is VALID [2022-04-08 15:27:05,507 INFO L290 TraceCheckUtils]: 17: Hoare triple {27563#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {27563#true} is VALID [2022-04-08 15:27:05,507 INFO L290 TraceCheckUtils]: 18: Hoare triple {27563#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {27563#true} is VALID [2022-04-08 15:27:05,508 INFO L290 TraceCheckUtils]: 19: Hoare triple {27563#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {27563#true} is VALID [2022-04-08 15:27:05,508 INFO L290 TraceCheckUtils]: 20: Hoare triple {27563#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {27563#true} is VALID [2022-04-08 15:27:05,508 INFO L290 TraceCheckUtils]: 21: Hoare triple {27563#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {27563#true} is VALID [2022-04-08 15:27:05,508 INFO L290 TraceCheckUtils]: 22: Hoare triple {27563#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {27563#true} is VALID [2022-04-08 15:27:05,508 INFO L290 TraceCheckUtils]: 23: Hoare triple {27563#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {27563#true} is VALID [2022-04-08 15:27:05,508 INFO L290 TraceCheckUtils]: 24: Hoare triple {27563#true} assume 8464 == #t~mem55;havoc #t~mem55; {27563#true} is VALID [2022-04-08 15:27:05,508 INFO L290 TraceCheckUtils]: 25: Hoare triple {27563#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {27563#true} is VALID [2022-04-08 15:27:05,508 INFO L290 TraceCheckUtils]: 26: Hoare triple {27563#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {27563#true} is VALID [2022-04-08 15:27:05,509 INFO L290 TraceCheckUtils]: 27: Hoare triple {27563#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:27:05,510 INFO L290 TraceCheckUtils]: 28: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:27:05,510 INFO L290 TraceCheckUtils]: 29: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:27:05,511 INFO L290 TraceCheckUtils]: 30: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} ~skip~0 := 0; {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:27:05,511 INFO L290 TraceCheckUtils]: 31: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:27:05,511 INFO L290 TraceCheckUtils]: 32: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:27:05,512 INFO L290 TraceCheckUtils]: 33: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:27:05,512 INFO L290 TraceCheckUtils]: 34: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:27:05,513 INFO L290 TraceCheckUtils]: 35: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:27:05,513 INFO L290 TraceCheckUtils]: 36: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:27:05,514 INFO L290 TraceCheckUtils]: 37: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:27:05,514 INFO L290 TraceCheckUtils]: 38: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:27:05,514 INFO L290 TraceCheckUtils]: 39: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:27:05,515 INFO L290 TraceCheckUtils]: 40: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:27:05,515 INFO L290 TraceCheckUtils]: 41: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:27:05,516 INFO L290 TraceCheckUtils]: 42: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:27:05,516 INFO L290 TraceCheckUtils]: 43: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:27:05,516 INFO L290 TraceCheckUtils]: 44: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:27:05,517 INFO L290 TraceCheckUtils]: 45: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:27:05,517 INFO L290 TraceCheckUtils]: 46: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:27:05,518 INFO L290 TraceCheckUtils]: 47: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {27569#(not (= |ssl3_accept_#t~mem62| 8528))} is VALID [2022-04-08 15:27:05,518 INFO L290 TraceCheckUtils]: 48: Hoare triple {27569#(not (= |ssl3_accept_#t~mem62| 8528))} assume 8528 == #t~mem62;havoc #t~mem62; {27564#false} is VALID [2022-04-08 15:27:05,518 INFO L290 TraceCheckUtils]: 49: Hoare triple {27564#false} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 888 + #t~mem99.offset, 8);call #t~mem101 := read~int(#t~mem100.base, 20 + #t~mem100.offset, 8);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 332 + ~s.offset, 8); {27564#false} is VALID [2022-04-08 15:27:05,518 INFO L290 TraceCheckUtils]: 50: Hoare triple {27564#false} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 18446744073709551616;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem103.base, 935 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {27564#false} is VALID [2022-04-08 15:27:05,518 INFO L290 TraceCheckUtils]: 51: Hoare triple {27564#false} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem106 := read~int(#t~mem105.base, 935 + #t~mem105.offset, 4); {27564#false} is VALID [2022-04-08 15:27:05,518 INFO L290 TraceCheckUtils]: 52: Hoare triple {27564#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {27564#false} is VALID [2022-04-08 15:27:05,519 INFO L290 TraceCheckUtils]: 53: Hoare triple {27564#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 18446744073709551616); {27564#false} is VALID [2022-04-08 15:27:05,519 INFO L290 TraceCheckUtils]: 54: Hoare triple {27564#false} assume !(0 != ~l~0 % 18446744073709551616);~skip~0 := 1; {27564#false} is VALID [2022-04-08 15:27:05,519 INFO L290 TraceCheckUtils]: 55: Hoare triple {27564#false} call write~int(8544, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {27564#false} is VALID [2022-04-08 15:27:05,519 INFO L290 TraceCheckUtils]: 56: Hoare triple {27564#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {27564#false} is VALID [2022-04-08 15:27:05,519 INFO L290 TraceCheckUtils]: 57: Hoare triple {27564#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {27564#false} is VALID [2022-04-08 15:27:05,519 INFO L290 TraceCheckUtils]: 58: Hoare triple {27564#false} ~skip~0 := 0; {27564#false} is VALID [2022-04-08 15:27:05,519 INFO L290 TraceCheckUtils]: 59: Hoare triple {27564#false} assume !false; {27564#false} is VALID [2022-04-08 15:27:05,519 INFO L290 TraceCheckUtils]: 60: Hoare triple {27564#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {27564#false} is VALID [2022-04-08 15:27:05,519 INFO L290 TraceCheckUtils]: 61: Hoare triple {27564#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {27564#false} is VALID [2022-04-08 15:27:05,519 INFO L290 TraceCheckUtils]: 62: Hoare triple {27564#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {27564#false} is VALID [2022-04-08 15:27:05,519 INFO L290 TraceCheckUtils]: 63: Hoare triple {27564#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {27564#false} is VALID [2022-04-08 15:27:05,520 INFO L290 TraceCheckUtils]: 64: Hoare triple {27564#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {27564#false} is VALID [2022-04-08 15:27:05,520 INFO L290 TraceCheckUtils]: 65: Hoare triple {27564#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {27564#false} is VALID [2022-04-08 15:27:05,520 INFO L290 TraceCheckUtils]: 66: Hoare triple {27564#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {27564#false} is VALID [2022-04-08 15:27:05,520 INFO L290 TraceCheckUtils]: 67: Hoare triple {27564#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {27564#false} is VALID [2022-04-08 15:27:05,520 INFO L290 TraceCheckUtils]: 68: Hoare triple {27564#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {27564#false} is VALID [2022-04-08 15:27:05,520 INFO L290 TraceCheckUtils]: 69: Hoare triple {27564#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {27564#false} is VALID [2022-04-08 15:27:05,520 INFO L290 TraceCheckUtils]: 70: Hoare triple {27564#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {27564#false} is VALID [2022-04-08 15:27:05,520 INFO L290 TraceCheckUtils]: 71: Hoare triple {27564#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {27564#false} is VALID [2022-04-08 15:27:05,520 INFO L290 TraceCheckUtils]: 72: Hoare triple {27564#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {27564#false} is VALID [2022-04-08 15:27:05,520 INFO L290 TraceCheckUtils]: 73: Hoare triple {27564#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {27564#false} is VALID [2022-04-08 15:27:05,520 INFO L290 TraceCheckUtils]: 74: Hoare triple {27564#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {27564#false} is VALID [2022-04-08 15:27:05,520 INFO L290 TraceCheckUtils]: 75: Hoare triple {27564#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {27564#false} is VALID [2022-04-08 15:27:05,521 INFO L290 TraceCheckUtils]: 76: Hoare triple {27564#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {27564#false} is VALID [2022-04-08 15:27:05,521 INFO L290 TraceCheckUtils]: 77: Hoare triple {27564#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {27564#false} is VALID [2022-04-08 15:27:05,521 INFO L290 TraceCheckUtils]: 78: Hoare triple {27564#false} assume 8544 == #t~mem64;havoc #t~mem64; {27564#false} is VALID [2022-04-08 15:27:05,521 INFO L290 TraceCheckUtils]: 79: Hoare triple {27564#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {27564#false} is VALID [2022-04-08 15:27:05,521 INFO L290 TraceCheckUtils]: 80: Hoare triple {27564#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {27564#false} is VALID [2022-04-08 15:27:05,521 INFO L290 TraceCheckUtils]: 81: Hoare triple {27564#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {27564#false} is VALID [2022-04-08 15:27:05,521 INFO L290 TraceCheckUtils]: 82: Hoare triple {27564#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {27564#false} is VALID [2022-04-08 15:27:05,521 INFO L290 TraceCheckUtils]: 83: Hoare triple {27564#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {27564#false} is VALID [2022-04-08 15:27:05,521 INFO L290 TraceCheckUtils]: 84: Hoare triple {27564#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {27564#false} is VALID [2022-04-08 15:27:05,521 INFO L290 TraceCheckUtils]: 85: Hoare triple {27564#false} assume 7 == ~blastFlag~0; {27564#false} is VALID [2022-04-08 15:27:05,521 INFO L290 TraceCheckUtils]: 86: Hoare triple {27564#false} assume !false; {27564#false} is VALID [2022-04-08 15:27:05,522 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 15:27:05,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:27:05,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058684673] [2022-04-08 15:27:05,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058684673] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:27:05,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:27:05,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:27:05,522 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:27:05,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [672395666] [2022-04-08 15:27:05,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [672395666] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:27:05,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:27:05,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:27:05,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223081002] [2022-04-08 15:27:05,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:27:05,523 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 87 [2022-04-08 15:27:05,524 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:27:05,524 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:27:05,598 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:27:05,598 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:27:05,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:27:05,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:27:05,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:27:05,599 INFO L87 Difference]: Start difference. First operand 261 states and 408 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:27:10,938 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:27:16,220 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-08 15:27:17,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:27:17,436 INFO L93 Difference]: Finished difference Result 614 states and 963 transitions. [2022-04-08 15:27:17,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:27:17,436 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 87 [2022-04-08 15:27:17,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:27:17,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:27:17,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 590 transitions. [2022-04-08 15:27:17,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:27:17,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 590 transitions. [2022-04-08 15:27:17,441 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 590 transitions. [2022-04-08 15:27:17,837 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 590 edges. 590 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:27:17,843 INFO L225 Difference]: With dead ends: 614 [2022-04-08 15:27:17,843 INFO L226 Difference]: Without dead ends: 379 [2022-04-08 15:27:17,843 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 15:27:17,844 INFO L913 BasicCegarLoop]: 129 mSDtfsCounter, 132 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-04-08 15:27:17,844 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 366 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2022-04-08 15:27:17,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2022-04-08 15:27:17,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 287. [2022-04-08 15:27:17,862 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:27:17,863 INFO L82 GeneralOperation]: Start isEquivalent. First operand 379 states. Second operand has 287 states, 282 states have (on average 1.574468085106383) internal successors, (444), 282 states have internal predecessors, (444), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:27:17,863 INFO L74 IsIncluded]: Start isIncluded. First operand 379 states. Second operand has 287 states, 282 states have (on average 1.574468085106383) internal successors, (444), 282 states have internal predecessors, (444), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:27:17,863 INFO L87 Difference]: Start difference. First operand 379 states. Second operand has 287 states, 282 states have (on average 1.574468085106383) internal successors, (444), 282 states have internal predecessors, (444), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:27:17,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:27:17,872 INFO L93 Difference]: Finished difference Result 379 states and 582 transitions. [2022-04-08 15:27:17,872 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 582 transitions. [2022-04-08 15:27:17,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:27:17,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:27:17,873 INFO L74 IsIncluded]: Start isIncluded. First operand has 287 states, 282 states have (on average 1.574468085106383) internal successors, (444), 282 states have internal predecessors, (444), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 379 states. [2022-04-08 15:27:17,873 INFO L87 Difference]: Start difference. First operand has 287 states, 282 states have (on average 1.574468085106383) internal successors, (444), 282 states have internal predecessors, (444), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 379 states. [2022-04-08 15:27:17,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:27:17,881 INFO L93 Difference]: Finished difference Result 379 states and 582 transitions. [2022-04-08 15:27:17,881 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 582 transitions. [2022-04-08 15:27:17,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:27:17,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:27:17,882 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:27:17,882 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:27:17,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 282 states have (on average 1.574468085106383) internal successors, (444), 282 states have internal predecessors, (444), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:27:17,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 448 transitions. [2022-04-08 15:27:17,889 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 448 transitions. Word has length 87 [2022-04-08 15:27:17,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:27:17,889 INFO L478 AbstractCegarLoop]: Abstraction has 287 states and 448 transitions. [2022-04-08 15:27:17,889 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:27:17,889 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 287 states and 448 transitions. [2022-04-08 15:27:18,250 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 448 edges. 448 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:27:18,251 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 448 transitions. [2022-04-08 15:27:18,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-04-08 15:27:18,252 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:27:18,252 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:27:18,252 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-08 15:27:18,252 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:27:18,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:27:18,253 INFO L85 PathProgramCache]: Analyzing trace with hash 684844099, now seen corresponding path program 1 times [2022-04-08 15:27:18,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:27:18,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1226532017] [2022-04-08 15:27:18,302 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:27:18,302 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:27:18,303 INFO L85 PathProgramCache]: Analyzing trace with hash 684844099, now seen corresponding path program 2 times [2022-04-08 15:27:18,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:27:18,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163619255] [2022-04-08 15:27:18,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:27:18,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:27:18,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:27:18,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:27:18,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:27:18,424 INFO L290 TraceCheckUtils]: 0: Hoare triple {30142#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {30135#true} is VALID [2022-04-08 15:27:18,424 INFO L290 TraceCheckUtils]: 1: Hoare triple {30135#true} assume true; {30135#true} is VALID [2022-04-08 15:27:18,424 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30135#true} {30135#true} #690#return; {30135#true} is VALID [2022-04-08 15:27:18,425 INFO L272 TraceCheckUtils]: 0: Hoare triple {30135#true} call ULTIMATE.init(); {30142#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:27:18,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {30142#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {30135#true} is VALID [2022-04-08 15:27:18,425 INFO L290 TraceCheckUtils]: 2: Hoare triple {30135#true} assume true; {30135#true} is VALID [2022-04-08 15:27:18,425 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30135#true} {30135#true} #690#return; {30135#true} is VALID [2022-04-08 15:27:18,426 INFO L272 TraceCheckUtils]: 4: Hoare triple {30135#true} call #t~ret161 := main(); {30135#true} is VALID [2022-04-08 15:27:18,426 INFO L290 TraceCheckUtils]: 5: Hoare triple {30135#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {30135#true} is VALID [2022-04-08 15:27:18,426 INFO L290 TraceCheckUtils]: 6: Hoare triple {30135#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {30135#true} is VALID [2022-04-08 15:27:18,426 INFO L272 TraceCheckUtils]: 7: Hoare triple {30135#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {30135#true} is VALID [2022-04-08 15:27:18,426 INFO L290 TraceCheckUtils]: 8: Hoare triple {30135#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {30135#true} is VALID [2022-04-08 15:27:18,426 INFO L290 TraceCheckUtils]: 9: Hoare triple {30135#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {30135#true} is VALID [2022-04-08 15:27:18,426 INFO L290 TraceCheckUtils]: 10: Hoare triple {30135#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {30135#true} is VALID [2022-04-08 15:27:18,426 INFO L290 TraceCheckUtils]: 11: Hoare triple {30135#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {30135#true} is VALID [2022-04-08 15:27:18,426 INFO L290 TraceCheckUtils]: 12: Hoare triple {30135#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {30135#true} is VALID [2022-04-08 15:27:18,426 INFO L290 TraceCheckUtils]: 13: Hoare triple {30135#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {30135#true} is VALID [2022-04-08 15:27:18,426 INFO L290 TraceCheckUtils]: 14: Hoare triple {30135#true} assume !false; {30135#true} is VALID [2022-04-08 15:27:18,426 INFO L290 TraceCheckUtils]: 15: Hoare triple {30135#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {30135#true} is VALID [2022-04-08 15:27:18,427 INFO L290 TraceCheckUtils]: 16: Hoare triple {30135#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {30135#true} is VALID [2022-04-08 15:27:18,427 INFO L290 TraceCheckUtils]: 17: Hoare triple {30135#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {30135#true} is VALID [2022-04-08 15:27:18,427 INFO L290 TraceCheckUtils]: 18: Hoare triple {30135#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {30135#true} is VALID [2022-04-08 15:27:18,427 INFO L290 TraceCheckUtils]: 19: Hoare triple {30135#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {30135#true} is VALID [2022-04-08 15:27:18,427 INFO L290 TraceCheckUtils]: 20: Hoare triple {30135#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {30135#true} is VALID [2022-04-08 15:27:18,427 INFO L290 TraceCheckUtils]: 21: Hoare triple {30135#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {30135#true} is VALID [2022-04-08 15:27:18,427 INFO L290 TraceCheckUtils]: 22: Hoare triple {30135#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {30135#true} is VALID [2022-04-08 15:27:18,427 INFO L290 TraceCheckUtils]: 23: Hoare triple {30135#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {30135#true} is VALID [2022-04-08 15:27:18,427 INFO L290 TraceCheckUtils]: 24: Hoare triple {30135#true} assume 8464 == #t~mem55;havoc #t~mem55; {30135#true} is VALID [2022-04-08 15:27:18,427 INFO L290 TraceCheckUtils]: 25: Hoare triple {30135#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {30135#true} is VALID [2022-04-08 15:27:18,427 INFO L290 TraceCheckUtils]: 26: Hoare triple {30135#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {30135#true} is VALID [2022-04-08 15:27:18,428 INFO L290 TraceCheckUtils]: 27: Hoare triple {30135#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-08 15:27:18,429 INFO L290 TraceCheckUtils]: 28: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-08 15:27:18,429 INFO L290 TraceCheckUtils]: 29: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-08 15:27:18,430 INFO L290 TraceCheckUtils]: 30: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} ~skip~0 := 0; {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-08 15:27:18,430 INFO L290 TraceCheckUtils]: 31: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !false; {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-08 15:27:18,430 INFO L290 TraceCheckUtils]: 32: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-08 15:27:18,431 INFO L290 TraceCheckUtils]: 33: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-08 15:27:18,431 INFO L290 TraceCheckUtils]: 34: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-08 15:27:18,432 INFO L290 TraceCheckUtils]: 35: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-08 15:27:18,432 INFO L290 TraceCheckUtils]: 36: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-08 15:27:18,433 INFO L290 TraceCheckUtils]: 37: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-08 15:27:18,433 INFO L290 TraceCheckUtils]: 38: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-08 15:27:18,433 INFO L290 TraceCheckUtils]: 39: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-08 15:27:18,434 INFO L290 TraceCheckUtils]: 40: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-08 15:27:18,434 INFO L290 TraceCheckUtils]: 41: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-08 15:27:18,435 INFO L290 TraceCheckUtils]: 42: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-08 15:27:18,435 INFO L290 TraceCheckUtils]: 43: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-08 15:27:18,435 INFO L290 TraceCheckUtils]: 44: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-08 15:27:18,436 INFO L290 TraceCheckUtils]: 45: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-08 15:27:18,436 INFO L290 TraceCheckUtils]: 46: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-08 15:27:18,437 INFO L290 TraceCheckUtils]: 47: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-08 15:27:18,437 INFO L290 TraceCheckUtils]: 48: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {30141#(not (= |ssl3_accept_#t~mem63| 8529))} is VALID [2022-04-08 15:27:18,437 INFO L290 TraceCheckUtils]: 49: Hoare triple {30141#(not (= |ssl3_accept_#t~mem63| 8529))} assume 8529 == #t~mem63;havoc #t~mem63; {30136#false} is VALID [2022-04-08 15:27:18,438 INFO L290 TraceCheckUtils]: 50: Hoare triple {30136#false} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 888 + #t~mem99.offset, 8);call #t~mem101 := read~int(#t~mem100.base, 20 + #t~mem100.offset, 8);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 332 + ~s.offset, 8); {30136#false} is VALID [2022-04-08 15:27:18,438 INFO L290 TraceCheckUtils]: 51: Hoare triple {30136#false} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 18446744073709551616;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem103.base, 935 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {30136#false} is VALID [2022-04-08 15:27:18,438 INFO L290 TraceCheckUtils]: 52: Hoare triple {30136#false} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem106 := read~int(#t~mem105.base, 935 + #t~mem105.offset, 4); {30136#false} is VALID [2022-04-08 15:27:18,438 INFO L290 TraceCheckUtils]: 53: Hoare triple {30136#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {30136#false} is VALID [2022-04-08 15:27:18,438 INFO L290 TraceCheckUtils]: 54: Hoare triple {30136#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 18446744073709551616); {30136#false} is VALID [2022-04-08 15:27:18,438 INFO L290 TraceCheckUtils]: 55: Hoare triple {30136#false} assume !(0 != ~l~0 % 18446744073709551616);~skip~0 := 1; {30136#false} is VALID [2022-04-08 15:27:18,438 INFO L290 TraceCheckUtils]: 56: Hoare triple {30136#false} call write~int(8544, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {30136#false} is VALID [2022-04-08 15:27:18,438 INFO L290 TraceCheckUtils]: 57: Hoare triple {30136#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {30136#false} is VALID [2022-04-08 15:27:18,438 INFO L290 TraceCheckUtils]: 58: Hoare triple {30136#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {30136#false} is VALID [2022-04-08 15:27:18,438 INFO L290 TraceCheckUtils]: 59: Hoare triple {30136#false} ~skip~0 := 0; {30136#false} is VALID [2022-04-08 15:27:18,438 INFO L290 TraceCheckUtils]: 60: Hoare triple {30136#false} assume !false; {30136#false} is VALID [2022-04-08 15:27:18,438 INFO L290 TraceCheckUtils]: 61: Hoare triple {30136#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {30136#false} is VALID [2022-04-08 15:27:18,439 INFO L290 TraceCheckUtils]: 62: Hoare triple {30136#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {30136#false} is VALID [2022-04-08 15:27:18,439 INFO L290 TraceCheckUtils]: 63: Hoare triple {30136#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {30136#false} is VALID [2022-04-08 15:27:18,439 INFO L290 TraceCheckUtils]: 64: Hoare triple {30136#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {30136#false} is VALID [2022-04-08 15:27:18,439 INFO L290 TraceCheckUtils]: 65: Hoare triple {30136#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {30136#false} is VALID [2022-04-08 15:27:18,439 INFO L290 TraceCheckUtils]: 66: Hoare triple {30136#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {30136#false} is VALID [2022-04-08 15:27:18,439 INFO L290 TraceCheckUtils]: 67: Hoare triple {30136#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {30136#false} is VALID [2022-04-08 15:27:18,439 INFO L290 TraceCheckUtils]: 68: Hoare triple {30136#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {30136#false} is VALID [2022-04-08 15:27:18,439 INFO L290 TraceCheckUtils]: 69: Hoare triple {30136#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {30136#false} is VALID [2022-04-08 15:27:18,439 INFO L290 TraceCheckUtils]: 70: Hoare triple {30136#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {30136#false} is VALID [2022-04-08 15:27:18,439 INFO L290 TraceCheckUtils]: 71: Hoare triple {30136#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {30136#false} is VALID [2022-04-08 15:27:18,439 INFO L290 TraceCheckUtils]: 72: Hoare triple {30136#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {30136#false} is VALID [2022-04-08 15:27:18,439 INFO L290 TraceCheckUtils]: 73: Hoare triple {30136#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {30136#false} is VALID [2022-04-08 15:27:18,440 INFO L290 TraceCheckUtils]: 74: Hoare triple {30136#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {30136#false} is VALID [2022-04-08 15:27:18,440 INFO L290 TraceCheckUtils]: 75: Hoare triple {30136#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {30136#false} is VALID [2022-04-08 15:27:18,440 INFO L290 TraceCheckUtils]: 76: Hoare triple {30136#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {30136#false} is VALID [2022-04-08 15:27:18,440 INFO L290 TraceCheckUtils]: 77: Hoare triple {30136#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {30136#false} is VALID [2022-04-08 15:27:18,440 INFO L290 TraceCheckUtils]: 78: Hoare triple {30136#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {30136#false} is VALID [2022-04-08 15:27:18,440 INFO L290 TraceCheckUtils]: 79: Hoare triple {30136#false} assume 8544 == #t~mem64;havoc #t~mem64; {30136#false} is VALID [2022-04-08 15:27:18,440 INFO L290 TraceCheckUtils]: 80: Hoare triple {30136#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {30136#false} is VALID [2022-04-08 15:27:18,440 INFO L290 TraceCheckUtils]: 81: Hoare triple {30136#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {30136#false} is VALID [2022-04-08 15:27:18,440 INFO L290 TraceCheckUtils]: 82: Hoare triple {30136#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {30136#false} is VALID [2022-04-08 15:27:18,440 INFO L290 TraceCheckUtils]: 83: Hoare triple {30136#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {30136#false} is VALID [2022-04-08 15:27:18,440 INFO L290 TraceCheckUtils]: 84: Hoare triple {30136#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {30136#false} is VALID [2022-04-08 15:27:18,440 INFO L290 TraceCheckUtils]: 85: Hoare triple {30136#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {30136#false} is VALID [2022-04-08 15:27:18,441 INFO L290 TraceCheckUtils]: 86: Hoare triple {30136#false} assume 7 == ~blastFlag~0; {30136#false} is VALID [2022-04-08 15:27:18,441 INFO L290 TraceCheckUtils]: 87: Hoare triple {30136#false} assume !false; {30136#false} is VALID [2022-04-08 15:27:18,441 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 15:27:18,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:27:18,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163619255] [2022-04-08 15:27:18,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163619255] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:27:18,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:27:18,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:27:18,442 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:27:18,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1226532017] [2022-04-08 15:27:18,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1226532017] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:27:18,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:27:18,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:27:18,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119164511] [2022-04-08 15:27:18,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:27:18,443 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 88 [2022-04-08 15:27:18,443 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:27:18,443 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:27:18,527 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:27:18,527 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:27:18,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:27:18,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:27:18,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:27:18,528 INFO L87 Difference]: Start difference. First operand 287 states and 448 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:27:21,772 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-08 15:27:24,892 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:27:26,897 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:27:28,903 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:27:30,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:27:30,127 INFO L93 Difference]: Finished difference Result 626 states and 976 transitions. [2022-04-08 15:27:30,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:27:30,127 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 88 [2022-04-08 15:27:30,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:27:30,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:27:30,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 590 transitions. [2022-04-08 15:27:30,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:27:30,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 590 transitions. [2022-04-08 15:27:30,140 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 590 transitions. [2022-04-08 15:27:30,531 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 590 edges. 590 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:27:30,539 INFO L225 Difference]: With dead ends: 626 [2022-04-08 15:27:30,539 INFO L226 Difference]: Without dead ends: 365 [2022-04-08 15:27:30,540 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 15:27:30,540 INFO L913 BasicCegarLoop]: 147 mSDtfsCounter, 131 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 57 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2022-04-08 15:27:30,541 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 402 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 503 Invalid, 1 Unknown, 0 Unchecked, 7.6s Time] [2022-04-08 15:27:30,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2022-04-08 15:27:30,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 287. [2022-04-08 15:27:30,555 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:27:30,556 INFO L82 GeneralOperation]: Start isEquivalent. First operand 365 states. Second operand has 287 states, 282 states have (on average 1.5638297872340425) internal successors, (441), 282 states have internal predecessors, (441), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:27:30,556 INFO L74 IsIncluded]: Start isIncluded. First operand 365 states. Second operand has 287 states, 282 states have (on average 1.5638297872340425) internal successors, (441), 282 states have internal predecessors, (441), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:27:30,557 INFO L87 Difference]: Start difference. First operand 365 states. Second operand has 287 states, 282 states have (on average 1.5638297872340425) internal successors, (441), 282 states have internal predecessors, (441), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:27:30,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:27:30,564 INFO L93 Difference]: Finished difference Result 365 states and 555 transitions. [2022-04-08 15:27:30,564 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 555 transitions. [2022-04-08 15:27:30,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:27:30,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:27:30,565 INFO L74 IsIncluded]: Start isIncluded. First operand has 287 states, 282 states have (on average 1.5638297872340425) internal successors, (441), 282 states have internal predecessors, (441), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 365 states. [2022-04-08 15:27:30,566 INFO L87 Difference]: Start difference. First operand has 287 states, 282 states have (on average 1.5638297872340425) internal successors, (441), 282 states have internal predecessors, (441), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 365 states. [2022-04-08 15:27:30,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:27:30,573 INFO L93 Difference]: Finished difference Result 365 states and 555 transitions. [2022-04-08 15:27:30,573 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 555 transitions. [2022-04-08 15:27:30,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:27:30,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:27:30,574 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:27:30,574 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:27:30,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 282 states have (on average 1.5638297872340425) internal successors, (441), 282 states have internal predecessors, (441), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:27:30,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 445 transitions. [2022-04-08 15:27:30,581 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 445 transitions. Word has length 88 [2022-04-08 15:27:30,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:27:30,581 INFO L478 AbstractCegarLoop]: Abstraction has 287 states and 445 transitions. [2022-04-08 15:27:30,581 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:27:30,581 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 287 states and 445 transitions. [2022-04-08 15:27:30,933 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 445 edges. 445 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:27:30,933 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 445 transitions. [2022-04-08 15:27:30,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-04-08 15:27:30,934 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:27:30,934 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:27:30,934 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-08 15:27:30,934 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:27:30,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:27:30,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1964115669, now seen corresponding path program 1 times [2022-04-08 15:27:30,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:27:30,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [93833118] [2022-04-08 15:27:30,990 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:27:30,991 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:27:30,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1964115669, now seen corresponding path program 2 times [2022-04-08 15:27:30,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:27:30,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673765267] [2022-04-08 15:27:30,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:27:30,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:27:31,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:27:31,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:27:31,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:27:31,150 INFO L290 TraceCheckUtils]: 0: Hoare triple {32710#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {32703#true} is VALID [2022-04-08 15:27:31,150 INFO L290 TraceCheckUtils]: 1: Hoare triple {32703#true} assume true; {32703#true} is VALID [2022-04-08 15:27:31,150 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32703#true} {32703#true} #690#return; {32703#true} is VALID [2022-04-08 15:27:31,151 INFO L272 TraceCheckUtils]: 0: Hoare triple {32703#true} call ULTIMATE.init(); {32710#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:27:31,151 INFO L290 TraceCheckUtils]: 1: Hoare triple {32710#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {32703#true} is VALID [2022-04-08 15:27:31,151 INFO L290 TraceCheckUtils]: 2: Hoare triple {32703#true} assume true; {32703#true} is VALID [2022-04-08 15:27:31,151 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32703#true} {32703#true} #690#return; {32703#true} is VALID [2022-04-08 15:27:31,151 INFO L272 TraceCheckUtils]: 4: Hoare triple {32703#true} call #t~ret161 := main(); {32703#true} is VALID [2022-04-08 15:27:31,151 INFO L290 TraceCheckUtils]: 5: Hoare triple {32703#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {32703#true} is VALID [2022-04-08 15:27:31,152 INFO L290 TraceCheckUtils]: 6: Hoare triple {32703#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {32703#true} is VALID [2022-04-08 15:27:31,152 INFO L272 TraceCheckUtils]: 7: Hoare triple {32703#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {32703#true} is VALID [2022-04-08 15:27:31,152 INFO L290 TraceCheckUtils]: 8: Hoare triple {32703#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {32703#true} is VALID [2022-04-08 15:27:31,152 INFO L290 TraceCheckUtils]: 9: Hoare triple {32703#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {32703#true} is VALID [2022-04-08 15:27:31,152 INFO L290 TraceCheckUtils]: 10: Hoare triple {32703#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {32703#true} is VALID [2022-04-08 15:27:31,152 INFO L290 TraceCheckUtils]: 11: Hoare triple {32703#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {32703#true} is VALID [2022-04-08 15:27:31,152 INFO L290 TraceCheckUtils]: 12: Hoare triple {32703#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {32703#true} is VALID [2022-04-08 15:27:31,152 INFO L290 TraceCheckUtils]: 13: Hoare triple {32703#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {32703#true} is VALID [2022-04-08 15:27:31,152 INFO L290 TraceCheckUtils]: 14: Hoare triple {32703#true} assume !false; {32703#true} is VALID [2022-04-08 15:27:31,152 INFO L290 TraceCheckUtils]: 15: Hoare triple {32703#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {32703#true} is VALID [2022-04-08 15:27:31,152 INFO L290 TraceCheckUtils]: 16: Hoare triple {32703#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {32703#true} is VALID [2022-04-08 15:27:31,152 INFO L290 TraceCheckUtils]: 17: Hoare triple {32703#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {32703#true} is VALID [2022-04-08 15:27:31,152 INFO L290 TraceCheckUtils]: 18: Hoare triple {32703#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {32703#true} is VALID [2022-04-08 15:27:31,153 INFO L290 TraceCheckUtils]: 19: Hoare triple {32703#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {32703#true} is VALID [2022-04-08 15:27:31,153 INFO L290 TraceCheckUtils]: 20: Hoare triple {32703#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {32703#true} is VALID [2022-04-08 15:27:31,153 INFO L290 TraceCheckUtils]: 21: Hoare triple {32703#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {32703#true} is VALID [2022-04-08 15:27:31,153 INFO L290 TraceCheckUtils]: 22: Hoare triple {32703#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {32703#true} is VALID [2022-04-08 15:27:31,153 INFO L290 TraceCheckUtils]: 23: Hoare triple {32703#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {32703#true} is VALID [2022-04-08 15:27:31,153 INFO L290 TraceCheckUtils]: 24: Hoare triple {32703#true} assume 8464 == #t~mem55;havoc #t~mem55; {32703#true} is VALID [2022-04-08 15:27:31,153 INFO L290 TraceCheckUtils]: 25: Hoare triple {32703#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {32703#true} is VALID [2022-04-08 15:27:31,153 INFO L290 TraceCheckUtils]: 26: Hoare triple {32703#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {32703#true} is VALID [2022-04-08 15:27:31,154 INFO L290 TraceCheckUtils]: 27: Hoare triple {32703#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:27:31,154 INFO L290 TraceCheckUtils]: 28: Hoare triple {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:27:31,155 INFO L290 TraceCheckUtils]: 29: Hoare triple {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:27:31,155 INFO L290 TraceCheckUtils]: 30: Hoare triple {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:27:31,156 INFO L290 TraceCheckUtils]: 31: Hoare triple {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:27:31,156 INFO L290 TraceCheckUtils]: 32: Hoare triple {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:27:31,156 INFO L290 TraceCheckUtils]: 33: Hoare triple {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:27:31,157 INFO L290 TraceCheckUtils]: 34: Hoare triple {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:27:31,157 INFO L290 TraceCheckUtils]: 35: Hoare triple {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:27:31,158 INFO L290 TraceCheckUtils]: 36: Hoare triple {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:27:31,158 INFO L290 TraceCheckUtils]: 37: Hoare triple {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:27:31,159 INFO L290 TraceCheckUtils]: 38: Hoare triple {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:27:31,159 INFO L290 TraceCheckUtils]: 39: Hoare triple {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:27:31,159 INFO L290 TraceCheckUtils]: 40: Hoare triple {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:27:31,160 INFO L290 TraceCheckUtils]: 41: Hoare triple {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:27:31,160 INFO L290 TraceCheckUtils]: 42: Hoare triple {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:27:31,161 INFO L290 TraceCheckUtils]: 43: Hoare triple {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {32709#(= |ssl3_accept_#t~mem58| 8496)} is VALID [2022-04-08 15:27:31,161 INFO L290 TraceCheckUtils]: 44: Hoare triple {32709#(= |ssl3_accept_#t~mem58| 8496)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-08 15:27:31,161 INFO L290 TraceCheckUtils]: 45: Hoare triple {32704#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-08 15:27:31,161 INFO L290 TraceCheckUtils]: 46: Hoare triple {32704#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-08 15:27:31,161 INFO L290 TraceCheckUtils]: 47: Hoare triple {32704#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-08 15:27:31,161 INFO L290 TraceCheckUtils]: 48: Hoare triple {32704#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-08 15:27:31,161 INFO L290 TraceCheckUtils]: 49: Hoare triple {32704#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-08 15:27:31,161 INFO L290 TraceCheckUtils]: 50: Hoare triple {32704#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-08 15:27:31,161 INFO L290 TraceCheckUtils]: 51: Hoare triple {32704#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-08 15:27:31,162 INFO L290 TraceCheckUtils]: 52: Hoare triple {32704#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-08 15:27:31,162 INFO L290 TraceCheckUtils]: 53: Hoare triple {32704#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-08 15:27:31,162 INFO L290 TraceCheckUtils]: 54: Hoare triple {32704#false} assume 8448 == #t~mem68;havoc #t~mem68; {32704#false} is VALID [2022-04-08 15:27:31,162 INFO L290 TraceCheckUtils]: 55: Hoare triple {32704#false} assume !(~num1~0 > 0); {32704#false} is VALID [2022-04-08 15:27:31,162 INFO L290 TraceCheckUtils]: 56: Hoare triple {32704#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem133 := read~int(#t~mem132.base, 904 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 72 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {32704#false} is VALID [2022-04-08 15:27:31,162 INFO L290 TraceCheckUtils]: 57: Hoare triple {32704#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {32704#false} is VALID [2022-04-08 15:27:31,162 INFO L290 TraceCheckUtils]: 58: Hoare triple {32704#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {32704#false} is VALID [2022-04-08 15:27:31,162 INFO L290 TraceCheckUtils]: 59: Hoare triple {32704#false} ~skip~0 := 0; {32704#false} is VALID [2022-04-08 15:27:31,162 INFO L290 TraceCheckUtils]: 60: Hoare triple {32704#false} assume !false; {32704#false} is VALID [2022-04-08 15:27:31,162 INFO L290 TraceCheckUtils]: 61: Hoare triple {32704#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-08 15:27:31,162 INFO L290 TraceCheckUtils]: 62: Hoare triple {32704#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-08 15:27:31,163 INFO L290 TraceCheckUtils]: 63: Hoare triple {32704#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-08 15:27:31,163 INFO L290 TraceCheckUtils]: 64: Hoare triple {32704#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-08 15:27:31,163 INFO L290 TraceCheckUtils]: 65: Hoare triple {32704#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-08 15:27:31,163 INFO L290 TraceCheckUtils]: 66: Hoare triple {32704#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-08 15:27:31,163 INFO L290 TraceCheckUtils]: 67: Hoare triple {32704#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-08 15:27:31,163 INFO L290 TraceCheckUtils]: 68: Hoare triple {32704#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-08 15:27:31,163 INFO L290 TraceCheckUtils]: 69: Hoare triple {32704#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-08 15:27:31,163 INFO L290 TraceCheckUtils]: 70: Hoare triple {32704#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-08 15:27:31,163 INFO L290 TraceCheckUtils]: 71: Hoare triple {32704#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-08 15:27:31,163 INFO L290 TraceCheckUtils]: 72: Hoare triple {32704#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-08 15:27:31,163 INFO L290 TraceCheckUtils]: 73: Hoare triple {32704#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-08 15:27:31,163 INFO L290 TraceCheckUtils]: 74: Hoare triple {32704#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-08 15:27:31,163 INFO L290 TraceCheckUtils]: 75: Hoare triple {32704#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-08 15:27:31,164 INFO L290 TraceCheckUtils]: 76: Hoare triple {32704#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-08 15:27:31,164 INFO L290 TraceCheckUtils]: 77: Hoare triple {32704#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-08 15:27:31,164 INFO L290 TraceCheckUtils]: 78: Hoare triple {32704#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-08 15:27:31,164 INFO L290 TraceCheckUtils]: 79: Hoare triple {32704#false} assume 8544 == #t~mem64;havoc #t~mem64; {32704#false} is VALID [2022-04-08 15:27:31,164 INFO L290 TraceCheckUtils]: 80: Hoare triple {32704#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {32704#false} is VALID [2022-04-08 15:27:31,164 INFO L290 TraceCheckUtils]: 81: Hoare triple {32704#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {32704#false} is VALID [2022-04-08 15:27:31,164 INFO L290 TraceCheckUtils]: 82: Hoare triple {32704#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {32704#false} is VALID [2022-04-08 15:27:31,164 INFO L290 TraceCheckUtils]: 83: Hoare triple {32704#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {32704#false} is VALID [2022-04-08 15:27:31,164 INFO L290 TraceCheckUtils]: 84: Hoare triple {32704#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {32704#false} is VALID [2022-04-08 15:27:31,164 INFO L290 TraceCheckUtils]: 85: Hoare triple {32704#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {32704#false} is VALID [2022-04-08 15:27:31,164 INFO L290 TraceCheckUtils]: 86: Hoare triple {32704#false} assume 7 == ~blastFlag~0; {32704#false} is VALID [2022-04-08 15:27:31,164 INFO L290 TraceCheckUtils]: 87: Hoare triple {32704#false} assume !false; {32704#false} is VALID [2022-04-08 15:27:31,165 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 15:27:31,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:27:31,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673765267] [2022-04-08 15:27:31,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673765267] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:27:31,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:27:31,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:27:31,167 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:27:31,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [93833118] [2022-04-08 15:27:31,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [93833118] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:27:31,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:27:31,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:27:31,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446121419] [2022-04-08 15:27:31,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:27:31,168 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 88 [2022-04-08 15:27:31,168 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:27:31,168 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:27:31,228 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:27:31,228 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:27:31,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:27:31,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:27:31,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:27:31,229 INFO L87 Difference]: Start difference. First operand 287 states and 445 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:27:33,257 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:27:34,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:27:34,320 INFO L93 Difference]: Finished difference Result 590 states and 921 transitions. [2022-04-08 15:27:34,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:27:34,320 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 88 [2022-04-08 15:27:34,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:27:34,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:27:34,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 472 transitions. [2022-04-08 15:27:34,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:27:34,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 472 transitions. [2022-04-08 15:27:34,324 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 472 transitions. [2022-04-08 15:27:34,635 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 472 edges. 472 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:27:34,639 INFO L225 Difference]: With dead ends: 590 [2022-04-08 15:27:34,639 INFO L226 Difference]: Without dead ends: 329 [2022-04-08 15:27:34,640 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 15:27:34,640 INFO L913 BasicCegarLoop]: 195 mSDtfsCounter, 30 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-08 15:27:34,641 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 505 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 392 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 15:27:34,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-04-08 15:27:34,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 309. [2022-04-08 15:27:34,657 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:27:34,657 INFO L82 GeneralOperation]: Start isEquivalent. First operand 329 states. Second operand has 309 states, 304 states have (on average 1.5625) internal successors, (475), 304 states have internal predecessors, (475), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:27:34,658 INFO L74 IsIncluded]: Start isIncluded. First operand 329 states. Second operand has 309 states, 304 states have (on average 1.5625) internal successors, (475), 304 states have internal predecessors, (475), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:27:34,658 INFO L87 Difference]: Start difference. First operand 329 states. Second operand has 309 states, 304 states have (on average 1.5625) internal successors, (475), 304 states have internal predecessors, (475), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:27:34,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:27:34,664 INFO L93 Difference]: Finished difference Result 329 states and 505 transitions. [2022-04-08 15:27:34,664 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 505 transitions. [2022-04-08 15:27:34,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:27:34,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:27:34,666 INFO L74 IsIncluded]: Start isIncluded. First operand has 309 states, 304 states have (on average 1.5625) internal successors, (475), 304 states have internal predecessors, (475), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 329 states. [2022-04-08 15:27:34,666 INFO L87 Difference]: Start difference. First operand has 309 states, 304 states have (on average 1.5625) internal successors, (475), 304 states have internal predecessors, (475), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 329 states. [2022-04-08 15:27:34,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:27:34,672 INFO L93 Difference]: Finished difference Result 329 states and 505 transitions. [2022-04-08 15:27:34,672 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 505 transitions. [2022-04-08 15:27:34,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:27:34,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:27:34,673 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:27:34,673 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:27:34,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 304 states have (on average 1.5625) internal successors, (475), 304 states have internal predecessors, (475), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:27:34,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 479 transitions. [2022-04-08 15:27:34,681 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 479 transitions. Word has length 88 [2022-04-08 15:27:34,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:27:34,681 INFO L478 AbstractCegarLoop]: Abstraction has 309 states and 479 transitions. [2022-04-08 15:27:34,681 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:27:34,682 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 309 states and 479 transitions. [2022-04-08 15:27:35,073 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 479 edges. 479 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:27:35,073 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 479 transitions. [2022-04-08 15:27:35,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-08 15:27:35,074 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:27:35,074 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:27:35,074 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-08 15:27:35,074 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:27:35,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:27:35,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1847172772, now seen corresponding path program 1 times [2022-04-08 15:27:35,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:27:35,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1348731143] [2022-04-08 15:27:35,127 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:27:35,127 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:27:35,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1847172772, now seen corresponding path program 2 times [2022-04-08 15:27:35,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:27:35,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706206667] [2022-04-08 15:27:35,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:27:35,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:27:35,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:27:35,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:27:35,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:27:35,245 INFO L290 TraceCheckUtils]: 0: Hoare triple {35178#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {35171#true} is VALID [2022-04-08 15:27:35,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {35171#true} assume true; {35171#true} is VALID [2022-04-08 15:27:35,245 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35171#true} {35171#true} #690#return; {35171#true} is VALID [2022-04-08 15:27:35,246 INFO L272 TraceCheckUtils]: 0: Hoare triple {35171#true} call ULTIMATE.init(); {35178#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:27:35,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {35178#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {35171#true} is VALID [2022-04-08 15:27:35,246 INFO L290 TraceCheckUtils]: 2: Hoare triple {35171#true} assume true; {35171#true} is VALID [2022-04-08 15:27:35,246 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35171#true} {35171#true} #690#return; {35171#true} is VALID [2022-04-08 15:27:35,246 INFO L272 TraceCheckUtils]: 4: Hoare triple {35171#true} call #t~ret161 := main(); {35171#true} is VALID [2022-04-08 15:27:35,246 INFO L290 TraceCheckUtils]: 5: Hoare triple {35171#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {35171#true} is VALID [2022-04-08 15:27:35,246 INFO L290 TraceCheckUtils]: 6: Hoare triple {35171#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {35171#true} is VALID [2022-04-08 15:27:35,246 INFO L272 TraceCheckUtils]: 7: Hoare triple {35171#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {35171#true} is VALID [2022-04-08 15:27:35,268 INFO L290 TraceCheckUtils]: 8: Hoare triple {35171#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {35171#true} is VALID [2022-04-08 15:27:35,268 INFO L290 TraceCheckUtils]: 9: Hoare triple {35171#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {35171#true} is VALID [2022-04-08 15:27:35,268 INFO L290 TraceCheckUtils]: 10: Hoare triple {35171#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {35171#true} is VALID [2022-04-08 15:27:35,268 INFO L290 TraceCheckUtils]: 11: Hoare triple {35171#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {35171#true} is VALID [2022-04-08 15:27:35,268 INFO L290 TraceCheckUtils]: 12: Hoare triple {35171#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {35171#true} is VALID [2022-04-08 15:27:35,268 INFO L290 TraceCheckUtils]: 13: Hoare triple {35171#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {35171#true} is VALID [2022-04-08 15:27:35,268 INFO L290 TraceCheckUtils]: 14: Hoare triple {35171#true} assume !false; {35171#true} is VALID [2022-04-08 15:27:35,269 INFO L290 TraceCheckUtils]: 15: Hoare triple {35171#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {35171#true} is VALID [2022-04-08 15:27:35,269 INFO L290 TraceCheckUtils]: 16: Hoare triple {35171#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {35171#true} is VALID [2022-04-08 15:27:35,269 INFO L290 TraceCheckUtils]: 17: Hoare triple {35171#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {35171#true} is VALID [2022-04-08 15:27:35,269 INFO L290 TraceCheckUtils]: 18: Hoare triple {35171#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {35171#true} is VALID [2022-04-08 15:27:35,269 INFO L290 TraceCheckUtils]: 19: Hoare triple {35171#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {35171#true} is VALID [2022-04-08 15:27:35,269 INFO L290 TraceCheckUtils]: 20: Hoare triple {35171#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {35171#true} is VALID [2022-04-08 15:27:35,269 INFO L290 TraceCheckUtils]: 21: Hoare triple {35171#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {35171#true} is VALID [2022-04-08 15:27:35,269 INFO L290 TraceCheckUtils]: 22: Hoare triple {35171#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {35171#true} is VALID [2022-04-08 15:27:35,269 INFO L290 TraceCheckUtils]: 23: Hoare triple {35171#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {35171#true} is VALID [2022-04-08 15:27:35,270 INFO L290 TraceCheckUtils]: 24: Hoare triple {35171#true} assume 8464 == #t~mem55;havoc #t~mem55; {35171#true} is VALID [2022-04-08 15:27:35,270 INFO L290 TraceCheckUtils]: 25: Hoare triple {35171#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {35171#true} is VALID [2022-04-08 15:27:35,270 INFO L290 TraceCheckUtils]: 26: Hoare triple {35171#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {35171#true} is VALID [2022-04-08 15:27:35,273 INFO L290 TraceCheckUtils]: 27: Hoare triple {35171#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:27:35,273 INFO L290 TraceCheckUtils]: 28: Hoare triple {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:27:35,274 INFO L290 TraceCheckUtils]: 29: Hoare triple {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:27:35,274 INFO L290 TraceCheckUtils]: 30: Hoare triple {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:27:35,275 INFO L290 TraceCheckUtils]: 31: Hoare triple {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:27:35,275 INFO L290 TraceCheckUtils]: 32: Hoare triple {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:27:35,276 INFO L290 TraceCheckUtils]: 33: Hoare triple {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:27:35,276 INFO L290 TraceCheckUtils]: 34: Hoare triple {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:27:35,276 INFO L290 TraceCheckUtils]: 35: Hoare triple {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:27:35,277 INFO L290 TraceCheckUtils]: 36: Hoare triple {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:27:35,277 INFO L290 TraceCheckUtils]: 37: Hoare triple {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {35177#(= |ssl3_accept_#t~mem52| 8496)} is VALID [2022-04-08 15:27:35,278 INFO L290 TraceCheckUtils]: 38: Hoare triple {35177#(= |ssl3_accept_#t~mem52| 8496)} assume 8480 == #t~mem52;havoc #t~mem52; {35172#false} is VALID [2022-04-08 15:27:35,278 INFO L290 TraceCheckUtils]: 39: Hoare triple {35172#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {35172#false} is VALID [2022-04-08 15:27:35,278 INFO L290 TraceCheckUtils]: 40: Hoare triple {35172#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8482, #t~mem91.base, 904 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:27:35,278 INFO L290 TraceCheckUtils]: 41: Hoare triple {35172#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {35172#false} is VALID [2022-04-08 15:27:35,278 INFO L290 TraceCheckUtils]: 42: Hoare triple {35172#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {35172#false} is VALID [2022-04-08 15:27:35,278 INFO L290 TraceCheckUtils]: 43: Hoare triple {35172#false} ~skip~0 := 0; {35172#false} is VALID [2022-04-08 15:27:35,278 INFO L290 TraceCheckUtils]: 44: Hoare triple {35172#false} assume !false; {35172#false} is VALID [2022-04-08 15:27:35,278 INFO L290 TraceCheckUtils]: 45: Hoare triple {35172#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:27:35,278 INFO L290 TraceCheckUtils]: 46: Hoare triple {35172#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:27:35,278 INFO L290 TraceCheckUtils]: 47: Hoare triple {35172#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:27:35,278 INFO L290 TraceCheckUtils]: 48: Hoare triple {35172#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:27:35,279 INFO L290 TraceCheckUtils]: 49: Hoare triple {35172#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:27:35,279 INFO L290 TraceCheckUtils]: 50: Hoare triple {35172#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:27:35,279 INFO L290 TraceCheckUtils]: 51: Hoare triple {35172#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:27:35,279 INFO L290 TraceCheckUtils]: 52: Hoare triple {35172#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:27:35,279 INFO L290 TraceCheckUtils]: 53: Hoare triple {35172#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:27:35,279 INFO L290 TraceCheckUtils]: 54: Hoare triple {35172#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:27:35,279 INFO L290 TraceCheckUtils]: 55: Hoare triple {35172#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:27:35,279 INFO L290 TraceCheckUtils]: 56: Hoare triple {35172#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:27:35,279 INFO L290 TraceCheckUtils]: 57: Hoare triple {35172#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:27:35,279 INFO L290 TraceCheckUtils]: 58: Hoare triple {35172#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:27:35,279 INFO L290 TraceCheckUtils]: 59: Hoare triple {35172#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:27:35,279 INFO L290 TraceCheckUtils]: 60: Hoare triple {35172#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:27:35,280 INFO L290 TraceCheckUtils]: 61: Hoare triple {35172#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:27:35,280 INFO L290 TraceCheckUtils]: 62: Hoare triple {35172#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:27:35,280 INFO L290 TraceCheckUtils]: 63: Hoare triple {35172#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:27:35,280 INFO L290 TraceCheckUtils]: 64: Hoare triple {35172#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:27:35,280 INFO L290 TraceCheckUtils]: 65: Hoare triple {35172#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:27:35,280 INFO L290 TraceCheckUtils]: 66: Hoare triple {35172#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:27:35,280 INFO L290 TraceCheckUtils]: 67: Hoare triple {35172#false} assume 8448 == #t~mem68;havoc #t~mem68; {35172#false} is VALID [2022-04-08 15:27:35,280 INFO L290 TraceCheckUtils]: 68: Hoare triple {35172#false} assume !(~num1~0 > 0); {35172#false} is VALID [2022-04-08 15:27:35,280 INFO L290 TraceCheckUtils]: 69: Hoare triple {35172#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem133 := read~int(#t~mem132.base, 904 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 72 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {35172#false} is VALID [2022-04-08 15:27:35,280 INFO L290 TraceCheckUtils]: 70: Hoare triple {35172#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {35172#false} is VALID [2022-04-08 15:27:35,280 INFO L290 TraceCheckUtils]: 71: Hoare triple {35172#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {35172#false} is VALID [2022-04-08 15:27:35,280 INFO L290 TraceCheckUtils]: 72: Hoare triple {35172#false} ~skip~0 := 0; {35172#false} is VALID [2022-04-08 15:27:35,281 INFO L290 TraceCheckUtils]: 73: Hoare triple {35172#false} assume !false; {35172#false} is VALID [2022-04-08 15:27:35,281 INFO L290 TraceCheckUtils]: 74: Hoare triple {35172#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:27:35,281 INFO L290 TraceCheckUtils]: 75: Hoare triple {35172#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:27:35,281 INFO L290 TraceCheckUtils]: 76: Hoare triple {35172#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:27:35,281 INFO L290 TraceCheckUtils]: 77: Hoare triple {35172#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:27:35,281 INFO L290 TraceCheckUtils]: 78: Hoare triple {35172#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:27:35,281 INFO L290 TraceCheckUtils]: 79: Hoare triple {35172#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:27:35,281 INFO L290 TraceCheckUtils]: 80: Hoare triple {35172#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:27:35,281 INFO L290 TraceCheckUtils]: 81: Hoare triple {35172#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:27:35,281 INFO L290 TraceCheckUtils]: 82: Hoare triple {35172#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:27:35,281 INFO L290 TraceCheckUtils]: 83: Hoare triple {35172#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:27:35,282 INFO L290 TraceCheckUtils]: 84: Hoare triple {35172#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:27:35,282 INFO L290 TraceCheckUtils]: 85: Hoare triple {35172#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:27:35,282 INFO L290 TraceCheckUtils]: 86: Hoare triple {35172#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:27:35,282 INFO L290 TraceCheckUtils]: 87: Hoare triple {35172#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:27:35,282 INFO L290 TraceCheckUtils]: 88: Hoare triple {35172#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:27:35,282 INFO L290 TraceCheckUtils]: 89: Hoare triple {35172#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:27:35,282 INFO L290 TraceCheckUtils]: 90: Hoare triple {35172#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:27:35,282 INFO L290 TraceCheckUtils]: 91: Hoare triple {35172#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:27:35,282 INFO L290 TraceCheckUtils]: 92: Hoare triple {35172#false} assume 8544 == #t~mem64;havoc #t~mem64; {35172#false} is VALID [2022-04-08 15:27:35,282 INFO L290 TraceCheckUtils]: 93: Hoare triple {35172#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:27:35,282 INFO L290 TraceCheckUtils]: 94: Hoare triple {35172#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {35172#false} is VALID [2022-04-08 15:27:35,282 INFO L290 TraceCheckUtils]: 95: Hoare triple {35172#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {35172#false} is VALID [2022-04-08 15:27:35,283 INFO L290 TraceCheckUtils]: 96: Hoare triple {35172#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {35172#false} is VALID [2022-04-08 15:27:35,283 INFO L290 TraceCheckUtils]: 97: Hoare triple {35172#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {35172#false} is VALID [2022-04-08 15:27:35,283 INFO L290 TraceCheckUtils]: 98: Hoare triple {35172#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {35172#false} is VALID [2022-04-08 15:27:35,283 INFO L290 TraceCheckUtils]: 99: Hoare triple {35172#false} assume 7 == ~blastFlag~0; {35172#false} is VALID [2022-04-08 15:27:35,283 INFO L290 TraceCheckUtils]: 100: Hoare triple {35172#false} assume !false; {35172#false} is VALID [2022-04-08 15:27:35,283 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-04-08 15:27:35,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:27:35,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706206667] [2022-04-08 15:27:35,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706206667] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:27:35,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:27:35,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:27:35,284 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:27:35,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1348731143] [2022-04-08 15:27:35,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1348731143] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:27:35,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:27:35,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:27:35,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560307091] [2022-04-08 15:27:35,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:27:35,285 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 101 [2022-04-08 15:27:35,285 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:27:35,285 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:27:35,341 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:27:35,341 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:27:35,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:27:35,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:27:35,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:27:35,342 INFO L87 Difference]: Start difference. First operand 309 states and 479 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:27:39,187 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-08 15:27:43,352 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-08 15:27:46,559 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:27:47,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:27:47,518 INFO L93 Difference]: Finished difference Result 612 states and 954 transitions. [2022-04-08 15:27:47,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:27:47,518 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 101 [2022-04-08 15:27:47,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:27:47,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:27:47,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 471 transitions. [2022-04-08 15:27:47,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:27:47,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 471 transitions. [2022-04-08 15:27:47,523 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 471 transitions. [2022-04-08 15:27:47,828 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 471 edges. 471 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:27:47,833 INFO L225 Difference]: With dead ends: 612 [2022-04-08 15:27:47,833 INFO L226 Difference]: Without dead ends: 329 [2022-04-08 15:27:47,833 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 15:27:47,834 INFO L913 BasicCegarLoop]: 196 mSDtfsCounter, 35 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.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, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-04-08 15:27:47,834 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 505 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-04-08 15:27:47,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-04-08 15:27:47,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 309. [2022-04-08 15:27:47,849 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:27:47,850 INFO L82 GeneralOperation]: Start isEquivalent. First operand 329 states. Second operand has 309 states, 304 states have (on average 1.5592105263157894) internal successors, (474), 304 states have internal predecessors, (474), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:27:47,850 INFO L74 IsIncluded]: Start isIncluded. First operand 329 states. Second operand has 309 states, 304 states have (on average 1.5592105263157894) internal successors, (474), 304 states have internal predecessors, (474), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:27:47,851 INFO L87 Difference]: Start difference. First operand 329 states. Second operand has 309 states, 304 states have (on average 1.5592105263157894) internal successors, (474), 304 states have internal predecessors, (474), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:27:47,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:27:47,857 INFO L93 Difference]: Finished difference Result 329 states and 504 transitions. [2022-04-08 15:27:47,857 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 504 transitions. [2022-04-08 15:27:47,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:27:47,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:27:47,858 INFO L74 IsIncluded]: Start isIncluded. First operand has 309 states, 304 states have (on average 1.5592105263157894) internal successors, (474), 304 states have internal predecessors, (474), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 329 states. [2022-04-08 15:27:47,859 INFO L87 Difference]: Start difference. First operand has 309 states, 304 states have (on average 1.5592105263157894) internal successors, (474), 304 states have internal predecessors, (474), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 329 states. [2022-04-08 15:27:47,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:27:47,865 INFO L93 Difference]: Finished difference Result 329 states and 504 transitions. [2022-04-08 15:27:47,865 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 504 transitions. [2022-04-08 15:27:47,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:27:47,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:27:47,866 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:27:47,866 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:27:47,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 304 states have (on average 1.5592105263157894) internal successors, (474), 304 states have internal predecessors, (474), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:27:47,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 478 transitions. [2022-04-08 15:27:47,873 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 478 transitions. Word has length 101 [2022-04-08 15:27:47,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:27:47,874 INFO L478 AbstractCegarLoop]: Abstraction has 309 states and 478 transitions. [2022-04-08 15:27:47,874 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:27:47,874 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 309 states and 478 transitions. [2022-04-08 15:27:48,248 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 478 edges. 478 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:27:48,248 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 478 transitions. [2022-04-08 15:27:48,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-04-08 15:27:48,249 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:27:48,249 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:27:48,249 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-08 15:27:48,249 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:27:48,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:27:48,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1251719941, now seen corresponding path program 1 times [2022-04-08 15:27:48,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:27:48,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [964615323] [2022-04-08 15:27:48,311 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:27:48,311 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:27:48,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1251719941, now seen corresponding path program 2 times [2022-04-08 15:27:48,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:27:48,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596797806] [2022-04-08 15:27:48,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:27:48,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:27:48,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:27:48,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:27:48,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:27:48,433 INFO L290 TraceCheckUtils]: 0: Hoare triple {37690#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {37683#true} is VALID [2022-04-08 15:27:48,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {37683#true} assume true; {37683#true} is VALID [2022-04-08 15:27:48,433 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37683#true} {37683#true} #690#return; {37683#true} is VALID [2022-04-08 15:27:48,434 INFO L272 TraceCheckUtils]: 0: Hoare triple {37683#true} call ULTIMATE.init(); {37690#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:27:48,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {37690#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {37683#true} is VALID [2022-04-08 15:27:48,434 INFO L290 TraceCheckUtils]: 2: Hoare triple {37683#true} assume true; {37683#true} is VALID [2022-04-08 15:27:48,434 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37683#true} {37683#true} #690#return; {37683#true} is VALID [2022-04-08 15:27:48,435 INFO L272 TraceCheckUtils]: 4: Hoare triple {37683#true} call #t~ret161 := main(); {37683#true} is VALID [2022-04-08 15:27:48,435 INFO L290 TraceCheckUtils]: 5: Hoare triple {37683#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {37683#true} is VALID [2022-04-08 15:27:48,435 INFO L290 TraceCheckUtils]: 6: Hoare triple {37683#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {37683#true} is VALID [2022-04-08 15:27:48,435 INFO L272 TraceCheckUtils]: 7: Hoare triple {37683#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {37683#true} is VALID [2022-04-08 15:27:48,435 INFO L290 TraceCheckUtils]: 8: Hoare triple {37683#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {37683#true} is VALID [2022-04-08 15:27:48,435 INFO L290 TraceCheckUtils]: 9: Hoare triple {37683#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {37683#true} is VALID [2022-04-08 15:27:48,435 INFO L290 TraceCheckUtils]: 10: Hoare triple {37683#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {37683#true} is VALID [2022-04-08 15:27:48,435 INFO L290 TraceCheckUtils]: 11: Hoare triple {37683#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {37683#true} is VALID [2022-04-08 15:27:48,435 INFO L290 TraceCheckUtils]: 12: Hoare triple {37683#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {37683#true} is VALID [2022-04-08 15:27:48,435 INFO L290 TraceCheckUtils]: 13: Hoare triple {37683#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {37683#true} is VALID [2022-04-08 15:27:48,435 INFO L290 TraceCheckUtils]: 14: Hoare triple {37683#true} assume !false; {37683#true} is VALID [2022-04-08 15:27:48,436 INFO L290 TraceCheckUtils]: 15: Hoare triple {37683#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {37683#true} is VALID [2022-04-08 15:27:48,436 INFO L290 TraceCheckUtils]: 16: Hoare triple {37683#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {37683#true} is VALID [2022-04-08 15:27:48,436 INFO L290 TraceCheckUtils]: 17: Hoare triple {37683#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {37683#true} is VALID [2022-04-08 15:27:48,436 INFO L290 TraceCheckUtils]: 18: Hoare triple {37683#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {37683#true} is VALID [2022-04-08 15:27:48,436 INFO L290 TraceCheckUtils]: 19: Hoare triple {37683#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {37683#true} is VALID [2022-04-08 15:27:48,436 INFO L290 TraceCheckUtils]: 20: Hoare triple {37683#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {37683#true} is VALID [2022-04-08 15:27:48,436 INFO L290 TraceCheckUtils]: 21: Hoare triple {37683#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {37683#true} is VALID [2022-04-08 15:27:48,436 INFO L290 TraceCheckUtils]: 22: Hoare triple {37683#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {37683#true} is VALID [2022-04-08 15:27:48,436 INFO L290 TraceCheckUtils]: 23: Hoare triple {37683#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {37683#true} is VALID [2022-04-08 15:27:48,436 INFO L290 TraceCheckUtils]: 24: Hoare triple {37683#true} assume 8464 == #t~mem55;havoc #t~mem55; {37683#true} is VALID [2022-04-08 15:27:48,436 INFO L290 TraceCheckUtils]: 25: Hoare triple {37683#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {37683#true} is VALID [2022-04-08 15:27:48,436 INFO L290 TraceCheckUtils]: 26: Hoare triple {37683#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {37683#true} is VALID [2022-04-08 15:27:48,437 INFO L290 TraceCheckUtils]: 27: Hoare triple {37683#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-08 15:27:48,438 INFO L290 TraceCheckUtils]: 28: Hoare triple {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-08 15:27:48,438 INFO L290 TraceCheckUtils]: 29: Hoare triple {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-08 15:27:48,439 INFO L290 TraceCheckUtils]: 30: Hoare triple {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} ~skip~0 := 0; {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-08 15:27:48,439 INFO L290 TraceCheckUtils]: 31: Hoare triple {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} assume !false; {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-08 15:27:48,440 INFO L290 TraceCheckUtils]: 32: Hoare triple {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-08 15:27:48,440 INFO L290 TraceCheckUtils]: 33: Hoare triple {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-08 15:27:48,440 INFO L290 TraceCheckUtils]: 34: Hoare triple {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-08 15:27:48,441 INFO L290 TraceCheckUtils]: 35: Hoare triple {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-08 15:27:48,441 INFO L290 TraceCheckUtils]: 36: Hoare triple {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-08 15:27:48,442 INFO L290 TraceCheckUtils]: 37: Hoare triple {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-08 15:27:48,442 INFO L290 TraceCheckUtils]: 38: Hoare triple {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {37689#(not (= |ssl3_accept_#t~mem53| 8481))} is VALID [2022-04-08 15:27:48,442 INFO L290 TraceCheckUtils]: 39: Hoare triple {37689#(not (= |ssl3_accept_#t~mem53| 8481))} assume 8481 == #t~mem53;havoc #t~mem53; {37684#false} is VALID [2022-04-08 15:27:48,442 INFO L290 TraceCheckUtils]: 40: Hoare triple {37684#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {37684#false} is VALID [2022-04-08 15:27:48,443 INFO L290 TraceCheckUtils]: 41: Hoare triple {37684#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8482, #t~mem91.base, 904 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:27:48,443 INFO L290 TraceCheckUtils]: 42: Hoare triple {37684#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {37684#false} is VALID [2022-04-08 15:27:48,443 INFO L290 TraceCheckUtils]: 43: Hoare triple {37684#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {37684#false} is VALID [2022-04-08 15:27:48,443 INFO L290 TraceCheckUtils]: 44: Hoare triple {37684#false} ~skip~0 := 0; {37684#false} is VALID [2022-04-08 15:27:48,443 INFO L290 TraceCheckUtils]: 45: Hoare triple {37684#false} assume !false; {37684#false} is VALID [2022-04-08 15:27:48,443 INFO L290 TraceCheckUtils]: 46: Hoare triple {37684#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:27:48,443 INFO L290 TraceCheckUtils]: 47: Hoare triple {37684#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:27:48,443 INFO L290 TraceCheckUtils]: 48: Hoare triple {37684#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:27:48,443 INFO L290 TraceCheckUtils]: 49: Hoare triple {37684#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:27:48,443 INFO L290 TraceCheckUtils]: 50: Hoare triple {37684#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:27:48,443 INFO L290 TraceCheckUtils]: 51: Hoare triple {37684#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:27:48,443 INFO L290 TraceCheckUtils]: 52: Hoare triple {37684#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:27:48,444 INFO L290 TraceCheckUtils]: 53: Hoare triple {37684#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:27:48,444 INFO L290 TraceCheckUtils]: 54: Hoare triple {37684#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:27:48,444 INFO L290 TraceCheckUtils]: 55: Hoare triple {37684#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:27:48,444 INFO L290 TraceCheckUtils]: 56: Hoare triple {37684#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:27:48,444 INFO L290 TraceCheckUtils]: 57: Hoare triple {37684#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:27:48,444 INFO L290 TraceCheckUtils]: 58: Hoare triple {37684#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:27:48,444 INFO L290 TraceCheckUtils]: 59: Hoare triple {37684#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:27:48,444 INFO L290 TraceCheckUtils]: 60: Hoare triple {37684#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:27:48,444 INFO L290 TraceCheckUtils]: 61: Hoare triple {37684#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:27:48,444 INFO L290 TraceCheckUtils]: 62: Hoare triple {37684#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:27:48,444 INFO L290 TraceCheckUtils]: 63: Hoare triple {37684#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:27:48,444 INFO L290 TraceCheckUtils]: 64: Hoare triple {37684#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:27:48,445 INFO L290 TraceCheckUtils]: 65: Hoare triple {37684#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:27:48,445 INFO L290 TraceCheckUtils]: 66: Hoare triple {37684#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:27:48,445 INFO L290 TraceCheckUtils]: 67: Hoare triple {37684#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:27:48,445 INFO L290 TraceCheckUtils]: 68: Hoare triple {37684#false} assume 8448 == #t~mem68;havoc #t~mem68; {37684#false} is VALID [2022-04-08 15:27:48,445 INFO L290 TraceCheckUtils]: 69: Hoare triple {37684#false} assume !(~num1~0 > 0); {37684#false} is VALID [2022-04-08 15:27:48,445 INFO L290 TraceCheckUtils]: 70: Hoare triple {37684#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem133 := read~int(#t~mem132.base, 904 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 72 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {37684#false} is VALID [2022-04-08 15:27:48,445 INFO L290 TraceCheckUtils]: 71: Hoare triple {37684#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {37684#false} is VALID [2022-04-08 15:27:48,445 INFO L290 TraceCheckUtils]: 72: Hoare triple {37684#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {37684#false} is VALID [2022-04-08 15:27:48,445 INFO L290 TraceCheckUtils]: 73: Hoare triple {37684#false} ~skip~0 := 0; {37684#false} is VALID [2022-04-08 15:27:48,445 INFO L290 TraceCheckUtils]: 74: Hoare triple {37684#false} assume !false; {37684#false} is VALID [2022-04-08 15:27:48,445 INFO L290 TraceCheckUtils]: 75: Hoare triple {37684#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:27:48,445 INFO L290 TraceCheckUtils]: 76: Hoare triple {37684#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:27:48,445 INFO L290 TraceCheckUtils]: 77: Hoare triple {37684#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:27:48,446 INFO L290 TraceCheckUtils]: 78: Hoare triple {37684#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:27:48,446 INFO L290 TraceCheckUtils]: 79: Hoare triple {37684#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:27:48,446 INFO L290 TraceCheckUtils]: 80: Hoare triple {37684#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:27:48,446 INFO L290 TraceCheckUtils]: 81: Hoare triple {37684#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:27:48,446 INFO L290 TraceCheckUtils]: 82: Hoare triple {37684#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:27:48,446 INFO L290 TraceCheckUtils]: 83: Hoare triple {37684#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:27:48,446 INFO L290 TraceCheckUtils]: 84: Hoare triple {37684#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:27:48,446 INFO L290 TraceCheckUtils]: 85: Hoare triple {37684#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:27:48,446 INFO L290 TraceCheckUtils]: 86: Hoare triple {37684#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:27:48,446 INFO L290 TraceCheckUtils]: 87: Hoare triple {37684#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:27:48,446 INFO L290 TraceCheckUtils]: 88: Hoare triple {37684#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:27:48,446 INFO L290 TraceCheckUtils]: 89: Hoare triple {37684#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:27:48,447 INFO L290 TraceCheckUtils]: 90: Hoare triple {37684#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:27:48,447 INFO L290 TraceCheckUtils]: 91: Hoare triple {37684#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:27:48,447 INFO L290 TraceCheckUtils]: 92: Hoare triple {37684#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:27:48,447 INFO L290 TraceCheckUtils]: 93: Hoare triple {37684#false} assume 8544 == #t~mem64;havoc #t~mem64; {37684#false} is VALID [2022-04-08 15:27:48,447 INFO L290 TraceCheckUtils]: 94: Hoare triple {37684#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:27:48,447 INFO L290 TraceCheckUtils]: 95: Hoare triple {37684#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {37684#false} is VALID [2022-04-08 15:27:48,447 INFO L290 TraceCheckUtils]: 96: Hoare triple {37684#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {37684#false} is VALID [2022-04-08 15:27:48,447 INFO L290 TraceCheckUtils]: 97: Hoare triple {37684#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {37684#false} is VALID [2022-04-08 15:27:48,447 INFO L290 TraceCheckUtils]: 98: Hoare triple {37684#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {37684#false} is VALID [2022-04-08 15:27:48,447 INFO L290 TraceCheckUtils]: 99: Hoare triple {37684#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {37684#false} is VALID [2022-04-08 15:27:48,447 INFO L290 TraceCheckUtils]: 100: Hoare triple {37684#false} assume 7 == ~blastFlag~0; {37684#false} is VALID [2022-04-08 15:27:48,447 INFO L290 TraceCheckUtils]: 101: Hoare triple {37684#false} assume !false; {37684#false} is VALID [2022-04-08 15:27:48,448 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-04-08 15:27:48,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:27:48,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596797806] [2022-04-08 15:27:48,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596797806] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:27:48,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:27:48,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:27:48,467 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:27:48,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [964615323] [2022-04-08 15:27:48,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [964615323] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:27:48,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:27:48,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:27:48,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349647794] [2022-04-08 15:27:48,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:27:48,468 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 102 [2022-04-08 15:27:48,468 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:27:48,469 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:27:48,545 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:27:48,545 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:27:48,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:27:48,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:27:48,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:27:48,546 INFO L87 Difference]: Start difference. First operand 309 states and 478 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:27:51,405 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:27:53,805 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:27:55,809 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:27:57,840 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:27:59,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:27:59,073 INFO L93 Difference]: Finished difference Result 670 states and 1036 transitions. [2022-04-08 15:27:59,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:27:59,074 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 102 [2022-04-08 15:27:59,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:27:59,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:27:59,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 589 transitions. [2022-04-08 15:27:59,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:27:59,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 589 transitions. [2022-04-08 15:27:59,078 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 589 transitions. [2022-04-08 15:27:59,470 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 589 edges. 589 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:27:59,476 INFO L225 Difference]: With dead ends: 670 [2022-04-08 15:27:59,476 INFO L226 Difference]: Without dead ends: 387 [2022-04-08 15:27:59,477 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 15:27:59,478 INFO L913 BasicCegarLoop]: 147 mSDtfsCounter, 140 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 57 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2022-04-08 15:27:59,478 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 402 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 502 Invalid, 2 Unknown, 0 Unchecked, 7.3s Time] [2022-04-08 15:27:59,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2022-04-08 15:27:59,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 309. [2022-04-08 15:27:59,495 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:27:59,496 INFO L82 GeneralOperation]: Start isEquivalent. First operand 387 states. Second operand has 309 states, 304 states have (on average 1.542763157894737) internal successors, (469), 304 states have internal predecessors, (469), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:27:59,496 INFO L74 IsIncluded]: Start isIncluded. First operand 387 states. Second operand has 309 states, 304 states have (on average 1.542763157894737) internal successors, (469), 304 states have internal predecessors, (469), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:27:59,497 INFO L87 Difference]: Start difference. First operand 387 states. Second operand has 309 states, 304 states have (on average 1.542763157894737) internal successors, (469), 304 states have internal predecessors, (469), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:27:59,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:27:59,505 INFO L93 Difference]: Finished difference Result 387 states and 583 transitions. [2022-04-08 15:27:59,505 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 583 transitions. [2022-04-08 15:27:59,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:27:59,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:27:59,507 INFO L74 IsIncluded]: Start isIncluded. First operand has 309 states, 304 states have (on average 1.542763157894737) internal successors, (469), 304 states have internal predecessors, (469), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 387 states. [2022-04-08 15:27:59,507 INFO L87 Difference]: Start difference. First operand has 309 states, 304 states have (on average 1.542763157894737) internal successors, (469), 304 states have internal predecessors, (469), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 387 states. [2022-04-08 15:27:59,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:27:59,516 INFO L93 Difference]: Finished difference Result 387 states and 583 transitions. [2022-04-08 15:27:59,516 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 583 transitions. [2022-04-08 15:27:59,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:27:59,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:27:59,517 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:27:59,517 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:27:59,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 304 states have (on average 1.542763157894737) internal successors, (469), 304 states have internal predecessors, (469), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:27:59,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 473 transitions. [2022-04-08 15:27:59,524 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 473 transitions. Word has length 102 [2022-04-08 15:27:59,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:27:59,524 INFO L478 AbstractCegarLoop]: Abstraction has 309 states and 473 transitions. [2022-04-08 15:27:59,524 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:27:59,524 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 309 states and 473 transitions. [2022-04-08 15:27:59,998 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 473 edges. 473 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:27:59,999 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 473 transitions. [2022-04-08 15:27:59,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-04-08 15:28:00,000 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:28:00,000 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:28:00,000 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-08 15:28:00,000 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:28:00,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:28:00,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1560968036, now seen corresponding path program 1 times [2022-04-08 15:28:00,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:28:00,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2079913577] [2022-04-08 15:28:00,062 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:28:00,062 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:28:00,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1560968036, now seen corresponding path program 2 times [2022-04-08 15:28:00,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:28:00,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780349487] [2022-04-08 15:28:00,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:28:00,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:28:00,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:28:00,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:28:00,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:28:00,207 INFO L290 TraceCheckUtils]: 0: Hoare triple {40434#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {40427#true} is VALID [2022-04-08 15:28:00,208 INFO L290 TraceCheckUtils]: 1: Hoare triple {40427#true} assume true; {40427#true} is VALID [2022-04-08 15:28:00,208 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40427#true} {40427#true} #690#return; {40427#true} is VALID [2022-04-08 15:28:00,208 INFO L272 TraceCheckUtils]: 0: Hoare triple {40427#true} call ULTIMATE.init(); {40434#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:28:00,208 INFO L290 TraceCheckUtils]: 1: Hoare triple {40434#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {40427#true} is VALID [2022-04-08 15:28:00,209 INFO L290 TraceCheckUtils]: 2: Hoare triple {40427#true} assume true; {40427#true} is VALID [2022-04-08 15:28:00,209 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40427#true} {40427#true} #690#return; {40427#true} is VALID [2022-04-08 15:28:00,209 INFO L272 TraceCheckUtils]: 4: Hoare triple {40427#true} call #t~ret161 := main(); {40427#true} is VALID [2022-04-08 15:28:00,209 INFO L290 TraceCheckUtils]: 5: Hoare triple {40427#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {40427#true} is VALID [2022-04-08 15:28:00,209 INFO L290 TraceCheckUtils]: 6: Hoare triple {40427#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {40427#true} is VALID [2022-04-08 15:28:00,209 INFO L272 TraceCheckUtils]: 7: Hoare triple {40427#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {40427#true} is VALID [2022-04-08 15:28:00,209 INFO L290 TraceCheckUtils]: 8: Hoare triple {40427#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {40427#true} is VALID [2022-04-08 15:28:00,209 INFO L290 TraceCheckUtils]: 9: Hoare triple {40427#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {40427#true} is VALID [2022-04-08 15:28:00,209 INFO L290 TraceCheckUtils]: 10: Hoare triple {40427#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {40427#true} is VALID [2022-04-08 15:28:00,209 INFO L290 TraceCheckUtils]: 11: Hoare triple {40427#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {40427#true} is VALID [2022-04-08 15:28:00,209 INFO L290 TraceCheckUtils]: 12: Hoare triple {40427#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {40427#true} is VALID [2022-04-08 15:28:00,209 INFO L290 TraceCheckUtils]: 13: Hoare triple {40427#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {40427#true} is VALID [2022-04-08 15:28:00,210 INFO L290 TraceCheckUtils]: 14: Hoare triple {40427#true} assume !false; {40427#true} is VALID [2022-04-08 15:28:00,210 INFO L290 TraceCheckUtils]: 15: Hoare triple {40427#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {40427#true} is VALID [2022-04-08 15:28:00,210 INFO L290 TraceCheckUtils]: 16: Hoare triple {40427#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {40427#true} is VALID [2022-04-08 15:28:00,210 INFO L290 TraceCheckUtils]: 17: Hoare triple {40427#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {40427#true} is VALID [2022-04-08 15:28:00,210 INFO L290 TraceCheckUtils]: 18: Hoare triple {40427#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {40427#true} is VALID [2022-04-08 15:28:00,210 INFO L290 TraceCheckUtils]: 19: Hoare triple {40427#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {40427#true} is VALID [2022-04-08 15:28:00,210 INFO L290 TraceCheckUtils]: 20: Hoare triple {40427#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {40427#true} is VALID [2022-04-08 15:28:00,210 INFO L290 TraceCheckUtils]: 21: Hoare triple {40427#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {40427#true} is VALID [2022-04-08 15:28:00,210 INFO L290 TraceCheckUtils]: 22: Hoare triple {40427#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {40427#true} is VALID [2022-04-08 15:28:00,210 INFO L290 TraceCheckUtils]: 23: Hoare triple {40427#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {40427#true} is VALID [2022-04-08 15:28:00,210 INFO L290 TraceCheckUtils]: 24: Hoare triple {40427#true} assume 8464 == #t~mem55;havoc #t~mem55; {40427#true} is VALID [2022-04-08 15:28:00,210 INFO L290 TraceCheckUtils]: 25: Hoare triple {40427#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {40427#true} is VALID [2022-04-08 15:28:00,211 INFO L290 TraceCheckUtils]: 26: Hoare triple {40427#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {40427#true} is VALID [2022-04-08 15:28:00,212 INFO L290 TraceCheckUtils]: 27: Hoare triple {40427#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:28:00,212 INFO L290 TraceCheckUtils]: 28: Hoare triple {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:28:00,212 INFO L290 TraceCheckUtils]: 29: Hoare triple {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:28:00,213 INFO L290 TraceCheckUtils]: 30: Hoare triple {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:28:00,213 INFO L290 TraceCheckUtils]: 31: Hoare triple {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:28:00,214 INFO L290 TraceCheckUtils]: 32: Hoare triple {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:28:00,214 INFO L290 TraceCheckUtils]: 33: Hoare triple {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:28:00,214 INFO L290 TraceCheckUtils]: 34: Hoare triple {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:28:00,215 INFO L290 TraceCheckUtils]: 35: Hoare triple {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:28:00,215 INFO L290 TraceCheckUtils]: 36: Hoare triple {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:28:00,216 INFO L290 TraceCheckUtils]: 37: Hoare triple {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:28:00,216 INFO L290 TraceCheckUtils]: 38: Hoare triple {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:28:00,216 INFO L290 TraceCheckUtils]: 39: Hoare triple {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {40433#(= |ssl3_accept_#t~mem54| 8496)} is VALID [2022-04-08 15:28:00,217 INFO L290 TraceCheckUtils]: 40: Hoare triple {40433#(= |ssl3_accept_#t~mem54| 8496)} assume 8482 == #t~mem54;havoc #t~mem54; {40428#false} is VALID [2022-04-08 15:28:00,217 INFO L290 TraceCheckUtils]: 41: Hoare triple {40428#false} call write~int(3, ~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:28:00,217 INFO L290 TraceCheckUtils]: 42: Hoare triple {40428#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {40428#false} is VALID [2022-04-08 15:28:00,217 INFO L290 TraceCheckUtils]: 43: Hoare triple {40428#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {40428#false} is VALID [2022-04-08 15:28:00,217 INFO L290 TraceCheckUtils]: 44: Hoare triple {40428#false} ~skip~0 := 0; {40428#false} is VALID [2022-04-08 15:28:00,217 INFO L290 TraceCheckUtils]: 45: Hoare triple {40428#false} assume !false; {40428#false} is VALID [2022-04-08 15:28:00,217 INFO L290 TraceCheckUtils]: 46: Hoare triple {40428#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:28:00,217 INFO L290 TraceCheckUtils]: 47: Hoare triple {40428#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:28:00,217 INFO L290 TraceCheckUtils]: 48: Hoare triple {40428#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:28:00,217 INFO L290 TraceCheckUtils]: 49: Hoare triple {40428#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:28:00,218 INFO L290 TraceCheckUtils]: 50: Hoare triple {40428#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:28:00,218 INFO L290 TraceCheckUtils]: 51: Hoare triple {40428#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:28:00,218 INFO L290 TraceCheckUtils]: 52: Hoare triple {40428#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:28:00,218 INFO L290 TraceCheckUtils]: 53: Hoare triple {40428#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:28:00,218 INFO L290 TraceCheckUtils]: 54: Hoare triple {40428#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:28:00,218 INFO L290 TraceCheckUtils]: 55: Hoare triple {40428#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:28:00,218 INFO L290 TraceCheckUtils]: 56: Hoare triple {40428#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:28:00,218 INFO L290 TraceCheckUtils]: 57: Hoare triple {40428#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:28:00,218 INFO L290 TraceCheckUtils]: 58: Hoare triple {40428#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:28:00,218 INFO L290 TraceCheckUtils]: 59: Hoare triple {40428#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:28:00,218 INFO L290 TraceCheckUtils]: 60: Hoare triple {40428#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:28:00,218 INFO L290 TraceCheckUtils]: 61: Hoare triple {40428#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:28:00,219 INFO L290 TraceCheckUtils]: 62: Hoare triple {40428#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:28:00,219 INFO L290 TraceCheckUtils]: 63: Hoare triple {40428#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:28:00,219 INFO L290 TraceCheckUtils]: 64: Hoare triple {40428#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:28:00,219 INFO L290 TraceCheckUtils]: 65: Hoare triple {40428#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:28:00,219 INFO L290 TraceCheckUtils]: 66: Hoare triple {40428#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:28:00,219 INFO L290 TraceCheckUtils]: 67: Hoare triple {40428#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:28:00,219 INFO L290 TraceCheckUtils]: 68: Hoare triple {40428#false} assume 8448 == #t~mem68;havoc #t~mem68; {40428#false} is VALID [2022-04-08 15:28:00,219 INFO L290 TraceCheckUtils]: 69: Hoare triple {40428#false} assume !(~num1~0 > 0); {40428#false} is VALID [2022-04-08 15:28:00,219 INFO L290 TraceCheckUtils]: 70: Hoare triple {40428#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem133 := read~int(#t~mem132.base, 904 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 72 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {40428#false} is VALID [2022-04-08 15:28:00,219 INFO L290 TraceCheckUtils]: 71: Hoare triple {40428#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {40428#false} is VALID [2022-04-08 15:28:00,219 INFO L290 TraceCheckUtils]: 72: Hoare triple {40428#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {40428#false} is VALID [2022-04-08 15:28:00,219 INFO L290 TraceCheckUtils]: 73: Hoare triple {40428#false} ~skip~0 := 0; {40428#false} is VALID [2022-04-08 15:28:00,220 INFO L290 TraceCheckUtils]: 74: Hoare triple {40428#false} assume !false; {40428#false} is VALID [2022-04-08 15:28:00,220 INFO L290 TraceCheckUtils]: 75: Hoare triple {40428#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:28:00,220 INFO L290 TraceCheckUtils]: 76: Hoare triple {40428#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:28:00,220 INFO L290 TraceCheckUtils]: 77: Hoare triple {40428#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:28:00,220 INFO L290 TraceCheckUtils]: 78: Hoare triple {40428#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:28:00,220 INFO L290 TraceCheckUtils]: 79: Hoare triple {40428#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:28:00,220 INFO L290 TraceCheckUtils]: 80: Hoare triple {40428#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:28:00,220 INFO L290 TraceCheckUtils]: 81: Hoare triple {40428#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:28:00,220 INFO L290 TraceCheckUtils]: 82: Hoare triple {40428#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:28:00,220 INFO L290 TraceCheckUtils]: 83: Hoare triple {40428#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:28:00,220 INFO L290 TraceCheckUtils]: 84: Hoare triple {40428#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:28:00,220 INFO L290 TraceCheckUtils]: 85: Hoare triple {40428#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:28:00,220 INFO L290 TraceCheckUtils]: 86: Hoare triple {40428#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:28:00,221 INFO L290 TraceCheckUtils]: 87: Hoare triple {40428#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:28:00,221 INFO L290 TraceCheckUtils]: 88: Hoare triple {40428#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:28:00,221 INFO L290 TraceCheckUtils]: 89: Hoare triple {40428#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:28:00,221 INFO L290 TraceCheckUtils]: 90: Hoare triple {40428#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:28:00,221 INFO L290 TraceCheckUtils]: 91: Hoare triple {40428#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:28:00,221 INFO L290 TraceCheckUtils]: 92: Hoare triple {40428#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:28:00,221 INFO L290 TraceCheckUtils]: 93: Hoare triple {40428#false} assume 8544 == #t~mem64;havoc #t~mem64; {40428#false} is VALID [2022-04-08 15:28:00,221 INFO L290 TraceCheckUtils]: 94: Hoare triple {40428#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:28:00,221 INFO L290 TraceCheckUtils]: 95: Hoare triple {40428#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {40428#false} is VALID [2022-04-08 15:28:00,221 INFO L290 TraceCheckUtils]: 96: Hoare triple {40428#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {40428#false} is VALID [2022-04-08 15:28:00,221 INFO L290 TraceCheckUtils]: 97: Hoare triple {40428#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {40428#false} is VALID [2022-04-08 15:28:00,221 INFO L290 TraceCheckUtils]: 98: Hoare triple {40428#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {40428#false} is VALID [2022-04-08 15:28:00,221 INFO L290 TraceCheckUtils]: 99: Hoare triple {40428#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {40428#false} is VALID [2022-04-08 15:28:00,222 INFO L290 TraceCheckUtils]: 100: Hoare triple {40428#false} assume 7 == ~blastFlag~0; {40428#false} is VALID [2022-04-08 15:28:00,222 INFO L290 TraceCheckUtils]: 101: Hoare triple {40428#false} assume !false; {40428#false} is VALID [2022-04-08 15:28:00,222 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-04-08 15:28:00,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:28:00,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780349487] [2022-04-08 15:28:00,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780349487] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:28:00,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:28:00,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:28:00,223 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:28:00,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2079913577] [2022-04-08 15:28:00,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2079913577] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:28:00,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:28:00,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:28:00,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840893794] [2022-04-08 15:28:00,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:28:00,223 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 102 [2022-04-08 15:28:00,224 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:28:00,224 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:28:00,285 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:28:00,285 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:28:00,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:28:00,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:28:00,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:28:00,286 INFO L87 Difference]: Start difference. First operand 309 states and 473 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:28:04,832 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:28:06,863 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:28:08,889 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:28:09,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:28:09,847 INFO L93 Difference]: Finished difference Result 609 states and 939 transitions. [2022-04-08 15:28:09,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:28:09,847 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 102 [2022-04-08 15:28:09,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:28:09,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:28:09,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 466 transitions. [2022-04-08 15:28:09,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:28:09,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 466 transitions. [2022-04-08 15:28:09,851 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 466 transitions. [2022-04-08 15:28:10,158 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 466 edges. 466 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:28:10,162 INFO L225 Difference]: With dead ends: 609 [2022-04-08 15:28:10,162 INFO L226 Difference]: Without dead ends: 326 [2022-04-08 15:28:10,163 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 15:28:10,163 INFO L913 BasicCegarLoop]: 199 mSDtfsCounter, 31 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 9 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-04-08 15:28:10,163 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 511 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 386 Invalid, 3 Unknown, 0 Unchecked, 6.9s Time] [2022-04-08 15:28:10,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2022-04-08 15:28:10,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 309. [2022-04-08 15:28:10,180 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:28:10,180 INFO L82 GeneralOperation]: Start isEquivalent. First operand 326 states. Second operand has 309 states, 304 states have (on average 1.5394736842105263) internal successors, (468), 304 states have internal predecessors, (468), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:28:10,181 INFO L74 IsIncluded]: Start isIncluded. First operand 326 states. Second operand has 309 states, 304 states have (on average 1.5394736842105263) internal successors, (468), 304 states have internal predecessors, (468), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:28:10,181 INFO L87 Difference]: Start difference. First operand 326 states. Second operand has 309 states, 304 states have (on average 1.5394736842105263) internal successors, (468), 304 states have internal predecessors, (468), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:28:10,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:28:10,187 INFO L93 Difference]: Finished difference Result 326 states and 495 transitions. [2022-04-08 15:28:10,187 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 495 transitions. [2022-04-08 15:28:10,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:28:10,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:28:10,188 INFO L74 IsIncluded]: Start isIncluded. First operand has 309 states, 304 states have (on average 1.5394736842105263) internal successors, (468), 304 states have internal predecessors, (468), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 326 states. [2022-04-08 15:28:10,188 INFO L87 Difference]: Start difference. First operand has 309 states, 304 states have (on average 1.5394736842105263) internal successors, (468), 304 states have internal predecessors, (468), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 326 states. [2022-04-08 15:28:10,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:28:10,195 INFO L93 Difference]: Finished difference Result 326 states and 495 transitions. [2022-04-08 15:28:10,195 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 495 transitions. [2022-04-08 15:28:10,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:28:10,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:28:10,195 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:28:10,195 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:28:10,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 304 states have (on average 1.5394736842105263) internal successors, (468), 304 states have internal predecessors, (468), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:28:10,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 472 transitions. [2022-04-08 15:28:10,203 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 472 transitions. Word has length 102 [2022-04-08 15:28:10,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:28:10,203 INFO L478 AbstractCegarLoop]: Abstraction has 309 states and 472 transitions. [2022-04-08 15:28:10,203 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:28:10,203 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 309 states and 472 transitions. [2022-04-08 15:28:10,604 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 472 edges. 472 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:28:10,605 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 472 transitions. [2022-04-08 15:28:10,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-04-08 15:28:10,605 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:28:10,605 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:28:10,605 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-08 15:28:10,606 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:28:10,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:28:10,606 INFO L85 PathProgramCache]: Analyzing trace with hash -472074122, now seen corresponding path program 1 times [2022-04-08 15:28:10,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:28:10,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1023796477] [2022-04-08 15:28:10,671 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:28:10,672 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:28:10,672 INFO L85 PathProgramCache]: Analyzing trace with hash -472074122, now seen corresponding path program 2 times [2022-04-08 15:28:10,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:28:10,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562434868] [2022-04-08 15:28:10,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:28:10,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:28:10,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:28:10,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:28:10,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:28:10,826 INFO L290 TraceCheckUtils]: 0: Hoare triple {42934#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {42927#true} is VALID [2022-04-08 15:28:10,827 INFO L290 TraceCheckUtils]: 1: Hoare triple {42927#true} assume true; {42927#true} is VALID [2022-04-08 15:28:10,827 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42927#true} {42927#true} #690#return; {42927#true} is VALID [2022-04-08 15:28:10,827 INFO L272 TraceCheckUtils]: 0: Hoare triple {42927#true} call ULTIMATE.init(); {42934#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:28:10,828 INFO L290 TraceCheckUtils]: 1: Hoare triple {42934#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {42927#true} is VALID [2022-04-08 15:28:10,828 INFO L290 TraceCheckUtils]: 2: Hoare triple {42927#true} assume true; {42927#true} is VALID [2022-04-08 15:28:10,828 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42927#true} {42927#true} #690#return; {42927#true} is VALID [2022-04-08 15:28:10,828 INFO L272 TraceCheckUtils]: 4: Hoare triple {42927#true} call #t~ret161 := main(); {42927#true} is VALID [2022-04-08 15:28:10,828 INFO L290 TraceCheckUtils]: 5: Hoare triple {42927#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {42927#true} is VALID [2022-04-08 15:28:10,828 INFO L290 TraceCheckUtils]: 6: Hoare triple {42927#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {42927#true} is VALID [2022-04-08 15:28:10,828 INFO L272 TraceCheckUtils]: 7: Hoare triple {42927#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {42927#true} is VALID [2022-04-08 15:28:10,828 INFO L290 TraceCheckUtils]: 8: Hoare triple {42927#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {42927#true} is VALID [2022-04-08 15:28:10,828 INFO L290 TraceCheckUtils]: 9: Hoare triple {42927#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {42927#true} is VALID [2022-04-08 15:28:10,828 INFO L290 TraceCheckUtils]: 10: Hoare triple {42927#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {42927#true} is VALID [2022-04-08 15:28:10,829 INFO L290 TraceCheckUtils]: 11: Hoare triple {42927#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {42927#true} is VALID [2022-04-08 15:28:10,829 INFO L290 TraceCheckUtils]: 12: Hoare triple {42927#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {42927#true} is VALID [2022-04-08 15:28:10,829 INFO L290 TraceCheckUtils]: 13: Hoare triple {42927#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {42927#true} is VALID [2022-04-08 15:28:10,829 INFO L290 TraceCheckUtils]: 14: Hoare triple {42927#true} assume !false; {42927#true} is VALID [2022-04-08 15:28:10,829 INFO L290 TraceCheckUtils]: 15: Hoare triple {42927#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {42927#true} is VALID [2022-04-08 15:28:10,829 INFO L290 TraceCheckUtils]: 16: Hoare triple {42927#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {42927#true} is VALID [2022-04-08 15:28:10,829 INFO L290 TraceCheckUtils]: 17: Hoare triple {42927#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {42927#true} is VALID [2022-04-08 15:28:10,829 INFO L290 TraceCheckUtils]: 18: Hoare triple {42927#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {42927#true} is VALID [2022-04-08 15:28:10,829 INFO L290 TraceCheckUtils]: 19: Hoare triple {42927#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {42927#true} is VALID [2022-04-08 15:28:10,829 INFO L290 TraceCheckUtils]: 20: Hoare triple {42927#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {42927#true} is VALID [2022-04-08 15:28:10,829 INFO L290 TraceCheckUtils]: 21: Hoare triple {42927#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {42927#true} is VALID [2022-04-08 15:28:10,829 INFO L290 TraceCheckUtils]: 22: Hoare triple {42927#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {42927#true} is VALID [2022-04-08 15:28:10,829 INFO L290 TraceCheckUtils]: 23: Hoare triple {42927#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {42927#true} is VALID [2022-04-08 15:28:10,830 INFO L290 TraceCheckUtils]: 24: Hoare triple {42927#true} assume 8464 == #t~mem55;havoc #t~mem55; {42927#true} is VALID [2022-04-08 15:28:10,830 INFO L290 TraceCheckUtils]: 25: Hoare triple {42927#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {42927#true} is VALID [2022-04-08 15:28:10,830 INFO L290 TraceCheckUtils]: 26: Hoare triple {42927#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {42927#true} is VALID [2022-04-08 15:28:10,830 INFO L290 TraceCheckUtils]: 27: Hoare triple {42927#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {42927#true} is VALID [2022-04-08 15:28:10,830 INFO L290 TraceCheckUtils]: 28: Hoare triple {42927#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {42927#true} is VALID [2022-04-08 15:28:10,830 INFO L290 TraceCheckUtils]: 29: Hoare triple {42927#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {42927#true} is VALID [2022-04-08 15:28:10,830 INFO L290 TraceCheckUtils]: 30: Hoare triple {42927#true} ~skip~0 := 0; {42927#true} is VALID [2022-04-08 15:28:10,830 INFO L290 TraceCheckUtils]: 31: Hoare triple {42927#true} assume !false; {42927#true} is VALID [2022-04-08 15:28:10,830 INFO L290 TraceCheckUtils]: 32: Hoare triple {42927#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {42927#true} is VALID [2022-04-08 15:28:10,830 INFO L290 TraceCheckUtils]: 33: Hoare triple {42927#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {42927#true} is VALID [2022-04-08 15:28:10,830 INFO L290 TraceCheckUtils]: 34: Hoare triple {42927#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {42927#true} is VALID [2022-04-08 15:28:10,831 INFO L290 TraceCheckUtils]: 35: Hoare triple {42927#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {42927#true} is VALID [2022-04-08 15:28:10,831 INFO L290 TraceCheckUtils]: 36: Hoare triple {42927#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {42927#true} is VALID [2022-04-08 15:28:10,831 INFO L290 TraceCheckUtils]: 37: Hoare triple {42927#true} assume 8195 == #t~mem51;havoc #t~mem51; {42927#true} is VALID [2022-04-08 15:28:10,831 INFO L290 TraceCheckUtils]: 38: Hoare triple {42927#true} call write~int(1, ~s.base, 56 + ~s.offset, 4); {42927#true} is VALID [2022-04-08 15:28:10,831 INFO L290 TraceCheckUtils]: 39: Hoare triple {42927#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {42927#true} is VALID [2022-04-08 15:28:10,831 INFO L290 TraceCheckUtils]: 40: Hoare triple {42927#true} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {42927#true} is VALID [2022-04-08 15:28:10,831 INFO L290 TraceCheckUtils]: 41: Hoare triple {42927#true} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {42927#true} is VALID [2022-04-08 15:28:10,831 INFO L290 TraceCheckUtils]: 42: Hoare triple {42927#true} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {42927#true} is VALID [2022-04-08 15:28:10,831 INFO L290 TraceCheckUtils]: 43: Hoare triple {42927#true} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 72 + ~s.offset, 4); {42927#true} is VALID [2022-04-08 15:28:10,832 INFO L290 TraceCheckUtils]: 44: Hoare triple {42927#true} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem89 := read~int(#t~mem88.base, 132 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 132 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 72 + ~s.offset, 4); {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-08 15:28:10,833 INFO L290 TraceCheckUtils]: 45: Hoare triple {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-08 15:28:10,833 INFO L290 TraceCheckUtils]: 46: Hoare triple {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-08 15:28:10,834 INFO L290 TraceCheckUtils]: 47: Hoare triple {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} ~skip~0 := 0; {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-08 15:28:10,834 INFO L290 TraceCheckUtils]: 48: Hoare triple {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} assume !false; {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-08 15:28:10,834 INFO L290 TraceCheckUtils]: 49: Hoare triple {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-08 15:28:10,835 INFO L290 TraceCheckUtils]: 50: Hoare triple {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-08 15:28:10,835 INFO L290 TraceCheckUtils]: 51: Hoare triple {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-08 15:28:10,835 INFO L290 TraceCheckUtils]: 52: Hoare triple {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-08 15:28:10,836 INFO L290 TraceCheckUtils]: 53: Hoare triple {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-08 15:28:10,836 INFO L290 TraceCheckUtils]: 54: Hoare triple {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {42933#(= |ssl3_accept_#t~mem52| 8480)} is VALID [2022-04-08 15:28:10,837 INFO L290 TraceCheckUtils]: 55: Hoare triple {42933#(= |ssl3_accept_#t~mem52| 8480)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-08 15:28:10,837 INFO L290 TraceCheckUtils]: 56: Hoare triple {42928#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-08 15:28:10,837 INFO L290 TraceCheckUtils]: 57: Hoare triple {42928#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-08 15:28:10,837 INFO L290 TraceCheckUtils]: 58: Hoare triple {42928#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-08 15:28:10,837 INFO L290 TraceCheckUtils]: 59: Hoare triple {42928#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-08 15:28:10,837 INFO L290 TraceCheckUtils]: 60: Hoare triple {42928#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-08 15:28:10,837 INFO L290 TraceCheckUtils]: 61: Hoare triple {42928#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-08 15:28:10,837 INFO L290 TraceCheckUtils]: 62: Hoare triple {42928#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-08 15:28:10,837 INFO L290 TraceCheckUtils]: 63: Hoare triple {42928#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-08 15:28:10,837 INFO L290 TraceCheckUtils]: 64: Hoare triple {42928#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-08 15:28:10,837 INFO L290 TraceCheckUtils]: 65: Hoare triple {42928#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-08 15:28:10,838 INFO L290 TraceCheckUtils]: 66: Hoare triple {42928#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-08 15:28:10,838 INFO L290 TraceCheckUtils]: 67: Hoare triple {42928#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-08 15:28:10,838 INFO L290 TraceCheckUtils]: 68: Hoare triple {42928#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-08 15:28:10,838 INFO L290 TraceCheckUtils]: 69: Hoare triple {42928#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-08 15:28:10,838 INFO L290 TraceCheckUtils]: 70: Hoare triple {42928#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-08 15:28:10,838 INFO L290 TraceCheckUtils]: 71: Hoare triple {42928#false} assume 8448 == #t~mem68;havoc #t~mem68; {42928#false} is VALID [2022-04-08 15:28:10,838 INFO L290 TraceCheckUtils]: 72: Hoare triple {42928#false} assume !(~num1~0 > 0); {42928#false} is VALID [2022-04-08 15:28:10,838 INFO L290 TraceCheckUtils]: 73: Hoare triple {42928#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem133 := read~int(#t~mem132.base, 904 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 72 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {42928#false} is VALID [2022-04-08 15:28:10,838 INFO L290 TraceCheckUtils]: 74: Hoare triple {42928#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {42928#false} is VALID [2022-04-08 15:28:10,838 INFO L290 TraceCheckUtils]: 75: Hoare triple {42928#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {42928#false} is VALID [2022-04-08 15:28:10,838 INFO L290 TraceCheckUtils]: 76: Hoare triple {42928#false} ~skip~0 := 0; {42928#false} is VALID [2022-04-08 15:28:10,838 INFO L290 TraceCheckUtils]: 77: Hoare triple {42928#false} assume !false; {42928#false} is VALID [2022-04-08 15:28:10,839 INFO L290 TraceCheckUtils]: 78: Hoare triple {42928#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-08 15:28:10,839 INFO L290 TraceCheckUtils]: 79: Hoare triple {42928#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-08 15:28:10,839 INFO L290 TraceCheckUtils]: 80: Hoare triple {42928#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-08 15:28:10,839 INFO L290 TraceCheckUtils]: 81: Hoare triple {42928#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-08 15:28:10,839 INFO L290 TraceCheckUtils]: 82: Hoare triple {42928#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-08 15:28:10,839 INFO L290 TraceCheckUtils]: 83: Hoare triple {42928#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-08 15:28:10,839 INFO L290 TraceCheckUtils]: 84: Hoare triple {42928#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-08 15:28:10,839 INFO L290 TraceCheckUtils]: 85: Hoare triple {42928#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-08 15:28:10,839 INFO L290 TraceCheckUtils]: 86: Hoare triple {42928#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-08 15:28:10,839 INFO L290 TraceCheckUtils]: 87: Hoare triple {42928#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-08 15:28:10,839 INFO L290 TraceCheckUtils]: 88: Hoare triple {42928#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-08 15:28:10,839 INFO L290 TraceCheckUtils]: 89: Hoare triple {42928#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-08 15:28:10,840 INFO L290 TraceCheckUtils]: 90: Hoare triple {42928#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-08 15:28:10,840 INFO L290 TraceCheckUtils]: 91: Hoare triple {42928#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-08 15:28:10,840 INFO L290 TraceCheckUtils]: 92: Hoare triple {42928#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-08 15:28:10,840 INFO L290 TraceCheckUtils]: 93: Hoare triple {42928#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-08 15:28:10,840 INFO L290 TraceCheckUtils]: 94: Hoare triple {42928#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-08 15:28:10,840 INFO L290 TraceCheckUtils]: 95: Hoare triple {42928#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-08 15:28:10,840 INFO L290 TraceCheckUtils]: 96: Hoare triple {42928#false} assume 8544 == #t~mem64;havoc #t~mem64; {42928#false} is VALID [2022-04-08 15:28:10,840 INFO L290 TraceCheckUtils]: 97: Hoare triple {42928#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {42928#false} is VALID [2022-04-08 15:28:10,840 INFO L290 TraceCheckUtils]: 98: Hoare triple {42928#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {42928#false} is VALID [2022-04-08 15:28:10,840 INFO L290 TraceCheckUtils]: 99: Hoare triple {42928#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {42928#false} is VALID [2022-04-08 15:28:10,840 INFO L290 TraceCheckUtils]: 100: Hoare triple {42928#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {42928#false} is VALID [2022-04-08 15:28:10,840 INFO L290 TraceCheckUtils]: 101: Hoare triple {42928#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {42928#false} is VALID [2022-04-08 15:28:10,841 INFO L290 TraceCheckUtils]: 102: Hoare triple {42928#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {42928#false} is VALID [2022-04-08 15:28:10,841 INFO L290 TraceCheckUtils]: 103: Hoare triple {42928#false} assume 7 == ~blastFlag~0; {42928#false} is VALID [2022-04-08 15:28:10,841 INFO L290 TraceCheckUtils]: 104: Hoare triple {42928#false} assume !false; {42928#false} is VALID [2022-04-08 15:28:10,841 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-08 15:28:10,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:28:10,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562434868] [2022-04-08 15:28:10,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562434868] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:28:10,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:28:10,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:28:10,842 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:28:10,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1023796477] [2022-04-08 15:28:10,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1023796477] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:28:10,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:28:10,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:28:10,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345760595] [2022-04-08 15:28:10,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:28:10,844 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 105 [2022-04-08 15:28:10,844 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:28:10,844 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:28:10,905 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:28:10,905 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:28:10,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:28:10,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:28:10,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:28:10,906 INFO L87 Difference]: Start difference. First operand 309 states and 472 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:28:14,587 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:28:20,384 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:28:23,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:28:23,734 INFO L93 Difference]: Finished difference Result 620 states and 952 transitions. [2022-04-08 15:28:23,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:28:23,734 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 105 [2022-04-08 15:28:23,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:28:23,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:28:23,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 449 transitions. [2022-04-08 15:28:23,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:28:23,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 449 transitions. [2022-04-08 15:28:23,737 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 449 transitions. [2022-04-08 15:28:24,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 449 edges. 449 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:28:24,025 INFO L225 Difference]: With dead ends: 620 [2022-04-08 15:28:24,025 INFO L226 Difference]: Without dead ends: 337 [2022-04-08 15:28:24,026 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 15:28:24,026 INFO L913 BasicCegarLoop]: 226 mSDtfsCounter, 18 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-04-08 15:28:24,026 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 566 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-04-08 15:28:24,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-04-08 15:28:24,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 325. [2022-04-08 15:28:24,043 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:28:24,044 INFO L82 GeneralOperation]: Start isEquivalent. First operand 337 states. Second operand has 325 states, 320 states have (on average 1.53125) internal successors, (490), 320 states have internal predecessors, (490), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:28:24,044 INFO L74 IsIncluded]: Start isIncluded. First operand 337 states. Second operand has 325 states, 320 states have (on average 1.53125) internal successors, (490), 320 states have internal predecessors, (490), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:28:24,045 INFO L87 Difference]: Start difference. First operand 337 states. Second operand has 325 states, 320 states have (on average 1.53125) internal successors, (490), 320 states have internal predecessors, (490), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:28:24,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:28:24,051 INFO L93 Difference]: Finished difference Result 337 states and 509 transitions. [2022-04-08 15:28:24,051 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 509 transitions. [2022-04-08 15:28:24,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:28:24,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:28:24,052 INFO L74 IsIncluded]: Start isIncluded. First operand has 325 states, 320 states have (on average 1.53125) internal successors, (490), 320 states have internal predecessors, (490), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 337 states. [2022-04-08 15:28:24,053 INFO L87 Difference]: Start difference. First operand has 325 states, 320 states have (on average 1.53125) internal successors, (490), 320 states have internal predecessors, (490), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 337 states. [2022-04-08 15:28:24,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:28:24,059 INFO L93 Difference]: Finished difference Result 337 states and 509 transitions. [2022-04-08 15:28:24,059 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 509 transitions. [2022-04-08 15:28:24,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:28:24,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:28:24,060 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:28:24,060 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:28:24,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 320 states have (on average 1.53125) internal successors, (490), 320 states have internal predecessors, (490), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:28:24,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 494 transitions. [2022-04-08 15:28:24,068 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 494 transitions. Word has length 105 [2022-04-08 15:28:24,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:28:24,068 INFO L478 AbstractCegarLoop]: Abstraction has 325 states and 494 transitions. [2022-04-08 15:28:24,068 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:28:24,068 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 325 states and 494 transitions. [2022-04-08 15:28:24,473 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 494 edges. 494 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:28:24,473 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 494 transitions. [2022-04-08 15:28:24,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-04-08 15:28:24,474 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:28:24,474 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:28:24,474 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-08 15:28:24,474 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:28:24,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:28:24,475 INFO L85 PathProgramCache]: Analyzing trace with hash -888676307, now seen corresponding path program 1 times [2022-04-08 15:28:24,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:28:24,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [487140463] [2022-04-08 15:28:24,548 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:28:24,548 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:28:24,549 INFO L85 PathProgramCache]: Analyzing trace with hash -888676307, now seen corresponding path program 2 times [2022-04-08 15:28:24,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:28:24,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320865858] [2022-04-08 15:28:24,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:28:24,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:28:24,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:28:24,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:28:24,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:28:24,695 INFO L290 TraceCheckUtils]: 0: Hoare triple {45510#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {45503#true} is VALID [2022-04-08 15:28:24,695 INFO L290 TraceCheckUtils]: 1: Hoare triple {45503#true} assume true; {45503#true} is VALID [2022-04-08 15:28:24,695 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45503#true} {45503#true} #690#return; {45503#true} is VALID [2022-04-08 15:28:24,696 INFO L272 TraceCheckUtils]: 0: Hoare triple {45503#true} call ULTIMATE.init(); {45510#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:28:24,696 INFO L290 TraceCheckUtils]: 1: Hoare triple {45510#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {45503#true} is VALID [2022-04-08 15:28:24,696 INFO L290 TraceCheckUtils]: 2: Hoare triple {45503#true} assume true; {45503#true} is VALID [2022-04-08 15:28:24,696 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45503#true} {45503#true} #690#return; {45503#true} is VALID [2022-04-08 15:28:24,696 INFO L272 TraceCheckUtils]: 4: Hoare triple {45503#true} call #t~ret161 := main(); {45503#true} is VALID [2022-04-08 15:28:24,696 INFO L290 TraceCheckUtils]: 5: Hoare triple {45503#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {45503#true} is VALID [2022-04-08 15:28:24,697 INFO L290 TraceCheckUtils]: 6: Hoare triple {45503#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {45503#true} is VALID [2022-04-08 15:28:24,697 INFO L272 TraceCheckUtils]: 7: Hoare triple {45503#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {45503#true} is VALID [2022-04-08 15:28:24,697 INFO L290 TraceCheckUtils]: 8: Hoare triple {45503#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {45503#true} is VALID [2022-04-08 15:28:24,697 INFO L290 TraceCheckUtils]: 9: Hoare triple {45503#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {45503#true} is VALID [2022-04-08 15:28:24,697 INFO L290 TraceCheckUtils]: 10: Hoare triple {45503#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {45503#true} is VALID [2022-04-08 15:28:24,697 INFO L290 TraceCheckUtils]: 11: Hoare triple {45503#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {45503#true} is VALID [2022-04-08 15:28:24,697 INFO L290 TraceCheckUtils]: 12: Hoare triple {45503#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {45503#true} is VALID [2022-04-08 15:28:24,697 INFO L290 TraceCheckUtils]: 13: Hoare triple {45503#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {45503#true} is VALID [2022-04-08 15:28:24,697 INFO L290 TraceCheckUtils]: 14: Hoare triple {45503#true} assume !false; {45503#true} is VALID [2022-04-08 15:28:24,697 INFO L290 TraceCheckUtils]: 15: Hoare triple {45503#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {45503#true} is VALID [2022-04-08 15:28:24,697 INFO L290 TraceCheckUtils]: 16: Hoare triple {45503#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {45503#true} is VALID [2022-04-08 15:28:24,698 INFO L290 TraceCheckUtils]: 17: Hoare triple {45503#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {45503#true} is VALID [2022-04-08 15:28:24,698 INFO L290 TraceCheckUtils]: 18: Hoare triple {45503#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {45503#true} is VALID [2022-04-08 15:28:24,698 INFO L290 TraceCheckUtils]: 19: Hoare triple {45503#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {45503#true} is VALID [2022-04-08 15:28:24,698 INFO L290 TraceCheckUtils]: 20: Hoare triple {45503#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {45503#true} is VALID [2022-04-08 15:28:24,698 INFO L290 TraceCheckUtils]: 21: Hoare triple {45503#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {45503#true} is VALID [2022-04-08 15:28:24,698 INFO L290 TraceCheckUtils]: 22: Hoare triple {45503#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {45503#true} is VALID [2022-04-08 15:28:24,698 INFO L290 TraceCheckUtils]: 23: Hoare triple {45503#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {45503#true} is VALID [2022-04-08 15:28:24,698 INFO L290 TraceCheckUtils]: 24: Hoare triple {45503#true} assume 8464 == #t~mem55;havoc #t~mem55; {45503#true} is VALID [2022-04-08 15:28:24,698 INFO L290 TraceCheckUtils]: 25: Hoare triple {45503#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {45503#true} is VALID [2022-04-08 15:28:24,698 INFO L290 TraceCheckUtils]: 26: Hoare triple {45503#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {45503#true} is VALID [2022-04-08 15:28:24,699 INFO L290 TraceCheckUtils]: 27: Hoare triple {45503#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {45508#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:28:24,700 INFO L290 TraceCheckUtils]: 28: Hoare triple {45508#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {45508#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:28:24,700 INFO L290 TraceCheckUtils]: 29: Hoare triple {45508#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {45508#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:28:24,701 INFO L290 TraceCheckUtils]: 30: Hoare triple {45508#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} ~skip~0 := 0; {45508#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:28:24,701 INFO L290 TraceCheckUtils]: 31: Hoare triple {45508#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {45508#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:28:24,701 INFO L290 TraceCheckUtils]: 32: Hoare triple {45508#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {45508#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:28:24,702 INFO L290 TraceCheckUtils]: 33: Hoare triple {45508#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {45508#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:28:24,702 INFO L290 TraceCheckUtils]: 34: Hoare triple {45508#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {45508#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:28:24,703 INFO L290 TraceCheckUtils]: 35: Hoare triple {45508#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {45508#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:28:24,703 INFO L290 TraceCheckUtils]: 36: Hoare triple {45508#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {45509#(not (= |ssl3_accept_#t~mem51| 8195))} is VALID [2022-04-08 15:28:24,703 INFO L290 TraceCheckUtils]: 37: Hoare triple {45509#(not (= |ssl3_accept_#t~mem51| 8195))} assume 8195 == #t~mem51;havoc #t~mem51; {45504#false} is VALID [2022-04-08 15:28:24,703 INFO L290 TraceCheckUtils]: 38: Hoare triple {45504#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:28:24,704 INFO L290 TraceCheckUtils]: 39: Hoare triple {45504#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {45504#false} is VALID [2022-04-08 15:28:24,704 INFO L290 TraceCheckUtils]: 40: Hoare triple {45504#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:28:24,704 INFO L290 TraceCheckUtils]: 41: Hoare triple {45504#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {45504#false} is VALID [2022-04-08 15:28:24,704 INFO L290 TraceCheckUtils]: 42: Hoare triple {45504#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {45504#false} is VALID [2022-04-08 15:28:24,704 INFO L290 TraceCheckUtils]: 43: Hoare triple {45504#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:28:24,704 INFO L290 TraceCheckUtils]: 44: Hoare triple {45504#false} assume 12292 != #t~mem85;havoc #t~mem85; {45504#false} is VALID [2022-04-08 15:28:24,704 INFO L290 TraceCheckUtils]: 45: Hoare triple {45504#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 72 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem87 := read~int(#t~mem86.base, 128 + #t~mem86.offset, 4);call write~int(1 + #t~mem87, #t~mem86.base, 128 + #t~mem86.offset, 4);havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87; {45504#false} is VALID [2022-04-08 15:28:24,704 INFO L290 TraceCheckUtils]: 46: Hoare triple {45504#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {45504#false} is VALID [2022-04-08 15:28:24,704 INFO L290 TraceCheckUtils]: 47: Hoare triple {45504#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {45504#false} is VALID [2022-04-08 15:28:24,704 INFO L290 TraceCheckUtils]: 48: Hoare triple {45504#false} ~skip~0 := 0; {45504#false} is VALID [2022-04-08 15:28:24,704 INFO L290 TraceCheckUtils]: 49: Hoare triple {45504#false} assume !false; {45504#false} is VALID [2022-04-08 15:28:24,705 INFO L290 TraceCheckUtils]: 50: Hoare triple {45504#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:28:24,705 INFO L290 TraceCheckUtils]: 51: Hoare triple {45504#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:28:24,705 INFO L290 TraceCheckUtils]: 52: Hoare triple {45504#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:28:24,705 INFO L290 TraceCheckUtils]: 53: Hoare triple {45504#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:28:24,705 INFO L290 TraceCheckUtils]: 54: Hoare triple {45504#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:28:24,705 INFO L290 TraceCheckUtils]: 55: Hoare triple {45504#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:28:24,705 INFO L290 TraceCheckUtils]: 56: Hoare triple {45504#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:28:24,705 INFO L290 TraceCheckUtils]: 57: Hoare triple {45504#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:28:24,705 INFO L290 TraceCheckUtils]: 58: Hoare triple {45504#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:28:24,705 INFO L290 TraceCheckUtils]: 59: Hoare triple {45504#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:28:24,705 INFO L290 TraceCheckUtils]: 60: Hoare triple {45504#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:28:24,705 INFO L290 TraceCheckUtils]: 61: Hoare triple {45504#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:28:24,706 INFO L290 TraceCheckUtils]: 62: Hoare triple {45504#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:28:24,706 INFO L290 TraceCheckUtils]: 63: Hoare triple {45504#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:28:24,706 INFO L290 TraceCheckUtils]: 64: Hoare triple {45504#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:28:24,706 INFO L290 TraceCheckUtils]: 65: Hoare triple {45504#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:28:24,706 INFO L290 TraceCheckUtils]: 66: Hoare triple {45504#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:28:24,706 INFO L290 TraceCheckUtils]: 67: Hoare triple {45504#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:28:24,706 INFO L290 TraceCheckUtils]: 68: Hoare triple {45504#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:28:24,706 INFO L290 TraceCheckUtils]: 69: Hoare triple {45504#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:28:24,706 INFO L290 TraceCheckUtils]: 70: Hoare triple {45504#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:28:24,706 INFO L290 TraceCheckUtils]: 71: Hoare triple {45504#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:28:24,706 INFO L290 TraceCheckUtils]: 72: Hoare triple {45504#false} assume 8448 == #t~mem68;havoc #t~mem68; {45504#false} is VALID [2022-04-08 15:28:24,706 INFO L290 TraceCheckUtils]: 73: Hoare triple {45504#false} assume !(~num1~0 > 0); {45504#false} is VALID [2022-04-08 15:28:24,707 INFO L290 TraceCheckUtils]: 74: Hoare triple {45504#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem133 := read~int(#t~mem132.base, 904 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 72 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {45504#false} is VALID [2022-04-08 15:28:24,707 INFO L290 TraceCheckUtils]: 75: Hoare triple {45504#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {45504#false} is VALID [2022-04-08 15:28:24,707 INFO L290 TraceCheckUtils]: 76: Hoare triple {45504#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {45504#false} is VALID [2022-04-08 15:28:24,707 INFO L290 TraceCheckUtils]: 77: Hoare triple {45504#false} ~skip~0 := 0; {45504#false} is VALID [2022-04-08 15:28:24,707 INFO L290 TraceCheckUtils]: 78: Hoare triple {45504#false} assume !false; {45504#false} is VALID [2022-04-08 15:28:24,707 INFO L290 TraceCheckUtils]: 79: Hoare triple {45504#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:28:24,707 INFO L290 TraceCheckUtils]: 80: Hoare triple {45504#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:28:24,707 INFO L290 TraceCheckUtils]: 81: Hoare triple {45504#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:28:24,707 INFO L290 TraceCheckUtils]: 82: Hoare triple {45504#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:28:24,707 INFO L290 TraceCheckUtils]: 83: Hoare triple {45504#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:28:24,707 INFO L290 TraceCheckUtils]: 84: Hoare triple {45504#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:28:24,708 INFO L290 TraceCheckUtils]: 85: Hoare triple {45504#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:28:24,708 INFO L290 TraceCheckUtils]: 86: Hoare triple {45504#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:28:24,708 INFO L290 TraceCheckUtils]: 87: Hoare triple {45504#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:28:24,708 INFO L290 TraceCheckUtils]: 88: Hoare triple {45504#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:28:24,708 INFO L290 TraceCheckUtils]: 89: Hoare triple {45504#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:28:24,708 INFO L290 TraceCheckUtils]: 90: Hoare triple {45504#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:28:24,708 INFO L290 TraceCheckUtils]: 91: Hoare triple {45504#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:28:24,708 INFO L290 TraceCheckUtils]: 92: Hoare triple {45504#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:28:24,708 INFO L290 TraceCheckUtils]: 93: Hoare triple {45504#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:28:24,708 INFO L290 TraceCheckUtils]: 94: Hoare triple {45504#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:28:24,708 INFO L290 TraceCheckUtils]: 95: Hoare triple {45504#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:28:24,708 INFO L290 TraceCheckUtils]: 96: Hoare triple {45504#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:28:24,709 INFO L290 TraceCheckUtils]: 97: Hoare triple {45504#false} assume 8544 == #t~mem64;havoc #t~mem64; {45504#false} is VALID [2022-04-08 15:28:24,709 INFO L290 TraceCheckUtils]: 98: Hoare triple {45504#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:28:24,709 INFO L290 TraceCheckUtils]: 99: Hoare triple {45504#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {45504#false} is VALID [2022-04-08 15:28:24,709 INFO L290 TraceCheckUtils]: 100: Hoare triple {45504#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {45504#false} is VALID [2022-04-08 15:28:24,709 INFO L290 TraceCheckUtils]: 101: Hoare triple {45504#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {45504#false} is VALID [2022-04-08 15:28:24,709 INFO L290 TraceCheckUtils]: 102: Hoare triple {45504#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {45504#false} is VALID [2022-04-08 15:28:24,709 INFO L290 TraceCheckUtils]: 103: Hoare triple {45504#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {45504#false} is VALID [2022-04-08 15:28:24,709 INFO L290 TraceCheckUtils]: 104: Hoare triple {45504#false} assume 7 == ~blastFlag~0; {45504#false} is VALID [2022-04-08 15:28:24,709 INFO L290 TraceCheckUtils]: 105: Hoare triple {45504#false} assume !false; {45504#false} is VALID [2022-04-08 15:28:24,710 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-04-08 15:28:24,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:28:24,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320865858] [2022-04-08 15:28:24,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320865858] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:28:24,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:28:24,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:28:24,710 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:28:24,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [487140463] [2022-04-08 15:28:24,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [487140463] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:28:24,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:28:24,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:28:24,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656012179] [2022-04-08 15:28:24,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:28:24,711 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 106 [2022-04-08 15:28:24,711 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:28:24,712 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:28:24,774 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:28:24,774 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:28:24,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:28:24,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:28:24,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:28:24,775 INFO L87 Difference]: Start difference. First operand 325 states and 494 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:28:28,902 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:28:30,932 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:28:32,958 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:28:34,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:28:34,171 INFO L93 Difference]: Finished difference Result 692 states and 1055 transitions. [2022-04-08 15:28:34,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:28:34,171 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 106 [2022-04-08 15:28:34,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:28:34,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:28:34,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 575 transitions. [2022-04-08 15:28:34,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:28:34,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 575 transitions. [2022-04-08 15:28:34,175 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 575 transitions. [2022-04-08 15:28:34,563 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 575 edges. 575 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:28:34,570 INFO L225 Difference]: With dead ends: 692 [2022-04-08 15:28:34,570 INFO L226 Difference]: Without dead ends: 393 [2022-04-08 15:28:34,570 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 15:28:34,571 INFO L913 BasicCegarLoop]: 154 mSDtfsCounter, 134 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 51 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-04-08 15:28:34,571 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 416 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 487 Invalid, 3 Unknown, 0 Unchecked, 6.8s Time] [2022-04-08 15:28:34,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2022-04-08 15:28:34,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 325. [2022-04-08 15:28:34,589 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:28:34,590 INFO L82 GeneralOperation]: Start isEquivalent. First operand 393 states. Second operand has 325 states, 320 states have (on average 1.5125) internal successors, (484), 320 states have internal predecessors, (484), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:28:34,590 INFO L74 IsIncluded]: Start isIncluded. First operand 393 states. Second operand has 325 states, 320 states have (on average 1.5125) internal successors, (484), 320 states have internal predecessors, (484), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:28:34,591 INFO L87 Difference]: Start difference. First operand 393 states. Second operand has 325 states, 320 states have (on average 1.5125) internal successors, (484), 320 states have internal predecessors, (484), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:28:34,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:28:34,599 INFO L93 Difference]: Finished difference Result 393 states and 585 transitions. [2022-04-08 15:28:34,599 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 585 transitions. [2022-04-08 15:28:34,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:28:34,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:28:34,600 INFO L74 IsIncluded]: Start isIncluded. First operand has 325 states, 320 states have (on average 1.5125) internal successors, (484), 320 states have internal predecessors, (484), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 393 states. [2022-04-08 15:28:34,601 INFO L87 Difference]: Start difference. First operand has 325 states, 320 states have (on average 1.5125) internal successors, (484), 320 states have internal predecessors, (484), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 393 states. [2022-04-08 15:28:34,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:28:34,610 INFO L93 Difference]: Finished difference Result 393 states and 585 transitions. [2022-04-08 15:28:34,610 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 585 transitions. [2022-04-08 15:28:34,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:28:34,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:28:34,610 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:28:34,610 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:28:34,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 320 states have (on average 1.5125) internal successors, (484), 320 states have internal predecessors, (484), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:28:34,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 488 transitions. [2022-04-08 15:28:34,619 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 488 transitions. Word has length 106 [2022-04-08 15:28:34,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:28:34,619 INFO L478 AbstractCegarLoop]: Abstraction has 325 states and 488 transitions. [2022-04-08 15:28:34,619 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:28:34,619 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 325 states and 488 transitions. [2022-04-08 15:28:35,143 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 488 edges. 488 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:28:35,143 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 488 transitions. [2022-04-08 15:28:35,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-04-08 15:28:35,144 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:28:35,144 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:28:35,144 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-08 15:28:35,144 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:28:35,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:28:35,144 INFO L85 PathProgramCache]: Analyzing trace with hash -863733163, now seen corresponding path program 1 times [2022-04-08 15:28:35,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:28:35,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1458292086] [2022-04-08 15:28:35,219 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:28:35,219 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:28:35,219 INFO L85 PathProgramCache]: Analyzing trace with hash -863733163, now seen corresponding path program 2 times [2022-04-08 15:28:35,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:28:35,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451992017] [2022-04-08 15:28:35,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:28:35,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:28:35,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:28:35,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:28:35,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:28:35,356 INFO L290 TraceCheckUtils]: 0: Hoare triple {48342#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {48335#true} is VALID [2022-04-08 15:28:35,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {48335#true} assume true; {48335#true} is VALID [2022-04-08 15:28:35,356 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {48335#true} {48335#true} #690#return; {48335#true} is VALID [2022-04-08 15:28:35,357 INFO L272 TraceCheckUtils]: 0: Hoare triple {48335#true} call ULTIMATE.init(); {48342#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:28:35,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {48342#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {48335#true} is VALID [2022-04-08 15:28:35,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {48335#true} assume true; {48335#true} is VALID [2022-04-08 15:28:35,358 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48335#true} {48335#true} #690#return; {48335#true} is VALID [2022-04-08 15:28:35,358 INFO L272 TraceCheckUtils]: 4: Hoare triple {48335#true} call #t~ret161 := main(); {48335#true} is VALID [2022-04-08 15:28:35,358 INFO L290 TraceCheckUtils]: 5: Hoare triple {48335#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {48335#true} is VALID [2022-04-08 15:28:35,358 INFO L290 TraceCheckUtils]: 6: Hoare triple {48335#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {48335#true} is VALID [2022-04-08 15:28:35,358 INFO L272 TraceCheckUtils]: 7: Hoare triple {48335#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {48335#true} is VALID [2022-04-08 15:28:35,358 INFO L290 TraceCheckUtils]: 8: Hoare triple {48335#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {48335#true} is VALID [2022-04-08 15:28:35,358 INFO L290 TraceCheckUtils]: 9: Hoare triple {48335#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {48335#true} is VALID [2022-04-08 15:28:35,358 INFO L290 TraceCheckUtils]: 10: Hoare triple {48335#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {48335#true} is VALID [2022-04-08 15:28:35,358 INFO L290 TraceCheckUtils]: 11: Hoare triple {48335#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {48335#true} is VALID [2022-04-08 15:28:35,358 INFO L290 TraceCheckUtils]: 12: Hoare triple {48335#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {48335#true} is VALID [2022-04-08 15:28:35,358 INFO L290 TraceCheckUtils]: 13: Hoare triple {48335#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {48335#true} is VALID [2022-04-08 15:28:35,358 INFO L290 TraceCheckUtils]: 14: Hoare triple {48335#true} assume !false; {48335#true} is VALID [2022-04-08 15:28:35,359 INFO L290 TraceCheckUtils]: 15: Hoare triple {48335#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-08 15:28:35,359 INFO L290 TraceCheckUtils]: 16: Hoare triple {48335#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-08 15:28:35,359 INFO L290 TraceCheckUtils]: 17: Hoare triple {48335#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-08 15:28:35,359 INFO L290 TraceCheckUtils]: 18: Hoare triple {48335#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-08 15:28:35,359 INFO L290 TraceCheckUtils]: 19: Hoare triple {48335#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-08 15:28:35,359 INFO L290 TraceCheckUtils]: 20: Hoare triple {48335#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-08 15:28:35,359 INFO L290 TraceCheckUtils]: 21: Hoare triple {48335#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-08 15:28:35,359 INFO L290 TraceCheckUtils]: 22: Hoare triple {48335#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-08 15:28:35,359 INFO L290 TraceCheckUtils]: 23: Hoare triple {48335#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-08 15:28:35,359 INFO L290 TraceCheckUtils]: 24: Hoare triple {48335#true} assume 8464 == #t~mem55;havoc #t~mem55; {48335#true} is VALID [2022-04-08 15:28:35,359 INFO L290 TraceCheckUtils]: 25: Hoare triple {48335#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {48335#true} is VALID [2022-04-08 15:28:35,359 INFO L290 TraceCheckUtils]: 26: Hoare triple {48335#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {48335#true} is VALID [2022-04-08 15:28:35,359 INFO L290 TraceCheckUtils]: 27: Hoare triple {48335#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {48335#true} is VALID [2022-04-08 15:28:35,359 INFO L290 TraceCheckUtils]: 28: Hoare triple {48335#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {48335#true} is VALID [2022-04-08 15:28:35,360 INFO L290 TraceCheckUtils]: 29: Hoare triple {48335#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {48335#true} is VALID [2022-04-08 15:28:35,360 INFO L290 TraceCheckUtils]: 30: Hoare triple {48335#true} ~skip~0 := 0; {48335#true} is VALID [2022-04-08 15:28:35,360 INFO L290 TraceCheckUtils]: 31: Hoare triple {48335#true} assume !false; {48335#true} is VALID [2022-04-08 15:28:35,360 INFO L290 TraceCheckUtils]: 32: Hoare triple {48335#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-08 15:28:35,360 INFO L290 TraceCheckUtils]: 33: Hoare triple {48335#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-08 15:28:35,360 INFO L290 TraceCheckUtils]: 34: Hoare triple {48335#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-08 15:28:35,360 INFO L290 TraceCheckUtils]: 35: Hoare triple {48335#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-08 15:28:35,360 INFO L290 TraceCheckUtils]: 36: Hoare triple {48335#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-08 15:28:35,360 INFO L290 TraceCheckUtils]: 37: Hoare triple {48335#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-08 15:28:35,360 INFO L290 TraceCheckUtils]: 38: Hoare triple {48335#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-08 15:28:35,360 INFO L290 TraceCheckUtils]: 39: Hoare triple {48335#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-08 15:28:35,360 INFO L290 TraceCheckUtils]: 40: Hoare triple {48335#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-08 15:28:35,360 INFO L290 TraceCheckUtils]: 41: Hoare triple {48335#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-08 15:28:35,361 INFO L290 TraceCheckUtils]: 42: Hoare triple {48335#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-08 15:28:35,361 INFO L290 TraceCheckUtils]: 43: Hoare triple {48335#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-08 15:28:35,361 INFO L290 TraceCheckUtils]: 44: Hoare triple {48335#true} assume 8496 == #t~mem58;havoc #t~mem58; {48335#true} is VALID [2022-04-08 15:28:35,361 INFO L290 TraceCheckUtils]: 45: Hoare triple {48335#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {48335#true} is VALID [2022-04-08 15:28:35,361 INFO L290 TraceCheckUtils]: 46: Hoare triple {48335#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {48335#true} is VALID [2022-04-08 15:28:35,361 INFO L290 TraceCheckUtils]: 47: Hoare triple {48335#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {48335#true} is VALID [2022-04-08 15:28:35,362 INFO L290 TraceCheckUtils]: 48: Hoare triple {48335#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:28:35,363 INFO L290 TraceCheckUtils]: 49: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:28:35,363 INFO L290 TraceCheckUtils]: 50: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:28:35,364 INFO L290 TraceCheckUtils]: 51: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:28:35,364 INFO L290 TraceCheckUtils]: 52: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} ~skip~0 := 0; {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:28:35,365 INFO L290 TraceCheckUtils]: 53: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:28:35,365 INFO L290 TraceCheckUtils]: 54: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:28:35,365 INFO L290 TraceCheckUtils]: 55: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:28:35,366 INFO L290 TraceCheckUtils]: 56: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:28:35,366 INFO L290 TraceCheckUtils]: 57: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:28:35,367 INFO L290 TraceCheckUtils]: 58: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:28:35,367 INFO L290 TraceCheckUtils]: 59: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:28:35,367 INFO L290 TraceCheckUtils]: 60: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:28:35,368 INFO L290 TraceCheckUtils]: 61: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:28:35,368 INFO L290 TraceCheckUtils]: 62: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:28:35,369 INFO L290 TraceCheckUtils]: 63: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:28:35,369 INFO L290 TraceCheckUtils]: 64: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:28:35,369 INFO L290 TraceCheckUtils]: 65: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:28:35,370 INFO L290 TraceCheckUtils]: 66: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:28:35,370 INFO L290 TraceCheckUtils]: 67: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:28:35,371 INFO L290 TraceCheckUtils]: 68: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:28:35,371 INFO L290 TraceCheckUtils]: 69: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:28:35,371 INFO L290 TraceCheckUtils]: 70: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:28:35,372 INFO L290 TraceCheckUtils]: 71: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:28:35,372 INFO L290 TraceCheckUtils]: 72: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:28:35,373 INFO L290 TraceCheckUtils]: 73: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:28:35,373 INFO L290 TraceCheckUtils]: 74: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:28:35,373 INFO L290 TraceCheckUtils]: 75: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {48341#(not (= 8448 |ssl3_accept_#t~mem68|))} is VALID [2022-04-08 15:28:35,374 INFO L290 TraceCheckUtils]: 76: Hoare triple {48341#(not (= 8448 |ssl3_accept_#t~mem68|))} assume 8448 == #t~mem68;havoc #t~mem68; {48336#false} is VALID [2022-04-08 15:28:35,374 INFO L290 TraceCheckUtils]: 77: Hoare triple {48336#false} assume !(~num1~0 > 0); {48336#false} is VALID [2022-04-08 15:28:35,374 INFO L290 TraceCheckUtils]: 78: Hoare triple {48336#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem133 := read~int(#t~mem132.base, 904 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 72 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {48336#false} is VALID [2022-04-08 15:28:35,374 INFO L290 TraceCheckUtils]: 79: Hoare triple {48336#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {48336#false} is VALID [2022-04-08 15:28:35,374 INFO L290 TraceCheckUtils]: 80: Hoare triple {48336#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {48336#false} is VALID [2022-04-08 15:28:35,374 INFO L290 TraceCheckUtils]: 81: Hoare triple {48336#false} ~skip~0 := 0; {48336#false} is VALID [2022-04-08 15:28:35,374 INFO L290 TraceCheckUtils]: 82: Hoare triple {48336#false} assume !false; {48336#false} is VALID [2022-04-08 15:28:35,374 INFO L290 TraceCheckUtils]: 83: Hoare triple {48336#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {48336#false} is VALID [2022-04-08 15:28:35,374 INFO L290 TraceCheckUtils]: 84: Hoare triple {48336#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {48336#false} is VALID [2022-04-08 15:28:35,374 INFO L290 TraceCheckUtils]: 85: Hoare triple {48336#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {48336#false} is VALID [2022-04-08 15:28:35,374 INFO L290 TraceCheckUtils]: 86: Hoare triple {48336#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {48336#false} is VALID [2022-04-08 15:28:35,374 INFO L290 TraceCheckUtils]: 87: Hoare triple {48336#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {48336#false} is VALID [2022-04-08 15:28:35,375 INFO L290 TraceCheckUtils]: 88: Hoare triple {48336#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {48336#false} is VALID [2022-04-08 15:28:35,375 INFO L290 TraceCheckUtils]: 89: Hoare triple {48336#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {48336#false} is VALID [2022-04-08 15:28:35,375 INFO L290 TraceCheckUtils]: 90: Hoare triple {48336#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {48336#false} is VALID [2022-04-08 15:28:35,375 INFO L290 TraceCheckUtils]: 91: Hoare triple {48336#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {48336#false} is VALID [2022-04-08 15:28:35,375 INFO L290 TraceCheckUtils]: 92: Hoare triple {48336#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {48336#false} is VALID [2022-04-08 15:28:35,375 INFO L290 TraceCheckUtils]: 93: Hoare triple {48336#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {48336#false} is VALID [2022-04-08 15:28:35,375 INFO L290 TraceCheckUtils]: 94: Hoare triple {48336#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {48336#false} is VALID [2022-04-08 15:28:35,375 INFO L290 TraceCheckUtils]: 95: Hoare triple {48336#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {48336#false} is VALID [2022-04-08 15:28:35,375 INFO L290 TraceCheckUtils]: 96: Hoare triple {48336#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {48336#false} is VALID [2022-04-08 15:28:35,375 INFO L290 TraceCheckUtils]: 97: Hoare triple {48336#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {48336#false} is VALID [2022-04-08 15:28:35,375 INFO L290 TraceCheckUtils]: 98: Hoare triple {48336#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {48336#false} is VALID [2022-04-08 15:28:35,375 INFO L290 TraceCheckUtils]: 99: Hoare triple {48336#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {48336#false} is VALID [2022-04-08 15:28:35,375 INFO L290 TraceCheckUtils]: 100: Hoare triple {48336#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {48336#false} is VALID [2022-04-08 15:28:35,376 INFO L290 TraceCheckUtils]: 101: Hoare triple {48336#false} assume 8544 == #t~mem64;havoc #t~mem64; {48336#false} is VALID [2022-04-08 15:28:35,376 INFO L290 TraceCheckUtils]: 102: Hoare triple {48336#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {48336#false} is VALID [2022-04-08 15:28:35,376 INFO L290 TraceCheckUtils]: 103: Hoare triple {48336#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {48336#false} is VALID [2022-04-08 15:28:35,376 INFO L290 TraceCheckUtils]: 104: Hoare triple {48336#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {48336#false} is VALID [2022-04-08 15:28:35,376 INFO L290 TraceCheckUtils]: 105: Hoare triple {48336#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {48336#false} is VALID [2022-04-08 15:28:35,376 INFO L290 TraceCheckUtils]: 106: Hoare triple {48336#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {48336#false} is VALID [2022-04-08 15:28:35,376 INFO L290 TraceCheckUtils]: 107: Hoare triple {48336#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {48336#false} is VALID [2022-04-08 15:28:35,376 INFO L290 TraceCheckUtils]: 108: Hoare triple {48336#false} assume 7 == ~blastFlag~0; {48336#false} is VALID [2022-04-08 15:28:35,376 INFO L290 TraceCheckUtils]: 109: Hoare triple {48336#false} assume !false; {48336#false} is VALID [2022-04-08 15:28:35,377 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-08 15:28:35,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:28:35,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451992017] [2022-04-08 15:28:35,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451992017] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:28:35,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:28:35,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:28:35,378 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:28:35,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1458292086] [2022-04-08 15:28:35,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1458292086] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:28:35,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:28:35,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:28:35,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383586790] [2022-04-08 15:28:35,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:28:35,378 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 110 [2022-04-08 15:28:35,379 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:28:35,379 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:28:35,461 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:28:35,462 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:28:35,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:28:35,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:28:35,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:28:35,463 INFO L87 Difference]: Start difference. First operand 325 states and 488 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:28:37,774 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:28:39,779 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:28:44,964 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:28:46,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:28:46,119 INFO L93 Difference]: Finished difference Result 768 states and 1165 transitions. [2022-04-08 15:28:46,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:28:46,119 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 110 [2022-04-08 15:28:46,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:28:46,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:28:46,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 570 transitions. [2022-04-08 15:28:46,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:28:46,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 570 transitions. [2022-04-08 15:28:46,124 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 570 transitions. [2022-04-08 15:28:46,501 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 570 edges. 570 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:28:46,510 INFO L225 Difference]: With dead ends: 768 [2022-04-08 15:28:46,510 INFO L226 Difference]: Without dead ends: 469 [2022-04-08 15:28:46,511 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 15:28:46,511 INFO L913 BasicCegarLoop]: 148 mSDtfsCounter, 115 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 40 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-04-08 15:28:46,511 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 404 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 473 Invalid, 1 Unknown, 0 Unchecked, 6.2s Time] [2022-04-08 15:28:46,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2022-04-08 15:28:46,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 389. [2022-04-08 15:28:46,545 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:28:46,545 INFO L82 GeneralOperation]: Start isEquivalent. First operand 469 states. Second operand has 389 states, 384 states have (on average 1.5104166666666667) internal successors, (580), 384 states have internal predecessors, (580), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:28:46,546 INFO L74 IsIncluded]: Start isIncluded. First operand 469 states. Second operand has 389 states, 384 states have (on average 1.5104166666666667) internal successors, (580), 384 states have internal predecessors, (580), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:28:46,546 INFO L87 Difference]: Start difference. First operand 469 states. Second operand has 389 states, 384 states have (on average 1.5104166666666667) internal successors, (580), 384 states have internal predecessors, (580), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:28:46,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:28:46,557 INFO L93 Difference]: Finished difference Result 469 states and 705 transitions. [2022-04-08 15:28:46,557 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 705 transitions. [2022-04-08 15:28:46,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:28:46,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:28:46,559 INFO L74 IsIncluded]: Start isIncluded. First operand has 389 states, 384 states have (on average 1.5104166666666667) internal successors, (580), 384 states have internal predecessors, (580), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 469 states. [2022-04-08 15:28:46,559 INFO L87 Difference]: Start difference. First operand has 389 states, 384 states have (on average 1.5104166666666667) internal successors, (580), 384 states have internal predecessors, (580), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 469 states. [2022-04-08 15:28:46,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:28:46,571 INFO L93 Difference]: Finished difference Result 469 states and 705 transitions. [2022-04-08 15:28:46,571 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 705 transitions. [2022-04-08 15:28:46,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:28:46,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:28:46,572 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:28:46,572 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:28:46,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 384 states have (on average 1.5104166666666667) internal successors, (580), 384 states have internal predecessors, (580), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:28:46,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 584 transitions. [2022-04-08 15:28:46,584 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 584 transitions. Word has length 110 [2022-04-08 15:28:46,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:28:46,584 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 584 transitions. [2022-04-08 15:28:46,584 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:28:46,584 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 389 states and 584 transitions. [2022-04-08 15:28:47,202 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 584 edges. 584 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:28:47,203 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 584 transitions. [2022-04-08 15:28:47,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-04-08 15:28:47,204 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:28:47,204 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:28:47,204 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-08 15:28:47,204 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:28:47,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:28:47,204 INFO L85 PathProgramCache]: Analyzing trace with hash 352037614, now seen corresponding path program 1 times [2022-04-08 15:28:47,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:28:47,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1640414477] [2022-04-08 15:28:47,291 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:28:47,291 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:28:47,291 INFO L85 PathProgramCache]: Analyzing trace with hash 352037614, now seen corresponding path program 2 times [2022-04-08 15:28:47,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:28:47,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732076562] [2022-04-08 15:28:47,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:28:47,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:28:47,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:28:47,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:28:47,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:28:47,446 INFO L290 TraceCheckUtils]: 0: Hoare triple {51606#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {51599#true} is VALID [2022-04-08 15:28:47,446 INFO L290 TraceCheckUtils]: 1: Hoare triple {51599#true} assume true; {51599#true} is VALID [2022-04-08 15:28:47,446 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {51599#true} {51599#true} #690#return; {51599#true} is VALID [2022-04-08 15:28:47,447 INFO L272 TraceCheckUtils]: 0: Hoare triple {51599#true} call ULTIMATE.init(); {51606#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:28:47,447 INFO L290 TraceCheckUtils]: 1: Hoare triple {51606#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {51599#true} is VALID [2022-04-08 15:28:47,447 INFO L290 TraceCheckUtils]: 2: Hoare triple {51599#true} assume true; {51599#true} is VALID [2022-04-08 15:28:47,447 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51599#true} {51599#true} #690#return; {51599#true} is VALID [2022-04-08 15:28:47,447 INFO L272 TraceCheckUtils]: 4: Hoare triple {51599#true} call #t~ret161 := main(); {51599#true} is VALID [2022-04-08 15:28:47,448 INFO L290 TraceCheckUtils]: 5: Hoare triple {51599#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {51599#true} is VALID [2022-04-08 15:28:47,448 INFO L290 TraceCheckUtils]: 6: Hoare triple {51599#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {51599#true} is VALID [2022-04-08 15:28:47,448 INFO L272 TraceCheckUtils]: 7: Hoare triple {51599#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {51599#true} is VALID [2022-04-08 15:28:47,448 INFO L290 TraceCheckUtils]: 8: Hoare triple {51599#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {51599#true} is VALID [2022-04-08 15:28:47,448 INFO L290 TraceCheckUtils]: 9: Hoare triple {51599#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {51599#true} is VALID [2022-04-08 15:28:47,448 INFO L290 TraceCheckUtils]: 10: Hoare triple {51599#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {51599#true} is VALID [2022-04-08 15:28:47,448 INFO L290 TraceCheckUtils]: 11: Hoare triple {51599#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {51599#true} is VALID [2022-04-08 15:28:47,448 INFO L290 TraceCheckUtils]: 12: Hoare triple {51599#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {51599#true} is VALID [2022-04-08 15:28:47,448 INFO L290 TraceCheckUtils]: 13: Hoare triple {51599#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {51599#true} is VALID [2022-04-08 15:28:47,448 INFO L290 TraceCheckUtils]: 14: Hoare triple {51599#true} assume !false; {51599#true} is VALID [2022-04-08 15:28:47,448 INFO L290 TraceCheckUtils]: 15: Hoare triple {51599#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-08 15:28:47,448 INFO L290 TraceCheckUtils]: 16: Hoare triple {51599#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-08 15:28:47,449 INFO L290 TraceCheckUtils]: 17: Hoare triple {51599#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-08 15:28:47,449 INFO L290 TraceCheckUtils]: 18: Hoare triple {51599#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-08 15:28:47,449 INFO L290 TraceCheckUtils]: 19: Hoare triple {51599#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-08 15:28:47,449 INFO L290 TraceCheckUtils]: 20: Hoare triple {51599#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-08 15:28:47,449 INFO L290 TraceCheckUtils]: 21: Hoare triple {51599#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-08 15:28:47,449 INFO L290 TraceCheckUtils]: 22: Hoare triple {51599#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-08 15:28:47,449 INFO L290 TraceCheckUtils]: 23: Hoare triple {51599#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-08 15:28:47,449 INFO L290 TraceCheckUtils]: 24: Hoare triple {51599#true} assume 8464 == #t~mem55;havoc #t~mem55; {51599#true} is VALID [2022-04-08 15:28:47,449 INFO L290 TraceCheckUtils]: 25: Hoare triple {51599#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {51599#true} is VALID [2022-04-08 15:28:47,449 INFO L290 TraceCheckUtils]: 26: Hoare triple {51599#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {51599#true} is VALID [2022-04-08 15:28:47,449 INFO L290 TraceCheckUtils]: 27: Hoare triple {51599#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {51599#true} is VALID [2022-04-08 15:28:47,449 INFO L290 TraceCheckUtils]: 28: Hoare triple {51599#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {51599#true} is VALID [2022-04-08 15:28:47,449 INFO L290 TraceCheckUtils]: 29: Hoare triple {51599#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {51599#true} is VALID [2022-04-08 15:28:47,450 INFO L290 TraceCheckUtils]: 30: Hoare triple {51599#true} ~skip~0 := 0; {51599#true} is VALID [2022-04-08 15:28:47,450 INFO L290 TraceCheckUtils]: 31: Hoare triple {51599#true} assume !false; {51599#true} is VALID [2022-04-08 15:28:47,450 INFO L290 TraceCheckUtils]: 32: Hoare triple {51599#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-08 15:28:47,450 INFO L290 TraceCheckUtils]: 33: Hoare triple {51599#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-08 15:28:47,450 INFO L290 TraceCheckUtils]: 34: Hoare triple {51599#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-08 15:28:47,450 INFO L290 TraceCheckUtils]: 35: Hoare triple {51599#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-08 15:28:47,450 INFO L290 TraceCheckUtils]: 36: Hoare triple {51599#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-08 15:28:47,450 INFO L290 TraceCheckUtils]: 37: Hoare triple {51599#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-08 15:28:47,450 INFO L290 TraceCheckUtils]: 38: Hoare triple {51599#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-08 15:28:47,450 INFO L290 TraceCheckUtils]: 39: Hoare triple {51599#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-08 15:28:47,450 INFO L290 TraceCheckUtils]: 40: Hoare triple {51599#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-08 15:28:47,450 INFO L290 TraceCheckUtils]: 41: Hoare triple {51599#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-08 15:28:47,451 INFO L290 TraceCheckUtils]: 42: Hoare triple {51599#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-08 15:28:47,451 INFO L290 TraceCheckUtils]: 43: Hoare triple {51599#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-08 15:28:47,451 INFO L290 TraceCheckUtils]: 44: Hoare triple {51599#true} assume 8496 == #t~mem58;havoc #t~mem58; {51599#true} is VALID [2022-04-08 15:28:47,451 INFO L290 TraceCheckUtils]: 45: Hoare triple {51599#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {51599#true} is VALID [2022-04-08 15:28:47,451 INFO L290 TraceCheckUtils]: 46: Hoare triple {51599#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {51599#true} is VALID [2022-04-08 15:28:47,451 INFO L290 TraceCheckUtils]: 47: Hoare triple {51599#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {51599#true} is VALID [2022-04-08 15:28:47,452 INFO L290 TraceCheckUtils]: 48: Hoare triple {51599#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-08 15:28:47,452 INFO L290 TraceCheckUtils]: 49: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-08 15:28:47,453 INFO L290 TraceCheckUtils]: 50: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-08 15:28:47,453 INFO L290 TraceCheckUtils]: 51: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-08 15:28:47,454 INFO L290 TraceCheckUtils]: 52: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} ~skip~0 := 0; {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-08 15:28:47,454 INFO L290 TraceCheckUtils]: 53: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !false; {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-08 15:28:47,454 INFO L290 TraceCheckUtils]: 54: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-08 15:28:47,455 INFO L290 TraceCheckUtils]: 55: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-08 15:28:47,455 INFO L290 TraceCheckUtils]: 56: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-08 15:28:47,456 INFO L290 TraceCheckUtils]: 57: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-08 15:28:47,456 INFO L290 TraceCheckUtils]: 58: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-08 15:28:47,457 INFO L290 TraceCheckUtils]: 59: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-08 15:28:47,457 INFO L290 TraceCheckUtils]: 60: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-08 15:28:47,458 INFO L290 TraceCheckUtils]: 61: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-08 15:28:47,458 INFO L290 TraceCheckUtils]: 62: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-08 15:28:47,458 INFO L290 TraceCheckUtils]: 63: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-08 15:28:47,459 INFO L290 TraceCheckUtils]: 64: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-08 15:28:47,459 INFO L290 TraceCheckUtils]: 65: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-08 15:28:47,460 INFO L290 TraceCheckUtils]: 66: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-08 15:28:47,460 INFO L290 TraceCheckUtils]: 67: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-08 15:28:47,460 INFO L290 TraceCheckUtils]: 68: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-08 15:28:47,461 INFO L290 TraceCheckUtils]: 69: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-08 15:28:47,461 INFO L290 TraceCheckUtils]: 70: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-08 15:28:47,462 INFO L290 TraceCheckUtils]: 71: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-08 15:28:47,462 INFO L290 TraceCheckUtils]: 72: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-08 15:28:47,462 INFO L290 TraceCheckUtils]: 73: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-08 15:28:47,463 INFO L290 TraceCheckUtils]: 74: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-08 15:28:47,463 INFO L290 TraceCheckUtils]: 75: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-08 15:28:47,464 INFO L290 TraceCheckUtils]: 76: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-08 15:28:47,464 INFO L290 TraceCheckUtils]: 77: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-08 15:28:47,465 INFO L290 TraceCheckUtils]: 78: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-08 15:28:47,465 INFO L290 TraceCheckUtils]: 79: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-08 15:28:47,465 INFO L290 TraceCheckUtils]: 80: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {51605#(not (= |ssl3_accept_#t~mem73| 8608))} is VALID [2022-04-08 15:28:47,466 INFO L290 TraceCheckUtils]: 81: Hoare triple {51605#(not (= |ssl3_accept_#t~mem73| 8608))} assume 8608 == #t~mem73;havoc #t~mem73; {51600#false} is VALID [2022-04-08 15:28:47,466 INFO L290 TraceCheckUtils]: 82: Hoare triple {51600#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {51600#false} is VALID [2022-04-08 15:28:47,466 INFO L290 TraceCheckUtils]: 83: Hoare triple {51600#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {51600#false} is VALID [2022-04-08 15:28:47,466 INFO L290 TraceCheckUtils]: 84: Hoare triple {51600#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {51600#false} is VALID [2022-04-08 15:28:47,466 INFO L290 TraceCheckUtils]: 85: Hoare triple {51600#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {51600#false} is VALID [2022-04-08 15:28:47,466 INFO L290 TraceCheckUtils]: 86: Hoare triple {51600#false} ~skip~0 := 0; {51600#false} is VALID [2022-04-08 15:28:47,466 INFO L290 TraceCheckUtils]: 87: Hoare triple {51600#false} assume !false; {51600#false} is VALID [2022-04-08 15:28:47,466 INFO L290 TraceCheckUtils]: 88: Hoare triple {51600#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-08 15:28:47,466 INFO L290 TraceCheckUtils]: 89: Hoare triple {51600#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-08 15:28:47,467 INFO L290 TraceCheckUtils]: 90: Hoare triple {51600#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-08 15:28:47,467 INFO L290 TraceCheckUtils]: 91: Hoare triple {51600#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-08 15:28:47,467 INFO L290 TraceCheckUtils]: 92: Hoare triple {51600#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-08 15:28:47,467 INFO L290 TraceCheckUtils]: 93: Hoare triple {51600#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-08 15:28:47,467 INFO L290 TraceCheckUtils]: 94: Hoare triple {51600#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-08 15:28:47,467 INFO L290 TraceCheckUtils]: 95: Hoare triple {51600#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-08 15:28:47,467 INFO L290 TraceCheckUtils]: 96: Hoare triple {51600#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-08 15:28:47,467 INFO L290 TraceCheckUtils]: 97: Hoare triple {51600#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-08 15:28:47,467 INFO L290 TraceCheckUtils]: 98: Hoare triple {51600#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-08 15:28:47,467 INFO L290 TraceCheckUtils]: 99: Hoare triple {51600#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-08 15:28:47,467 INFO L290 TraceCheckUtils]: 100: Hoare triple {51600#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-08 15:28:47,467 INFO L290 TraceCheckUtils]: 101: Hoare triple {51600#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-08 15:28:47,467 INFO L290 TraceCheckUtils]: 102: Hoare triple {51600#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-08 15:28:47,468 INFO L290 TraceCheckUtils]: 103: Hoare triple {51600#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-08 15:28:47,468 INFO L290 TraceCheckUtils]: 104: Hoare triple {51600#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-08 15:28:47,468 INFO L290 TraceCheckUtils]: 105: Hoare triple {51600#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-08 15:28:47,468 INFO L290 TraceCheckUtils]: 106: Hoare triple {51600#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-08 15:28:47,468 INFO L290 TraceCheckUtils]: 107: Hoare triple {51600#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-08 15:28:47,468 INFO L290 TraceCheckUtils]: 108: Hoare triple {51600#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-08 15:28:47,468 INFO L290 TraceCheckUtils]: 109: Hoare triple {51600#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-08 15:28:47,468 INFO L290 TraceCheckUtils]: 110: Hoare triple {51600#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-08 15:28:47,468 INFO L290 TraceCheckUtils]: 111: Hoare triple {51600#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-08 15:28:47,468 INFO L290 TraceCheckUtils]: 112: Hoare triple {51600#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-08 15:28:47,468 INFO L290 TraceCheckUtils]: 113: Hoare triple {51600#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-08 15:28:47,468 INFO L290 TraceCheckUtils]: 114: Hoare triple {51600#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-08 15:28:47,468 INFO L290 TraceCheckUtils]: 115: Hoare triple {51600#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-08 15:28:47,469 INFO L290 TraceCheckUtils]: 116: Hoare triple {51600#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-08 15:28:47,469 INFO L290 TraceCheckUtils]: 117: Hoare triple {51600#false} assume 8640 == #t~mem75;havoc #t~mem75; {51600#false} is VALID [2022-04-08 15:28:47,469 INFO L290 TraceCheckUtils]: 118: Hoare triple {51600#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {51600#false} is VALID [2022-04-08 15:28:47,469 INFO L290 TraceCheckUtils]: 119: Hoare triple {51600#false} assume !(4 == ~blastFlag~0); {51600#false} is VALID [2022-04-08 15:28:47,469 INFO L290 TraceCheckUtils]: 120: Hoare triple {51600#false} assume 5 == ~blastFlag~0; {51600#false} is VALID [2022-04-08 15:28:47,469 INFO L290 TraceCheckUtils]: 121: Hoare triple {51600#false} assume !false; {51600#false} is VALID [2022-04-08 15:28:47,469 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-08 15:28:47,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:28:47,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732076562] [2022-04-08 15:28:47,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732076562] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:28:47,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:28:47,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:28:47,470 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:28:47,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1640414477] [2022-04-08 15:28:47,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1640414477] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:28:47,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:28:47,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:28:47,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949320979] [2022-04-08 15:28:47,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:28:47,471 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 122 [2022-04-08 15:28:47,471 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:28:47,471 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:28:47,555 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:28:47,555 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:28:47,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:28:47,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:28:47,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:28:47,556 INFO L87 Difference]: Start difference. First operand 389 states and 584 transitions. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:28:51,277 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:28:56,856 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:28:59,998 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-08 15:29:01,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:29:01,116 INFO L93 Difference]: Finished difference Result 860 states and 1297 transitions. [2022-04-08 15:29:01,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:29:01,116 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 122 [2022-04-08 15:29:01,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:29:01,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:01,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 574 transitions. [2022-04-08 15:29:01,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:01,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 574 transitions. [2022-04-08 15:29:01,120 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 574 transitions. [2022-04-08 15:29:01,493 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 574 edges. 574 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:29:01,503 INFO L225 Difference]: With dead ends: 860 [2022-04-08 15:29:01,503 INFO L226 Difference]: Without dead ends: 497 [2022-04-08 15:29:01,504 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 15:29:01,504 INFO L913 BasicCegarLoop]: 143 mSDtfsCounter, 111 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-04-08 15:29:01,504 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 394 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2022-04-08 15:29:01,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2022-04-08 15:29:01,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 426. [2022-04-08 15:29:01,533 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:29:01,534 INFO L82 GeneralOperation]: Start isEquivalent. First operand 497 states. Second operand has 426 states, 421 states have (on average 1.510688836104513) internal successors, (636), 421 states have internal predecessors, (636), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:01,534 INFO L74 IsIncluded]: Start isIncluded. First operand 497 states. Second operand has 426 states, 421 states have (on average 1.510688836104513) internal successors, (636), 421 states have internal predecessors, (636), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:01,535 INFO L87 Difference]: Start difference. First operand 497 states. Second operand has 426 states, 421 states have (on average 1.510688836104513) internal successors, (636), 421 states have internal predecessors, (636), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:01,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:29:01,547 INFO L93 Difference]: Finished difference Result 497 states and 741 transitions. [2022-04-08 15:29:01,547 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 741 transitions. [2022-04-08 15:29:01,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:29:01,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:29:01,548 INFO L74 IsIncluded]: Start isIncluded. First operand has 426 states, 421 states have (on average 1.510688836104513) internal successors, (636), 421 states have internal predecessors, (636), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 497 states. [2022-04-08 15:29:01,549 INFO L87 Difference]: Start difference. First operand has 426 states, 421 states have (on average 1.510688836104513) internal successors, (636), 421 states have internal predecessors, (636), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 497 states. [2022-04-08 15:29:01,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:29:01,561 INFO L93 Difference]: Finished difference Result 497 states and 741 transitions. [2022-04-08 15:29:01,562 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 741 transitions. [2022-04-08 15:29:01,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:29:01,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:29:01,562 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:29:01,562 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:29:01,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 421 states have (on average 1.510688836104513) internal successors, (636), 421 states have internal predecessors, (636), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:01,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 640 transitions. [2022-04-08 15:29:01,577 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 640 transitions. Word has length 122 [2022-04-08 15:29:01,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:29:01,577 INFO L478 AbstractCegarLoop]: Abstraction has 426 states and 640 transitions. [2022-04-08 15:29:01,578 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:01,578 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 426 states and 640 transitions. [2022-04-08 15:29:02,265 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 640 edges. 640 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:29:02,265 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 640 transitions. [2022-04-08 15:29:02,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-04-08 15:29:02,266 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:29:02,266 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:29:02,266 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-08 15:29:02,266 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:29:02,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:29:02,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1052782150, now seen corresponding path program 1 times [2022-04-08 15:29:02,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:29:02,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [320785801] [2022-04-08 15:29:02,348 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:29:02,348 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:29:02,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1052782150, now seen corresponding path program 2 times [2022-04-08 15:29:02,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:29:02,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815060382] [2022-04-08 15:29:02,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:29:02,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:29:02,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:29:02,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:29:02,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:29:02,487 INFO L290 TraceCheckUtils]: 0: Hoare triple {55184#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {55177#true} is VALID [2022-04-08 15:29:02,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {55177#true} assume true; {55177#true} is VALID [2022-04-08 15:29:02,487 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {55177#true} {55177#true} #690#return; {55177#true} is VALID [2022-04-08 15:29:02,488 INFO L272 TraceCheckUtils]: 0: Hoare triple {55177#true} call ULTIMATE.init(); {55184#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:29:02,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {55184#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {55177#true} is VALID [2022-04-08 15:29:02,488 INFO L290 TraceCheckUtils]: 2: Hoare triple {55177#true} assume true; {55177#true} is VALID [2022-04-08 15:29:02,488 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55177#true} {55177#true} #690#return; {55177#true} is VALID [2022-04-08 15:29:02,489 INFO L272 TraceCheckUtils]: 4: Hoare triple {55177#true} call #t~ret161 := main(); {55177#true} is VALID [2022-04-08 15:29:02,489 INFO L290 TraceCheckUtils]: 5: Hoare triple {55177#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {55177#true} is VALID [2022-04-08 15:29:02,489 INFO L290 TraceCheckUtils]: 6: Hoare triple {55177#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {55177#true} is VALID [2022-04-08 15:29:02,489 INFO L272 TraceCheckUtils]: 7: Hoare triple {55177#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {55177#true} is VALID [2022-04-08 15:29:02,489 INFO L290 TraceCheckUtils]: 8: Hoare triple {55177#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {55177#true} is VALID [2022-04-08 15:29:02,489 INFO L290 TraceCheckUtils]: 9: Hoare triple {55177#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {55177#true} is VALID [2022-04-08 15:29:02,489 INFO L290 TraceCheckUtils]: 10: Hoare triple {55177#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {55177#true} is VALID [2022-04-08 15:29:02,489 INFO L290 TraceCheckUtils]: 11: Hoare triple {55177#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {55177#true} is VALID [2022-04-08 15:29:02,489 INFO L290 TraceCheckUtils]: 12: Hoare triple {55177#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {55177#true} is VALID [2022-04-08 15:29:02,489 INFO L290 TraceCheckUtils]: 13: Hoare triple {55177#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {55177#true} is VALID [2022-04-08 15:29:02,490 INFO L290 TraceCheckUtils]: 14: Hoare triple {55177#true} assume !false; {55177#true} is VALID [2022-04-08 15:29:02,490 INFO L290 TraceCheckUtils]: 15: Hoare triple {55177#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-08 15:29:02,490 INFO L290 TraceCheckUtils]: 16: Hoare triple {55177#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-08 15:29:02,490 INFO L290 TraceCheckUtils]: 17: Hoare triple {55177#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-08 15:29:02,490 INFO L290 TraceCheckUtils]: 18: Hoare triple {55177#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-08 15:29:02,490 INFO L290 TraceCheckUtils]: 19: Hoare triple {55177#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-08 15:29:02,490 INFO L290 TraceCheckUtils]: 20: Hoare triple {55177#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-08 15:29:02,490 INFO L290 TraceCheckUtils]: 21: Hoare triple {55177#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-08 15:29:02,490 INFO L290 TraceCheckUtils]: 22: Hoare triple {55177#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-08 15:29:02,490 INFO L290 TraceCheckUtils]: 23: Hoare triple {55177#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-08 15:29:02,490 INFO L290 TraceCheckUtils]: 24: Hoare triple {55177#true} assume 8464 == #t~mem55;havoc #t~mem55; {55177#true} is VALID [2022-04-08 15:29:02,491 INFO L290 TraceCheckUtils]: 25: Hoare triple {55177#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {55177#true} is VALID [2022-04-08 15:29:02,491 INFO L290 TraceCheckUtils]: 26: Hoare triple {55177#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {55177#true} is VALID [2022-04-08 15:29:02,491 INFO L290 TraceCheckUtils]: 27: Hoare triple {55177#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {55177#true} is VALID [2022-04-08 15:29:02,491 INFO L290 TraceCheckUtils]: 28: Hoare triple {55177#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {55177#true} is VALID [2022-04-08 15:29:02,491 INFO L290 TraceCheckUtils]: 29: Hoare triple {55177#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {55177#true} is VALID [2022-04-08 15:29:02,491 INFO L290 TraceCheckUtils]: 30: Hoare triple {55177#true} ~skip~0 := 0; {55177#true} is VALID [2022-04-08 15:29:02,491 INFO L290 TraceCheckUtils]: 31: Hoare triple {55177#true} assume !false; {55177#true} is VALID [2022-04-08 15:29:02,491 INFO L290 TraceCheckUtils]: 32: Hoare triple {55177#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-08 15:29:02,491 INFO L290 TraceCheckUtils]: 33: Hoare triple {55177#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-08 15:29:02,491 INFO L290 TraceCheckUtils]: 34: Hoare triple {55177#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-08 15:29:02,492 INFO L290 TraceCheckUtils]: 35: Hoare triple {55177#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-08 15:29:02,492 INFO L290 TraceCheckUtils]: 36: Hoare triple {55177#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-08 15:29:02,492 INFO L290 TraceCheckUtils]: 37: Hoare triple {55177#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-08 15:29:02,492 INFO L290 TraceCheckUtils]: 38: Hoare triple {55177#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-08 15:29:02,492 INFO L290 TraceCheckUtils]: 39: Hoare triple {55177#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-08 15:29:02,492 INFO L290 TraceCheckUtils]: 40: Hoare triple {55177#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-08 15:29:02,492 INFO L290 TraceCheckUtils]: 41: Hoare triple {55177#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-08 15:29:02,492 INFO L290 TraceCheckUtils]: 42: Hoare triple {55177#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-08 15:29:02,492 INFO L290 TraceCheckUtils]: 43: Hoare triple {55177#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-08 15:29:02,492 INFO L290 TraceCheckUtils]: 44: Hoare triple {55177#true} assume 8496 == #t~mem58;havoc #t~mem58; {55177#true} is VALID [2022-04-08 15:29:02,493 INFO L290 TraceCheckUtils]: 45: Hoare triple {55177#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {55177#true} is VALID [2022-04-08 15:29:02,493 INFO L290 TraceCheckUtils]: 46: Hoare triple {55177#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {55177#true} is VALID [2022-04-08 15:29:02,493 INFO L290 TraceCheckUtils]: 47: Hoare triple {55177#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {55177#true} is VALID [2022-04-08 15:29:02,494 INFO L290 TraceCheckUtils]: 48: Hoare triple {55177#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-08 15:29:02,494 INFO L290 TraceCheckUtils]: 49: Hoare triple {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-08 15:29:02,495 INFO L290 TraceCheckUtils]: 50: Hoare triple {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-08 15:29:02,495 INFO L290 TraceCheckUtils]: 51: Hoare triple {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-08 15:29:02,496 INFO L290 TraceCheckUtils]: 52: Hoare triple {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} ~skip~0 := 0; {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-08 15:29:02,496 INFO L290 TraceCheckUtils]: 53: Hoare triple {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} assume !false; {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-08 15:29:02,497 INFO L290 TraceCheckUtils]: 54: Hoare triple {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-08 15:29:02,497 INFO L290 TraceCheckUtils]: 55: Hoare triple {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-08 15:29:02,497 INFO L290 TraceCheckUtils]: 56: Hoare triple {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-08 15:29:02,498 INFO L290 TraceCheckUtils]: 57: Hoare triple {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-08 15:29:02,498 INFO L290 TraceCheckUtils]: 58: Hoare triple {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-08 15:29:02,499 INFO L290 TraceCheckUtils]: 59: Hoare triple {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {55183#(not (= |ssl3_accept_#t~mem52| 8480))} is VALID [2022-04-08 15:29:02,499 INFO L290 TraceCheckUtils]: 60: Hoare triple {55183#(not (= |ssl3_accept_#t~mem52| 8480))} assume 8480 == #t~mem52;havoc #t~mem52; {55178#false} is VALID [2022-04-08 15:29:02,499 INFO L290 TraceCheckUtils]: 61: Hoare triple {55178#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {55178#false} is VALID [2022-04-08 15:29:02,499 INFO L290 TraceCheckUtils]: 62: Hoare triple {55178#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8482, #t~mem91.base, 904 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:29:02,499 INFO L290 TraceCheckUtils]: 63: Hoare triple {55178#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {55178#false} is VALID [2022-04-08 15:29:02,499 INFO L290 TraceCheckUtils]: 64: Hoare triple {55178#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {55178#false} is VALID [2022-04-08 15:29:02,500 INFO L290 TraceCheckUtils]: 65: Hoare triple {55178#false} ~skip~0 := 0; {55178#false} is VALID [2022-04-08 15:29:02,500 INFO L290 TraceCheckUtils]: 66: Hoare triple {55178#false} assume !false; {55178#false} is VALID [2022-04-08 15:29:02,500 INFO L290 TraceCheckUtils]: 67: Hoare triple {55178#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:29:02,500 INFO L290 TraceCheckUtils]: 68: Hoare triple {55178#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:29:02,500 INFO L290 TraceCheckUtils]: 69: Hoare triple {55178#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:29:02,500 INFO L290 TraceCheckUtils]: 70: Hoare triple {55178#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:29:02,500 INFO L290 TraceCheckUtils]: 71: Hoare triple {55178#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:29:02,500 INFO L290 TraceCheckUtils]: 72: Hoare triple {55178#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:29:02,500 INFO L290 TraceCheckUtils]: 73: Hoare triple {55178#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:29:02,500 INFO L290 TraceCheckUtils]: 74: Hoare triple {55178#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:29:02,501 INFO L290 TraceCheckUtils]: 75: Hoare triple {55178#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:29:02,501 INFO L290 TraceCheckUtils]: 76: Hoare triple {55178#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:29:02,501 INFO L290 TraceCheckUtils]: 77: Hoare triple {55178#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:29:02,501 INFO L290 TraceCheckUtils]: 78: Hoare triple {55178#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:29:02,501 INFO L290 TraceCheckUtils]: 79: Hoare triple {55178#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:29:02,501 INFO L290 TraceCheckUtils]: 80: Hoare triple {55178#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:29:02,501 INFO L290 TraceCheckUtils]: 81: Hoare triple {55178#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:29:02,501 INFO L290 TraceCheckUtils]: 82: Hoare triple {55178#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:29:02,501 INFO L290 TraceCheckUtils]: 83: Hoare triple {55178#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:29:02,501 INFO L290 TraceCheckUtils]: 84: Hoare triple {55178#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:29:02,502 INFO L290 TraceCheckUtils]: 85: Hoare triple {55178#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:29:02,502 INFO L290 TraceCheckUtils]: 86: Hoare triple {55178#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:29:02,502 INFO L290 TraceCheckUtils]: 87: Hoare triple {55178#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:29:02,502 INFO L290 TraceCheckUtils]: 88: Hoare triple {55178#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:29:02,502 INFO L290 TraceCheckUtils]: 89: Hoare triple {55178#false} assume 8448 == #t~mem68;havoc #t~mem68; {55178#false} is VALID [2022-04-08 15:29:02,502 INFO L290 TraceCheckUtils]: 90: Hoare triple {55178#false} assume !(~num1~0 > 0); {55178#false} is VALID [2022-04-08 15:29:02,502 INFO L290 TraceCheckUtils]: 91: Hoare triple {55178#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem133 := read~int(#t~mem132.base, 904 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 72 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {55178#false} is VALID [2022-04-08 15:29:02,502 INFO L290 TraceCheckUtils]: 92: Hoare triple {55178#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {55178#false} is VALID [2022-04-08 15:29:02,502 INFO L290 TraceCheckUtils]: 93: Hoare triple {55178#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {55178#false} is VALID [2022-04-08 15:29:02,502 INFO L290 TraceCheckUtils]: 94: Hoare triple {55178#false} ~skip~0 := 0; {55178#false} is VALID [2022-04-08 15:29:02,502 INFO L290 TraceCheckUtils]: 95: Hoare triple {55178#false} assume !false; {55178#false} is VALID [2022-04-08 15:29:02,503 INFO L290 TraceCheckUtils]: 96: Hoare triple {55178#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:29:02,503 INFO L290 TraceCheckUtils]: 97: Hoare triple {55178#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:29:02,503 INFO L290 TraceCheckUtils]: 98: Hoare triple {55178#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:29:02,503 INFO L290 TraceCheckUtils]: 99: Hoare triple {55178#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:29:02,503 INFO L290 TraceCheckUtils]: 100: Hoare triple {55178#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:29:02,503 INFO L290 TraceCheckUtils]: 101: Hoare triple {55178#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:29:02,503 INFO L290 TraceCheckUtils]: 102: Hoare triple {55178#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:29:02,503 INFO L290 TraceCheckUtils]: 103: Hoare triple {55178#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:29:02,503 INFO L290 TraceCheckUtils]: 104: Hoare triple {55178#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:29:02,503 INFO L290 TraceCheckUtils]: 105: Hoare triple {55178#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:29:02,504 INFO L290 TraceCheckUtils]: 106: Hoare triple {55178#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:29:02,504 INFO L290 TraceCheckUtils]: 107: Hoare triple {55178#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:29:02,504 INFO L290 TraceCheckUtils]: 108: Hoare triple {55178#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:29:02,504 INFO L290 TraceCheckUtils]: 109: Hoare triple {55178#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:29:02,504 INFO L290 TraceCheckUtils]: 110: Hoare triple {55178#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:29:02,504 INFO L290 TraceCheckUtils]: 111: Hoare triple {55178#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:29:02,504 INFO L290 TraceCheckUtils]: 112: Hoare triple {55178#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:29:02,504 INFO L290 TraceCheckUtils]: 113: Hoare triple {55178#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:29:02,504 INFO L290 TraceCheckUtils]: 114: Hoare triple {55178#false} assume 8544 == #t~mem64;havoc #t~mem64; {55178#false} is VALID [2022-04-08 15:29:02,504 INFO L290 TraceCheckUtils]: 115: Hoare triple {55178#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:29:02,504 INFO L290 TraceCheckUtils]: 116: Hoare triple {55178#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {55178#false} is VALID [2022-04-08 15:29:02,504 INFO L290 TraceCheckUtils]: 117: Hoare triple {55178#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {55178#false} is VALID [2022-04-08 15:29:02,505 INFO L290 TraceCheckUtils]: 118: Hoare triple {55178#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {55178#false} is VALID [2022-04-08 15:29:02,505 INFO L290 TraceCheckUtils]: 119: Hoare triple {55178#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {55178#false} is VALID [2022-04-08 15:29:02,505 INFO L290 TraceCheckUtils]: 120: Hoare triple {55178#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {55178#false} is VALID [2022-04-08 15:29:02,505 INFO L290 TraceCheckUtils]: 121: Hoare triple {55178#false} assume 7 == ~blastFlag~0; {55178#false} is VALID [2022-04-08 15:29:02,505 INFO L290 TraceCheckUtils]: 122: Hoare triple {55178#false} assume !false; {55178#false} is VALID [2022-04-08 15:29:02,505 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-04-08 15:29:02,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:29:02,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815060382] [2022-04-08 15:29:02,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815060382] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:29:02,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:29:02,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:29:02,506 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:29:02,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [320785801] [2022-04-08 15:29:02,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [320785801] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:29:02,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:29:02,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:29:02,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590749918] [2022-04-08 15:29:02,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:29:02,507 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 123 [2022-04-08 15:29:02,507 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:29:02,507 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:02,587 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:29:02,587 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:29:02,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:29:02,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:29:02,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:29:02,588 INFO L87 Difference]: Start difference. First operand 426 states and 640 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:09,031 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:29:11,062 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:29:12,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:29:12,234 INFO L93 Difference]: Finished difference Result 892 states and 1345 transitions. [2022-04-08 15:29:12,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:29:12,234 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 123 [2022-04-08 15:29:12,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:29:12,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:12,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 572 transitions. [2022-04-08 15:29:12,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:12,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 572 transitions. [2022-04-08 15:29:12,241 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 572 transitions. [2022-04-08 15:29:12,626 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 572 edges. 572 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:29:12,636 INFO L225 Difference]: With dead ends: 892 [2022-04-08 15:29:12,636 INFO L226 Difference]: Without dead ends: 492 [2022-04-08 15:29:12,636 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 15:29:12,637 INFO L913 BasicCegarLoop]: 127 mSDtfsCounter, 132 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 53 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-04-08 15:29:12,637 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 362 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 456 Invalid, 2 Unknown, 0 Unchecked, 5.8s Time] [2022-04-08 15:29:12,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2022-04-08 15:29:12,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 426. [2022-04-08 15:29:12,668 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:29:12,668 INFO L82 GeneralOperation]: Start isEquivalent. First operand 492 states. Second operand has 426 states, 421 states have (on average 1.494061757719715) internal successors, (629), 421 states have internal predecessors, (629), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:12,669 INFO L74 IsIncluded]: Start isIncluded. First operand 492 states. Second operand has 426 states, 421 states have (on average 1.494061757719715) internal successors, (629), 421 states have internal predecessors, (629), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:12,669 INFO L87 Difference]: Start difference. First operand 492 states. Second operand has 426 states, 421 states have (on average 1.494061757719715) internal successors, (629), 421 states have internal predecessors, (629), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:12,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:29:12,681 INFO L93 Difference]: Finished difference Result 492 states and 728 transitions. [2022-04-08 15:29:12,681 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 728 transitions. [2022-04-08 15:29:12,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:29:12,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:29:12,682 INFO L74 IsIncluded]: Start isIncluded. First operand has 426 states, 421 states have (on average 1.494061757719715) internal successors, (629), 421 states have internal predecessors, (629), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 492 states. [2022-04-08 15:29:12,683 INFO L87 Difference]: Start difference. First operand has 426 states, 421 states have (on average 1.494061757719715) internal successors, (629), 421 states have internal predecessors, (629), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 492 states. [2022-04-08 15:29:12,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:29:12,695 INFO L93 Difference]: Finished difference Result 492 states and 728 transitions. [2022-04-08 15:29:12,695 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 728 transitions. [2022-04-08 15:29:12,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:29:12,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:29:12,696 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:29:12,696 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:29:12,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 421 states have (on average 1.494061757719715) internal successors, (629), 421 states have internal predecessors, (629), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:12,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 633 transitions. [2022-04-08 15:29:12,706 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 633 transitions. Word has length 123 [2022-04-08 15:29:12,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:29:12,706 INFO L478 AbstractCegarLoop]: Abstraction has 426 states and 633 transitions. [2022-04-08 15:29:12,706 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:12,706 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 426 states and 633 transitions. [2022-04-08 15:29:13,267 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 633 edges. 633 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:29:13,268 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 633 transitions. [2022-04-08 15:29:13,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-04-08 15:29:13,268 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:29:13,269 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:29:13,269 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-08 15:29:13,269 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:29:13,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:29:13,269 INFO L85 PathProgramCache]: Analyzing trace with hash 988315678, now seen corresponding path program 1 times [2022-04-08 15:29:13,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:29:13,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [328210211] [2022-04-08 15:29:13,360 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:29:13,360 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:29:13,361 INFO L85 PathProgramCache]: Analyzing trace with hash 988315678, now seen corresponding path program 2 times [2022-04-08 15:29:13,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:29:13,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692746143] [2022-04-08 15:29:13,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:29:13,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:29:13,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:29:13,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:29:13,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:29:13,506 INFO L290 TraceCheckUtils]: 0: Hoare triple {58816#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {58809#true} is VALID [2022-04-08 15:29:13,506 INFO L290 TraceCheckUtils]: 1: Hoare triple {58809#true} assume true; {58809#true} is VALID [2022-04-08 15:29:13,506 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {58809#true} {58809#true} #690#return; {58809#true} is VALID [2022-04-08 15:29:13,507 INFO L272 TraceCheckUtils]: 0: Hoare triple {58809#true} call ULTIMATE.init(); {58816#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:29:13,507 INFO L290 TraceCheckUtils]: 1: Hoare triple {58816#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {58809#true} is VALID [2022-04-08 15:29:13,507 INFO L290 TraceCheckUtils]: 2: Hoare triple {58809#true} assume true; {58809#true} is VALID [2022-04-08 15:29:13,507 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58809#true} {58809#true} #690#return; {58809#true} is VALID [2022-04-08 15:29:13,507 INFO L272 TraceCheckUtils]: 4: Hoare triple {58809#true} call #t~ret161 := main(); {58809#true} is VALID [2022-04-08 15:29:13,507 INFO L290 TraceCheckUtils]: 5: Hoare triple {58809#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {58809#true} is VALID [2022-04-08 15:29:13,507 INFO L290 TraceCheckUtils]: 6: Hoare triple {58809#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {58809#true} is VALID [2022-04-08 15:29:13,507 INFO L272 TraceCheckUtils]: 7: Hoare triple {58809#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {58809#true} is VALID [2022-04-08 15:29:13,507 INFO L290 TraceCheckUtils]: 8: Hoare triple {58809#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {58809#true} is VALID [2022-04-08 15:29:13,508 INFO L290 TraceCheckUtils]: 9: Hoare triple {58809#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {58809#true} is VALID [2022-04-08 15:29:13,508 INFO L290 TraceCheckUtils]: 10: Hoare triple {58809#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {58809#true} is VALID [2022-04-08 15:29:13,508 INFO L290 TraceCheckUtils]: 11: Hoare triple {58809#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {58809#true} is VALID [2022-04-08 15:29:13,508 INFO L290 TraceCheckUtils]: 12: Hoare triple {58809#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {58809#true} is VALID [2022-04-08 15:29:13,508 INFO L290 TraceCheckUtils]: 13: Hoare triple {58809#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {58809#true} is VALID [2022-04-08 15:29:13,508 INFO L290 TraceCheckUtils]: 14: Hoare triple {58809#true} assume !false; {58809#true} is VALID [2022-04-08 15:29:13,508 INFO L290 TraceCheckUtils]: 15: Hoare triple {58809#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-08 15:29:13,508 INFO L290 TraceCheckUtils]: 16: Hoare triple {58809#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-08 15:29:13,508 INFO L290 TraceCheckUtils]: 17: Hoare triple {58809#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-08 15:29:13,508 INFO L290 TraceCheckUtils]: 18: Hoare triple {58809#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-08 15:29:13,508 INFO L290 TraceCheckUtils]: 19: Hoare triple {58809#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-08 15:29:13,508 INFO L290 TraceCheckUtils]: 20: Hoare triple {58809#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-08 15:29:13,509 INFO L290 TraceCheckUtils]: 21: Hoare triple {58809#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-08 15:29:13,509 INFO L290 TraceCheckUtils]: 22: Hoare triple {58809#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-08 15:29:13,509 INFO L290 TraceCheckUtils]: 23: Hoare triple {58809#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-08 15:29:13,509 INFO L290 TraceCheckUtils]: 24: Hoare triple {58809#true} assume 8464 == #t~mem55;havoc #t~mem55; {58809#true} is VALID [2022-04-08 15:29:13,509 INFO L290 TraceCheckUtils]: 25: Hoare triple {58809#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {58809#true} is VALID [2022-04-08 15:29:13,511 INFO L290 TraceCheckUtils]: 26: Hoare triple {58809#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {58809#true} is VALID [2022-04-08 15:29:13,511 INFO L290 TraceCheckUtils]: 27: Hoare triple {58809#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {58809#true} is VALID [2022-04-08 15:29:13,511 INFO L290 TraceCheckUtils]: 28: Hoare triple {58809#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {58809#true} is VALID [2022-04-08 15:29:13,511 INFO L290 TraceCheckUtils]: 29: Hoare triple {58809#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {58809#true} is VALID [2022-04-08 15:29:13,511 INFO L290 TraceCheckUtils]: 30: Hoare triple {58809#true} ~skip~0 := 0; {58809#true} is VALID [2022-04-08 15:29:13,511 INFO L290 TraceCheckUtils]: 31: Hoare triple {58809#true} assume !false; {58809#true} is VALID [2022-04-08 15:29:13,511 INFO L290 TraceCheckUtils]: 32: Hoare triple {58809#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-08 15:29:13,511 INFO L290 TraceCheckUtils]: 33: Hoare triple {58809#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-08 15:29:13,511 INFO L290 TraceCheckUtils]: 34: Hoare triple {58809#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-08 15:29:13,512 INFO L290 TraceCheckUtils]: 35: Hoare triple {58809#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-08 15:29:13,512 INFO L290 TraceCheckUtils]: 36: Hoare triple {58809#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-08 15:29:13,512 INFO L290 TraceCheckUtils]: 37: Hoare triple {58809#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-08 15:29:13,512 INFO L290 TraceCheckUtils]: 38: Hoare triple {58809#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-08 15:29:13,512 INFO L290 TraceCheckUtils]: 39: Hoare triple {58809#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-08 15:29:13,512 INFO L290 TraceCheckUtils]: 40: Hoare triple {58809#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-08 15:29:13,512 INFO L290 TraceCheckUtils]: 41: Hoare triple {58809#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-08 15:29:13,512 INFO L290 TraceCheckUtils]: 42: Hoare triple {58809#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-08 15:29:13,512 INFO L290 TraceCheckUtils]: 43: Hoare triple {58809#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-08 15:29:13,512 INFO L290 TraceCheckUtils]: 44: Hoare triple {58809#true} assume 8496 == #t~mem58;havoc #t~mem58; {58809#true} is VALID [2022-04-08 15:29:13,512 INFO L290 TraceCheckUtils]: 45: Hoare triple {58809#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {58809#true} is VALID [2022-04-08 15:29:13,512 INFO L290 TraceCheckUtils]: 46: Hoare triple {58809#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {58809#true} is VALID [2022-04-08 15:29:13,513 INFO L290 TraceCheckUtils]: 47: Hoare triple {58809#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {58809#true} is VALID [2022-04-08 15:29:13,513 INFO L290 TraceCheckUtils]: 48: Hoare triple {58809#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:13,514 INFO L290 TraceCheckUtils]: 49: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:13,515 INFO L290 TraceCheckUtils]: 50: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:13,515 INFO L290 TraceCheckUtils]: 51: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:13,516 INFO L290 TraceCheckUtils]: 52: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:13,516 INFO L290 TraceCheckUtils]: 53: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:13,516 INFO L290 TraceCheckUtils]: 54: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:13,517 INFO L290 TraceCheckUtils]: 55: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:13,517 INFO L290 TraceCheckUtils]: 56: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:13,518 INFO L290 TraceCheckUtils]: 57: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:13,518 INFO L290 TraceCheckUtils]: 58: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:13,518 INFO L290 TraceCheckUtils]: 59: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:13,519 INFO L290 TraceCheckUtils]: 60: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:13,519 INFO L290 TraceCheckUtils]: 61: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:13,520 INFO L290 TraceCheckUtils]: 62: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:13,520 INFO L290 TraceCheckUtils]: 63: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:13,521 INFO L290 TraceCheckUtils]: 64: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:13,521 INFO L290 TraceCheckUtils]: 65: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:13,521 INFO L290 TraceCheckUtils]: 66: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:13,522 INFO L290 TraceCheckUtils]: 67: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:13,522 INFO L290 TraceCheckUtils]: 68: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:13,523 INFO L290 TraceCheckUtils]: 69: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:13,523 INFO L290 TraceCheckUtils]: 70: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:13,524 INFO L290 TraceCheckUtils]: 71: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:13,524 INFO L290 TraceCheckUtils]: 72: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:13,524 INFO L290 TraceCheckUtils]: 73: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:13,525 INFO L290 TraceCheckUtils]: 74: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:13,525 INFO L290 TraceCheckUtils]: 75: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:13,526 INFO L290 TraceCheckUtils]: 76: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:13,526 INFO L290 TraceCheckUtils]: 77: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:13,526 INFO L290 TraceCheckUtils]: 78: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:13,527 INFO L290 TraceCheckUtils]: 79: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:13,527 INFO L290 TraceCheckUtils]: 80: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:13,528 INFO L290 TraceCheckUtils]: 81: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {58815#(= |ssl3_accept_#t~mem74| 8656)} is VALID [2022-04-08 15:29:13,528 INFO L290 TraceCheckUtils]: 82: Hoare triple {58815#(= |ssl3_accept_#t~mem74| 8656)} assume 8609 == #t~mem74;havoc #t~mem74; {58810#false} is VALID [2022-04-08 15:29:13,528 INFO L290 TraceCheckUtils]: 83: Hoare triple {58810#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {58810#false} is VALID [2022-04-08 15:29:13,528 INFO L290 TraceCheckUtils]: 84: Hoare triple {58810#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {58810#false} is VALID [2022-04-08 15:29:13,528 INFO L290 TraceCheckUtils]: 85: Hoare triple {58810#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {58810#false} is VALID [2022-04-08 15:29:13,528 INFO L290 TraceCheckUtils]: 86: Hoare triple {58810#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {58810#false} is VALID [2022-04-08 15:29:13,529 INFO L290 TraceCheckUtils]: 87: Hoare triple {58810#false} ~skip~0 := 0; {58810#false} is VALID [2022-04-08 15:29:13,529 INFO L290 TraceCheckUtils]: 88: Hoare triple {58810#false} assume !false; {58810#false} is VALID [2022-04-08 15:29:13,529 INFO L290 TraceCheckUtils]: 89: Hoare triple {58810#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-08 15:29:13,529 INFO L290 TraceCheckUtils]: 90: Hoare triple {58810#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-08 15:29:13,529 INFO L290 TraceCheckUtils]: 91: Hoare triple {58810#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-08 15:29:13,529 INFO L290 TraceCheckUtils]: 92: Hoare triple {58810#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-08 15:29:13,529 INFO L290 TraceCheckUtils]: 93: Hoare triple {58810#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-08 15:29:13,529 INFO L290 TraceCheckUtils]: 94: Hoare triple {58810#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-08 15:29:13,529 INFO L290 TraceCheckUtils]: 95: Hoare triple {58810#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-08 15:29:13,529 INFO L290 TraceCheckUtils]: 96: Hoare triple {58810#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-08 15:29:13,529 INFO L290 TraceCheckUtils]: 97: Hoare triple {58810#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-08 15:29:13,529 INFO L290 TraceCheckUtils]: 98: Hoare triple {58810#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-08 15:29:13,530 INFO L290 TraceCheckUtils]: 99: Hoare triple {58810#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-08 15:29:13,530 INFO L290 TraceCheckUtils]: 100: Hoare triple {58810#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-08 15:29:13,530 INFO L290 TraceCheckUtils]: 101: Hoare triple {58810#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-08 15:29:13,530 INFO L290 TraceCheckUtils]: 102: Hoare triple {58810#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-08 15:29:13,530 INFO L290 TraceCheckUtils]: 103: Hoare triple {58810#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-08 15:29:13,530 INFO L290 TraceCheckUtils]: 104: Hoare triple {58810#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-08 15:29:13,530 INFO L290 TraceCheckUtils]: 105: Hoare triple {58810#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-08 15:29:13,530 INFO L290 TraceCheckUtils]: 106: Hoare triple {58810#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-08 15:29:13,530 INFO L290 TraceCheckUtils]: 107: Hoare triple {58810#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-08 15:29:13,530 INFO L290 TraceCheckUtils]: 108: Hoare triple {58810#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-08 15:29:13,530 INFO L290 TraceCheckUtils]: 109: Hoare triple {58810#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-08 15:29:13,530 INFO L290 TraceCheckUtils]: 110: Hoare triple {58810#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-08 15:29:13,531 INFO L290 TraceCheckUtils]: 111: Hoare triple {58810#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-08 15:29:13,531 INFO L290 TraceCheckUtils]: 112: Hoare triple {58810#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-08 15:29:13,531 INFO L290 TraceCheckUtils]: 113: Hoare triple {58810#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-08 15:29:13,531 INFO L290 TraceCheckUtils]: 114: Hoare triple {58810#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-08 15:29:13,531 INFO L290 TraceCheckUtils]: 115: Hoare triple {58810#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-08 15:29:13,531 INFO L290 TraceCheckUtils]: 116: Hoare triple {58810#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-08 15:29:13,531 INFO L290 TraceCheckUtils]: 117: Hoare triple {58810#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-08 15:29:13,531 INFO L290 TraceCheckUtils]: 118: Hoare triple {58810#false} assume 8640 == #t~mem75;havoc #t~mem75; {58810#false} is VALID [2022-04-08 15:29:13,531 INFO L290 TraceCheckUtils]: 119: Hoare triple {58810#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {58810#false} is VALID [2022-04-08 15:29:13,531 INFO L290 TraceCheckUtils]: 120: Hoare triple {58810#false} assume !(4 == ~blastFlag~0); {58810#false} is VALID [2022-04-08 15:29:13,531 INFO L290 TraceCheckUtils]: 121: Hoare triple {58810#false} assume 5 == ~blastFlag~0; {58810#false} is VALID [2022-04-08 15:29:13,531 INFO L290 TraceCheckUtils]: 122: Hoare triple {58810#false} assume !false; {58810#false} is VALID [2022-04-08 15:29:13,532 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-08 15:29:13,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:29:13,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692746143] [2022-04-08 15:29:13,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692746143] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:29:13,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:29:13,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:29:13,532 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:29:13,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [328210211] [2022-04-08 15:29:13,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [328210211] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:29:13,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:29:13,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:29:13,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606178047] [2022-04-08 15:29:13,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:29:13,533 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 123 [2022-04-08 15:29:13,533 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:29:13,534 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:13,615 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:29:13,615 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:29:13,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:29:13,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:29:13,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:29:13,616 INFO L87 Difference]: Start difference. First operand 426 states and 633 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:17,978 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:29:20,013 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:29:22,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:29:22,867 INFO L93 Difference]: Finished difference Result 897 states and 1337 transitions. [2022-04-08 15:29:22,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:29:22,868 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 123 [2022-04-08 15:29:22,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:29:22,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:22,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 512 transitions. [2022-04-08 15:29:22,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:22,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 512 transitions. [2022-04-08 15:29:22,871 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 512 transitions. [2022-04-08 15:29:23,204 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 512 edges. 512 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:29:23,222 INFO L225 Difference]: With dead ends: 897 [2022-04-08 15:29:23,222 INFO L226 Difference]: Without dead ends: 497 [2022-04-08 15:29:23,223 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 15:29:23,223 INFO L913 BasicCegarLoop]: 199 mSDtfsCounter, 53 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 7 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-04-08 15:29:23,223 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 513 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 465 Invalid, 2 Unknown, 0 Unchecked, 5.5s Time] [2022-04-08 15:29:23,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2022-04-08 15:29:23,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 466. [2022-04-08 15:29:23,259 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:29:23,259 INFO L82 GeneralOperation]: Start isEquivalent. First operand 497 states. Second operand has 466 states, 461 states have (on average 1.492407809110629) internal successors, (688), 461 states have internal predecessors, (688), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:23,260 INFO L74 IsIncluded]: Start isIncluded. First operand 497 states. Second operand has 466 states, 461 states have (on average 1.492407809110629) internal successors, (688), 461 states have internal predecessors, (688), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:23,260 INFO L87 Difference]: Start difference. First operand 497 states. Second operand has 466 states, 461 states have (on average 1.492407809110629) internal successors, (688), 461 states have internal predecessors, (688), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:23,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:29:23,272 INFO L93 Difference]: Finished difference Result 497 states and 733 transitions. [2022-04-08 15:29:23,273 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 733 transitions. [2022-04-08 15:29:23,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:29:23,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:29:23,274 INFO L74 IsIncluded]: Start isIncluded. First operand has 466 states, 461 states have (on average 1.492407809110629) internal successors, (688), 461 states have internal predecessors, (688), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 497 states. [2022-04-08 15:29:23,274 INFO L87 Difference]: Start difference. First operand has 466 states, 461 states have (on average 1.492407809110629) internal successors, (688), 461 states have internal predecessors, (688), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 497 states. [2022-04-08 15:29:23,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:29:23,287 INFO L93 Difference]: Finished difference Result 497 states and 733 transitions. [2022-04-08 15:29:23,287 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 733 transitions. [2022-04-08 15:29:23,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:29:23,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:29:23,288 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:29:23,288 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:29:23,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 461 states have (on average 1.492407809110629) internal successors, (688), 461 states have internal predecessors, (688), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:23,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 692 transitions. [2022-04-08 15:29:23,304 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 692 transitions. Word has length 123 [2022-04-08 15:29:23,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:29:23,304 INFO L478 AbstractCegarLoop]: Abstraction has 466 states and 692 transitions. [2022-04-08 15:29:23,304 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:23,304 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 466 states and 692 transitions. [2022-04-08 15:29:23,943 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 692 edges. 692 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:29:23,943 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 692 transitions. [2022-04-08 15:29:23,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-04-08 15:29:23,951 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:29:23,952 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:29:23,952 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-08 15:29:23,952 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:29:23,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:29:23,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1572547168, now seen corresponding path program 1 times [2022-04-08 15:29:23,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:29:23,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [717000610] [2022-04-08 15:29:24,026 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:29:24,026 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:29:24,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1572547168, now seen corresponding path program 2 times [2022-04-08 15:29:24,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:29:24,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930647829] [2022-04-08 15:29:24,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:29:24,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:29:24,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:29:24,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:29:24,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:29:24,164 INFO L290 TraceCheckUtils]: 0: Hoare triple {62548#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {62541#true} is VALID [2022-04-08 15:29:24,164 INFO L290 TraceCheckUtils]: 1: Hoare triple {62541#true} assume true; {62541#true} is VALID [2022-04-08 15:29:24,164 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {62541#true} {62541#true} #690#return; {62541#true} is VALID [2022-04-08 15:29:24,165 INFO L272 TraceCheckUtils]: 0: Hoare triple {62541#true} call ULTIMATE.init(); {62548#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:29:24,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {62548#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {62541#true} is VALID [2022-04-08 15:29:24,165 INFO L290 TraceCheckUtils]: 2: Hoare triple {62541#true} assume true; {62541#true} is VALID [2022-04-08 15:29:24,165 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {62541#true} {62541#true} #690#return; {62541#true} is VALID [2022-04-08 15:29:24,165 INFO L272 TraceCheckUtils]: 4: Hoare triple {62541#true} call #t~ret161 := main(); {62541#true} is VALID [2022-04-08 15:29:24,165 INFO L290 TraceCheckUtils]: 5: Hoare triple {62541#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {62541#true} is VALID [2022-04-08 15:29:24,165 INFO L290 TraceCheckUtils]: 6: Hoare triple {62541#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {62541#true} is VALID [2022-04-08 15:29:24,165 INFO L272 TraceCheckUtils]: 7: Hoare triple {62541#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {62541#true} is VALID [2022-04-08 15:29:24,165 INFO L290 TraceCheckUtils]: 8: Hoare triple {62541#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {62541#true} is VALID [2022-04-08 15:29:24,165 INFO L290 TraceCheckUtils]: 9: Hoare triple {62541#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {62541#true} is VALID [2022-04-08 15:29:24,166 INFO L290 TraceCheckUtils]: 10: Hoare triple {62541#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {62541#true} is VALID [2022-04-08 15:29:24,166 INFO L290 TraceCheckUtils]: 11: Hoare triple {62541#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {62541#true} is VALID [2022-04-08 15:29:24,166 INFO L290 TraceCheckUtils]: 12: Hoare triple {62541#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {62541#true} is VALID [2022-04-08 15:29:24,166 INFO L290 TraceCheckUtils]: 13: Hoare triple {62541#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {62541#true} is VALID [2022-04-08 15:29:24,166 INFO L290 TraceCheckUtils]: 14: Hoare triple {62541#true} assume !false; {62541#true} is VALID [2022-04-08 15:29:24,166 INFO L290 TraceCheckUtils]: 15: Hoare triple {62541#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-08 15:29:24,166 INFO L290 TraceCheckUtils]: 16: Hoare triple {62541#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-08 15:29:24,166 INFO L290 TraceCheckUtils]: 17: Hoare triple {62541#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-08 15:29:24,166 INFO L290 TraceCheckUtils]: 18: Hoare triple {62541#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-08 15:29:24,166 INFO L290 TraceCheckUtils]: 19: Hoare triple {62541#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-08 15:29:24,166 INFO L290 TraceCheckUtils]: 20: Hoare triple {62541#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-08 15:29:24,167 INFO L290 TraceCheckUtils]: 21: Hoare triple {62541#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-08 15:29:24,167 INFO L290 TraceCheckUtils]: 22: Hoare triple {62541#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-08 15:29:24,167 INFO L290 TraceCheckUtils]: 23: Hoare triple {62541#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-08 15:29:24,167 INFO L290 TraceCheckUtils]: 24: Hoare triple {62541#true} assume 8464 == #t~mem55;havoc #t~mem55; {62541#true} is VALID [2022-04-08 15:29:24,167 INFO L290 TraceCheckUtils]: 25: Hoare triple {62541#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {62541#true} is VALID [2022-04-08 15:29:24,167 INFO L290 TraceCheckUtils]: 26: Hoare triple {62541#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {62541#true} is VALID [2022-04-08 15:29:24,167 INFO L290 TraceCheckUtils]: 27: Hoare triple {62541#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {62541#true} is VALID [2022-04-08 15:29:24,167 INFO L290 TraceCheckUtils]: 28: Hoare triple {62541#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {62541#true} is VALID [2022-04-08 15:29:24,167 INFO L290 TraceCheckUtils]: 29: Hoare triple {62541#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {62541#true} is VALID [2022-04-08 15:29:24,167 INFO L290 TraceCheckUtils]: 30: Hoare triple {62541#true} ~skip~0 := 0; {62541#true} is VALID [2022-04-08 15:29:24,167 INFO L290 TraceCheckUtils]: 31: Hoare triple {62541#true} assume !false; {62541#true} is VALID [2022-04-08 15:29:24,167 INFO L290 TraceCheckUtils]: 32: Hoare triple {62541#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-08 15:29:24,168 INFO L290 TraceCheckUtils]: 33: Hoare triple {62541#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-08 15:29:24,168 INFO L290 TraceCheckUtils]: 34: Hoare triple {62541#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-08 15:29:24,168 INFO L290 TraceCheckUtils]: 35: Hoare triple {62541#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-08 15:29:24,168 INFO L290 TraceCheckUtils]: 36: Hoare triple {62541#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-08 15:29:24,168 INFO L290 TraceCheckUtils]: 37: Hoare triple {62541#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-08 15:29:24,168 INFO L290 TraceCheckUtils]: 38: Hoare triple {62541#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-08 15:29:24,168 INFO L290 TraceCheckUtils]: 39: Hoare triple {62541#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-08 15:29:24,168 INFO L290 TraceCheckUtils]: 40: Hoare triple {62541#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-08 15:29:24,168 INFO L290 TraceCheckUtils]: 41: Hoare triple {62541#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-08 15:29:24,168 INFO L290 TraceCheckUtils]: 42: Hoare triple {62541#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-08 15:29:24,168 INFO L290 TraceCheckUtils]: 43: Hoare triple {62541#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-08 15:29:24,168 INFO L290 TraceCheckUtils]: 44: Hoare triple {62541#true} assume 8496 == #t~mem58;havoc #t~mem58; {62541#true} is VALID [2022-04-08 15:29:24,169 INFO L290 TraceCheckUtils]: 45: Hoare triple {62541#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {62541#true} is VALID [2022-04-08 15:29:24,169 INFO L290 TraceCheckUtils]: 46: Hoare triple {62541#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {62541#true} is VALID [2022-04-08 15:29:24,169 INFO L290 TraceCheckUtils]: 47: Hoare triple {62541#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {62541#true} is VALID [2022-04-08 15:29:24,169 INFO L290 TraceCheckUtils]: 48: Hoare triple {62541#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 72 + ~s.offset, 4); {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-08 15:29:24,170 INFO L290 TraceCheckUtils]: 49: Hoare triple {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} call write~int(0, ~s.base, 88 + ~s.offset, 4); {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-08 15:29:24,171 INFO L290 TraceCheckUtils]: 50: Hoare triple {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-08 15:29:24,171 INFO L290 TraceCheckUtils]: 51: Hoare triple {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-08 15:29:24,171 INFO L290 TraceCheckUtils]: 52: Hoare triple {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} ~skip~0 := 0; {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-08 15:29:24,172 INFO L290 TraceCheckUtils]: 53: Hoare triple {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !false; {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-08 15:29:24,172 INFO L290 TraceCheckUtils]: 54: Hoare triple {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-08 15:29:24,173 INFO L290 TraceCheckUtils]: 55: Hoare triple {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-08 15:29:24,173 INFO L290 TraceCheckUtils]: 56: Hoare triple {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-08 15:29:24,173 INFO L290 TraceCheckUtils]: 57: Hoare triple {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-08 15:29:24,174 INFO L290 TraceCheckUtils]: 58: Hoare triple {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-08 15:29:24,174 INFO L290 TraceCheckUtils]: 59: Hoare triple {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-08 15:29:24,175 INFO L290 TraceCheckUtils]: 60: Hoare triple {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-08 15:29:24,175 INFO L290 TraceCheckUtils]: 61: Hoare triple {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-08 15:29:24,175 INFO L290 TraceCheckUtils]: 62: Hoare triple {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-08 15:29:24,176 INFO L290 TraceCheckUtils]: 63: Hoare triple {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-08 15:29:24,176 INFO L290 TraceCheckUtils]: 64: Hoare triple {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-08 15:29:24,177 INFO L290 TraceCheckUtils]: 65: Hoare triple {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-08 15:29:24,177 INFO L290 TraceCheckUtils]: 66: Hoare triple {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-08 15:29:24,177 INFO L290 TraceCheckUtils]: 67: Hoare triple {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {62547#(= |ssl3_accept_#t~mem60| 8512)} is VALID [2022-04-08 15:29:24,178 INFO L290 TraceCheckUtils]: 68: Hoare triple {62547#(= |ssl3_accept_#t~mem60| 8512)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:29:24,178 INFO L290 TraceCheckUtils]: 69: Hoare triple {62542#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:29:24,178 INFO L290 TraceCheckUtils]: 70: Hoare triple {62542#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:29:24,178 INFO L290 TraceCheckUtils]: 71: Hoare triple {62542#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:29:24,178 INFO L290 TraceCheckUtils]: 72: Hoare triple {62542#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:29:24,178 INFO L290 TraceCheckUtils]: 73: Hoare triple {62542#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:29:24,178 INFO L290 TraceCheckUtils]: 74: Hoare triple {62542#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:29:24,178 INFO L290 TraceCheckUtils]: 75: Hoare triple {62542#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:29:24,178 INFO L290 TraceCheckUtils]: 76: Hoare triple {62542#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:29:24,178 INFO L290 TraceCheckUtils]: 77: Hoare triple {62542#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:29:24,179 INFO L290 TraceCheckUtils]: 78: Hoare triple {62542#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:29:24,179 INFO L290 TraceCheckUtils]: 79: Hoare triple {62542#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:29:24,179 INFO L290 TraceCheckUtils]: 80: Hoare triple {62542#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:29:24,179 INFO L290 TraceCheckUtils]: 81: Hoare triple {62542#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:29:24,179 INFO L290 TraceCheckUtils]: 82: Hoare triple {62542#false} assume 8609 == #t~mem74;havoc #t~mem74; {62542#false} is VALID [2022-04-08 15:29:24,179 INFO L290 TraceCheckUtils]: 83: Hoare triple {62542#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {62542#false} is VALID [2022-04-08 15:29:24,179 INFO L290 TraceCheckUtils]: 84: Hoare triple {62542#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:29:24,179 INFO L290 TraceCheckUtils]: 85: Hoare triple {62542#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {62542#false} is VALID [2022-04-08 15:29:24,179 INFO L290 TraceCheckUtils]: 86: Hoare triple {62542#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {62542#false} is VALID [2022-04-08 15:29:24,179 INFO L290 TraceCheckUtils]: 87: Hoare triple {62542#false} ~skip~0 := 0; {62542#false} is VALID [2022-04-08 15:29:24,179 INFO L290 TraceCheckUtils]: 88: Hoare triple {62542#false} assume !false; {62542#false} is VALID [2022-04-08 15:29:24,179 INFO L290 TraceCheckUtils]: 89: Hoare triple {62542#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:29:24,180 INFO L290 TraceCheckUtils]: 90: Hoare triple {62542#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:29:24,180 INFO L290 TraceCheckUtils]: 91: Hoare triple {62542#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:29:24,180 INFO L290 TraceCheckUtils]: 92: Hoare triple {62542#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:29:24,180 INFO L290 TraceCheckUtils]: 93: Hoare triple {62542#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:29:24,180 INFO L290 TraceCheckUtils]: 94: Hoare triple {62542#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:29:24,180 INFO L290 TraceCheckUtils]: 95: Hoare triple {62542#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:29:24,180 INFO L290 TraceCheckUtils]: 96: Hoare triple {62542#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:29:24,180 INFO L290 TraceCheckUtils]: 97: Hoare triple {62542#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:29:24,180 INFO L290 TraceCheckUtils]: 98: Hoare triple {62542#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:29:24,180 INFO L290 TraceCheckUtils]: 99: Hoare triple {62542#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:29:24,180 INFO L290 TraceCheckUtils]: 100: Hoare triple {62542#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:29:24,180 INFO L290 TraceCheckUtils]: 101: Hoare triple {62542#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:29:24,181 INFO L290 TraceCheckUtils]: 102: Hoare triple {62542#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:29:24,181 INFO L290 TraceCheckUtils]: 103: Hoare triple {62542#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:29:24,181 INFO L290 TraceCheckUtils]: 104: Hoare triple {62542#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:29:24,181 INFO L290 TraceCheckUtils]: 105: Hoare triple {62542#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:29:24,181 INFO L290 TraceCheckUtils]: 106: Hoare triple {62542#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:29:24,181 INFO L290 TraceCheckUtils]: 107: Hoare triple {62542#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:29:24,181 INFO L290 TraceCheckUtils]: 108: Hoare triple {62542#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:29:24,181 INFO L290 TraceCheckUtils]: 109: Hoare triple {62542#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:29:24,181 INFO L290 TraceCheckUtils]: 110: Hoare triple {62542#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:29:24,181 INFO L290 TraceCheckUtils]: 111: Hoare triple {62542#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:29:24,181 INFO L290 TraceCheckUtils]: 112: Hoare triple {62542#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:29:24,182 INFO L290 TraceCheckUtils]: 113: Hoare triple {62542#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:29:24,182 INFO L290 TraceCheckUtils]: 114: Hoare triple {62542#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:29:24,182 INFO L290 TraceCheckUtils]: 115: Hoare triple {62542#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:29:24,182 INFO L290 TraceCheckUtils]: 116: Hoare triple {62542#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:29:24,182 INFO L290 TraceCheckUtils]: 117: Hoare triple {62542#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:29:24,182 INFO L290 TraceCheckUtils]: 118: Hoare triple {62542#false} assume 8640 == #t~mem75;havoc #t~mem75; {62542#false} is VALID [2022-04-08 15:29:24,182 INFO L290 TraceCheckUtils]: 119: Hoare triple {62542#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {62542#false} is VALID [2022-04-08 15:29:24,182 INFO L290 TraceCheckUtils]: 120: Hoare triple {62542#false} assume !(4 == ~blastFlag~0); {62542#false} is VALID [2022-04-08 15:29:24,182 INFO L290 TraceCheckUtils]: 121: Hoare triple {62542#false} assume 5 == ~blastFlag~0; {62542#false} is VALID [2022-04-08 15:29:24,182 INFO L290 TraceCheckUtils]: 122: Hoare triple {62542#false} assume !false; {62542#false} is VALID [2022-04-08 15:29:24,183 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-08 15:29:24,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:29:24,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930647829] [2022-04-08 15:29:24,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930647829] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:29:24,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:29:24,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:29:24,183 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:29:24,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [717000610] [2022-04-08 15:29:24,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [717000610] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:29:24,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:29:24,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:29:24,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938983398] [2022-04-08 15:29:24,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:29:24,184 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 123 [2022-04-08 15:29:24,184 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:29:24,185 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:24,261 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:29:24,261 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:29:24,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:29:24,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:29:24,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:29:24,262 INFO L87 Difference]: Start difference. First operand 466 states and 692 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:26,283 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:29:27,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:29:27,363 INFO L93 Difference]: Finished difference Result 943 states and 1408 transitions. [2022-04-08 15:29:27,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:29:27,363 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 123 [2022-04-08 15:29:27,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:29:27,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:27,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 466 transitions. [2022-04-08 15:29:27,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:27,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 466 transitions. [2022-04-08 15:29:27,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 466 transitions. [2022-04-08 15:29:27,665 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 466 edges. 466 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:29:27,674 INFO L225 Difference]: With dead ends: 943 [2022-04-08 15:29:27,674 INFO L226 Difference]: Without dead ends: 503 [2022-04-08 15:29:27,675 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 15:29:27,676 INFO L913 BasicCegarLoop]: 238 mSDtfsCounter, 28 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 15:29:27,676 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 589 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 428 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 15:29:27,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2022-04-08 15:29:27,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 490. [2022-04-08 15:29:27,704 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:29:27,705 INFO L82 GeneralOperation]: Start isEquivalent. First operand 503 states. Second operand has 490 states, 485 states have (on average 1.4907216494845361) internal successors, (723), 485 states have internal predecessors, (723), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:27,705 INFO L74 IsIncluded]: Start isIncluded. First operand 503 states. Second operand has 490 states, 485 states have (on average 1.4907216494845361) internal successors, (723), 485 states have internal predecessors, (723), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:27,706 INFO L87 Difference]: Start difference. First operand 503 states. Second operand has 490 states, 485 states have (on average 1.4907216494845361) internal successors, (723), 485 states have internal predecessors, (723), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:27,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:29:27,714 INFO L93 Difference]: Finished difference Result 503 states and 745 transitions. [2022-04-08 15:29:27,714 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 745 transitions. [2022-04-08 15:29:27,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:29:27,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:29:27,715 INFO L74 IsIncluded]: Start isIncluded. First operand has 490 states, 485 states have (on average 1.4907216494845361) internal successors, (723), 485 states have internal predecessors, (723), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 503 states. [2022-04-08 15:29:27,716 INFO L87 Difference]: Start difference. First operand has 490 states, 485 states have (on average 1.4907216494845361) internal successors, (723), 485 states have internal predecessors, (723), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 503 states. [2022-04-08 15:29:27,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:29:27,738 INFO L93 Difference]: Finished difference Result 503 states and 745 transitions. [2022-04-08 15:29:27,738 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 745 transitions. [2022-04-08 15:29:27,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:29:27,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:29:27,738 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:29:27,738 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:29:27,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 485 states have (on average 1.4907216494845361) internal successors, (723), 485 states have internal predecessors, (723), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:27,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 727 transitions. [2022-04-08 15:29:27,751 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 727 transitions. Word has length 123 [2022-04-08 15:29:27,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:29:27,751 INFO L478 AbstractCegarLoop]: Abstraction has 490 states and 727 transitions. [2022-04-08 15:29:27,752 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:27,752 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 490 states and 727 transitions. [2022-04-08 15:29:28,405 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 727 edges. 727 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:29:28,405 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 727 transitions. [2022-04-08 15:29:28,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-08 15:29:28,406 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:29:28,406 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:29:28,406 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-08 15:29:28,407 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:29:28,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:29:28,407 INFO L85 PathProgramCache]: Analyzing trace with hash -881988740, now seen corresponding path program 1 times [2022-04-08 15:29:28,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:29:28,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [225632138] [2022-04-08 15:29:28,492 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:29:28,492 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:29:28,493 INFO L85 PathProgramCache]: Analyzing trace with hash -881988740, now seen corresponding path program 2 times [2022-04-08 15:29:28,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:29:28,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529916718] [2022-04-08 15:29:28,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:29:28,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:29:28,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:29:28,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:29:28,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:29:28,635 INFO L290 TraceCheckUtils]: 0: Hoare triple {66432#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {66425#true} is VALID [2022-04-08 15:29:28,636 INFO L290 TraceCheckUtils]: 1: Hoare triple {66425#true} assume true; {66425#true} is VALID [2022-04-08 15:29:28,636 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {66425#true} {66425#true} #690#return; {66425#true} is VALID [2022-04-08 15:29:28,637 INFO L272 TraceCheckUtils]: 0: Hoare triple {66425#true} call ULTIMATE.init(); {66432#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:29:28,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {66432#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {66425#true} is VALID [2022-04-08 15:29:28,637 INFO L290 TraceCheckUtils]: 2: Hoare triple {66425#true} assume true; {66425#true} is VALID [2022-04-08 15:29:28,637 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66425#true} {66425#true} #690#return; {66425#true} is VALID [2022-04-08 15:29:28,637 INFO L272 TraceCheckUtils]: 4: Hoare triple {66425#true} call #t~ret161 := main(); {66425#true} is VALID [2022-04-08 15:29:28,637 INFO L290 TraceCheckUtils]: 5: Hoare triple {66425#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {66425#true} is VALID [2022-04-08 15:29:28,637 INFO L290 TraceCheckUtils]: 6: Hoare triple {66425#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {66425#true} is VALID [2022-04-08 15:29:28,637 INFO L272 TraceCheckUtils]: 7: Hoare triple {66425#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {66425#true} is VALID [2022-04-08 15:29:28,637 INFO L290 TraceCheckUtils]: 8: Hoare triple {66425#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {66425#true} is VALID [2022-04-08 15:29:28,637 INFO L290 TraceCheckUtils]: 9: Hoare triple {66425#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {66425#true} is VALID [2022-04-08 15:29:28,637 INFO L290 TraceCheckUtils]: 10: Hoare triple {66425#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {66425#true} is VALID [2022-04-08 15:29:28,638 INFO L290 TraceCheckUtils]: 11: Hoare triple {66425#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {66425#true} is VALID [2022-04-08 15:29:28,638 INFO L290 TraceCheckUtils]: 12: Hoare triple {66425#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {66425#true} is VALID [2022-04-08 15:29:28,638 INFO L290 TraceCheckUtils]: 13: Hoare triple {66425#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {66425#true} is VALID [2022-04-08 15:29:28,638 INFO L290 TraceCheckUtils]: 14: Hoare triple {66425#true} assume !false; {66425#true} is VALID [2022-04-08 15:29:28,638 INFO L290 TraceCheckUtils]: 15: Hoare triple {66425#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-08 15:29:28,638 INFO L290 TraceCheckUtils]: 16: Hoare triple {66425#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-08 15:29:28,638 INFO L290 TraceCheckUtils]: 17: Hoare triple {66425#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-08 15:29:28,638 INFO L290 TraceCheckUtils]: 18: Hoare triple {66425#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-08 15:29:28,638 INFO L290 TraceCheckUtils]: 19: Hoare triple {66425#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-08 15:29:28,638 INFO L290 TraceCheckUtils]: 20: Hoare triple {66425#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-08 15:29:28,638 INFO L290 TraceCheckUtils]: 21: Hoare triple {66425#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-08 15:29:28,638 INFO L290 TraceCheckUtils]: 22: Hoare triple {66425#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-08 15:29:28,639 INFO L290 TraceCheckUtils]: 23: Hoare triple {66425#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-08 15:29:28,639 INFO L290 TraceCheckUtils]: 24: Hoare triple {66425#true} assume 8464 == #t~mem55;havoc #t~mem55; {66425#true} is VALID [2022-04-08 15:29:28,639 INFO L290 TraceCheckUtils]: 25: Hoare triple {66425#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {66425#true} is VALID [2022-04-08 15:29:28,639 INFO L290 TraceCheckUtils]: 26: Hoare triple {66425#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {66425#true} is VALID [2022-04-08 15:29:28,639 INFO L290 TraceCheckUtils]: 27: Hoare triple {66425#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {66425#true} is VALID [2022-04-08 15:29:28,639 INFO L290 TraceCheckUtils]: 28: Hoare triple {66425#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {66425#true} is VALID [2022-04-08 15:29:28,639 INFO L290 TraceCheckUtils]: 29: Hoare triple {66425#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {66425#true} is VALID [2022-04-08 15:29:28,639 INFO L290 TraceCheckUtils]: 30: Hoare triple {66425#true} ~skip~0 := 0; {66425#true} is VALID [2022-04-08 15:29:28,639 INFO L290 TraceCheckUtils]: 31: Hoare triple {66425#true} assume !false; {66425#true} is VALID [2022-04-08 15:29:28,639 INFO L290 TraceCheckUtils]: 32: Hoare triple {66425#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-08 15:29:28,639 INFO L290 TraceCheckUtils]: 33: Hoare triple {66425#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-08 15:29:28,640 INFO L290 TraceCheckUtils]: 34: Hoare triple {66425#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-08 15:29:28,640 INFO L290 TraceCheckUtils]: 35: Hoare triple {66425#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-08 15:29:28,640 INFO L290 TraceCheckUtils]: 36: Hoare triple {66425#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-08 15:29:28,640 INFO L290 TraceCheckUtils]: 37: Hoare triple {66425#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-08 15:29:28,640 INFO L290 TraceCheckUtils]: 38: Hoare triple {66425#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-08 15:29:28,640 INFO L290 TraceCheckUtils]: 39: Hoare triple {66425#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-08 15:29:28,640 INFO L290 TraceCheckUtils]: 40: Hoare triple {66425#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-08 15:29:28,640 INFO L290 TraceCheckUtils]: 41: Hoare triple {66425#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-08 15:29:28,640 INFO L290 TraceCheckUtils]: 42: Hoare triple {66425#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-08 15:29:28,640 INFO L290 TraceCheckUtils]: 43: Hoare triple {66425#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-08 15:29:28,640 INFO L290 TraceCheckUtils]: 44: Hoare triple {66425#true} assume 8496 == #t~mem58;havoc #t~mem58; {66425#true} is VALID [2022-04-08 15:29:28,640 INFO L290 TraceCheckUtils]: 45: Hoare triple {66425#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {66425#true} is VALID [2022-04-08 15:29:28,641 INFO L290 TraceCheckUtils]: 46: Hoare triple {66425#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {66425#true} is VALID [2022-04-08 15:29:28,641 INFO L290 TraceCheckUtils]: 47: Hoare triple {66425#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {66425#true} is VALID [2022-04-08 15:29:28,641 INFO L290 TraceCheckUtils]: 48: Hoare triple {66425#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:28,642 INFO L290 TraceCheckUtils]: 49: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:28,643 INFO L290 TraceCheckUtils]: 50: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:28,643 INFO L290 TraceCheckUtils]: 51: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:28,643 INFO L290 TraceCheckUtils]: 52: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:28,644 INFO L290 TraceCheckUtils]: 53: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:28,644 INFO L290 TraceCheckUtils]: 54: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:28,645 INFO L290 TraceCheckUtils]: 55: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:28,645 INFO L290 TraceCheckUtils]: 56: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:28,645 INFO L290 TraceCheckUtils]: 57: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:28,646 INFO L290 TraceCheckUtils]: 58: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:28,646 INFO L290 TraceCheckUtils]: 59: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:28,647 INFO L290 TraceCheckUtils]: 60: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:28,647 INFO L290 TraceCheckUtils]: 61: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:28,647 INFO L290 TraceCheckUtils]: 62: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:28,648 INFO L290 TraceCheckUtils]: 63: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:28,648 INFO L290 TraceCheckUtils]: 64: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:28,649 INFO L290 TraceCheckUtils]: 65: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:28,649 INFO L290 TraceCheckUtils]: 66: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:28,649 INFO L290 TraceCheckUtils]: 67: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {66431#(= |ssl3_accept_#t~mem60| 8656)} is VALID [2022-04-08 15:29:28,650 INFO L290 TraceCheckUtils]: 68: Hoare triple {66431#(= |ssl3_accept_#t~mem60| 8656)} assume 8512 == #t~mem60;havoc #t~mem60; {66426#false} is VALID [2022-04-08 15:29:28,650 INFO L290 TraceCheckUtils]: 69: Hoare triple {66426#false} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 888 + #t~mem95.offset, 8);call #t~mem97 := read~int(#t~mem96.base, 20 + #t~mem96.offset, 8); {66426#false} is VALID [2022-04-08 15:29:28,650 INFO L290 TraceCheckUtils]: 70: Hoare triple {66426#false} assume 0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 18446744073709551616;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;~skip~0 := 1; {66426#false} is VALID [2022-04-08 15:29:28,650 INFO L290 TraceCheckUtils]: 71: Hoare triple {66426#false} call write~int(8528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {66426#false} is VALID [2022-04-08 15:29:28,650 INFO L290 TraceCheckUtils]: 72: Hoare triple {66426#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {66426#false} is VALID [2022-04-08 15:29:28,650 INFO L290 TraceCheckUtils]: 73: Hoare triple {66426#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {66426#false} is VALID [2022-04-08 15:29:28,651 INFO L290 TraceCheckUtils]: 74: Hoare triple {66426#false} ~skip~0 := 0; {66426#false} is VALID [2022-04-08 15:29:28,651 INFO L290 TraceCheckUtils]: 75: Hoare triple {66426#false} assume !false; {66426#false} is VALID [2022-04-08 15:29:28,651 INFO L290 TraceCheckUtils]: 76: Hoare triple {66426#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-08 15:29:28,651 INFO L290 TraceCheckUtils]: 77: Hoare triple {66426#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-08 15:29:28,651 INFO L290 TraceCheckUtils]: 78: Hoare triple {66426#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-08 15:29:28,651 INFO L290 TraceCheckUtils]: 79: Hoare triple {66426#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-08 15:29:28,651 INFO L290 TraceCheckUtils]: 80: Hoare triple {66426#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-08 15:29:28,651 INFO L290 TraceCheckUtils]: 81: Hoare triple {66426#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-08 15:29:28,651 INFO L290 TraceCheckUtils]: 82: Hoare triple {66426#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-08 15:29:28,651 INFO L290 TraceCheckUtils]: 83: Hoare triple {66426#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-08 15:29:28,652 INFO L290 TraceCheckUtils]: 84: Hoare triple {66426#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-08 15:29:28,652 INFO L290 TraceCheckUtils]: 85: Hoare triple {66426#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-08 15:29:28,652 INFO L290 TraceCheckUtils]: 86: Hoare triple {66426#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-08 15:29:28,652 INFO L290 TraceCheckUtils]: 87: Hoare triple {66426#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-08 15:29:28,652 INFO L290 TraceCheckUtils]: 88: Hoare triple {66426#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-08 15:29:28,652 INFO L290 TraceCheckUtils]: 89: Hoare triple {66426#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-08 15:29:28,652 INFO L290 TraceCheckUtils]: 90: Hoare triple {66426#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-08 15:29:28,652 INFO L290 TraceCheckUtils]: 91: Hoare triple {66426#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-08 15:29:28,652 INFO L290 TraceCheckUtils]: 92: Hoare triple {66426#false} assume 8528 == #t~mem62;havoc #t~mem62; {66426#false} is VALID [2022-04-08 15:29:28,652 INFO L290 TraceCheckUtils]: 93: Hoare triple {66426#false} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 888 + #t~mem99.offset, 8);call #t~mem101 := read~int(#t~mem100.base, 20 + #t~mem100.offset, 8);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 332 + ~s.offset, 8); {66426#false} is VALID [2022-04-08 15:29:28,652 INFO L290 TraceCheckUtils]: 94: Hoare triple {66426#false} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 18446744073709551616;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem103.base, 935 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {66426#false} is VALID [2022-04-08 15:29:28,652 INFO L290 TraceCheckUtils]: 95: Hoare triple {66426#false} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem106 := read~int(#t~mem105.base, 935 + #t~mem105.offset, 4); {66426#false} is VALID [2022-04-08 15:29:28,653 INFO L290 TraceCheckUtils]: 96: Hoare triple {66426#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {66426#false} is VALID [2022-04-08 15:29:28,653 INFO L290 TraceCheckUtils]: 97: Hoare triple {66426#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 18446744073709551616); {66426#false} is VALID [2022-04-08 15:29:28,653 INFO L290 TraceCheckUtils]: 98: Hoare triple {66426#false} assume !(0 != ~l~0 % 18446744073709551616);~skip~0 := 1; {66426#false} is VALID [2022-04-08 15:29:28,653 INFO L290 TraceCheckUtils]: 99: Hoare triple {66426#false} call write~int(8544, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {66426#false} is VALID [2022-04-08 15:29:28,653 INFO L290 TraceCheckUtils]: 100: Hoare triple {66426#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {66426#false} is VALID [2022-04-08 15:29:28,653 INFO L290 TraceCheckUtils]: 101: Hoare triple {66426#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {66426#false} is VALID [2022-04-08 15:29:28,653 INFO L290 TraceCheckUtils]: 102: Hoare triple {66426#false} ~skip~0 := 0; {66426#false} is VALID [2022-04-08 15:29:28,653 INFO L290 TraceCheckUtils]: 103: Hoare triple {66426#false} assume !false; {66426#false} is VALID [2022-04-08 15:29:28,653 INFO L290 TraceCheckUtils]: 104: Hoare triple {66426#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-08 15:29:28,653 INFO L290 TraceCheckUtils]: 105: Hoare triple {66426#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-08 15:29:28,653 INFO L290 TraceCheckUtils]: 106: Hoare triple {66426#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-08 15:29:28,654 INFO L290 TraceCheckUtils]: 107: Hoare triple {66426#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-08 15:29:28,654 INFO L290 TraceCheckUtils]: 108: Hoare triple {66426#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-08 15:29:28,654 INFO L290 TraceCheckUtils]: 109: Hoare triple {66426#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-08 15:29:28,654 INFO L290 TraceCheckUtils]: 110: Hoare triple {66426#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-08 15:29:28,654 INFO L290 TraceCheckUtils]: 111: Hoare triple {66426#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-08 15:29:28,654 INFO L290 TraceCheckUtils]: 112: Hoare triple {66426#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-08 15:29:28,654 INFO L290 TraceCheckUtils]: 113: Hoare triple {66426#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-08 15:29:28,654 INFO L290 TraceCheckUtils]: 114: Hoare triple {66426#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-08 15:29:28,654 INFO L290 TraceCheckUtils]: 115: Hoare triple {66426#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-08 15:29:28,654 INFO L290 TraceCheckUtils]: 116: Hoare triple {66426#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-08 15:29:28,654 INFO L290 TraceCheckUtils]: 117: Hoare triple {66426#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-08 15:29:28,655 INFO L290 TraceCheckUtils]: 118: Hoare triple {66426#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-08 15:29:28,655 INFO L290 TraceCheckUtils]: 119: Hoare triple {66426#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-08 15:29:28,655 INFO L290 TraceCheckUtils]: 120: Hoare triple {66426#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-08 15:29:28,655 INFO L290 TraceCheckUtils]: 121: Hoare triple {66426#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-08 15:29:28,655 INFO L290 TraceCheckUtils]: 122: Hoare triple {66426#false} assume 8544 == #t~mem64;havoc #t~mem64; {66426#false} is VALID [2022-04-08 15:29:28,655 INFO L290 TraceCheckUtils]: 123: Hoare triple {66426#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {66426#false} is VALID [2022-04-08 15:29:28,655 INFO L290 TraceCheckUtils]: 124: Hoare triple {66426#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {66426#false} is VALID [2022-04-08 15:29:28,655 INFO L290 TraceCheckUtils]: 125: Hoare triple {66426#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {66426#false} is VALID [2022-04-08 15:29:28,655 INFO L290 TraceCheckUtils]: 126: Hoare triple {66426#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {66426#false} is VALID [2022-04-08 15:29:28,655 INFO L290 TraceCheckUtils]: 127: Hoare triple {66426#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {66426#false} is VALID [2022-04-08 15:29:28,655 INFO L290 TraceCheckUtils]: 128: Hoare triple {66426#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {66426#false} is VALID [2022-04-08 15:29:28,655 INFO L290 TraceCheckUtils]: 129: Hoare triple {66426#false} assume 7 == ~blastFlag~0; {66426#false} is VALID [2022-04-08 15:29:28,656 INFO L290 TraceCheckUtils]: 130: Hoare triple {66426#false} assume !false; {66426#false} is VALID [2022-04-08 15:29:28,656 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-04-08 15:29:28,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:29:28,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529916718] [2022-04-08 15:29:28,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529916718] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:29:28,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:29:28,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:29:28,657 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:29:28,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [225632138] [2022-04-08 15:29:28,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [225632138] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:29:28,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:29:28,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:29:28,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917330544] [2022-04-08 15:29:28,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:29:28,657 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 131 [2022-04-08 15:29:28,658 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:29:28,658 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:28,732 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:29:28,732 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:29:28,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:29:28,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:29:28,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:29:28,733 INFO L87 Difference]: Start difference. First operand 490 states and 727 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:36,183 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:29:39,668 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:29:40,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:29:40,807 INFO L93 Difference]: Finished difference Result 985 states and 1465 transitions. [2022-04-08 15:29:40,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:29:40,807 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 131 [2022-04-08 15:29:40,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:29:40,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:40,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 511 transitions. [2022-04-08 15:29:40,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:40,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 511 transitions. [2022-04-08 15:29:40,811 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 511 transitions. [2022-04-08 15:29:41,143 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 511 edges. 511 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:29:41,154 INFO L225 Difference]: With dead ends: 985 [2022-04-08 15:29:41,154 INFO L226 Difference]: Without dead ends: 521 [2022-04-08 15:29:41,154 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 15:29:41,155 INFO L913 BasicCegarLoop]: 206 mSDtfsCounter, 66 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-04-08 15:29:41,155 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 527 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-04-08 15:29:41,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2022-04-08 15:29:41,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 490. [2022-04-08 15:29:41,184 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:29:41,185 INFO L82 GeneralOperation]: Start isEquivalent. First operand 521 states. Second operand has 490 states, 485 states have (on average 1.488659793814433) internal successors, (722), 485 states have internal predecessors, (722), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:41,185 INFO L74 IsIncluded]: Start isIncluded. First operand 521 states. Second operand has 490 states, 485 states have (on average 1.488659793814433) internal successors, (722), 485 states have internal predecessors, (722), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:41,186 INFO L87 Difference]: Start difference. First operand 521 states. Second operand has 490 states, 485 states have (on average 1.488659793814433) internal successors, (722), 485 states have internal predecessors, (722), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:41,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:29:41,196 INFO L93 Difference]: Finished difference Result 521 states and 767 transitions. [2022-04-08 15:29:41,196 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 767 transitions. [2022-04-08 15:29:41,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:29:41,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:29:41,198 INFO L74 IsIncluded]: Start isIncluded. First operand has 490 states, 485 states have (on average 1.488659793814433) internal successors, (722), 485 states have internal predecessors, (722), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 521 states. [2022-04-08 15:29:41,198 INFO L87 Difference]: Start difference. First operand has 490 states, 485 states have (on average 1.488659793814433) internal successors, (722), 485 states have internal predecessors, (722), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 521 states. [2022-04-08 15:29:41,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:29:41,209 INFO L93 Difference]: Finished difference Result 521 states and 767 transitions. [2022-04-08 15:29:41,209 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 767 transitions. [2022-04-08 15:29:41,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:29:41,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:29:41,210 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:29:41,210 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:29:41,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 485 states have (on average 1.488659793814433) internal successors, (722), 485 states have internal predecessors, (722), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:41,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 726 transitions. [2022-04-08 15:29:41,238 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 726 transitions. Word has length 131 [2022-04-08 15:29:41,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:29:41,238 INFO L478 AbstractCegarLoop]: Abstraction has 490 states and 726 transitions. [2022-04-08 15:29:41,238 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:41,238 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 490 states and 726 transitions. [2022-04-08 15:29:41,899 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 726 edges. 726 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:29:41,900 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 726 transitions. [2022-04-08 15:29:41,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-08 15:29:41,900 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:29:41,901 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:29:41,901 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-08 15:29:41,901 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:29:41,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:29:41,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1134050048, now seen corresponding path program 1 times [2022-04-08 15:29:41,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:29:41,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [771092480] [2022-04-08 15:29:41,987 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:29:41,988 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:29:41,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1134050048, now seen corresponding path program 2 times [2022-04-08 15:29:41,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:29:41,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213756877] [2022-04-08 15:29:41,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:29:41,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:29:42,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:29:42,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:29:42,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:29:42,139 INFO L290 TraceCheckUtils]: 0: Hoare triple {70436#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {70429#true} is VALID [2022-04-08 15:29:42,139 INFO L290 TraceCheckUtils]: 1: Hoare triple {70429#true} assume true; {70429#true} is VALID [2022-04-08 15:29:42,139 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {70429#true} {70429#true} #690#return; {70429#true} is VALID [2022-04-08 15:29:42,140 INFO L272 TraceCheckUtils]: 0: Hoare triple {70429#true} call ULTIMATE.init(); {70436#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:29:42,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {70436#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {70429#true} is VALID [2022-04-08 15:29:42,141 INFO L290 TraceCheckUtils]: 2: Hoare triple {70429#true} assume true; {70429#true} is VALID [2022-04-08 15:29:42,141 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70429#true} {70429#true} #690#return; {70429#true} is VALID [2022-04-08 15:29:42,141 INFO L272 TraceCheckUtils]: 4: Hoare triple {70429#true} call #t~ret161 := main(); {70429#true} is VALID [2022-04-08 15:29:42,141 INFO L290 TraceCheckUtils]: 5: Hoare triple {70429#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {70429#true} is VALID [2022-04-08 15:29:42,141 INFO L290 TraceCheckUtils]: 6: Hoare triple {70429#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {70429#true} is VALID [2022-04-08 15:29:42,141 INFO L272 TraceCheckUtils]: 7: Hoare triple {70429#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {70429#true} is VALID [2022-04-08 15:29:42,141 INFO L290 TraceCheckUtils]: 8: Hoare triple {70429#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {70429#true} is VALID [2022-04-08 15:29:42,141 INFO L290 TraceCheckUtils]: 9: Hoare triple {70429#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {70429#true} is VALID [2022-04-08 15:29:42,141 INFO L290 TraceCheckUtils]: 10: Hoare triple {70429#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {70429#true} is VALID [2022-04-08 15:29:42,142 INFO L290 TraceCheckUtils]: 11: Hoare triple {70429#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {70429#true} is VALID [2022-04-08 15:29:42,142 INFO L290 TraceCheckUtils]: 12: Hoare triple {70429#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {70429#true} is VALID [2022-04-08 15:29:42,142 INFO L290 TraceCheckUtils]: 13: Hoare triple {70429#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {70429#true} is VALID [2022-04-08 15:29:42,142 INFO L290 TraceCheckUtils]: 14: Hoare triple {70429#true} assume !false; {70429#true} is VALID [2022-04-08 15:29:42,142 INFO L290 TraceCheckUtils]: 15: Hoare triple {70429#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {70429#true} is VALID [2022-04-08 15:29:42,142 INFO L290 TraceCheckUtils]: 16: Hoare triple {70429#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {70429#true} is VALID [2022-04-08 15:29:42,142 INFO L290 TraceCheckUtils]: 17: Hoare triple {70429#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {70429#true} is VALID [2022-04-08 15:29:42,142 INFO L290 TraceCheckUtils]: 18: Hoare triple {70429#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {70429#true} is VALID [2022-04-08 15:29:42,142 INFO L290 TraceCheckUtils]: 19: Hoare triple {70429#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {70429#true} is VALID [2022-04-08 15:29:42,142 INFO L290 TraceCheckUtils]: 20: Hoare triple {70429#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {70429#true} is VALID [2022-04-08 15:29:42,142 INFO L290 TraceCheckUtils]: 21: Hoare triple {70429#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {70429#true} is VALID [2022-04-08 15:29:42,143 INFO L290 TraceCheckUtils]: 22: Hoare triple {70429#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {70429#true} is VALID [2022-04-08 15:29:42,143 INFO L290 TraceCheckUtils]: 23: Hoare triple {70429#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {70429#true} is VALID [2022-04-08 15:29:42,143 INFO L290 TraceCheckUtils]: 24: Hoare triple {70429#true} assume 8464 == #t~mem55;havoc #t~mem55; {70429#true} is VALID [2022-04-08 15:29:42,143 INFO L290 TraceCheckUtils]: 25: Hoare triple {70429#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {70429#true} is VALID [2022-04-08 15:29:42,143 INFO L290 TraceCheckUtils]: 26: Hoare triple {70429#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {70429#true} is VALID [2022-04-08 15:29:42,143 INFO L290 TraceCheckUtils]: 27: Hoare triple {70429#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {70429#true} is VALID [2022-04-08 15:29:42,143 INFO L290 TraceCheckUtils]: 28: Hoare triple {70429#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {70429#true} is VALID [2022-04-08 15:29:42,143 INFO L290 TraceCheckUtils]: 29: Hoare triple {70429#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {70429#true} is VALID [2022-04-08 15:29:42,143 INFO L290 TraceCheckUtils]: 30: Hoare triple {70429#true} ~skip~0 := 0; {70429#true} is VALID [2022-04-08 15:29:42,143 INFO L290 TraceCheckUtils]: 31: Hoare triple {70429#true} assume !false; {70429#true} is VALID [2022-04-08 15:29:42,143 INFO L290 TraceCheckUtils]: 32: Hoare triple {70429#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {70429#true} is VALID [2022-04-08 15:29:42,143 INFO L290 TraceCheckUtils]: 33: Hoare triple {70429#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {70429#true} is VALID [2022-04-08 15:29:42,143 INFO L290 TraceCheckUtils]: 34: Hoare triple {70429#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {70429#true} is VALID [2022-04-08 15:29:42,144 INFO L290 TraceCheckUtils]: 35: Hoare triple {70429#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {70429#true} is VALID [2022-04-08 15:29:42,144 INFO L290 TraceCheckUtils]: 36: Hoare triple {70429#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {70429#true} is VALID [2022-04-08 15:29:42,144 INFO L290 TraceCheckUtils]: 37: Hoare triple {70429#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {70429#true} is VALID [2022-04-08 15:29:42,144 INFO L290 TraceCheckUtils]: 38: Hoare triple {70429#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {70429#true} is VALID [2022-04-08 15:29:42,144 INFO L290 TraceCheckUtils]: 39: Hoare triple {70429#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {70429#true} is VALID [2022-04-08 15:29:42,144 INFO L290 TraceCheckUtils]: 40: Hoare triple {70429#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {70429#true} is VALID [2022-04-08 15:29:42,144 INFO L290 TraceCheckUtils]: 41: Hoare triple {70429#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {70429#true} is VALID [2022-04-08 15:29:42,144 INFO L290 TraceCheckUtils]: 42: Hoare triple {70429#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {70429#true} is VALID [2022-04-08 15:29:42,144 INFO L290 TraceCheckUtils]: 43: Hoare triple {70429#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {70429#true} is VALID [2022-04-08 15:29:42,144 INFO L290 TraceCheckUtils]: 44: Hoare triple {70429#true} assume 8496 == #t~mem58;havoc #t~mem58; {70429#true} is VALID [2022-04-08 15:29:42,144 INFO L290 TraceCheckUtils]: 45: Hoare triple {70429#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {70429#true} is VALID [2022-04-08 15:29:42,144 INFO L290 TraceCheckUtils]: 46: Hoare triple {70429#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {70429#true} is VALID [2022-04-08 15:29:42,145 INFO L290 TraceCheckUtils]: 47: Hoare triple {70429#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {70429#true} is VALID [2022-04-08 15:29:42,145 INFO L290 TraceCheckUtils]: 48: Hoare triple {70429#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:42,146 INFO L290 TraceCheckUtils]: 49: Hoare triple {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:42,147 INFO L290 TraceCheckUtils]: 50: Hoare triple {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:42,147 INFO L290 TraceCheckUtils]: 51: Hoare triple {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:42,147 INFO L290 TraceCheckUtils]: 52: Hoare triple {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:42,148 INFO L290 TraceCheckUtils]: 53: Hoare triple {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:42,148 INFO L290 TraceCheckUtils]: 54: Hoare triple {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:42,149 INFO L290 TraceCheckUtils]: 55: Hoare triple {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:42,149 INFO L290 TraceCheckUtils]: 56: Hoare triple {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:42,149 INFO L290 TraceCheckUtils]: 57: Hoare triple {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:42,150 INFO L290 TraceCheckUtils]: 58: Hoare triple {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:42,150 INFO L290 TraceCheckUtils]: 59: Hoare triple {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:42,151 INFO L290 TraceCheckUtils]: 60: Hoare triple {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:42,151 INFO L290 TraceCheckUtils]: 61: Hoare triple {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:42,152 INFO L290 TraceCheckUtils]: 62: Hoare triple {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:42,152 INFO L290 TraceCheckUtils]: 63: Hoare triple {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:42,152 INFO L290 TraceCheckUtils]: 64: Hoare triple {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:42,153 INFO L290 TraceCheckUtils]: 65: Hoare triple {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:42,153 INFO L290 TraceCheckUtils]: 66: Hoare triple {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:42,154 INFO L290 TraceCheckUtils]: 67: Hoare triple {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:42,154 INFO L290 TraceCheckUtils]: 68: Hoare triple {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:42,154 INFO L290 TraceCheckUtils]: 69: Hoare triple {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:42,155 INFO L290 TraceCheckUtils]: 70: Hoare triple {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:42,155 INFO L290 TraceCheckUtils]: 71: Hoare triple {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:42,156 INFO L290 TraceCheckUtils]: 72: Hoare triple {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:42,156 INFO L290 TraceCheckUtils]: 73: Hoare triple {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:42,157 INFO L290 TraceCheckUtils]: 74: Hoare triple {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:42,157 INFO L290 TraceCheckUtils]: 75: Hoare triple {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:42,157 INFO L290 TraceCheckUtils]: 76: Hoare triple {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:42,158 INFO L290 TraceCheckUtils]: 77: Hoare triple {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:42,158 INFO L290 TraceCheckUtils]: 78: Hoare triple {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:42,159 INFO L290 TraceCheckUtils]: 79: Hoare triple {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:42,159 INFO L290 TraceCheckUtils]: 80: Hoare triple {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:42,159 INFO L290 TraceCheckUtils]: 81: Hoare triple {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:42,160 INFO L290 TraceCheckUtils]: 82: Hoare triple {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:42,160 INFO L290 TraceCheckUtils]: 83: Hoare triple {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:42,161 INFO L290 TraceCheckUtils]: 84: Hoare triple {70434#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {70435#(= |ssl3_accept_#t~mem77| 8656)} is VALID [2022-04-08 15:29:42,161 INFO L290 TraceCheckUtils]: 85: Hoare triple {70435#(= |ssl3_accept_#t~mem77| 8656)} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {70430#false} is VALID [2022-04-08 15:29:42,161 INFO L290 TraceCheckUtils]: 86: Hoare triple {70430#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {70430#false} is VALID [2022-04-08 15:29:42,161 INFO L290 TraceCheckUtils]: 87: Hoare triple {70430#false} assume 8672 == #t~mem79;havoc #t~mem79; {70430#false} is VALID [2022-04-08 15:29:42,161 INFO L290 TraceCheckUtils]: 88: Hoare triple {70430#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {70430#false} is VALID [2022-04-08 15:29:42,161 INFO L290 TraceCheckUtils]: 89: Hoare triple {70430#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {70430#false} is VALID [2022-04-08 15:29:42,162 INFO L290 TraceCheckUtils]: 90: Hoare triple {70430#false} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 72 + ~s.offset, 4);call #t~mem145 := read~int(~s.base, 128 + ~s.offset, 4); {70430#false} is VALID [2022-04-08 15:29:42,162 INFO L290 TraceCheckUtils]: 91: Hoare triple {70430#false} assume 0 != #t~mem145;havoc #t~mem145;call #t~mem146.base, #t~mem146.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8640, #t~mem146.base, 904 + #t~mem146.offset, 4);havoc #t~mem146.base, #t~mem146.offset; {70430#false} is VALID [2022-04-08 15:29:42,162 INFO L290 TraceCheckUtils]: 92: Hoare triple {70430#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {70430#false} is VALID [2022-04-08 15:29:42,162 INFO L290 TraceCheckUtils]: 93: Hoare triple {70430#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {70430#false} is VALID [2022-04-08 15:29:42,162 INFO L290 TraceCheckUtils]: 94: Hoare triple {70430#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {70430#false} is VALID [2022-04-08 15:29:42,162 INFO L290 TraceCheckUtils]: 95: Hoare triple {70430#false} ~skip~0 := 0; {70430#false} is VALID [2022-04-08 15:29:42,162 INFO L290 TraceCheckUtils]: 96: Hoare triple {70430#false} assume !false; {70430#false} is VALID [2022-04-08 15:29:42,162 INFO L290 TraceCheckUtils]: 97: Hoare triple {70430#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {70430#false} is VALID [2022-04-08 15:29:42,162 INFO L290 TraceCheckUtils]: 98: Hoare triple {70430#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {70430#false} is VALID [2022-04-08 15:29:42,162 INFO L290 TraceCheckUtils]: 99: Hoare triple {70430#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {70430#false} is VALID [2022-04-08 15:29:42,163 INFO L290 TraceCheckUtils]: 100: Hoare triple {70430#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {70430#false} is VALID [2022-04-08 15:29:42,163 INFO L290 TraceCheckUtils]: 101: Hoare triple {70430#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {70430#false} is VALID [2022-04-08 15:29:42,163 INFO L290 TraceCheckUtils]: 102: Hoare triple {70430#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {70430#false} is VALID [2022-04-08 15:29:42,163 INFO L290 TraceCheckUtils]: 103: Hoare triple {70430#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {70430#false} is VALID [2022-04-08 15:29:42,163 INFO L290 TraceCheckUtils]: 104: Hoare triple {70430#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {70430#false} is VALID [2022-04-08 15:29:42,163 INFO L290 TraceCheckUtils]: 105: Hoare triple {70430#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {70430#false} is VALID [2022-04-08 15:29:42,163 INFO L290 TraceCheckUtils]: 106: Hoare triple {70430#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {70430#false} is VALID [2022-04-08 15:29:42,163 INFO L290 TraceCheckUtils]: 107: Hoare triple {70430#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {70430#false} is VALID [2022-04-08 15:29:42,163 INFO L290 TraceCheckUtils]: 108: Hoare triple {70430#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {70430#false} is VALID [2022-04-08 15:29:42,163 INFO L290 TraceCheckUtils]: 109: Hoare triple {70430#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {70430#false} is VALID [2022-04-08 15:29:42,163 INFO L290 TraceCheckUtils]: 110: Hoare triple {70430#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {70430#false} is VALID [2022-04-08 15:29:42,164 INFO L290 TraceCheckUtils]: 111: Hoare triple {70430#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {70430#false} is VALID [2022-04-08 15:29:42,164 INFO L290 TraceCheckUtils]: 112: Hoare triple {70430#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {70430#false} is VALID [2022-04-08 15:29:42,164 INFO L290 TraceCheckUtils]: 113: Hoare triple {70430#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {70430#false} is VALID [2022-04-08 15:29:42,164 INFO L290 TraceCheckUtils]: 114: Hoare triple {70430#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {70430#false} is VALID [2022-04-08 15:29:42,164 INFO L290 TraceCheckUtils]: 115: Hoare triple {70430#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {70430#false} is VALID [2022-04-08 15:29:42,164 INFO L290 TraceCheckUtils]: 116: Hoare triple {70430#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {70430#false} is VALID [2022-04-08 15:29:42,164 INFO L290 TraceCheckUtils]: 117: Hoare triple {70430#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {70430#false} is VALID [2022-04-08 15:29:42,164 INFO L290 TraceCheckUtils]: 118: Hoare triple {70430#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {70430#false} is VALID [2022-04-08 15:29:42,164 INFO L290 TraceCheckUtils]: 119: Hoare triple {70430#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {70430#false} is VALID [2022-04-08 15:29:42,164 INFO L290 TraceCheckUtils]: 120: Hoare triple {70430#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {70430#false} is VALID [2022-04-08 15:29:42,164 INFO L290 TraceCheckUtils]: 121: Hoare triple {70430#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {70430#false} is VALID [2022-04-08 15:29:42,165 INFO L290 TraceCheckUtils]: 122: Hoare triple {70430#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {70430#false} is VALID [2022-04-08 15:29:42,165 INFO L290 TraceCheckUtils]: 123: Hoare triple {70430#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {70430#false} is VALID [2022-04-08 15:29:42,165 INFO L290 TraceCheckUtils]: 124: Hoare triple {70430#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {70430#false} is VALID [2022-04-08 15:29:42,165 INFO L290 TraceCheckUtils]: 125: Hoare triple {70430#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {70430#false} is VALID [2022-04-08 15:29:42,165 INFO L290 TraceCheckUtils]: 126: Hoare triple {70430#false} assume 8640 == #t~mem75;havoc #t~mem75; {70430#false} is VALID [2022-04-08 15:29:42,165 INFO L290 TraceCheckUtils]: 127: Hoare triple {70430#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {70430#false} is VALID [2022-04-08 15:29:42,165 INFO L290 TraceCheckUtils]: 128: Hoare triple {70430#false} assume !(4 == ~blastFlag~0); {70430#false} is VALID [2022-04-08 15:29:42,165 INFO L290 TraceCheckUtils]: 129: Hoare triple {70430#false} assume 5 == ~blastFlag~0; {70430#false} is VALID [2022-04-08 15:29:42,165 INFO L290 TraceCheckUtils]: 130: Hoare triple {70430#false} assume !false; {70430#false} is VALID [2022-04-08 15:29:42,166 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-08 15:29:42,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:29:42,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213756877] [2022-04-08 15:29:42,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213756877] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:29:42,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:29:42,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:29:42,166 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:29:42,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [771092480] [2022-04-08 15:29:42,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [771092480] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:29:42,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:29:42,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:29:42,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110813702] [2022-04-08 15:29:42,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:29:42,167 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 131 [2022-04-08 15:29:42,167 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:29:42,168 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:42,271 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:29:42,272 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:29:42,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:29:42,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:29:42,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:29:42,272 INFO L87 Difference]: Start difference. First operand 490 states and 726 transitions. Second operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:44,297 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:29:45,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:29:45,415 INFO L93 Difference]: Finished difference Result 979 states and 1454 transitions. [2022-04-08 15:29:45,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:29:45,416 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 131 [2022-04-08 15:29:45,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:29:45,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:45,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 501 transitions. [2022-04-08 15:29:45,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:45,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 501 transitions. [2022-04-08 15:29:45,419 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 501 transitions. [2022-04-08 15:29:45,739 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 501 edges. 501 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:29:45,750 INFO L225 Difference]: With dead ends: 979 [2022-04-08 15:29:45,750 INFO L226 Difference]: Without dead ends: 515 [2022-04-08 15:29:45,751 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 15:29:45,751 INFO L913 BasicCegarLoop]: 209 mSDtfsCounter, 40 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 15:29:45,751 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 533 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 465 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 15:29:45,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2022-04-08 15:29:45,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 493. [2022-04-08 15:29:45,777 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:29:45,778 INFO L82 GeneralOperation]: Start isEquivalent. First operand 515 states. Second operand has 493 states, 488 states have (on average 1.485655737704918) internal successors, (725), 488 states have internal predecessors, (725), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:45,778 INFO L74 IsIncluded]: Start isIncluded. First operand 515 states. Second operand has 493 states, 488 states have (on average 1.485655737704918) internal successors, (725), 488 states have internal predecessors, (725), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:45,779 INFO L87 Difference]: Start difference. First operand 515 states. Second operand has 493 states, 488 states have (on average 1.485655737704918) internal successors, (725), 488 states have internal predecessors, (725), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:45,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:29:45,791 INFO L93 Difference]: Finished difference Result 515 states and 757 transitions. [2022-04-08 15:29:45,792 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 757 transitions. [2022-04-08 15:29:45,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:29:45,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:29:45,793 INFO L74 IsIncluded]: Start isIncluded. First operand has 493 states, 488 states have (on average 1.485655737704918) internal successors, (725), 488 states have internal predecessors, (725), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 515 states. [2022-04-08 15:29:45,793 INFO L87 Difference]: Start difference. First operand has 493 states, 488 states have (on average 1.485655737704918) internal successors, (725), 488 states have internal predecessors, (725), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 515 states. [2022-04-08 15:29:45,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:29:45,803 INFO L93 Difference]: Finished difference Result 515 states and 757 transitions. [2022-04-08 15:29:45,803 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 757 transitions. [2022-04-08 15:29:45,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:29:45,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:29:45,803 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:29:45,803 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:29:45,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 488 states have (on average 1.485655737704918) internal successors, (725), 488 states have internal predecessors, (725), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:45,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 729 transitions. [2022-04-08 15:29:45,825 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 729 transitions. Word has length 131 [2022-04-08 15:29:45,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:29:45,825 INFO L478 AbstractCegarLoop]: Abstraction has 493 states and 729 transitions. [2022-04-08 15:29:45,825 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:45,825 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 493 states and 729 transitions. [2022-04-08 15:29:46,478 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 729 edges. 729 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:29:46,478 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 729 transitions. [2022-04-08 15:29:46,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-08 15:29:46,479 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:29:46,479 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:29:46,479 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-04-08 15:29:46,479 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:29:46,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:29:46,480 INFO L85 PathProgramCache]: Analyzing trace with hash 442867454, now seen corresponding path program 1 times [2022-04-08 15:29:46,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:29:46,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1200988341] [2022-04-08 15:29:46,587 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:29:46,587 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:29:46,588 INFO L85 PathProgramCache]: Analyzing trace with hash 442867454, now seen corresponding path program 2 times [2022-04-08 15:29:46,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:29:46,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273223205] [2022-04-08 15:29:46,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:29:46,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:29:46,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:29:46,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:29:46,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:29:46,770 INFO L290 TraceCheckUtils]: 0: Hoare triple {74421#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {74415#true} is VALID [2022-04-08 15:29:46,771 INFO L290 TraceCheckUtils]: 1: Hoare triple {74415#true} assume true; {74415#true} is VALID [2022-04-08 15:29:46,771 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {74415#true} {74415#true} #690#return; {74415#true} is VALID [2022-04-08 15:29:46,772 INFO L272 TraceCheckUtils]: 0: Hoare triple {74415#true} call ULTIMATE.init(); {74421#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:29:46,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {74421#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {74415#true} is VALID [2022-04-08 15:29:46,772 INFO L290 TraceCheckUtils]: 2: Hoare triple {74415#true} assume true; {74415#true} is VALID [2022-04-08 15:29:46,772 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {74415#true} {74415#true} #690#return; {74415#true} is VALID [2022-04-08 15:29:46,772 INFO L272 TraceCheckUtils]: 4: Hoare triple {74415#true} call #t~ret161 := main(); {74415#true} is VALID [2022-04-08 15:29:46,772 INFO L290 TraceCheckUtils]: 5: Hoare triple {74415#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {74415#true} is VALID [2022-04-08 15:29:46,772 INFO L290 TraceCheckUtils]: 6: Hoare triple {74415#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {74415#true} is VALID [2022-04-08 15:29:46,772 INFO L272 TraceCheckUtils]: 7: Hoare triple {74415#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {74415#true} is VALID [2022-04-08 15:29:46,772 INFO L290 TraceCheckUtils]: 8: Hoare triple {74415#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {74415#true} is VALID [2022-04-08 15:29:46,772 INFO L290 TraceCheckUtils]: 9: Hoare triple {74415#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {74415#true} is VALID [2022-04-08 15:29:46,772 INFO L290 TraceCheckUtils]: 10: Hoare triple {74415#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {74415#true} is VALID [2022-04-08 15:29:46,773 INFO L290 TraceCheckUtils]: 11: Hoare triple {74415#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {74415#true} is VALID [2022-04-08 15:29:46,773 INFO L290 TraceCheckUtils]: 12: Hoare triple {74415#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {74415#true} is VALID [2022-04-08 15:29:46,773 INFO L290 TraceCheckUtils]: 13: Hoare triple {74415#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {74415#true} is VALID [2022-04-08 15:29:46,773 INFO L290 TraceCheckUtils]: 14: Hoare triple {74415#true} assume !false; {74415#true} is VALID [2022-04-08 15:29:46,773 INFO L290 TraceCheckUtils]: 15: Hoare triple {74415#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {74415#true} is VALID [2022-04-08 15:29:46,773 INFO L290 TraceCheckUtils]: 16: Hoare triple {74415#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {74415#true} is VALID [2022-04-08 15:29:46,773 INFO L290 TraceCheckUtils]: 17: Hoare triple {74415#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {74415#true} is VALID [2022-04-08 15:29:46,773 INFO L290 TraceCheckUtils]: 18: Hoare triple {74415#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {74415#true} is VALID [2022-04-08 15:29:46,773 INFO L290 TraceCheckUtils]: 19: Hoare triple {74415#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {74415#true} is VALID [2022-04-08 15:29:46,773 INFO L290 TraceCheckUtils]: 20: Hoare triple {74415#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {74415#true} is VALID [2022-04-08 15:29:46,773 INFO L290 TraceCheckUtils]: 21: Hoare triple {74415#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {74415#true} is VALID [2022-04-08 15:29:46,773 INFO L290 TraceCheckUtils]: 22: Hoare triple {74415#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {74415#true} is VALID [2022-04-08 15:29:46,773 INFO L290 TraceCheckUtils]: 23: Hoare triple {74415#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {74415#true} is VALID [2022-04-08 15:29:46,774 INFO L290 TraceCheckUtils]: 24: Hoare triple {74415#true} assume 8464 == #t~mem55;havoc #t~mem55; {74415#true} is VALID [2022-04-08 15:29:46,774 INFO L290 TraceCheckUtils]: 25: Hoare triple {74415#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {74415#true} is VALID [2022-04-08 15:29:46,774 INFO L290 TraceCheckUtils]: 26: Hoare triple {74415#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {74415#true} is VALID [2022-04-08 15:29:46,774 INFO L290 TraceCheckUtils]: 27: Hoare triple {74415#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {74415#true} is VALID [2022-04-08 15:29:46,774 INFO L290 TraceCheckUtils]: 28: Hoare triple {74415#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {74415#true} is VALID [2022-04-08 15:29:46,774 INFO L290 TraceCheckUtils]: 29: Hoare triple {74415#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {74415#true} is VALID [2022-04-08 15:29:46,774 INFO L290 TraceCheckUtils]: 30: Hoare triple {74415#true} ~skip~0 := 0; {74415#true} is VALID [2022-04-08 15:29:46,774 INFO L290 TraceCheckUtils]: 31: Hoare triple {74415#true} assume !false; {74415#true} is VALID [2022-04-08 15:29:46,774 INFO L290 TraceCheckUtils]: 32: Hoare triple {74415#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {74415#true} is VALID [2022-04-08 15:29:46,774 INFO L290 TraceCheckUtils]: 33: Hoare triple {74415#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {74415#true} is VALID [2022-04-08 15:29:46,774 INFO L290 TraceCheckUtils]: 34: Hoare triple {74415#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {74415#true} is VALID [2022-04-08 15:29:46,774 INFO L290 TraceCheckUtils]: 35: Hoare triple {74415#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {74415#true} is VALID [2022-04-08 15:29:46,774 INFO L290 TraceCheckUtils]: 36: Hoare triple {74415#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {74415#true} is VALID [2022-04-08 15:29:46,775 INFO L290 TraceCheckUtils]: 37: Hoare triple {74415#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {74415#true} is VALID [2022-04-08 15:29:46,775 INFO L290 TraceCheckUtils]: 38: Hoare triple {74415#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {74415#true} is VALID [2022-04-08 15:29:46,775 INFO L290 TraceCheckUtils]: 39: Hoare triple {74415#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {74415#true} is VALID [2022-04-08 15:29:46,775 INFO L290 TraceCheckUtils]: 40: Hoare triple {74415#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {74415#true} is VALID [2022-04-08 15:29:46,775 INFO L290 TraceCheckUtils]: 41: Hoare triple {74415#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {74415#true} is VALID [2022-04-08 15:29:46,775 INFO L290 TraceCheckUtils]: 42: Hoare triple {74415#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {74415#true} is VALID [2022-04-08 15:29:46,775 INFO L290 TraceCheckUtils]: 43: Hoare triple {74415#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {74415#true} is VALID [2022-04-08 15:29:46,775 INFO L290 TraceCheckUtils]: 44: Hoare triple {74415#true} assume 8496 == #t~mem58;havoc #t~mem58; {74415#true} is VALID [2022-04-08 15:29:46,775 INFO L290 TraceCheckUtils]: 45: Hoare triple {74415#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {74415#true} is VALID [2022-04-08 15:29:46,776 INFO L290 TraceCheckUtils]: 46: Hoare triple {74415#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,776 INFO L290 TraceCheckUtils]: 47: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,776 INFO L290 TraceCheckUtils]: 48: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,776 INFO L290 TraceCheckUtils]: 49: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} call write~int(0, ~s.base, 88 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,777 INFO L290 TraceCheckUtils]: 50: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,777 INFO L290 TraceCheckUtils]: 51: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,777 INFO L290 TraceCheckUtils]: 52: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} ~skip~0 := 0; {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,778 INFO L290 TraceCheckUtils]: 53: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !false; {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,778 INFO L290 TraceCheckUtils]: 54: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,778 INFO L290 TraceCheckUtils]: 55: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,779 INFO L290 TraceCheckUtils]: 56: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,779 INFO L290 TraceCheckUtils]: 57: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,779 INFO L290 TraceCheckUtils]: 58: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,779 INFO L290 TraceCheckUtils]: 59: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,780 INFO L290 TraceCheckUtils]: 60: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,780 INFO L290 TraceCheckUtils]: 61: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,780 INFO L290 TraceCheckUtils]: 62: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,781 INFO L290 TraceCheckUtils]: 63: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,781 INFO L290 TraceCheckUtils]: 64: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,781 INFO L290 TraceCheckUtils]: 65: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,782 INFO L290 TraceCheckUtils]: 66: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,782 INFO L290 TraceCheckUtils]: 67: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,782 INFO L290 TraceCheckUtils]: 68: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume 8512 == #t~mem60;havoc #t~mem60; {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,782 INFO L290 TraceCheckUtils]: 69: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 888 + #t~mem95.offset, 8);call #t~mem97 := read~int(#t~mem96.base, 20 + #t~mem96.offset, 8); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,783 INFO L290 TraceCheckUtils]: 70: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume 0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 18446744073709551616;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;~skip~0 := 1; {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,783 INFO L290 TraceCheckUtils]: 71: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} call write~int(8528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,783 INFO L290 TraceCheckUtils]: 72: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,784 INFO L290 TraceCheckUtils]: 73: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,784 INFO L290 TraceCheckUtils]: 74: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} ~skip~0 := 0; {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,784 INFO L290 TraceCheckUtils]: 75: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !false; {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,785 INFO L290 TraceCheckUtils]: 76: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,785 INFO L290 TraceCheckUtils]: 77: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,785 INFO L290 TraceCheckUtils]: 78: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,785 INFO L290 TraceCheckUtils]: 79: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,786 INFO L290 TraceCheckUtils]: 80: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,786 INFO L290 TraceCheckUtils]: 81: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,786 INFO L290 TraceCheckUtils]: 82: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,787 INFO L290 TraceCheckUtils]: 83: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,787 INFO L290 TraceCheckUtils]: 84: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,787 INFO L290 TraceCheckUtils]: 85: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,788 INFO L290 TraceCheckUtils]: 86: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,788 INFO L290 TraceCheckUtils]: 87: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,788 INFO L290 TraceCheckUtils]: 88: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,788 INFO L290 TraceCheckUtils]: 89: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,789 INFO L290 TraceCheckUtils]: 90: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,789 INFO L290 TraceCheckUtils]: 91: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,789 INFO L290 TraceCheckUtils]: 92: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume 8528 == #t~mem62;havoc #t~mem62; {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,790 INFO L290 TraceCheckUtils]: 93: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 888 + #t~mem99.offset, 8);call #t~mem101 := read~int(#t~mem100.base, 20 + #t~mem100.offset, 8);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 332 + ~s.offset, 8); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,790 INFO L290 TraceCheckUtils]: 94: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 18446744073709551616;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem103.base, 935 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,790 INFO L290 TraceCheckUtils]: 95: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem106 := read~int(#t~mem105.base, 935 + #t~mem105.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,790 INFO L290 TraceCheckUtils]: 96: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,791 INFO L290 TraceCheckUtils]: 97: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 18446744073709551616); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,791 INFO L290 TraceCheckUtils]: 98: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 != ~l~0 % 18446744073709551616);~skip~0 := 1; {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,791 INFO L290 TraceCheckUtils]: 99: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} call write~int(8544, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,792 INFO L290 TraceCheckUtils]: 100: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,792 INFO L290 TraceCheckUtils]: 101: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,792 INFO L290 TraceCheckUtils]: 102: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} ~skip~0 := 0; {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,793 INFO L290 TraceCheckUtils]: 103: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !false; {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,793 INFO L290 TraceCheckUtils]: 104: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,793 INFO L290 TraceCheckUtils]: 105: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,793 INFO L290 TraceCheckUtils]: 106: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,794 INFO L290 TraceCheckUtils]: 107: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,794 INFO L290 TraceCheckUtils]: 108: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,794 INFO L290 TraceCheckUtils]: 109: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,795 INFO L290 TraceCheckUtils]: 110: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,795 INFO L290 TraceCheckUtils]: 111: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,795 INFO L290 TraceCheckUtils]: 112: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,795 INFO L290 TraceCheckUtils]: 113: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,796 INFO L290 TraceCheckUtils]: 114: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,796 INFO L290 TraceCheckUtils]: 115: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,796 INFO L290 TraceCheckUtils]: 116: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,797 INFO L290 TraceCheckUtils]: 117: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,797 INFO L290 TraceCheckUtils]: 118: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,797 INFO L290 TraceCheckUtils]: 119: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,798 INFO L290 TraceCheckUtils]: 120: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,798 INFO L290 TraceCheckUtils]: 121: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,798 INFO L290 TraceCheckUtils]: 122: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume 8544 == #t~mem64;havoc #t~mem64; {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,799 INFO L290 TraceCheckUtils]: 123: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,799 INFO L290 TraceCheckUtils]: 124: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,799 INFO L290 TraceCheckUtils]: 125: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,799 INFO L290 TraceCheckUtils]: 126: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,800 INFO L290 TraceCheckUtils]: 127: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,800 INFO L290 TraceCheckUtils]: 128: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {74420#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:29:46,800 INFO L290 TraceCheckUtils]: 129: Hoare triple {74420#(= 2 ssl3_accept_~blastFlag~0)} assume 7 == ~blastFlag~0; {74416#false} is VALID [2022-04-08 15:29:46,801 INFO L290 TraceCheckUtils]: 130: Hoare triple {74416#false} assume !false; {74416#false} is VALID [2022-04-08 15:29:46,801 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-04-08 15:29:46,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:29:46,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273223205] [2022-04-08 15:29:46,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273223205] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:29:46,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:29:46,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:29:46,802 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:29:46,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1200988341] [2022-04-08 15:29:46,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1200988341] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:29:46,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:29:46,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:29:46,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724351710] [2022-04-08 15:29:46,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:29:46,803 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 131 [2022-04-08 15:29:46,803 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:29:46,803 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:46,861 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:29:46,861 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 15:29:46,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:29:46,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 15:29:46,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 15:29:46,862 INFO L87 Difference]: Start difference. First operand 493 states and 729 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:48,878 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:29:49,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:29:49,781 INFO L93 Difference]: Finished difference Result 1422 states and 2123 transitions. [2022-04-08 15:29:49,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 15:29:49,782 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 131 [2022-04-08 15:29:49,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:29:49,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:49,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 603 transitions. [2022-04-08 15:29:49,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:49,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 603 transitions. [2022-04-08 15:29:49,786 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 603 transitions. [2022-04-08 15:29:50,171 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 603 edges. 603 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:29:50,215 INFO L225 Difference]: With dead ends: 1422 [2022-04-08 15:29:50,216 INFO L226 Difference]: Without dead ends: 955 [2022-04-08 15:29:50,216 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 15:29:50,217 INFO L913 BasicCegarLoop]: 241 mSDtfsCounter, 136 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-08 15:29:50,217 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 435 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 281 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-08 15:29:50,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2022-04-08 15:29:50,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 955. [2022-04-08 15:29:50,271 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:29:50,272 INFO L82 GeneralOperation]: Start isEquivalent. First operand 955 states. Second operand has 955 states, 950 states have (on average 1.4842105263157894) internal successors, (1410), 950 states have internal predecessors, (1410), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:50,273 INFO L74 IsIncluded]: Start isIncluded. First operand 955 states. Second operand has 955 states, 950 states have (on average 1.4842105263157894) internal successors, (1410), 950 states have internal predecessors, (1410), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:50,273 INFO L87 Difference]: Start difference. First operand 955 states. Second operand has 955 states, 950 states have (on average 1.4842105263157894) internal successors, (1410), 950 states have internal predecessors, (1410), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:50,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:29:50,304 INFO L93 Difference]: Finished difference Result 955 states and 1414 transitions. [2022-04-08 15:29:50,304 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1414 transitions. [2022-04-08 15:29:50,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:29:50,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:29:50,306 INFO L74 IsIncluded]: Start isIncluded. First operand has 955 states, 950 states have (on average 1.4842105263157894) internal successors, (1410), 950 states have internal predecessors, (1410), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 955 states. [2022-04-08 15:29:50,307 INFO L87 Difference]: Start difference. First operand has 955 states, 950 states have (on average 1.4842105263157894) internal successors, (1410), 950 states have internal predecessors, (1410), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 955 states. [2022-04-08 15:29:50,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:29:50,334 INFO L93 Difference]: Finished difference Result 955 states and 1414 transitions. [2022-04-08 15:29:50,334 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1414 transitions. [2022-04-08 15:29:50,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:29:50,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:29:50,334 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:29:50,335 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:29:50,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 955 states, 950 states have (on average 1.4842105263157894) internal successors, (1410), 950 states have internal predecessors, (1410), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:50,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 1414 transitions. [2022-04-08 15:29:50,373 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 1414 transitions. Word has length 131 [2022-04-08 15:29:50,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:29:50,373 INFO L478 AbstractCegarLoop]: Abstraction has 955 states and 1414 transitions. [2022-04-08 15:29:50,373 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:50,373 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 955 states and 1414 transitions. [2022-04-08 15:29:51,688 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1414 edges. 1414 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:29:51,689 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1414 transitions. [2022-04-08 15:29:51,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-08 15:29:51,690 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:29:51,690 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:29:51,690 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-04-08 15:29:51,690 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:29:51,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:29:51,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1975617024, now seen corresponding path program 1 times [2022-04-08 15:29:51,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:29:51,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [866173708] [2022-04-08 15:29:51,796 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:29:51,796 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:29:51,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1975617024, now seen corresponding path program 2 times [2022-04-08 15:29:51,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:29:51,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012241423] [2022-04-08 15:29:51,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:29:51,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:29:51,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:29:51,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:29:51,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:29:51,907 INFO L290 TraceCheckUtils]: 0: Hoare triple {81094#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {81088#true} is VALID [2022-04-08 15:29:51,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {81088#true} assume true; {81088#true} is VALID [2022-04-08 15:29:51,907 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {81088#true} {81088#true} #690#return; {81088#true} is VALID [2022-04-08 15:29:51,908 INFO L272 TraceCheckUtils]: 0: Hoare triple {81088#true} call ULTIMATE.init(); {81094#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:29:51,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {81094#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {81088#true} is VALID [2022-04-08 15:29:51,908 INFO L290 TraceCheckUtils]: 2: Hoare triple {81088#true} assume true; {81088#true} is VALID [2022-04-08 15:29:51,908 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {81088#true} {81088#true} #690#return; {81088#true} is VALID [2022-04-08 15:29:51,908 INFO L272 TraceCheckUtils]: 4: Hoare triple {81088#true} call #t~ret161 := main(); {81088#true} is VALID [2022-04-08 15:29:51,908 INFO L290 TraceCheckUtils]: 5: Hoare triple {81088#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {81088#true} is VALID [2022-04-08 15:29:51,909 INFO L290 TraceCheckUtils]: 6: Hoare triple {81088#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {81088#true} is VALID [2022-04-08 15:29:51,909 INFO L272 TraceCheckUtils]: 7: Hoare triple {81088#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {81088#true} is VALID [2022-04-08 15:29:51,909 INFO L290 TraceCheckUtils]: 8: Hoare triple {81088#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {81088#true} is VALID [2022-04-08 15:29:51,909 INFO L290 TraceCheckUtils]: 9: Hoare triple {81088#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {81088#true} is VALID [2022-04-08 15:29:51,909 INFO L290 TraceCheckUtils]: 10: Hoare triple {81088#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {81088#true} is VALID [2022-04-08 15:29:51,909 INFO L290 TraceCheckUtils]: 11: Hoare triple {81088#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {81088#true} is VALID [2022-04-08 15:29:51,909 INFO L290 TraceCheckUtils]: 12: Hoare triple {81088#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {81088#true} is VALID [2022-04-08 15:29:51,909 INFO L290 TraceCheckUtils]: 13: Hoare triple {81088#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {81088#true} is VALID [2022-04-08 15:29:51,909 INFO L290 TraceCheckUtils]: 14: Hoare triple {81088#true} assume !false; {81088#true} is VALID [2022-04-08 15:29:51,909 INFO L290 TraceCheckUtils]: 15: Hoare triple {81088#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {81088#true} is VALID [2022-04-08 15:29:51,909 INFO L290 TraceCheckUtils]: 16: Hoare triple {81088#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {81088#true} is VALID [2022-04-08 15:29:51,909 INFO L290 TraceCheckUtils]: 17: Hoare triple {81088#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {81088#true} is VALID [2022-04-08 15:29:51,910 INFO L290 TraceCheckUtils]: 18: Hoare triple {81088#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {81088#true} is VALID [2022-04-08 15:29:51,910 INFO L290 TraceCheckUtils]: 19: Hoare triple {81088#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {81088#true} is VALID [2022-04-08 15:29:51,910 INFO L290 TraceCheckUtils]: 20: Hoare triple {81088#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {81088#true} is VALID [2022-04-08 15:29:51,910 INFO L290 TraceCheckUtils]: 21: Hoare triple {81088#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {81088#true} is VALID [2022-04-08 15:29:51,910 INFO L290 TraceCheckUtils]: 22: Hoare triple {81088#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {81088#true} is VALID [2022-04-08 15:29:51,910 INFO L290 TraceCheckUtils]: 23: Hoare triple {81088#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {81088#true} is VALID [2022-04-08 15:29:51,910 INFO L290 TraceCheckUtils]: 24: Hoare triple {81088#true} assume 8464 == #t~mem55;havoc #t~mem55; {81088#true} is VALID [2022-04-08 15:29:51,910 INFO L290 TraceCheckUtils]: 25: Hoare triple {81088#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {81088#true} is VALID [2022-04-08 15:29:51,910 INFO L290 TraceCheckUtils]: 26: Hoare triple {81088#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {81093#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 15:29:51,911 INFO L290 TraceCheckUtils]: 27: Hoare triple {81093#(= ssl3_accept_~blastFlag~0 1)} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {81093#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 15:29:51,911 INFO L290 TraceCheckUtils]: 28: Hoare triple {81093#(= ssl3_accept_~blastFlag~0 1)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {81093#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 15:29:51,911 INFO L290 TraceCheckUtils]: 29: Hoare triple {81093#(= ssl3_accept_~blastFlag~0 1)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {81093#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 15:29:51,912 INFO L290 TraceCheckUtils]: 30: Hoare triple {81093#(= ssl3_accept_~blastFlag~0 1)} ~skip~0 := 0; {81093#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 15:29:51,912 INFO L290 TraceCheckUtils]: 31: Hoare triple {81093#(= ssl3_accept_~blastFlag~0 1)} assume !false; {81093#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 15:29:51,912 INFO L290 TraceCheckUtils]: 32: Hoare triple {81093#(= ssl3_accept_~blastFlag~0 1)} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {81093#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 15:29:51,913 INFO L290 TraceCheckUtils]: 33: Hoare triple {81093#(= ssl3_accept_~blastFlag~0 1)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {81093#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 15:29:51,913 INFO L290 TraceCheckUtils]: 34: Hoare triple {81093#(= ssl3_accept_~blastFlag~0 1)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {81093#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 15:29:51,913 INFO L290 TraceCheckUtils]: 35: Hoare triple {81093#(= ssl3_accept_~blastFlag~0 1)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {81093#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 15:29:51,913 INFO L290 TraceCheckUtils]: 36: Hoare triple {81093#(= ssl3_accept_~blastFlag~0 1)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {81093#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 15:29:51,914 INFO L290 TraceCheckUtils]: 37: Hoare triple {81093#(= ssl3_accept_~blastFlag~0 1)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {81093#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 15:29:51,914 INFO L290 TraceCheckUtils]: 38: Hoare triple {81093#(= ssl3_accept_~blastFlag~0 1)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {81093#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 15:29:51,914 INFO L290 TraceCheckUtils]: 39: Hoare triple {81093#(= ssl3_accept_~blastFlag~0 1)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {81093#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 15:29:51,914 INFO L290 TraceCheckUtils]: 40: Hoare triple {81093#(= ssl3_accept_~blastFlag~0 1)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {81093#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 15:29:51,915 INFO L290 TraceCheckUtils]: 41: Hoare triple {81093#(= ssl3_accept_~blastFlag~0 1)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {81093#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 15:29:51,915 INFO L290 TraceCheckUtils]: 42: Hoare triple {81093#(= ssl3_accept_~blastFlag~0 1)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {81093#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 15:29:51,915 INFO L290 TraceCheckUtils]: 43: Hoare triple {81093#(= ssl3_accept_~blastFlag~0 1)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {81093#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 15:29:51,916 INFO L290 TraceCheckUtils]: 44: Hoare triple {81093#(= ssl3_accept_~blastFlag~0 1)} assume 8496 == #t~mem58;havoc #t~mem58; {81093#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 15:29:51,916 INFO L290 TraceCheckUtils]: 45: Hoare triple {81093#(= ssl3_accept_~blastFlag~0 1)} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {81093#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 15:29:51,916 INFO L290 TraceCheckUtils]: 46: Hoare triple {81093#(= ssl3_accept_~blastFlag~0 1)} assume !(1 == ~blastFlag~0); {81089#false} is VALID [2022-04-08 15:29:51,916 INFO L290 TraceCheckUtils]: 47: Hoare triple {81089#false} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {81089#false} is VALID [2022-04-08 15:29:51,916 INFO L290 TraceCheckUtils]: 48: Hoare triple {81089#false} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-08 15:29:51,916 INFO L290 TraceCheckUtils]: 49: Hoare triple {81089#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {81089#false} is VALID [2022-04-08 15:29:51,917 INFO L290 TraceCheckUtils]: 50: Hoare triple {81089#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {81089#false} is VALID [2022-04-08 15:29:51,917 INFO L290 TraceCheckUtils]: 51: Hoare triple {81089#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {81089#false} is VALID [2022-04-08 15:29:51,917 INFO L290 TraceCheckUtils]: 52: Hoare triple {81089#false} ~skip~0 := 0; {81089#false} is VALID [2022-04-08 15:29:51,917 INFO L290 TraceCheckUtils]: 53: Hoare triple {81089#false} assume !false; {81089#false} is VALID [2022-04-08 15:29:51,917 INFO L290 TraceCheckUtils]: 54: Hoare triple {81089#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-08 15:29:51,917 INFO L290 TraceCheckUtils]: 55: Hoare triple {81089#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-08 15:29:51,917 INFO L290 TraceCheckUtils]: 56: Hoare triple {81089#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-08 15:29:51,917 INFO L290 TraceCheckUtils]: 57: Hoare triple {81089#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-08 15:29:51,917 INFO L290 TraceCheckUtils]: 58: Hoare triple {81089#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-08 15:29:51,917 INFO L290 TraceCheckUtils]: 59: Hoare triple {81089#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-08 15:29:51,917 INFO L290 TraceCheckUtils]: 60: Hoare triple {81089#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-08 15:29:51,917 INFO L290 TraceCheckUtils]: 61: Hoare triple {81089#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-08 15:29:51,918 INFO L290 TraceCheckUtils]: 62: Hoare triple {81089#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-08 15:29:51,918 INFO L290 TraceCheckUtils]: 63: Hoare triple {81089#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-08 15:29:51,918 INFO L290 TraceCheckUtils]: 64: Hoare triple {81089#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-08 15:29:51,918 INFO L290 TraceCheckUtils]: 65: Hoare triple {81089#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-08 15:29:51,918 INFO L290 TraceCheckUtils]: 66: Hoare triple {81089#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-08 15:29:51,918 INFO L290 TraceCheckUtils]: 67: Hoare triple {81089#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-08 15:29:51,918 INFO L290 TraceCheckUtils]: 68: Hoare triple {81089#false} assume 8512 == #t~mem60;havoc #t~mem60; {81089#false} is VALID [2022-04-08 15:29:51,918 INFO L290 TraceCheckUtils]: 69: Hoare triple {81089#false} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 888 + #t~mem95.offset, 8);call #t~mem97 := read~int(#t~mem96.base, 20 + #t~mem96.offset, 8); {81089#false} is VALID [2022-04-08 15:29:51,918 INFO L290 TraceCheckUtils]: 70: Hoare triple {81089#false} assume 0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 18446744073709551616;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;~skip~0 := 1; {81089#false} is VALID [2022-04-08 15:29:51,918 INFO L290 TraceCheckUtils]: 71: Hoare triple {81089#false} call write~int(8528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {81089#false} is VALID [2022-04-08 15:29:51,918 INFO L290 TraceCheckUtils]: 72: Hoare triple {81089#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {81089#false} is VALID [2022-04-08 15:29:51,918 INFO L290 TraceCheckUtils]: 73: Hoare triple {81089#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {81089#false} is VALID [2022-04-08 15:29:51,918 INFO L290 TraceCheckUtils]: 74: Hoare triple {81089#false} ~skip~0 := 0; {81089#false} is VALID [2022-04-08 15:29:51,919 INFO L290 TraceCheckUtils]: 75: Hoare triple {81089#false} assume !false; {81089#false} is VALID [2022-04-08 15:29:51,919 INFO L290 TraceCheckUtils]: 76: Hoare triple {81089#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-08 15:29:51,919 INFO L290 TraceCheckUtils]: 77: Hoare triple {81089#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-08 15:29:51,919 INFO L290 TraceCheckUtils]: 78: Hoare triple {81089#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-08 15:29:51,919 INFO L290 TraceCheckUtils]: 79: Hoare triple {81089#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-08 15:29:51,919 INFO L290 TraceCheckUtils]: 80: Hoare triple {81089#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-08 15:29:51,919 INFO L290 TraceCheckUtils]: 81: Hoare triple {81089#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-08 15:29:51,919 INFO L290 TraceCheckUtils]: 82: Hoare triple {81089#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-08 15:29:51,919 INFO L290 TraceCheckUtils]: 83: Hoare triple {81089#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-08 15:29:51,919 INFO L290 TraceCheckUtils]: 84: Hoare triple {81089#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-08 15:29:51,919 INFO L290 TraceCheckUtils]: 85: Hoare triple {81089#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-08 15:29:51,919 INFO L290 TraceCheckUtils]: 86: Hoare triple {81089#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-08 15:29:51,919 INFO L290 TraceCheckUtils]: 87: Hoare triple {81089#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-08 15:29:51,920 INFO L290 TraceCheckUtils]: 88: Hoare triple {81089#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-08 15:29:51,920 INFO L290 TraceCheckUtils]: 89: Hoare triple {81089#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-08 15:29:51,920 INFO L290 TraceCheckUtils]: 90: Hoare triple {81089#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-08 15:29:51,920 INFO L290 TraceCheckUtils]: 91: Hoare triple {81089#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-08 15:29:51,920 INFO L290 TraceCheckUtils]: 92: Hoare triple {81089#false} assume 8528 == #t~mem62;havoc #t~mem62; {81089#false} is VALID [2022-04-08 15:29:51,920 INFO L290 TraceCheckUtils]: 93: Hoare triple {81089#false} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 888 + #t~mem99.offset, 8);call #t~mem101 := read~int(#t~mem100.base, 20 + #t~mem100.offset, 8);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 332 + ~s.offset, 8); {81089#false} is VALID [2022-04-08 15:29:51,920 INFO L290 TraceCheckUtils]: 94: Hoare triple {81089#false} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 18446744073709551616;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem103.base, 935 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {81089#false} is VALID [2022-04-08 15:29:51,920 INFO L290 TraceCheckUtils]: 95: Hoare triple {81089#false} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem106 := read~int(#t~mem105.base, 935 + #t~mem105.offset, 4); {81089#false} is VALID [2022-04-08 15:29:51,920 INFO L290 TraceCheckUtils]: 96: Hoare triple {81089#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {81089#false} is VALID [2022-04-08 15:29:51,920 INFO L290 TraceCheckUtils]: 97: Hoare triple {81089#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 18446744073709551616); {81089#false} is VALID [2022-04-08 15:29:51,920 INFO L290 TraceCheckUtils]: 98: Hoare triple {81089#false} assume !(0 != ~l~0 % 18446744073709551616);~skip~0 := 1; {81089#false} is VALID [2022-04-08 15:29:51,920 INFO L290 TraceCheckUtils]: 99: Hoare triple {81089#false} call write~int(8544, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {81089#false} is VALID [2022-04-08 15:29:51,921 INFO L290 TraceCheckUtils]: 100: Hoare triple {81089#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {81089#false} is VALID [2022-04-08 15:29:51,921 INFO L290 TraceCheckUtils]: 101: Hoare triple {81089#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {81089#false} is VALID [2022-04-08 15:29:51,921 INFO L290 TraceCheckUtils]: 102: Hoare triple {81089#false} ~skip~0 := 0; {81089#false} is VALID [2022-04-08 15:29:51,921 INFO L290 TraceCheckUtils]: 103: Hoare triple {81089#false} assume !false; {81089#false} is VALID [2022-04-08 15:29:51,921 INFO L290 TraceCheckUtils]: 104: Hoare triple {81089#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-08 15:29:51,921 INFO L290 TraceCheckUtils]: 105: Hoare triple {81089#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-08 15:29:51,921 INFO L290 TraceCheckUtils]: 106: Hoare triple {81089#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-08 15:29:51,921 INFO L290 TraceCheckUtils]: 107: Hoare triple {81089#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-08 15:29:51,921 INFO L290 TraceCheckUtils]: 108: Hoare triple {81089#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-08 15:29:51,921 INFO L290 TraceCheckUtils]: 109: Hoare triple {81089#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-08 15:29:51,921 INFO L290 TraceCheckUtils]: 110: Hoare triple {81089#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-08 15:29:51,921 INFO L290 TraceCheckUtils]: 111: Hoare triple {81089#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-08 15:29:51,921 INFO L290 TraceCheckUtils]: 112: Hoare triple {81089#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-08 15:29:51,922 INFO L290 TraceCheckUtils]: 113: Hoare triple {81089#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-08 15:29:51,922 INFO L290 TraceCheckUtils]: 114: Hoare triple {81089#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-08 15:29:51,922 INFO L290 TraceCheckUtils]: 115: Hoare triple {81089#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-08 15:29:51,922 INFO L290 TraceCheckUtils]: 116: Hoare triple {81089#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-08 15:29:51,922 INFO L290 TraceCheckUtils]: 117: Hoare triple {81089#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-08 15:29:51,922 INFO L290 TraceCheckUtils]: 118: Hoare triple {81089#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-08 15:29:51,922 INFO L290 TraceCheckUtils]: 119: Hoare triple {81089#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-08 15:29:51,922 INFO L290 TraceCheckUtils]: 120: Hoare triple {81089#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-08 15:29:51,922 INFO L290 TraceCheckUtils]: 121: Hoare triple {81089#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {81089#false} is VALID [2022-04-08 15:29:51,922 INFO L290 TraceCheckUtils]: 122: Hoare triple {81089#false} assume 8544 == #t~mem64;havoc #t~mem64; {81089#false} is VALID [2022-04-08 15:29:51,922 INFO L290 TraceCheckUtils]: 123: Hoare triple {81089#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {81089#false} is VALID [2022-04-08 15:29:51,922 INFO L290 TraceCheckUtils]: 124: Hoare triple {81089#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {81089#false} is VALID [2022-04-08 15:29:51,922 INFO L290 TraceCheckUtils]: 125: Hoare triple {81089#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {81089#false} is VALID [2022-04-08 15:29:51,923 INFO L290 TraceCheckUtils]: 126: Hoare triple {81089#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {81089#false} is VALID [2022-04-08 15:29:51,923 INFO L290 TraceCheckUtils]: 127: Hoare triple {81089#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {81089#false} is VALID [2022-04-08 15:29:51,923 INFO L290 TraceCheckUtils]: 128: Hoare triple {81089#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {81089#false} is VALID [2022-04-08 15:29:51,923 INFO L290 TraceCheckUtils]: 129: Hoare triple {81089#false} assume 7 == ~blastFlag~0; {81089#false} is VALID [2022-04-08 15:29:51,923 INFO L290 TraceCheckUtils]: 130: Hoare triple {81089#false} assume !false; {81089#false} is VALID [2022-04-08 15:29:51,923 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-04-08 15:29:51,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:29:51,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012241423] [2022-04-08 15:29:51,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012241423] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:29:51,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:29:51,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:29:51,924 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:29:51,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [866173708] [2022-04-08 15:29:51,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [866173708] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:29:51,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:29:51,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:29:51,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81786479] [2022-04-08 15:29:51,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:29:51,925 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 131 [2022-04-08 15:29:51,925 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:29:51,925 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:52,002 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:29:52,003 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 15:29:52,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:29:52,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 15:29:52,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 15:29:52,005 INFO L87 Difference]: Start difference. First operand 955 states and 1414 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:54,944 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-08 15:29:56,948 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:29:59,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:29:59,979 INFO L93 Difference]: Finished difference Result 1911 states and 2835 transitions. [2022-04-08 15:29:59,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 15:29:59,980 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 131 [2022-04-08 15:29:59,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:29:59,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:59,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 448 transitions. [2022-04-08 15:29:59,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:59,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 448 transitions. [2022-04-08 15:29:59,983 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 448 transitions. [2022-04-08 15:30:00,264 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 448 edges. 448 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:30:00,304 INFO L225 Difference]: With dead ends: 1911 [2022-04-08 15:30:00,305 INFO L226 Difference]: Without dead ends: 982 [2022-04-08 15:30:00,306 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 15:30:00,306 INFO L913 BasicCegarLoop]: 223 mSDtfsCounter, 15 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-04-08 15:30:00,307 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 417 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 249 Invalid, 1 Unknown, 0 Unchecked, 3.7s Time] [2022-04-08 15:30:00,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2022-04-08 15:30:00,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 982. [2022-04-08 15:30:00,385 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:30:00,386 INFO L82 GeneralOperation]: Start isEquivalent. First operand 982 states. Second operand has 982 states, 977 states have (on average 1.4790174002047083) internal successors, (1445), 977 states have internal predecessors, (1445), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:00,387 INFO L74 IsIncluded]: Start isIncluded. First operand 982 states. Second operand has 982 states, 977 states have (on average 1.4790174002047083) internal successors, (1445), 977 states have internal predecessors, (1445), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:00,387 INFO L87 Difference]: Start difference. First operand 982 states. Second operand has 982 states, 977 states have (on average 1.4790174002047083) internal successors, (1445), 977 states have internal predecessors, (1445), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:00,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:30:00,414 INFO L93 Difference]: Finished difference Result 982 states and 1449 transitions. [2022-04-08 15:30:00,414 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1449 transitions. [2022-04-08 15:30:00,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:30:00,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:30:00,416 INFO L74 IsIncluded]: Start isIncluded. First operand has 982 states, 977 states have (on average 1.4790174002047083) internal successors, (1445), 977 states have internal predecessors, (1445), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 982 states. [2022-04-08 15:30:00,416 INFO L87 Difference]: Start difference. First operand has 982 states, 977 states have (on average 1.4790174002047083) internal successors, (1445), 977 states have internal predecessors, (1445), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 982 states. [2022-04-08 15:30:00,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:30:00,444 INFO L93 Difference]: Finished difference Result 982 states and 1449 transitions. [2022-04-08 15:30:00,444 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1449 transitions. [2022-04-08 15:30:00,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:30:00,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:30:00,445 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:30:00,445 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:30:00,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 977 states have (on average 1.4790174002047083) internal successors, (1445), 977 states have internal predecessors, (1445), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:00,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1449 transitions. [2022-04-08 15:30:00,484 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1449 transitions. Word has length 131 [2022-04-08 15:30:00,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:30:00,484 INFO L478 AbstractCegarLoop]: Abstraction has 982 states and 1449 transitions. [2022-04-08 15:30:00,484 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:00,484 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 982 states and 1449 transitions. [2022-04-08 15:30:01,797 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1449 edges. 1449 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:30:01,797 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1449 transitions. [2022-04-08 15:30:01,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-08 15:30:01,799 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:30:01,799 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:30:01,799 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-04-08 15:30:01,799 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:30:01,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:30:01,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1857175550, now seen corresponding path program 1 times [2022-04-08 15:30:01,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:30:01,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2249895] [2022-04-08 15:30:01,895 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:30:01,895 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:30:01,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1857175550, now seen corresponding path program 2 times [2022-04-08 15:30:01,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:30:01,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531739715] [2022-04-08 15:30:01,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:30:01,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:30:01,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:30:02,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:30:02,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:30:02,013 INFO L290 TraceCheckUtils]: 0: Hoare triple {88853#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {88847#true} is VALID [2022-04-08 15:30:02,013 INFO L290 TraceCheckUtils]: 1: Hoare triple {88847#true} assume true; {88847#true} is VALID [2022-04-08 15:30:02,013 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {88847#true} {88847#true} #690#return; {88847#true} is VALID [2022-04-08 15:30:02,014 INFO L272 TraceCheckUtils]: 0: Hoare triple {88847#true} call ULTIMATE.init(); {88853#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:30:02,014 INFO L290 TraceCheckUtils]: 1: Hoare triple {88853#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {88847#true} is VALID [2022-04-08 15:30:02,014 INFO L290 TraceCheckUtils]: 2: Hoare triple {88847#true} assume true; {88847#true} is VALID [2022-04-08 15:30:02,014 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {88847#true} {88847#true} #690#return; {88847#true} is VALID [2022-04-08 15:30:02,014 INFO L272 TraceCheckUtils]: 4: Hoare triple {88847#true} call #t~ret161 := main(); {88847#true} is VALID [2022-04-08 15:30:02,015 INFO L290 TraceCheckUtils]: 5: Hoare triple {88847#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {88847#true} is VALID [2022-04-08 15:30:02,015 INFO L290 TraceCheckUtils]: 6: Hoare triple {88847#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {88847#true} is VALID [2022-04-08 15:30:02,015 INFO L272 TraceCheckUtils]: 7: Hoare triple {88847#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {88847#true} is VALID [2022-04-08 15:30:02,015 INFO L290 TraceCheckUtils]: 8: Hoare triple {88847#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {88852#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 15:30:02,015 INFO L290 TraceCheckUtils]: 9: Hoare triple {88852#(= ssl3_accept_~blastFlag~0 0)} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {88852#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 15:30:02,016 INFO L290 TraceCheckUtils]: 10: Hoare triple {88852#(= ssl3_accept_~blastFlag~0 0)} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {88852#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 15:30:02,016 INFO L290 TraceCheckUtils]: 11: Hoare triple {88852#(= ssl3_accept_~blastFlag~0 0)} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {88852#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 15:30:02,016 INFO L290 TraceCheckUtils]: 12: Hoare triple {88852#(= ssl3_accept_~blastFlag~0 0)} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {88852#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 15:30:02,017 INFO L290 TraceCheckUtils]: 13: Hoare triple {88852#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {88852#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 15:30:02,017 INFO L290 TraceCheckUtils]: 14: Hoare triple {88852#(= ssl3_accept_~blastFlag~0 0)} assume !false; {88852#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 15:30:02,017 INFO L290 TraceCheckUtils]: 15: Hoare triple {88852#(= ssl3_accept_~blastFlag~0 0)} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {88852#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 15:30:02,018 INFO L290 TraceCheckUtils]: 16: Hoare triple {88852#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {88852#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 15:30:02,018 INFO L290 TraceCheckUtils]: 17: Hoare triple {88852#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {88852#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 15:30:02,018 INFO L290 TraceCheckUtils]: 18: Hoare triple {88852#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {88852#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 15:30:02,018 INFO L290 TraceCheckUtils]: 19: Hoare triple {88852#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {88852#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 15:30:02,019 INFO L290 TraceCheckUtils]: 20: Hoare triple {88852#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {88852#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 15:30:02,019 INFO L290 TraceCheckUtils]: 21: Hoare triple {88852#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {88852#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 15:30:02,019 INFO L290 TraceCheckUtils]: 22: Hoare triple {88852#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {88852#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 15:30:02,020 INFO L290 TraceCheckUtils]: 23: Hoare triple {88852#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {88852#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 15:30:02,020 INFO L290 TraceCheckUtils]: 24: Hoare triple {88852#(= ssl3_accept_~blastFlag~0 0)} assume 8464 == #t~mem55;havoc #t~mem55; {88852#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 15:30:02,020 INFO L290 TraceCheckUtils]: 25: Hoare triple {88852#(= ssl3_accept_~blastFlag~0 0)} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {88852#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 15:30:02,021 INFO L290 TraceCheckUtils]: 26: Hoare triple {88852#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == ~blastFlag~0); {88848#false} is VALID [2022-04-08 15:30:02,021 INFO L290 TraceCheckUtils]: 27: Hoare triple {88848#false} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {88848#false} is VALID [2022-04-08 15:30:02,021 INFO L290 TraceCheckUtils]: 28: Hoare triple {88848#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {88848#false} is VALID [2022-04-08 15:30:02,021 INFO L290 TraceCheckUtils]: 29: Hoare triple {88848#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {88848#false} is VALID [2022-04-08 15:30:02,021 INFO L290 TraceCheckUtils]: 30: Hoare triple {88848#false} ~skip~0 := 0; {88848#false} is VALID [2022-04-08 15:30:02,021 INFO L290 TraceCheckUtils]: 31: Hoare triple {88848#false} assume !false; {88848#false} is VALID [2022-04-08 15:30:02,021 INFO L290 TraceCheckUtils]: 32: Hoare triple {88848#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-08 15:30:02,021 INFO L290 TraceCheckUtils]: 33: Hoare triple {88848#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-08 15:30:02,021 INFO L290 TraceCheckUtils]: 34: Hoare triple {88848#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-08 15:30:02,021 INFO L290 TraceCheckUtils]: 35: Hoare triple {88848#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-08 15:30:02,021 INFO L290 TraceCheckUtils]: 36: Hoare triple {88848#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-08 15:30:02,021 INFO L290 TraceCheckUtils]: 37: Hoare triple {88848#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-08 15:30:02,022 INFO L290 TraceCheckUtils]: 38: Hoare triple {88848#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-08 15:30:02,022 INFO L290 TraceCheckUtils]: 39: Hoare triple {88848#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-08 15:30:02,022 INFO L290 TraceCheckUtils]: 40: Hoare triple {88848#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-08 15:30:02,022 INFO L290 TraceCheckUtils]: 41: Hoare triple {88848#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-08 15:30:02,022 INFO L290 TraceCheckUtils]: 42: Hoare triple {88848#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-08 15:30:02,022 INFO L290 TraceCheckUtils]: 43: Hoare triple {88848#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-08 15:30:02,022 INFO L290 TraceCheckUtils]: 44: Hoare triple {88848#false} assume 8496 == #t~mem58;havoc #t~mem58; {88848#false} is VALID [2022-04-08 15:30:02,022 INFO L290 TraceCheckUtils]: 45: Hoare triple {88848#false} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {88848#false} is VALID [2022-04-08 15:30:02,022 INFO L290 TraceCheckUtils]: 46: Hoare triple {88848#false} assume !(1 == ~blastFlag~0); {88848#false} is VALID [2022-04-08 15:30:02,022 INFO L290 TraceCheckUtils]: 47: Hoare triple {88848#false} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {88848#false} is VALID [2022-04-08 15:30:02,022 INFO L290 TraceCheckUtils]: 48: Hoare triple {88848#false} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-08 15:30:02,022 INFO L290 TraceCheckUtils]: 49: Hoare triple {88848#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {88848#false} is VALID [2022-04-08 15:30:02,023 INFO L290 TraceCheckUtils]: 50: Hoare triple {88848#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {88848#false} is VALID [2022-04-08 15:30:02,023 INFO L290 TraceCheckUtils]: 51: Hoare triple {88848#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {88848#false} is VALID [2022-04-08 15:30:02,023 INFO L290 TraceCheckUtils]: 52: Hoare triple {88848#false} ~skip~0 := 0; {88848#false} is VALID [2022-04-08 15:30:02,023 INFO L290 TraceCheckUtils]: 53: Hoare triple {88848#false} assume !false; {88848#false} is VALID [2022-04-08 15:30:02,023 INFO L290 TraceCheckUtils]: 54: Hoare triple {88848#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-08 15:30:02,023 INFO L290 TraceCheckUtils]: 55: Hoare triple {88848#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-08 15:30:02,023 INFO L290 TraceCheckUtils]: 56: Hoare triple {88848#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-08 15:30:02,023 INFO L290 TraceCheckUtils]: 57: Hoare triple {88848#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-08 15:30:02,023 INFO L290 TraceCheckUtils]: 58: Hoare triple {88848#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-08 15:30:02,023 INFO L290 TraceCheckUtils]: 59: Hoare triple {88848#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-08 15:30:02,023 INFO L290 TraceCheckUtils]: 60: Hoare triple {88848#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-08 15:30:02,023 INFO L290 TraceCheckUtils]: 61: Hoare triple {88848#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-08 15:30:02,023 INFO L290 TraceCheckUtils]: 62: Hoare triple {88848#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-08 15:30:02,024 INFO L290 TraceCheckUtils]: 63: Hoare triple {88848#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-08 15:30:02,024 INFO L290 TraceCheckUtils]: 64: Hoare triple {88848#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-08 15:30:02,024 INFO L290 TraceCheckUtils]: 65: Hoare triple {88848#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-08 15:30:02,024 INFO L290 TraceCheckUtils]: 66: Hoare triple {88848#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-08 15:30:02,024 INFO L290 TraceCheckUtils]: 67: Hoare triple {88848#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-08 15:30:02,024 INFO L290 TraceCheckUtils]: 68: Hoare triple {88848#false} assume 8512 == #t~mem60;havoc #t~mem60; {88848#false} is VALID [2022-04-08 15:30:02,024 INFO L290 TraceCheckUtils]: 69: Hoare triple {88848#false} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 888 + #t~mem95.offset, 8);call #t~mem97 := read~int(#t~mem96.base, 20 + #t~mem96.offset, 8); {88848#false} is VALID [2022-04-08 15:30:02,024 INFO L290 TraceCheckUtils]: 70: Hoare triple {88848#false} assume 0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 18446744073709551616;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;~skip~0 := 1; {88848#false} is VALID [2022-04-08 15:30:02,024 INFO L290 TraceCheckUtils]: 71: Hoare triple {88848#false} call write~int(8528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {88848#false} is VALID [2022-04-08 15:30:02,024 INFO L290 TraceCheckUtils]: 72: Hoare triple {88848#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {88848#false} is VALID [2022-04-08 15:30:02,024 INFO L290 TraceCheckUtils]: 73: Hoare triple {88848#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {88848#false} is VALID [2022-04-08 15:30:02,024 INFO L290 TraceCheckUtils]: 74: Hoare triple {88848#false} ~skip~0 := 0; {88848#false} is VALID [2022-04-08 15:30:02,024 INFO L290 TraceCheckUtils]: 75: Hoare triple {88848#false} assume !false; {88848#false} is VALID [2022-04-08 15:30:02,025 INFO L290 TraceCheckUtils]: 76: Hoare triple {88848#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-08 15:30:02,025 INFO L290 TraceCheckUtils]: 77: Hoare triple {88848#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-08 15:30:02,025 INFO L290 TraceCheckUtils]: 78: Hoare triple {88848#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-08 15:30:02,025 INFO L290 TraceCheckUtils]: 79: Hoare triple {88848#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-08 15:30:02,025 INFO L290 TraceCheckUtils]: 80: Hoare triple {88848#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-08 15:30:02,025 INFO L290 TraceCheckUtils]: 81: Hoare triple {88848#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-08 15:30:02,025 INFO L290 TraceCheckUtils]: 82: Hoare triple {88848#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-08 15:30:02,025 INFO L290 TraceCheckUtils]: 83: Hoare triple {88848#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-08 15:30:02,025 INFO L290 TraceCheckUtils]: 84: Hoare triple {88848#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-08 15:30:02,025 INFO L290 TraceCheckUtils]: 85: Hoare triple {88848#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-08 15:30:02,025 INFO L290 TraceCheckUtils]: 86: Hoare triple {88848#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-08 15:30:02,025 INFO L290 TraceCheckUtils]: 87: Hoare triple {88848#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-08 15:30:02,025 INFO L290 TraceCheckUtils]: 88: Hoare triple {88848#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-08 15:30:02,026 INFO L290 TraceCheckUtils]: 89: Hoare triple {88848#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-08 15:30:02,026 INFO L290 TraceCheckUtils]: 90: Hoare triple {88848#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-08 15:30:02,026 INFO L290 TraceCheckUtils]: 91: Hoare triple {88848#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-08 15:30:02,026 INFO L290 TraceCheckUtils]: 92: Hoare triple {88848#false} assume 8528 == #t~mem62;havoc #t~mem62; {88848#false} is VALID [2022-04-08 15:30:02,026 INFO L290 TraceCheckUtils]: 93: Hoare triple {88848#false} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 888 + #t~mem99.offset, 8);call #t~mem101 := read~int(#t~mem100.base, 20 + #t~mem100.offset, 8);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 332 + ~s.offset, 8); {88848#false} is VALID [2022-04-08 15:30:02,026 INFO L290 TraceCheckUtils]: 94: Hoare triple {88848#false} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 18446744073709551616;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem103.base, 935 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {88848#false} is VALID [2022-04-08 15:30:02,026 INFO L290 TraceCheckUtils]: 95: Hoare triple {88848#false} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem106 := read~int(#t~mem105.base, 935 + #t~mem105.offset, 4); {88848#false} is VALID [2022-04-08 15:30:02,026 INFO L290 TraceCheckUtils]: 96: Hoare triple {88848#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {88848#false} is VALID [2022-04-08 15:30:02,026 INFO L290 TraceCheckUtils]: 97: Hoare triple {88848#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 18446744073709551616); {88848#false} is VALID [2022-04-08 15:30:02,026 INFO L290 TraceCheckUtils]: 98: Hoare triple {88848#false} assume !(0 != ~l~0 % 18446744073709551616);~skip~0 := 1; {88848#false} is VALID [2022-04-08 15:30:02,026 INFO L290 TraceCheckUtils]: 99: Hoare triple {88848#false} call write~int(8544, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {88848#false} is VALID [2022-04-08 15:30:02,026 INFO L290 TraceCheckUtils]: 100: Hoare triple {88848#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {88848#false} is VALID [2022-04-08 15:30:02,027 INFO L290 TraceCheckUtils]: 101: Hoare triple {88848#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {88848#false} is VALID [2022-04-08 15:30:02,027 INFO L290 TraceCheckUtils]: 102: Hoare triple {88848#false} ~skip~0 := 0; {88848#false} is VALID [2022-04-08 15:30:02,027 INFO L290 TraceCheckUtils]: 103: Hoare triple {88848#false} assume !false; {88848#false} is VALID [2022-04-08 15:30:02,027 INFO L290 TraceCheckUtils]: 104: Hoare triple {88848#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-08 15:30:02,027 INFO L290 TraceCheckUtils]: 105: Hoare triple {88848#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-08 15:30:02,027 INFO L290 TraceCheckUtils]: 106: Hoare triple {88848#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-08 15:30:02,027 INFO L290 TraceCheckUtils]: 107: Hoare triple {88848#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-08 15:30:02,027 INFO L290 TraceCheckUtils]: 108: Hoare triple {88848#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-08 15:30:02,027 INFO L290 TraceCheckUtils]: 109: Hoare triple {88848#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-08 15:30:02,027 INFO L290 TraceCheckUtils]: 110: Hoare triple {88848#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-08 15:30:02,027 INFO L290 TraceCheckUtils]: 111: Hoare triple {88848#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-08 15:30:02,027 INFO L290 TraceCheckUtils]: 112: Hoare triple {88848#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-08 15:30:02,028 INFO L290 TraceCheckUtils]: 113: Hoare triple {88848#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-08 15:30:02,028 INFO L290 TraceCheckUtils]: 114: Hoare triple {88848#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-08 15:30:02,028 INFO L290 TraceCheckUtils]: 115: Hoare triple {88848#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-08 15:30:02,028 INFO L290 TraceCheckUtils]: 116: Hoare triple {88848#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-08 15:30:02,028 INFO L290 TraceCheckUtils]: 117: Hoare triple {88848#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-08 15:30:02,028 INFO L290 TraceCheckUtils]: 118: Hoare triple {88848#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-08 15:30:02,028 INFO L290 TraceCheckUtils]: 119: Hoare triple {88848#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-08 15:30:02,028 INFO L290 TraceCheckUtils]: 120: Hoare triple {88848#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-08 15:30:02,028 INFO L290 TraceCheckUtils]: 121: Hoare triple {88848#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {88848#false} is VALID [2022-04-08 15:30:02,028 INFO L290 TraceCheckUtils]: 122: Hoare triple {88848#false} assume 8544 == #t~mem64;havoc #t~mem64; {88848#false} is VALID [2022-04-08 15:30:02,028 INFO L290 TraceCheckUtils]: 123: Hoare triple {88848#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {88848#false} is VALID [2022-04-08 15:30:02,028 INFO L290 TraceCheckUtils]: 124: Hoare triple {88848#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {88848#false} is VALID [2022-04-08 15:30:02,028 INFO L290 TraceCheckUtils]: 125: Hoare triple {88848#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {88848#false} is VALID [2022-04-08 15:30:02,029 INFO L290 TraceCheckUtils]: 126: Hoare triple {88848#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {88848#false} is VALID [2022-04-08 15:30:02,029 INFO L290 TraceCheckUtils]: 127: Hoare triple {88848#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {88848#false} is VALID [2022-04-08 15:30:02,029 INFO L290 TraceCheckUtils]: 128: Hoare triple {88848#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {88848#false} is VALID [2022-04-08 15:30:02,029 INFO L290 TraceCheckUtils]: 129: Hoare triple {88848#false} assume 7 == ~blastFlag~0; {88848#false} is VALID [2022-04-08 15:30:02,029 INFO L290 TraceCheckUtils]: 130: Hoare triple {88848#false} assume !false; {88848#false} is VALID [2022-04-08 15:30:02,029 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2022-04-08 15:30:02,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:30:02,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531739715] [2022-04-08 15:30:02,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531739715] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:30:02,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:30:02,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:30:02,030 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:30:02,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2249895] [2022-04-08 15:30:02,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2249895] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:30:02,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:30:02,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:30:02,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267173703] [2022-04-08 15:30:02,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:30:02,031 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 131 [2022-04-08 15:30:02,031 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:30:02,032 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:02,093 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:30:02,094 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 15:30:02,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:30:02,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 15:30:02,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 15:30:02,094 INFO L87 Difference]: Start difference. First operand 982 states and 1449 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:04,114 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:30:05,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:30:05,129 INFO L93 Difference]: Finished difference Result 1940 states and 2871 transitions. [2022-04-08 15:30:05,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 15:30:05,129 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 131 [2022-04-08 15:30:05,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:30:05,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:05,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 425 transitions. [2022-04-08 15:30:05,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:05,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 425 transitions. [2022-04-08 15:30:05,133 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 425 transitions. [2022-04-08 15:30:05,429 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 425 edges. 425 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:30:05,465 INFO L225 Difference]: With dead ends: 1940 [2022-04-08 15:30:05,465 INFO L226 Difference]: Without dead ends: 984 [2022-04-08 15:30:05,466 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 15:30:05,466 INFO L913 BasicCegarLoop]: 211 mSDtfsCounter, 4 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-08 15:30:05,466 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 396 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 233 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-08 15:30:05,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2022-04-08 15:30:05,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 984. [2022-04-08 15:30:05,516 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:30:05,517 INFO L82 GeneralOperation]: Start isEquivalent. First operand 984 states. Second operand has 984 states, 979 states have (on average 1.4780388151174668) internal successors, (1447), 979 states have internal predecessors, (1447), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:05,518 INFO L74 IsIncluded]: Start isIncluded. First operand 984 states. Second operand has 984 states, 979 states have (on average 1.4780388151174668) internal successors, (1447), 979 states have internal predecessors, (1447), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:05,519 INFO L87 Difference]: Start difference. First operand 984 states. Second operand has 984 states, 979 states have (on average 1.4780388151174668) internal successors, (1447), 979 states have internal predecessors, (1447), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:05,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:30:05,546 INFO L93 Difference]: Finished difference Result 984 states and 1451 transitions. [2022-04-08 15:30:05,546 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1451 transitions. [2022-04-08 15:30:05,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:30:05,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:30:05,548 INFO L74 IsIncluded]: Start isIncluded. First operand has 984 states, 979 states have (on average 1.4780388151174668) internal successors, (1447), 979 states have internal predecessors, (1447), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 984 states. [2022-04-08 15:30:05,549 INFO L87 Difference]: Start difference. First operand has 984 states, 979 states have (on average 1.4780388151174668) internal successors, (1447), 979 states have internal predecessors, (1447), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 984 states. [2022-04-08 15:30:05,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:30:05,577 INFO L93 Difference]: Finished difference Result 984 states and 1451 transitions. [2022-04-08 15:30:05,577 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1451 transitions. [2022-04-08 15:30:05,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:30:05,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:30:05,578 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:30:05,578 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:30:05,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 984 states, 979 states have (on average 1.4780388151174668) internal successors, (1447), 979 states have internal predecessors, (1447), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:05,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1451 transitions. [2022-04-08 15:30:05,629 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1451 transitions. Word has length 131 [2022-04-08 15:30:05,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:30:05,629 INFO L478 AbstractCegarLoop]: Abstraction has 984 states and 1451 transitions. [2022-04-08 15:30:05,629 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:05,629 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 984 states and 1451 transitions. [2022-04-08 15:30:06,991 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1451 edges. 1451 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:30:06,991 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1451 transitions. [2022-04-08 15:30:06,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-04-08 15:30:06,993 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:30:06,993 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:30:06,993 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-04-08 15:30:06,993 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:30:06,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:30:06,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1541930600, now seen corresponding path program 1 times [2022-04-08 15:30:06,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:30:06,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1731411033] [2022-04-08 15:30:07,097 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:30:07,097 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:30:07,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1541930600, now seen corresponding path program 2 times [2022-04-08 15:30:07,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:30:07,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484987493] [2022-04-08 15:30:07,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:30:07,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:30:07,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:30:07,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:30:07,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:30:07,236 INFO L290 TraceCheckUtils]: 0: Hoare triple {96678#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {96672#true} is VALID [2022-04-08 15:30:07,236 INFO L290 TraceCheckUtils]: 1: Hoare triple {96672#true} assume true; {96672#true} is VALID [2022-04-08 15:30:07,236 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {96672#true} {96672#true} #690#return; {96672#true} is VALID [2022-04-08 15:30:07,237 INFO L272 TraceCheckUtils]: 0: Hoare triple {96672#true} call ULTIMATE.init(); {96678#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:30:07,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {96678#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {96672#true} is VALID [2022-04-08 15:30:07,237 INFO L290 TraceCheckUtils]: 2: Hoare triple {96672#true} assume true; {96672#true} is VALID [2022-04-08 15:30:07,237 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {96672#true} {96672#true} #690#return; {96672#true} is VALID [2022-04-08 15:30:07,237 INFO L272 TraceCheckUtils]: 4: Hoare triple {96672#true} call #t~ret161 := main(); {96672#true} is VALID [2022-04-08 15:30:07,237 INFO L290 TraceCheckUtils]: 5: Hoare triple {96672#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {96672#true} is VALID [2022-04-08 15:30:07,237 INFO L290 TraceCheckUtils]: 6: Hoare triple {96672#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {96672#true} is VALID [2022-04-08 15:30:07,238 INFO L272 TraceCheckUtils]: 7: Hoare triple {96672#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {96672#true} is VALID [2022-04-08 15:30:07,238 INFO L290 TraceCheckUtils]: 8: Hoare triple {96672#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {96672#true} is VALID [2022-04-08 15:30:07,238 INFO L290 TraceCheckUtils]: 9: Hoare triple {96672#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {96672#true} is VALID [2022-04-08 15:30:07,238 INFO L290 TraceCheckUtils]: 10: Hoare triple {96672#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {96672#true} is VALID [2022-04-08 15:30:07,238 INFO L290 TraceCheckUtils]: 11: Hoare triple {96672#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {96672#true} is VALID [2022-04-08 15:30:07,238 INFO L290 TraceCheckUtils]: 12: Hoare triple {96672#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {96672#true} is VALID [2022-04-08 15:30:07,238 INFO L290 TraceCheckUtils]: 13: Hoare triple {96672#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {96672#true} is VALID [2022-04-08 15:30:07,238 INFO L290 TraceCheckUtils]: 14: Hoare triple {96672#true} assume !false; {96672#true} is VALID [2022-04-08 15:30:07,238 INFO L290 TraceCheckUtils]: 15: Hoare triple {96672#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {96672#true} is VALID [2022-04-08 15:30:07,238 INFO L290 TraceCheckUtils]: 16: Hoare triple {96672#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {96672#true} is VALID [2022-04-08 15:30:07,238 INFO L290 TraceCheckUtils]: 17: Hoare triple {96672#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {96672#true} is VALID [2022-04-08 15:30:07,238 INFO L290 TraceCheckUtils]: 18: Hoare triple {96672#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {96672#true} is VALID [2022-04-08 15:30:07,239 INFO L290 TraceCheckUtils]: 19: Hoare triple {96672#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {96672#true} is VALID [2022-04-08 15:30:07,239 INFO L290 TraceCheckUtils]: 20: Hoare triple {96672#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {96672#true} is VALID [2022-04-08 15:30:07,239 INFO L290 TraceCheckUtils]: 21: Hoare triple {96672#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {96672#true} is VALID [2022-04-08 15:30:07,239 INFO L290 TraceCheckUtils]: 22: Hoare triple {96672#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {96672#true} is VALID [2022-04-08 15:30:07,239 INFO L290 TraceCheckUtils]: 23: Hoare triple {96672#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {96672#true} is VALID [2022-04-08 15:30:07,239 INFO L290 TraceCheckUtils]: 24: Hoare triple {96672#true} assume 8464 == #t~mem55;havoc #t~mem55; {96672#true} is VALID [2022-04-08 15:30:07,239 INFO L290 TraceCheckUtils]: 25: Hoare triple {96672#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {96672#true} is VALID [2022-04-08 15:30:07,239 INFO L290 TraceCheckUtils]: 26: Hoare triple {96672#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {96672#true} is VALID [2022-04-08 15:30:07,239 INFO L290 TraceCheckUtils]: 27: Hoare triple {96672#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {96672#true} is VALID [2022-04-08 15:30:07,239 INFO L290 TraceCheckUtils]: 28: Hoare triple {96672#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {96672#true} is VALID [2022-04-08 15:30:07,239 INFO L290 TraceCheckUtils]: 29: Hoare triple {96672#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {96672#true} is VALID [2022-04-08 15:30:07,239 INFO L290 TraceCheckUtils]: 30: Hoare triple {96672#true} ~skip~0 := 0; {96672#true} is VALID [2022-04-08 15:30:07,240 INFO L290 TraceCheckUtils]: 31: Hoare triple {96672#true} assume !false; {96672#true} is VALID [2022-04-08 15:30:07,240 INFO L290 TraceCheckUtils]: 32: Hoare triple {96672#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {96672#true} is VALID [2022-04-08 15:30:07,240 INFO L290 TraceCheckUtils]: 33: Hoare triple {96672#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {96672#true} is VALID [2022-04-08 15:30:07,240 INFO L290 TraceCheckUtils]: 34: Hoare triple {96672#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {96672#true} is VALID [2022-04-08 15:30:07,240 INFO L290 TraceCheckUtils]: 35: Hoare triple {96672#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {96672#true} is VALID [2022-04-08 15:30:07,240 INFO L290 TraceCheckUtils]: 36: Hoare triple {96672#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {96672#true} is VALID [2022-04-08 15:30:07,240 INFO L290 TraceCheckUtils]: 37: Hoare triple {96672#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {96672#true} is VALID [2022-04-08 15:30:07,240 INFO L290 TraceCheckUtils]: 38: Hoare triple {96672#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {96672#true} is VALID [2022-04-08 15:30:07,240 INFO L290 TraceCheckUtils]: 39: Hoare triple {96672#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {96672#true} is VALID [2022-04-08 15:30:07,240 INFO L290 TraceCheckUtils]: 40: Hoare triple {96672#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {96672#true} is VALID [2022-04-08 15:30:07,240 INFO L290 TraceCheckUtils]: 41: Hoare triple {96672#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {96672#true} is VALID [2022-04-08 15:30:07,240 INFO L290 TraceCheckUtils]: 42: Hoare triple {96672#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {96672#true} is VALID [2022-04-08 15:30:07,240 INFO L290 TraceCheckUtils]: 43: Hoare triple {96672#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {96672#true} is VALID [2022-04-08 15:30:07,241 INFO L290 TraceCheckUtils]: 44: Hoare triple {96672#true} assume 8496 == #t~mem58;havoc #t~mem58; {96672#true} is VALID [2022-04-08 15:30:07,241 INFO L290 TraceCheckUtils]: 45: Hoare triple {96672#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {96672#true} is VALID [2022-04-08 15:30:07,241 INFO L290 TraceCheckUtils]: 46: Hoare triple {96672#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {96672#true} is VALID [2022-04-08 15:30:07,241 INFO L290 TraceCheckUtils]: 47: Hoare triple {96672#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {96672#true} is VALID [2022-04-08 15:30:07,241 INFO L290 TraceCheckUtils]: 48: Hoare triple {96672#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 72 + ~s.offset, 4); {96672#true} is VALID [2022-04-08 15:30:07,241 INFO L290 TraceCheckUtils]: 49: Hoare triple {96672#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {96672#true} is VALID [2022-04-08 15:30:07,241 INFO L290 TraceCheckUtils]: 50: Hoare triple {96672#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {96672#true} is VALID [2022-04-08 15:30:07,241 INFO L290 TraceCheckUtils]: 51: Hoare triple {96672#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {96672#true} is VALID [2022-04-08 15:30:07,241 INFO L290 TraceCheckUtils]: 52: Hoare triple {96672#true} ~skip~0 := 0; {96672#true} is VALID [2022-04-08 15:30:07,241 INFO L290 TraceCheckUtils]: 53: Hoare triple {96672#true} assume !false; {96672#true} is VALID [2022-04-08 15:30:07,241 INFO L290 TraceCheckUtils]: 54: Hoare triple {96672#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {96672#true} is VALID [2022-04-08 15:30:07,241 INFO L290 TraceCheckUtils]: 55: Hoare triple {96672#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {96672#true} is VALID [2022-04-08 15:30:07,242 INFO L290 TraceCheckUtils]: 56: Hoare triple {96672#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {96672#true} is VALID [2022-04-08 15:30:07,242 INFO L290 TraceCheckUtils]: 57: Hoare triple {96672#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {96672#true} is VALID [2022-04-08 15:30:07,242 INFO L290 TraceCheckUtils]: 58: Hoare triple {96672#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {96672#true} is VALID [2022-04-08 15:30:07,242 INFO L290 TraceCheckUtils]: 59: Hoare triple {96672#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {96672#true} is VALID [2022-04-08 15:30:07,242 INFO L290 TraceCheckUtils]: 60: Hoare triple {96672#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {96672#true} is VALID [2022-04-08 15:30:07,242 INFO L290 TraceCheckUtils]: 61: Hoare triple {96672#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {96672#true} is VALID [2022-04-08 15:30:07,242 INFO L290 TraceCheckUtils]: 62: Hoare triple {96672#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {96672#true} is VALID [2022-04-08 15:30:07,242 INFO L290 TraceCheckUtils]: 63: Hoare triple {96672#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {96672#true} is VALID [2022-04-08 15:30:07,242 INFO L290 TraceCheckUtils]: 64: Hoare triple {96672#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {96672#true} is VALID [2022-04-08 15:30:07,242 INFO L290 TraceCheckUtils]: 65: Hoare triple {96672#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {96672#true} is VALID [2022-04-08 15:30:07,242 INFO L290 TraceCheckUtils]: 66: Hoare triple {96672#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {96672#true} is VALID [2022-04-08 15:30:07,242 INFO L290 TraceCheckUtils]: 67: Hoare triple {96672#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {96672#true} is VALID [2022-04-08 15:30:07,242 INFO L290 TraceCheckUtils]: 68: Hoare triple {96672#true} assume 8512 == #t~mem60;havoc #t~mem60; {96672#true} is VALID [2022-04-08 15:30:07,243 INFO L290 TraceCheckUtils]: 69: Hoare triple {96672#true} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 888 + #t~mem95.offset, 8);call #t~mem97 := read~int(#t~mem96.base, 20 + #t~mem96.offset, 8); {96672#true} is VALID [2022-04-08 15:30:07,243 INFO L290 TraceCheckUtils]: 70: Hoare triple {96672#true} assume !(0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 18446744073709551616);havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {96672#true} is VALID [2022-04-08 15:30:07,243 INFO L290 TraceCheckUtils]: 71: Hoare triple {96672#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 6; {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:30:07,244 INFO L290 TraceCheckUtils]: 72: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(~ret~0 <= 0); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:30:07,244 INFO L290 TraceCheckUtils]: 73: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} call write~int(8528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:30:07,244 INFO L290 TraceCheckUtils]: 74: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:30:07,244 INFO L290 TraceCheckUtils]: 75: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:30:07,245 INFO L290 TraceCheckUtils]: 76: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} ~skip~0 := 0; {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:30:07,245 INFO L290 TraceCheckUtils]: 77: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !false; {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:30:07,245 INFO L290 TraceCheckUtils]: 78: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:30:07,246 INFO L290 TraceCheckUtils]: 79: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:30:07,246 INFO L290 TraceCheckUtils]: 80: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:30:07,246 INFO L290 TraceCheckUtils]: 81: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:30:07,246 INFO L290 TraceCheckUtils]: 82: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:30:07,247 INFO L290 TraceCheckUtils]: 83: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:30:07,247 INFO L290 TraceCheckUtils]: 84: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:30:07,247 INFO L290 TraceCheckUtils]: 85: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:30:07,248 INFO L290 TraceCheckUtils]: 86: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:30:07,248 INFO L290 TraceCheckUtils]: 87: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:30:07,248 INFO L290 TraceCheckUtils]: 88: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:30:07,248 INFO L290 TraceCheckUtils]: 89: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:30:07,249 INFO L290 TraceCheckUtils]: 90: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:30:07,249 INFO L290 TraceCheckUtils]: 91: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:30:07,249 INFO L290 TraceCheckUtils]: 92: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:30:07,250 INFO L290 TraceCheckUtils]: 93: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:30:07,250 INFO L290 TraceCheckUtils]: 94: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume 8528 == #t~mem62;havoc #t~mem62; {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:30:07,250 INFO L290 TraceCheckUtils]: 95: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 888 + #t~mem99.offset, 8);call #t~mem101 := read~int(#t~mem100.base, 20 + #t~mem100.offset, 8);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 332 + ~s.offset, 8); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:30:07,250 INFO L290 TraceCheckUtils]: 96: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 18446744073709551616;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem103.base, 935 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:30:07,251 INFO L290 TraceCheckUtils]: 97: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem106 := read~int(#t~mem105.base, 935 + #t~mem105.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:30:07,251 INFO L290 TraceCheckUtils]: 98: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:30:07,251 INFO L290 TraceCheckUtils]: 99: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 18446744073709551616); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:30:07,252 INFO L290 TraceCheckUtils]: 100: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(0 != ~l~0 % 18446744073709551616);~skip~0 := 1; {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:30:07,252 INFO L290 TraceCheckUtils]: 101: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} call write~int(8544, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:30:07,252 INFO L290 TraceCheckUtils]: 102: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:30:07,252 INFO L290 TraceCheckUtils]: 103: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:30:07,253 INFO L290 TraceCheckUtils]: 104: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} ~skip~0 := 0; {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:30:07,253 INFO L290 TraceCheckUtils]: 105: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !false; {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:30:07,253 INFO L290 TraceCheckUtils]: 106: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:30:07,254 INFO L290 TraceCheckUtils]: 107: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:30:07,254 INFO L290 TraceCheckUtils]: 108: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:30:07,254 INFO L290 TraceCheckUtils]: 109: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:30:07,254 INFO L290 TraceCheckUtils]: 110: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:30:07,287 INFO L290 TraceCheckUtils]: 111: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:30:07,288 INFO L290 TraceCheckUtils]: 112: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:30:07,288 INFO L290 TraceCheckUtils]: 113: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:30:07,288 INFO L290 TraceCheckUtils]: 114: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:30:07,289 INFO L290 TraceCheckUtils]: 115: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:30:07,289 INFO L290 TraceCheckUtils]: 116: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:30:07,289 INFO L290 TraceCheckUtils]: 117: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:30:07,289 INFO L290 TraceCheckUtils]: 118: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:30:07,290 INFO L290 TraceCheckUtils]: 119: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:30:07,290 INFO L290 TraceCheckUtils]: 120: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:30:07,290 INFO L290 TraceCheckUtils]: 121: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:30:07,291 INFO L290 TraceCheckUtils]: 122: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:30:07,291 INFO L290 TraceCheckUtils]: 123: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:30:07,291 INFO L290 TraceCheckUtils]: 124: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume 8544 == #t~mem64;havoc #t~mem64; {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:30:07,292 INFO L290 TraceCheckUtils]: 125: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:30:07,292 INFO L290 TraceCheckUtils]: 126: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:30:07,292 INFO L290 TraceCheckUtils]: 127: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:30:07,293 INFO L290 TraceCheckUtils]: 128: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:30:07,293 INFO L290 TraceCheckUtils]: 129: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:30:07,293 INFO L290 TraceCheckUtils]: 130: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {96677#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:30:07,294 INFO L290 TraceCheckUtils]: 131: Hoare triple {96677#(<= ssl3_accept_~blastFlag~0 6)} assume 7 == ~blastFlag~0; {96673#false} is VALID [2022-04-08 15:30:07,294 INFO L290 TraceCheckUtils]: 132: Hoare triple {96673#false} assume !false; {96673#false} is VALID [2022-04-08 15:30:07,294 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-08 15:30:07,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:30:07,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484987493] [2022-04-08 15:30:07,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484987493] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:30:07,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:30:07,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:30:07,295 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:30:07,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1731411033] [2022-04-08 15:30:07,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1731411033] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:30:07,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:30:07,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:30:07,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090710637] [2022-04-08 15:30:07,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:30:07,297 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 133 [2022-04-08 15:30:07,297 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:30:07,297 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:07,377 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:30:07,377 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 15:30:07,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:30:07,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 15:30:07,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 15:30:07,378 INFO L87 Difference]: Start difference. First operand 984 states and 1451 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:09,940 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:30:14,124 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:30:15,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:30:15,640 INFO L93 Difference]: Finished difference Result 2407 states and 3569 transitions. [2022-04-08 15:30:15,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 15:30:15,640 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 133 [2022-04-08 15:30:15,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:30:15,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:15,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 607 transitions. [2022-04-08 15:30:15,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:15,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 607 transitions. [2022-04-08 15:30:15,644 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 607 transitions. [2022-04-08 15:30:16,052 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 607 edges. 607 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:30:16,134 INFO L225 Difference]: With dead ends: 2407 [2022-04-08 15:30:16,134 INFO L226 Difference]: Without dead ends: 1451 [2022-04-08 15:30:16,135 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 15:30:16,135 INFO L913 BasicCegarLoop]: 195 mSDtfsCounter, 157 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 15 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-04-08 15:30:16,136 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 380 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 246 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2022-04-08 15:30:16,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2022-04-08 15:30:16,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 1449. [2022-04-08 15:30:16,722 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:30:16,724 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1451 states. Second operand has 1449 states, 1444 states have (on average 1.484072022160665) internal successors, (2143), 1444 states have internal predecessors, (2143), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:16,724 INFO L74 IsIncluded]: Start isIncluded. First operand 1451 states. Second operand has 1449 states, 1444 states have (on average 1.484072022160665) internal successors, (2143), 1444 states have internal predecessors, (2143), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:16,725 INFO L87 Difference]: Start difference. First operand 1451 states. Second operand has 1449 states, 1444 states have (on average 1.484072022160665) internal successors, (2143), 1444 states have internal predecessors, (2143), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:16,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:30:16,778 INFO L93 Difference]: Finished difference Result 1451 states and 2148 transitions. [2022-04-08 15:30:16,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 2148 transitions. [2022-04-08 15:30:16,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:30:16,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:30:16,781 INFO L74 IsIncluded]: Start isIncluded. First operand has 1449 states, 1444 states have (on average 1.484072022160665) internal successors, (2143), 1444 states have internal predecessors, (2143), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1451 states. [2022-04-08 15:30:16,782 INFO L87 Difference]: Start difference. First operand has 1449 states, 1444 states have (on average 1.484072022160665) internal successors, (2143), 1444 states have internal predecessors, (2143), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1451 states. [2022-04-08 15:30:16,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:30:16,835 INFO L93 Difference]: Finished difference Result 1451 states and 2148 transitions. [2022-04-08 15:30:16,835 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 2148 transitions. [2022-04-08 15:30:16,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:30:16,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:30:16,836 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:30:16,836 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:30:16,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1449 states, 1444 states have (on average 1.484072022160665) internal successors, (2143), 1444 states have internal predecessors, (2143), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:16,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1449 states to 1449 states and 2147 transitions. [2022-04-08 15:30:16,922 INFO L78 Accepts]: Start accepts. Automaton has 1449 states and 2147 transitions. Word has length 133 [2022-04-08 15:30:16,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:30:16,922 INFO L478 AbstractCegarLoop]: Abstraction has 1449 states and 2147 transitions. [2022-04-08 15:30:16,922 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:16,922 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1449 states and 2147 transitions. [2022-04-08 15:30:19,006 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2147 edges. 2147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:30:19,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1449 states and 2147 transitions. [2022-04-08 15:30:19,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-04-08 15:30:19,008 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:30:19,008 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:30:19,008 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-04-08 15:30:19,008 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:30:19,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:30:19,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1653660413, now seen corresponding path program 1 times [2022-04-08 15:30:19,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:30:19,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1469487264] [2022-04-08 15:30:19,124 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:30:19,124 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:30:19,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1653660413, now seen corresponding path program 2 times [2022-04-08 15:30:19,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:30:19,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301220824] [2022-04-08 15:30:19,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:30:19,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:30:19,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:30:19,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:30:19,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:30:19,533 INFO L290 TraceCheckUtils]: 0: Hoare triple {107304#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {107295#true} is VALID [2022-04-08 15:30:19,533 INFO L290 TraceCheckUtils]: 1: Hoare triple {107295#true} assume true; {107295#true} is VALID [2022-04-08 15:30:19,533 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {107295#true} {107295#true} #690#return; {107295#true} is VALID [2022-04-08 15:30:19,534 INFO L272 TraceCheckUtils]: 0: Hoare triple {107295#true} call ULTIMATE.init(); {107304#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:30:19,534 INFO L290 TraceCheckUtils]: 1: Hoare triple {107304#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {107295#true} is VALID [2022-04-08 15:30:19,534 INFO L290 TraceCheckUtils]: 2: Hoare triple {107295#true} assume true; {107295#true} is VALID [2022-04-08 15:30:19,534 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {107295#true} {107295#true} #690#return; {107295#true} is VALID [2022-04-08 15:30:19,535 INFO L272 TraceCheckUtils]: 4: Hoare triple {107295#true} call #t~ret161 := main(); {107295#true} is VALID [2022-04-08 15:30:19,535 INFO L290 TraceCheckUtils]: 5: Hoare triple {107295#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {107295#true} is VALID [2022-04-08 15:30:19,535 INFO L290 TraceCheckUtils]: 6: Hoare triple {107295#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {107300#(and (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 204)) 0) (= 0 (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 204))))} is VALID [2022-04-08 15:30:19,536 INFO L272 TraceCheckUtils]: 7: Hoare triple {107300#(and (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 204)) 0) (= 0 (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 204))))} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {107301#(and (= (select (select |#memory_$Pointer$.base| |ssl3_accept_#in~s.base|) (+ 204 |ssl3_accept_#in~s.offset|)) 0) (= (select (select |#memory_$Pointer$.offset| |ssl3_accept_#in~s.base|) (+ 204 |ssl3_accept_#in~s.offset|)) 0))} is VALID [2022-04-08 15:30:19,539 INFO L290 TraceCheckUtils]: 8: Hoare triple {107301#(and (= (select (select |#memory_$Pointer$.base| |ssl3_accept_#in~s.base|) (+ 204 |ssl3_accept_#in~s.offset|)) 0) (= (select (select |#memory_$Pointer$.offset| |ssl3_accept_#in~s.base|) (+ 204 |ssl3_accept_#in~s.offset|)) 0))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {107302#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} is VALID [2022-04-08 15:30:19,540 INFO L290 TraceCheckUtils]: 9: Hoare triple {107302#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {107302#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} is VALID [2022-04-08 15:30:19,540 INFO L290 TraceCheckUtils]: 10: Hoare triple {107302#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {107302#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} is VALID [2022-04-08 15:30:19,541 INFO L290 TraceCheckUtils]: 11: Hoare triple {107302#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {107302#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} is VALID [2022-04-08 15:30:19,541 INFO L290 TraceCheckUtils]: 12: Hoare triple {107302#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {107303#(and (= |ssl3_accept_#t~mem45.base| 0) (= |ssl3_accept_#t~mem45.offset| 0))} is VALID [2022-04-08 15:30:19,542 INFO L290 TraceCheckUtils]: 13: Hoare triple {107303#(and (= |ssl3_accept_#t~mem45.base| 0) (= |ssl3_accept_#t~mem45.offset| 0))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {107296#false} is VALID [2022-04-08 15:30:19,542 INFO L290 TraceCheckUtils]: 14: Hoare triple {107296#false} assume !false; {107296#false} is VALID [2022-04-08 15:30:19,542 INFO L290 TraceCheckUtils]: 15: Hoare triple {107296#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,542 INFO L290 TraceCheckUtils]: 16: Hoare triple {107296#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,542 INFO L290 TraceCheckUtils]: 17: Hoare triple {107296#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,542 INFO L290 TraceCheckUtils]: 18: Hoare triple {107296#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,542 INFO L290 TraceCheckUtils]: 19: Hoare triple {107296#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,542 INFO L290 TraceCheckUtils]: 20: Hoare triple {107296#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,542 INFO L290 TraceCheckUtils]: 21: Hoare triple {107296#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,542 INFO L290 TraceCheckUtils]: 22: Hoare triple {107296#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,543 INFO L290 TraceCheckUtils]: 23: Hoare triple {107296#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,543 INFO L290 TraceCheckUtils]: 24: Hoare triple {107296#false} assume 8464 == #t~mem55;havoc #t~mem55; {107296#false} is VALID [2022-04-08 15:30:19,543 INFO L290 TraceCheckUtils]: 25: Hoare triple {107296#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {107296#false} is VALID [2022-04-08 15:30:19,543 INFO L290 TraceCheckUtils]: 26: Hoare triple {107296#false} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {107296#false} is VALID [2022-04-08 15:30:19,543 INFO L290 TraceCheckUtils]: 27: Hoare triple {107296#false} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,543 INFO L290 TraceCheckUtils]: 28: Hoare triple {107296#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,543 INFO L290 TraceCheckUtils]: 29: Hoare triple {107296#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {107296#false} is VALID [2022-04-08 15:30:19,543 INFO L290 TraceCheckUtils]: 30: Hoare triple {107296#false} ~skip~0 := 0; {107296#false} is VALID [2022-04-08 15:30:19,543 INFO L290 TraceCheckUtils]: 31: Hoare triple {107296#false} assume !false; {107296#false} is VALID [2022-04-08 15:30:19,543 INFO L290 TraceCheckUtils]: 32: Hoare triple {107296#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,543 INFO L290 TraceCheckUtils]: 33: Hoare triple {107296#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,543 INFO L290 TraceCheckUtils]: 34: Hoare triple {107296#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,544 INFO L290 TraceCheckUtils]: 35: Hoare triple {107296#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,544 INFO L290 TraceCheckUtils]: 36: Hoare triple {107296#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,544 INFO L290 TraceCheckUtils]: 37: Hoare triple {107296#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,544 INFO L290 TraceCheckUtils]: 38: Hoare triple {107296#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,544 INFO L290 TraceCheckUtils]: 39: Hoare triple {107296#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,544 INFO L290 TraceCheckUtils]: 40: Hoare triple {107296#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,544 INFO L290 TraceCheckUtils]: 41: Hoare triple {107296#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,544 INFO L290 TraceCheckUtils]: 42: Hoare triple {107296#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,544 INFO L290 TraceCheckUtils]: 43: Hoare triple {107296#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,544 INFO L290 TraceCheckUtils]: 44: Hoare triple {107296#false} assume 8496 == #t~mem58;havoc #t~mem58; {107296#false} is VALID [2022-04-08 15:30:19,544 INFO L290 TraceCheckUtils]: 45: Hoare triple {107296#false} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {107296#false} is VALID [2022-04-08 15:30:19,544 INFO L290 TraceCheckUtils]: 46: Hoare triple {107296#false} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {107296#false} is VALID [2022-04-08 15:30:19,544 INFO L290 TraceCheckUtils]: 47: Hoare triple {107296#false} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,545 INFO L290 TraceCheckUtils]: 48: Hoare triple {107296#false} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,545 INFO L290 TraceCheckUtils]: 49: Hoare triple {107296#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,545 INFO L290 TraceCheckUtils]: 50: Hoare triple {107296#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,545 INFO L290 TraceCheckUtils]: 51: Hoare triple {107296#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {107296#false} is VALID [2022-04-08 15:30:19,545 INFO L290 TraceCheckUtils]: 52: Hoare triple {107296#false} ~skip~0 := 0; {107296#false} is VALID [2022-04-08 15:30:19,545 INFO L290 TraceCheckUtils]: 53: Hoare triple {107296#false} assume !false; {107296#false} is VALID [2022-04-08 15:30:19,545 INFO L290 TraceCheckUtils]: 54: Hoare triple {107296#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,545 INFO L290 TraceCheckUtils]: 55: Hoare triple {107296#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,545 INFO L290 TraceCheckUtils]: 56: Hoare triple {107296#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,545 INFO L290 TraceCheckUtils]: 57: Hoare triple {107296#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,545 INFO L290 TraceCheckUtils]: 58: Hoare triple {107296#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,545 INFO L290 TraceCheckUtils]: 59: Hoare triple {107296#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,545 INFO L290 TraceCheckUtils]: 60: Hoare triple {107296#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,546 INFO L290 TraceCheckUtils]: 61: Hoare triple {107296#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,546 INFO L290 TraceCheckUtils]: 62: Hoare triple {107296#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,546 INFO L290 TraceCheckUtils]: 63: Hoare triple {107296#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,546 INFO L290 TraceCheckUtils]: 64: Hoare triple {107296#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,546 INFO L290 TraceCheckUtils]: 65: Hoare triple {107296#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,546 INFO L290 TraceCheckUtils]: 66: Hoare triple {107296#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,546 INFO L290 TraceCheckUtils]: 67: Hoare triple {107296#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,546 INFO L290 TraceCheckUtils]: 68: Hoare triple {107296#false} assume 8512 == #t~mem60;havoc #t~mem60; {107296#false} is VALID [2022-04-08 15:30:19,546 INFO L290 TraceCheckUtils]: 69: Hoare triple {107296#false} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 888 + #t~mem95.offset, 8);call #t~mem97 := read~int(#t~mem96.base, 20 + #t~mem96.offset, 8); {107296#false} is VALID [2022-04-08 15:30:19,546 INFO L290 TraceCheckUtils]: 70: Hoare triple {107296#false} assume !(0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 18446744073709551616);havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {107296#false} is VALID [2022-04-08 15:30:19,546 INFO L290 TraceCheckUtils]: 71: Hoare triple {107296#false} assume 2 == ~blastFlag~0;~blastFlag~0 := 6; {107296#false} is VALID [2022-04-08 15:30:19,546 INFO L290 TraceCheckUtils]: 72: Hoare triple {107296#false} assume !(~ret~0 <= 0); {107296#false} is VALID [2022-04-08 15:30:19,546 INFO L290 TraceCheckUtils]: 73: Hoare triple {107296#false} call write~int(8528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,547 INFO L290 TraceCheckUtils]: 74: Hoare triple {107296#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,547 INFO L290 TraceCheckUtils]: 75: Hoare triple {107296#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {107296#false} is VALID [2022-04-08 15:30:19,547 INFO L290 TraceCheckUtils]: 76: Hoare triple {107296#false} ~skip~0 := 0; {107296#false} is VALID [2022-04-08 15:30:19,547 INFO L290 TraceCheckUtils]: 77: Hoare triple {107296#false} assume !false; {107296#false} is VALID [2022-04-08 15:30:19,547 INFO L290 TraceCheckUtils]: 78: Hoare triple {107296#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,547 INFO L290 TraceCheckUtils]: 79: Hoare triple {107296#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,547 INFO L290 TraceCheckUtils]: 80: Hoare triple {107296#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,547 INFO L290 TraceCheckUtils]: 81: Hoare triple {107296#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,547 INFO L290 TraceCheckUtils]: 82: Hoare triple {107296#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,547 INFO L290 TraceCheckUtils]: 83: Hoare triple {107296#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,547 INFO L290 TraceCheckUtils]: 84: Hoare triple {107296#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,547 INFO L290 TraceCheckUtils]: 85: Hoare triple {107296#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,548 INFO L290 TraceCheckUtils]: 86: Hoare triple {107296#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,548 INFO L290 TraceCheckUtils]: 87: Hoare triple {107296#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,548 INFO L290 TraceCheckUtils]: 88: Hoare triple {107296#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,548 INFO L290 TraceCheckUtils]: 89: Hoare triple {107296#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,548 INFO L290 TraceCheckUtils]: 90: Hoare triple {107296#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,548 INFO L290 TraceCheckUtils]: 91: Hoare triple {107296#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,548 INFO L290 TraceCheckUtils]: 92: Hoare triple {107296#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,548 INFO L290 TraceCheckUtils]: 93: Hoare triple {107296#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,548 INFO L290 TraceCheckUtils]: 94: Hoare triple {107296#false} assume 8528 == #t~mem62;havoc #t~mem62; {107296#false} is VALID [2022-04-08 15:30:19,548 INFO L290 TraceCheckUtils]: 95: Hoare triple {107296#false} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 888 + #t~mem99.offset, 8);call #t~mem101 := read~int(#t~mem100.base, 20 + #t~mem100.offset, 8);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 332 + ~s.offset, 8); {107296#false} is VALID [2022-04-08 15:30:19,548 INFO L290 TraceCheckUtils]: 96: Hoare triple {107296#false} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 18446744073709551616;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem103.base, 935 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {107296#false} is VALID [2022-04-08 15:30:19,548 INFO L290 TraceCheckUtils]: 97: Hoare triple {107296#false} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem106 := read~int(#t~mem105.base, 935 + #t~mem105.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,549 INFO L290 TraceCheckUtils]: 98: Hoare triple {107296#false} assume 0 != #t~mem106;havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {107296#false} is VALID [2022-04-08 15:30:19,549 INFO L290 TraceCheckUtils]: 99: Hoare triple {107296#false} assume -2147483648 <= #t~nondet115 && #t~nondet115 <= 2147483647;~ret~0 := #t~nondet115;havoc #t~nondet115; {107296#false} is VALID [2022-04-08 15:30:19,549 INFO L290 TraceCheckUtils]: 100: Hoare triple {107296#false} assume 6 == ~blastFlag~0;~blastFlag~0 := 7; {107296#false} is VALID [2022-04-08 15:30:19,549 INFO L290 TraceCheckUtils]: 101: Hoare triple {107296#false} assume !(~ret~0 <= 0); {107296#false} is VALID [2022-04-08 15:30:19,549 INFO L290 TraceCheckUtils]: 102: Hoare triple {107296#false} call write~int(8544, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,549 INFO L290 TraceCheckUtils]: 103: Hoare triple {107296#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,549 INFO L290 TraceCheckUtils]: 104: Hoare triple {107296#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {107296#false} is VALID [2022-04-08 15:30:19,549 INFO L290 TraceCheckUtils]: 105: Hoare triple {107296#false} ~skip~0 := 0; {107296#false} is VALID [2022-04-08 15:30:19,549 INFO L290 TraceCheckUtils]: 106: Hoare triple {107296#false} assume !false; {107296#false} is VALID [2022-04-08 15:30:19,549 INFO L290 TraceCheckUtils]: 107: Hoare triple {107296#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,549 INFO L290 TraceCheckUtils]: 108: Hoare triple {107296#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,549 INFO L290 TraceCheckUtils]: 109: Hoare triple {107296#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,550 INFO L290 TraceCheckUtils]: 110: Hoare triple {107296#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,550 INFO L290 TraceCheckUtils]: 111: Hoare triple {107296#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,550 INFO L290 TraceCheckUtils]: 112: Hoare triple {107296#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,550 INFO L290 TraceCheckUtils]: 113: Hoare triple {107296#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,550 INFO L290 TraceCheckUtils]: 114: Hoare triple {107296#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,550 INFO L290 TraceCheckUtils]: 115: Hoare triple {107296#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,550 INFO L290 TraceCheckUtils]: 116: Hoare triple {107296#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,550 INFO L290 TraceCheckUtils]: 117: Hoare triple {107296#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,550 INFO L290 TraceCheckUtils]: 118: Hoare triple {107296#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,550 INFO L290 TraceCheckUtils]: 119: Hoare triple {107296#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,550 INFO L290 TraceCheckUtils]: 120: Hoare triple {107296#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,550 INFO L290 TraceCheckUtils]: 121: Hoare triple {107296#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,550 INFO L290 TraceCheckUtils]: 122: Hoare triple {107296#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,551 INFO L290 TraceCheckUtils]: 123: Hoare triple {107296#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,551 INFO L290 TraceCheckUtils]: 124: Hoare triple {107296#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,551 INFO L290 TraceCheckUtils]: 125: Hoare triple {107296#false} assume 8544 == #t~mem64;havoc #t~mem64; {107296#false} is VALID [2022-04-08 15:30:19,551 INFO L290 TraceCheckUtils]: 126: Hoare triple {107296#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {107296#false} is VALID [2022-04-08 15:30:19,551 INFO L290 TraceCheckUtils]: 127: Hoare triple {107296#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {107296#false} is VALID [2022-04-08 15:30:19,551 INFO L290 TraceCheckUtils]: 128: Hoare triple {107296#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {107296#false} is VALID [2022-04-08 15:30:19,551 INFO L290 TraceCheckUtils]: 129: Hoare triple {107296#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {107296#false} is VALID [2022-04-08 15:30:19,551 INFO L290 TraceCheckUtils]: 130: Hoare triple {107296#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {107296#false} is VALID [2022-04-08 15:30:19,551 INFO L290 TraceCheckUtils]: 131: Hoare triple {107296#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {107296#false} is VALID [2022-04-08 15:30:19,551 INFO L290 TraceCheckUtils]: 132: Hoare triple {107296#false} assume 7 == ~blastFlag~0; {107296#false} is VALID [2022-04-08 15:30:19,551 INFO L290 TraceCheckUtils]: 133: Hoare triple {107296#false} assume !false; {107296#false} is VALID [2022-04-08 15:30:19,552 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-04-08 15:30:19,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:30:19,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301220824] [2022-04-08 15:30:19,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301220824] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:30:19,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:30:19,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 15:30:19,552 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:30:19,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1469487264] [2022-04-08 15:30:19,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1469487264] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:30:19,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:30:19,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 15:30:19,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478265431] [2022-04-08 15:30:19,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:30:19,553 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 134 [2022-04-08 15:30:19,553 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:30:19,553 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:19,619 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:30:19,619 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 15:30:19,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:30:19,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 15:30:19,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-08 15:30:19,620 INFO L87 Difference]: Start difference. First operand 1449 states and 2147 transitions. Second operand has 7 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:21,656 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:30:24,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:30:24,038 INFO L93 Difference]: Finished difference Result 2891 states and 4286 transitions. [2022-04-08 15:30:24,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 15:30:24,038 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 134 [2022-04-08 15:30:24,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:30:24,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:24,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 422 transitions. [2022-04-08 15:30:24,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:24,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 422 transitions. [2022-04-08 15:30:24,041 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 422 transitions. [2022-04-08 15:30:24,309 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 422 edges. 422 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:30:24,396 INFO L225 Difference]: With dead ends: 2891 [2022-04-08 15:30:24,396 INFO L226 Difference]: Without dead ends: 1449 [2022-04-08 15:30:24,398 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-08 15:30:24,398 INFO L913 BasicCegarLoop]: 209 mSDtfsCounter, 7 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s 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.5s IncrementalHoareTripleChecker+Time [2022-04-08 15:30:24,398 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 841 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 439 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-08 15:30:24,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1449 states. [2022-04-08 15:30:24,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1449 to 1449. [2022-04-08 15:30:24,916 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:30:24,918 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1449 states. Second operand has 1449 states, 1444 states have (on average 1.4833795013850415) internal successors, (2142), 1444 states have internal predecessors, (2142), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:24,919 INFO L74 IsIncluded]: Start isIncluded. First operand 1449 states. Second operand has 1449 states, 1444 states have (on average 1.4833795013850415) internal successors, (2142), 1444 states have internal predecessors, (2142), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:24,920 INFO L87 Difference]: Start difference. First operand 1449 states. Second operand has 1449 states, 1444 states have (on average 1.4833795013850415) internal successors, (2142), 1444 states have internal predecessors, (2142), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:24,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:30:24,975 INFO L93 Difference]: Finished difference Result 1449 states and 2146 transitions. [2022-04-08 15:30:24,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1449 states and 2146 transitions. [2022-04-08 15:30:24,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:30:24,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:30:24,979 INFO L74 IsIncluded]: Start isIncluded. First operand has 1449 states, 1444 states have (on average 1.4833795013850415) internal successors, (2142), 1444 states have internal predecessors, (2142), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1449 states. [2022-04-08 15:30:24,980 INFO L87 Difference]: Start difference. First operand has 1449 states, 1444 states have (on average 1.4833795013850415) internal successors, (2142), 1444 states have internal predecessors, (2142), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1449 states. [2022-04-08 15:30:25,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:30:25,050 INFO L93 Difference]: Finished difference Result 1449 states and 2146 transitions. [2022-04-08 15:30:25,050 INFO L276 IsEmpty]: Start isEmpty. Operand 1449 states and 2146 transitions. [2022-04-08 15:30:25,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:30:25,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:30:25,051 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:30:25,051 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:30:25,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1449 states, 1444 states have (on average 1.4833795013850415) internal successors, (2142), 1444 states have internal predecessors, (2142), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:25,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1449 states to 1449 states and 2146 transitions. [2022-04-08 15:30:25,144 INFO L78 Accepts]: Start accepts. Automaton has 1449 states and 2146 transitions. Word has length 134 [2022-04-08 15:30:25,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:30:25,144 INFO L478 AbstractCegarLoop]: Abstraction has 1449 states and 2146 transitions. [2022-04-08 15:30:25,145 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:25,145 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1449 states and 2146 transitions. [2022-04-08 15:30:27,176 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2146 edges. 2146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:30:27,176 INFO L276 IsEmpty]: Start isEmpty. Operand 1449 states and 2146 transitions. [2022-04-08 15:30:27,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-04-08 15:30:27,178 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:30:27,178 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:30:27,178 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-04-08 15:30:27,178 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:30:27,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:30:27,179 INFO L85 PathProgramCache]: Analyzing trace with hash 2056535233, now seen corresponding path program 1 times [2022-04-08 15:30:27,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:30:27,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1402879630] [2022-04-08 15:30:27,278 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:30:27,278 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:30:27,278 INFO L85 PathProgramCache]: Analyzing trace with hash 2056535233, now seen corresponding path program 2 times [2022-04-08 15:30:27,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:30:27,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816934504] [2022-04-08 15:30:27,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:30:27,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:30:27,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 15:30:27,748 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-08 15:30:28,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 15:30:28,137 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-08 15:30:28,137 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-08 15:30:28,137 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-08 15:30:28,143 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 15:30:28,145 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-04-08 15:30:28,147 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-04-08 15:30:28,150 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 15:30:28,199 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 15:30:28,199 WARN L170 areAnnotationChecker]: SSLv3_server_methodENTRY has no Hoare annotation [2022-04-08 15:30:28,199 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-08 15:30:28,199 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-08 15:30:28,199 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-08 15:30:28,199 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-08 15:30:28,199 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyENTRY has no Hoare annotation [2022-04-08 15:30:28,199 WARN L170 areAnnotationChecker]: sslv3_base_methodENTRY has no Hoare annotation [2022-04-08 15:30:28,199 WARN L170 areAnnotationChecker]: #Ultimate.meminitENTRY has no Hoare annotation [2022-04-08 15:30:28,199 WARN L170 areAnnotationChecker]: ssl3_acceptENTRY has no Hoare annotation [2022-04-08 15:30:28,199 WARN L170 areAnnotationChecker]: ssl3_get_server_methodENTRY has no Hoare annotation [2022-04-08 15:30:28,199 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 15:30:28,199 WARN L170 areAnnotationChecker]: L1061 has no Hoare annotation [2022-04-08 15:30:28,199 WARN L170 areAnnotationChecker]: L1061 has no Hoare annotation [2022-04-08 15:30:28,199 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-08 15:30:28,200 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-08 15:30:28,200 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-08 15:30:28,200 WARN L170 areAnnotationChecker]: L1095 has no Hoare annotation [2022-04-08 15:30:28,200 WARN L170 areAnnotationChecker]: L1095 has no Hoare annotation [2022-04-08 15:30:28,200 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2022-04-08 15:30:28,200 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2022-04-08 15:30:28,200 WARN L170 areAnnotationChecker]: L1767 has no Hoare annotation [2022-04-08 15:30:28,200 WARN L170 areAnnotationChecker]: L1767 has no Hoare annotation [2022-04-08 15:30:28,200 WARN L170 areAnnotationChecker]: #Ultimate.meminitFINAL has no Hoare annotation [2022-04-08 15:30:28,200 WARN L170 areAnnotationChecker]: L1146 has no Hoare annotation [2022-04-08 15:30:28,200 WARN L170 areAnnotationChecker]: L1146 has no Hoare annotation [2022-04-08 15:30:28,200 WARN L170 areAnnotationChecker]: L1044 has no Hoare annotation [2022-04-08 15:30:28,200 WARN L170 areAnnotationChecker]: L1044 has no Hoare annotation [2022-04-08 15:30:28,200 WARN L170 areAnnotationChecker]: L1063 has no Hoare annotation [2022-04-08 15:30:28,200 WARN L170 areAnnotationChecker]: L1063 has no Hoare annotation [2022-04-08 15:30:28,200 WARN L170 areAnnotationChecker]: L1061-2 has no Hoare annotation [2022-04-08 15:30:28,200 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-08 15:30:28,200 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-08 15:30:28,200 WARN L170 areAnnotationChecker]: L1095-2 has no Hoare annotation [2022-04-08 15:30:28,200 WARN L170 areAnnotationChecker]: L1095-2 has no Hoare annotation [2022-04-08 15:30:28,200 WARN L170 areAnnotationChecker]: L-1-3 has no Hoare annotation [2022-04-08 15:30:28,201 WARN L170 areAnnotationChecker]: L-1-3 has no Hoare annotation [2022-04-08 15:30:28,201 WARN L170 areAnnotationChecker]: L1767-1 has no Hoare annotation [2022-04-08 15:30:28,201 WARN L170 areAnnotationChecker]: #Ultimate.meminitEXIT has no Hoare annotation [2022-04-08 15:30:28,201 WARN L170 areAnnotationChecker]: L1146-2 has no Hoare annotation [2022-04-08 15:30:28,201 WARN L170 areAnnotationChecker]: L1046 has no Hoare annotation [2022-04-08 15:30:28,201 WARN L170 areAnnotationChecker]: L1046 has no Hoare annotation [2022-04-08 15:30:28,201 WARN L170 areAnnotationChecker]: ssl3_get_server_methodFINAL has no Hoare annotation [2022-04-08 15:30:28,201 WARN L170 areAnnotationChecker]: L1063-1 has no Hoare annotation [2022-04-08 15:30:28,201 WARN L170 areAnnotationChecker]: SSLv3_server_methodFINAL has no Hoare annotation [2022-04-08 15:30:28,201 WARN L170 areAnnotationChecker]: L1105 has no Hoare annotation [2022-04-08 15:30:28,201 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyFINAL has no Hoare annotation [2022-04-08 15:30:28,201 WARN L170 areAnnotationChecker]: sslv3_base_methodFINAL has no Hoare annotation [2022-04-08 15:30:28,201 WARN L170 areAnnotationChecker]: L1152 has no Hoare annotation [2022-04-08 15:30:28,201 WARN L170 areAnnotationChecker]: L1152 has no Hoare annotation [2022-04-08 15:30:28,201 WARN L170 areAnnotationChecker]: L1046-1 has no Hoare annotation [2022-04-08 15:30:28,201 WARN L170 areAnnotationChecker]: L1065 has no Hoare annotation [2022-04-08 15:30:28,201 WARN L170 areAnnotationChecker]: L1065 has no Hoare annotation [2022-04-08 15:30:28,201 WARN L170 areAnnotationChecker]: SSLv3_server_methodEXIT has no Hoare annotation [2022-04-08 15:30:28,201 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-08 15:30:28,201 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyEXIT has no Hoare annotation [2022-04-08 15:30:28,201 WARN L170 areAnnotationChecker]: sslv3_base_methodEXIT has no Hoare annotation [2022-04-08 15:30:28,201 WARN L170 areAnnotationChecker]: L1153 has no Hoare annotation [2022-04-08 15:30:28,201 WARN L170 areAnnotationChecker]: L1153 has no Hoare annotation [2022-04-08 15:30:28,201 WARN L170 areAnnotationChecker]: L1152-1 has no Hoare annotation [2022-04-08 15:30:28,201 WARN L170 areAnnotationChecker]: L1065-1 has no Hoare annotation [2022-04-08 15:30:28,202 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-08 15:30:28,202 WARN L170 areAnnotationChecker]: L1161 has no Hoare annotation [2022-04-08 15:30:28,202 WARN L170 areAnnotationChecker]: L1161 has no Hoare annotation [2022-04-08 15:30:28,202 WARN L170 areAnnotationChecker]: ssl3_acceptFINAL has no Hoare annotation [2022-04-08 15:30:28,202 WARN L170 areAnnotationChecker]: L1167-2 has no Hoare annotation [2022-04-08 15:30:28,202 WARN L170 areAnnotationChecker]: L1167-2 has no Hoare annotation [2022-04-08 15:30:28,202 WARN L170 areAnnotationChecker]: L1167-2 has no Hoare annotation [2022-04-08 15:30:28,202 WARN L170 areAnnotationChecker]: ssl3_acceptEXIT has no Hoare annotation [2022-04-08 15:30:28,202 WARN L170 areAnnotationChecker]: L1747 has no Hoare annotation [2022-04-08 15:30:28,202 WARN L170 areAnnotationChecker]: L1168 has no Hoare annotation [2022-04-08 15:30:28,202 WARN L170 areAnnotationChecker]: L1751 has no Hoare annotation [2022-04-08 15:30:28,202 WARN L170 areAnnotationChecker]: L1751 has no Hoare annotation [2022-04-08 15:30:28,202 WARN L170 areAnnotationChecker]: L1170 has no Hoare annotation [2022-04-08 15:30:28,202 WARN L170 areAnnotationChecker]: L1170 has no Hoare annotation [2022-04-08 15:30:28,202 WARN L170 areAnnotationChecker]: L1751-2 has no Hoare annotation [2022-04-08 15:30:28,202 WARN L170 areAnnotationChecker]: L1171 has no Hoare annotation [2022-04-08 15:30:28,202 WARN L170 areAnnotationChecker]: L1173 has no Hoare annotation [2022-04-08 15:30:28,202 WARN L170 areAnnotationChecker]: L1173 has no Hoare annotation [2022-04-08 15:30:28,202 WARN L170 areAnnotationChecker]: L1280 has no Hoare annotation [2022-04-08 15:30:28,202 WARN L170 areAnnotationChecker]: L1176 has no Hoare annotation [2022-04-08 15:30:28,202 WARN L170 areAnnotationChecker]: L1176 has no Hoare annotation [2022-04-08 15:30:28,202 WARN L170 areAnnotationChecker]: L1285 has no Hoare annotation [2022-04-08 15:30:28,202 WARN L170 areAnnotationChecker]: L1285 has no Hoare annotation [2022-04-08 15:30:28,202 WARN L170 areAnnotationChecker]: L1179 has no Hoare annotation [2022-04-08 15:30:28,202 WARN L170 areAnnotationChecker]: L1179 has no Hoare annotation [2022-04-08 15:30:28,202 WARN L170 areAnnotationChecker]: L1285-2 has no Hoare annotation [2022-04-08 15:30:28,203 WARN L170 areAnnotationChecker]: L1182 has no Hoare annotation [2022-04-08 15:30:28,203 WARN L170 areAnnotationChecker]: L1182 has no Hoare annotation [2022-04-08 15:30:28,203 WARN L170 areAnnotationChecker]: L1290 has no Hoare annotation [2022-04-08 15:30:28,203 WARN L170 areAnnotationChecker]: L1290 has no Hoare annotation [2022-04-08 15:30:28,203 WARN L170 areAnnotationChecker]: L1185 has no Hoare annotation [2022-04-08 15:30:28,203 WARN L170 areAnnotationChecker]: L1185 has no Hoare annotation [2022-04-08 15:30:28,203 WARN L170 areAnnotationChecker]: L1296 has no Hoare annotation [2022-04-08 15:30:28,203 WARN L170 areAnnotationChecker]: L1296 has no Hoare annotation [2022-04-08 15:30:28,203 WARN L170 areAnnotationChecker]: L1189 has no Hoare annotation [2022-04-08 15:30:28,203 WARN L170 areAnnotationChecker]: L1188 has no Hoare annotation [2022-04-08 15:30:28,203 WARN L170 areAnnotationChecker]: L1188 has no Hoare annotation [2022-04-08 15:30:28,203 WARN L170 areAnnotationChecker]: L1298 has no Hoare annotation [2022-04-08 15:30:28,203 WARN L170 areAnnotationChecker]: L1298 has no Hoare annotation [2022-04-08 15:30:28,203 WARN L170 areAnnotationChecker]: L1296-2 has no Hoare annotation [2022-04-08 15:30:28,203 WARN L170 areAnnotationChecker]: L1296-2 has no Hoare annotation [2022-04-08 15:30:28,203 WARN L170 areAnnotationChecker]: L1339 has no Hoare annotation [2022-04-08 15:30:28,203 WARN L170 areAnnotationChecker]: L1339 has no Hoare annotation [2022-04-08 15:30:28,203 WARN L170 areAnnotationChecker]: L1191 has no Hoare annotation [2022-04-08 15:30:28,203 WARN L170 areAnnotationChecker]: L1191 has no Hoare annotation [2022-04-08 15:30:28,203 WARN L170 areAnnotationChecker]: L1304 has no Hoare annotation [2022-04-08 15:30:28,203 WARN L170 areAnnotationChecker]: L1304 has no Hoare annotation [2022-04-08 15:30:28,203 WARN L170 areAnnotationChecker]: L1321 has no Hoare annotation [2022-04-08 15:30:28,203 WARN L170 areAnnotationChecker]: L1321 has no Hoare annotation [2022-04-08 15:30:28,203 WARN L170 areAnnotationChecker]: L1678 has no Hoare annotation [2022-04-08 15:30:28,204 WARN L170 areAnnotationChecker]: L1192 has no Hoare annotation [2022-04-08 15:30:28,204 WARN L170 areAnnotationChecker]: L1194 has no Hoare annotation [2022-04-08 15:30:28,204 WARN L170 areAnnotationChecker]: L1194 has no Hoare annotation [2022-04-08 15:30:28,204 WARN L170 areAnnotationChecker]: L1322 has no Hoare annotation [2022-04-08 15:30:28,204 WARN L170 areAnnotationChecker]: L1322 has no Hoare annotation [2022-04-08 15:30:28,204 WARN L170 areAnnotationChecker]: L1716 has no Hoare annotation [2022-04-08 15:30:28,204 WARN L170 areAnnotationChecker]: L1716 has no Hoare annotation [2022-04-08 15:30:28,204 WARN L170 areAnnotationChecker]: L1201 has no Hoare annotation [2022-04-08 15:30:28,204 WARN L170 areAnnotationChecker]: L1197 has no Hoare annotation [2022-04-08 15:30:28,204 WARN L170 areAnnotationChecker]: L1197 has no Hoare annotation [2022-04-08 15:30:28,204 WARN L170 areAnnotationChecker]: L1717 has no Hoare annotation [2022-04-08 15:30:28,204 WARN L170 areAnnotationChecker]: L1717 has no Hoare annotation [2022-04-08 15:30:28,204 WARN L170 areAnnotationChecker]: L1716-1 has no Hoare annotation [2022-04-08 15:30:28,204 WARN L170 areAnnotationChecker]: L1356 has no Hoare annotation [2022-04-08 15:30:28,204 WARN L170 areAnnotationChecker]: L1356 has no Hoare annotation [2022-04-08 15:30:28,204 WARN L170 areAnnotationChecker]: L1200 has no Hoare annotation [2022-04-08 15:30:28,204 WARN L170 areAnnotationChecker]: L1200 has no Hoare annotation [2022-04-08 15:30:28,204 WARN L170 areAnnotationChecker]: L1718 has no Hoare annotation [2022-04-08 15:30:28,204 WARN L170 areAnnotationChecker]: L1718 has no Hoare annotation [2022-04-08 15:30:28,204 WARN L170 areAnnotationChecker]: L1356-2 has no Hoare annotation [2022-04-08 15:30:28,204 WARN L170 areAnnotationChecker]: L1356-2 has no Hoare annotation [2022-04-08 15:30:28,204 WARN L170 areAnnotationChecker]: L1203 has no Hoare annotation [2022-04-08 15:30:28,204 WARN L170 areAnnotationChecker]: L1203 has no Hoare annotation [2022-04-08 15:30:28,205 WARN L170 areAnnotationChecker]: L1720 has no Hoare annotation [2022-04-08 15:30:28,205 WARN L170 areAnnotationChecker]: L1720 has no Hoare annotation [2022-04-08 15:30:28,205 WARN L170 areAnnotationChecker]: L1718-2 has no Hoare annotation [2022-04-08 15:30:28,205 WARN L170 areAnnotationChecker]: L1718-2 has no Hoare annotation [2022-04-08 15:30:28,205 WARN L170 areAnnotationChecker]: L1207 has no Hoare annotation [2022-04-08 15:30:28,205 WARN L170 areAnnotationChecker]: L1206 has no Hoare annotation [2022-04-08 15:30:28,205 WARN L170 areAnnotationChecker]: L1206 has no Hoare annotation [2022-04-08 15:30:28,205 WARN L170 areAnnotationChecker]: L1729 has no Hoare annotation [2022-04-08 15:30:28,205 WARN L170 areAnnotationChecker]: L1729 has no Hoare annotation [2022-04-08 15:30:28,205 WARN L170 areAnnotationChecker]: L1373 has no Hoare annotation [2022-04-08 15:30:28,205 WARN L170 areAnnotationChecker]: L1373 has no Hoare annotation [2022-04-08 15:30:28,205 WARN L170 areAnnotationChecker]: L1209 has no Hoare annotation [2022-04-08 15:30:28,205 WARN L170 areAnnotationChecker]: L1209 has no Hoare annotation [2022-04-08 15:30:28,205 WARN L170 areAnnotationChecker]: L1373-2 has no Hoare annotation [2022-04-08 15:30:28,205 WARN L170 areAnnotationChecker]: L1373-2 has no Hoare annotation [2022-04-08 15:30:28,205 WARN L170 areAnnotationChecker]: L1213 has no Hoare annotation [2022-04-08 15:30:28,205 WARN L170 areAnnotationChecker]: L1212 has no Hoare annotation [2022-04-08 15:30:28,205 WARN L170 areAnnotationChecker]: L1212 has no Hoare annotation [2022-04-08 15:30:28,205 WARN L170 areAnnotationChecker]: L1383 has no Hoare annotation [2022-04-08 15:30:28,205 WARN L170 areAnnotationChecker]: L1383 has no Hoare annotation [2022-04-08 15:30:28,205 WARN L170 areAnnotationChecker]: L1392 has no Hoare annotation [2022-04-08 15:30:28,205 WARN L170 areAnnotationChecker]: L1392 has no Hoare annotation [2022-04-08 15:30:28,205 WARN L170 areAnnotationChecker]: L1215 has no Hoare annotation [2022-04-08 15:30:28,205 WARN L170 areAnnotationChecker]: L1215 has no Hoare annotation [2022-04-08 15:30:28,206 WARN L170 areAnnotationChecker]: L1383-2 has no Hoare annotation [2022-04-08 15:30:28,206 WARN L170 areAnnotationChecker]: L1392-2 has no Hoare annotation [2022-04-08 15:30:28,206 WARN L170 areAnnotationChecker]: L1396 has no Hoare annotation [2022-04-08 15:30:28,206 WARN L170 areAnnotationChecker]: L1396 has no Hoare annotation [2022-04-08 15:30:28,206 WARN L170 areAnnotationChecker]: L1219 has no Hoare annotation [2022-04-08 15:30:28,206 WARN L170 areAnnotationChecker]: L1218 has no Hoare annotation [2022-04-08 15:30:28,206 WARN L170 areAnnotationChecker]: L1218 has no Hoare annotation [2022-04-08 15:30:28,206 WARN L170 areAnnotationChecker]: L1396-2 has no Hoare annotation [2022-04-08 15:30:28,206 WARN L170 areAnnotationChecker]: L1396-2 has no Hoare annotation [2022-04-08 15:30:28,206 WARN L170 areAnnotationChecker]: L1413 has no Hoare annotation [2022-04-08 15:30:28,206 WARN L170 areAnnotationChecker]: L1413 has no Hoare annotation [2022-04-08 15:30:28,206 WARN L170 areAnnotationChecker]: L1221 has no Hoare annotation [2022-04-08 15:30:28,206 WARN L170 areAnnotationChecker]: L1221 has no Hoare annotation [2022-04-08 15:30:28,206 WARN L170 areAnnotationChecker]: L1413-2 has no Hoare annotation [2022-04-08 15:30:28,206 WARN L170 areAnnotationChecker]: L1225 has no Hoare annotation [2022-04-08 15:30:28,206 WARN L170 areAnnotationChecker]: L1224 has no Hoare annotation [2022-04-08 15:30:28,206 WARN L170 areAnnotationChecker]: L1224 has no Hoare annotation [2022-04-08 15:30:28,206 WARN L170 areAnnotationChecker]: L1418 has no Hoare annotation [2022-04-08 15:30:28,206 WARN L170 areAnnotationChecker]: L1418 has no Hoare annotation [2022-04-08 15:30:28,206 WARN L170 areAnnotationChecker]: L1464 has no Hoare annotation [2022-04-08 15:30:28,206 WARN L170 areAnnotationChecker]: L1464 has no Hoare annotation [2022-04-08 15:30:28,206 WARN L170 areAnnotationChecker]: L1227 has no Hoare annotation [2022-04-08 15:30:28,206 WARN L170 areAnnotationChecker]: L1227 has no Hoare annotation [2022-04-08 15:30:28,207 WARN L170 areAnnotationChecker]: L1435 has no Hoare annotation [2022-04-08 15:30:28,207 WARN L170 areAnnotationChecker]: L1421 has no Hoare annotation [2022-04-08 15:30:28,207 WARN L170 areAnnotationChecker]: L1421 has no Hoare annotation [2022-04-08 15:30:28,207 WARN L170 areAnnotationChecker]: L1465 has no Hoare annotation [2022-04-08 15:30:28,207 WARN L170 areAnnotationChecker]: L1465 has no Hoare annotation [2022-04-08 15:30:28,207 WARN L170 areAnnotationChecker]: L1231 has no Hoare annotation [2022-04-08 15:30:28,207 WARN L170 areAnnotationChecker]: L1230 has no Hoare annotation [2022-04-08 15:30:28,207 WARN L170 areAnnotationChecker]: L1230 has no Hoare annotation [2022-04-08 15:30:28,207 WARN L170 areAnnotationChecker]: L1437 has no Hoare annotation [2022-04-08 15:30:28,207 WARN L170 areAnnotationChecker]: L1437 has no Hoare annotation [2022-04-08 15:30:28,207 WARN L170 areAnnotationChecker]: L1424 has no Hoare annotation [2022-04-08 15:30:28,207 WARN L170 areAnnotationChecker]: L1424 has no Hoare annotation [2022-04-08 15:30:28,207 WARN L170 areAnnotationChecker]: L1466 has no Hoare annotation [2022-04-08 15:30:28,207 WARN L170 areAnnotationChecker]: L1466 has no Hoare annotation [2022-04-08 15:30:28,207 WARN L170 areAnnotationChecker]: L1474 has no Hoare annotation [2022-04-08 15:30:28,207 WARN L170 areAnnotationChecker]: L1511 has no Hoare annotation [2022-04-08 15:30:28,207 WARN L170 areAnnotationChecker]: L1511 has no Hoare annotation [2022-04-08 15:30:28,207 WARN L170 areAnnotationChecker]: L1233 has no Hoare annotation [2022-04-08 15:30:28,207 WARN L170 areAnnotationChecker]: L1233 has no Hoare annotation [2022-04-08 15:30:28,207 WARN L170 areAnnotationChecker]: L1437-2 has no Hoare annotation [2022-04-08 15:30:28,207 WARN L170 areAnnotationChecker]: L1437-2 has no Hoare annotation [2022-04-08 15:30:28,207 WARN L170 areAnnotationChecker]: L1425 has no Hoare annotation [2022-04-08 15:30:28,207 WARN L170 areAnnotationChecker]: L1425 has no Hoare annotation [2022-04-08 15:30:28,207 WARN L170 areAnnotationChecker]: L1424-1 has no Hoare annotation [2022-04-08 15:30:28,208 WARN L170 areAnnotationChecker]: L1475 has no Hoare annotation [2022-04-08 15:30:28,208 WARN L170 areAnnotationChecker]: L1475 has no Hoare annotation [2022-04-08 15:30:28,208 WARN L170 areAnnotationChecker]: L1234 has no Hoare annotation [2022-04-08 15:30:28,208 WARN L170 areAnnotationChecker]: L1234 has no Hoare annotation [2022-04-08 15:30:28,208 WARN L170 areAnnotationChecker]: L1236 has no Hoare annotation [2022-04-08 15:30:28,208 WARN L170 areAnnotationChecker]: L1236 has no Hoare annotation [2022-04-08 15:30:28,208 WARN L170 areAnnotationChecker]: L1428 has no Hoare annotation [2022-04-08 15:30:28,208 WARN L170 areAnnotationChecker]: L1428 has no Hoare annotation [2022-04-08 15:30:28,208 WARN L170 areAnnotationChecker]: L1476 has no Hoare annotation [2022-04-08 15:30:28,208 WARN L170 areAnnotationChecker]: L1476 has no Hoare annotation [2022-04-08 15:30:28,208 WARN L170 areAnnotationChecker]: L1484 has no Hoare annotation [2022-04-08 15:30:28,208 WARN L170 areAnnotationChecker]: L1524 has no Hoare annotation [2022-04-08 15:30:28,208 WARN L170 areAnnotationChecker]: L1524 has no Hoare annotation [2022-04-08 15:30:28,208 WARN L170 areAnnotationChecker]: L1521-1 has no Hoare annotation [2022-04-08 15:30:28,208 WARN L170 areAnnotationChecker]: L1240 has no Hoare annotation [2022-04-08 15:30:28,208 WARN L170 areAnnotationChecker]: L1239 has no Hoare annotation [2022-04-08 15:30:28,208 WARN L170 areAnnotationChecker]: L1239 has no Hoare annotation [2022-04-08 15:30:28,208 WARN L170 areAnnotationChecker]: L1429 has no Hoare annotation [2022-04-08 15:30:28,209 WARN L170 areAnnotationChecker]: L1429 has no Hoare annotation [2022-04-08 15:30:28,209 WARN L170 areAnnotationChecker]: L1487 has no Hoare annotation [2022-04-08 15:30:28,209 WARN L170 areAnnotationChecker]: L1487 has no Hoare annotation [2022-04-08 15:30:28,209 WARN L170 areAnnotationChecker]: L1539 has no Hoare annotation [2022-04-08 15:30:28,209 WARN L170 areAnnotationChecker]: L1539 has no Hoare annotation [2022-04-08 15:30:28,209 WARN L170 areAnnotationChecker]: L1242 has no Hoare annotation [2022-04-08 15:30:28,209 WARN L170 areAnnotationChecker]: L1242 has no Hoare annotation [2022-04-08 15:30:28,209 WARN L170 areAnnotationChecker]: L1429-2 has no Hoare annotation [2022-04-08 15:30:28,209 WARN L170 areAnnotationChecker]: L1429-2 has no Hoare annotation [2022-04-08 15:30:28,209 WARN L170 areAnnotationChecker]: L1586 has no Hoare annotation [2022-04-08 15:30:28,209 WARN L170 areAnnotationChecker]: L1586 has no Hoare annotation [2022-04-08 15:30:28,209 WARN L170 areAnnotationChecker]: L1492 has no Hoare annotation [2022-04-08 15:30:28,209 WARN L170 areAnnotationChecker]: L1492 has no Hoare annotation [2022-04-08 15:30:28,209 WARN L170 areAnnotationChecker]: L1544 has no Hoare annotation [2022-04-08 15:30:28,209 WARN L170 areAnnotationChecker]: L1544 has no Hoare annotation [2022-04-08 15:30:28,209 WARN L170 areAnnotationChecker]: L1246 has no Hoare annotation [2022-04-08 15:30:28,209 WARN L170 areAnnotationChecker]: L1245 has no Hoare annotation [2022-04-08 15:30:28,209 WARN L170 areAnnotationChecker]: L1245 has no Hoare annotation [2022-04-08 15:30:28,209 WARN L170 areAnnotationChecker]: L1548 has no Hoare annotation [2022-04-08 15:30:28,209 WARN L170 areAnnotationChecker]: L1548 has no Hoare annotation [2022-04-08 15:30:28,209 WARN L170 areAnnotationChecker]: L1560 has no Hoare annotation [2022-04-08 15:30:28,210 WARN L170 areAnnotationChecker]: L1560 has no Hoare annotation [2022-04-08 15:30:28,210 WARN L170 areAnnotationChecker]: L1248 has no Hoare annotation [2022-04-08 15:30:28,210 WARN L170 areAnnotationChecker]: L1248 has no Hoare annotation [2022-04-08 15:30:28,210 WARN L170 areAnnotationChecker]: L1252 has no Hoare annotation [2022-04-08 15:30:28,210 WARN L170 areAnnotationChecker]: L1251 has no Hoare annotation [2022-04-08 15:30:28,210 WARN L170 areAnnotationChecker]: L1251 has no Hoare annotation [2022-04-08 15:30:28,210 WARN L170 areAnnotationChecker]: L1571 has no Hoare annotation [2022-04-08 15:30:28,210 WARN L170 areAnnotationChecker]: L1571 has no Hoare annotation [2022-04-08 15:30:28,210 WARN L170 areAnnotationChecker]: L1254 has no Hoare annotation [2022-04-08 15:30:28,210 WARN L170 areAnnotationChecker]: L1254 has no Hoare annotation [2022-04-08 15:30:28,210 WARN L170 areAnnotationChecker]: L1258 has no Hoare annotation [2022-04-08 15:30:28,211 WARN L170 areAnnotationChecker]: L1257 has no Hoare annotation [2022-04-08 15:30:28,211 WARN L170 areAnnotationChecker]: L1257 has no Hoare annotation [2022-04-08 15:30:28,211 WARN L170 areAnnotationChecker]: L1582 has no Hoare annotation [2022-04-08 15:30:28,211 WARN L170 areAnnotationChecker]: L1582 has no Hoare annotation [2022-04-08 15:30:28,211 WARN L170 areAnnotationChecker]: L1260 has no Hoare annotation [2022-04-08 15:30:28,211 WARN L170 areAnnotationChecker]: L1260 has no Hoare annotation [2022-04-08 15:30:28,211 WARN L170 areAnnotationChecker]: L1588-2 has no Hoare annotation [2022-04-08 15:30:28,211 WARN L170 areAnnotationChecker]: L1588-2 has no Hoare annotation [2022-04-08 15:30:28,211 WARN L170 areAnnotationChecker]: L1585 has no Hoare annotation [2022-04-08 15:30:28,211 WARN L170 areAnnotationChecker]: L1585 has no Hoare annotation [2022-04-08 15:30:28,211 WARN L170 areAnnotationChecker]: L1264 has no Hoare annotation [2022-04-08 15:30:28,211 WARN L170 areAnnotationChecker]: L1263 has no Hoare annotation [2022-04-08 15:30:28,211 WARN L170 areAnnotationChecker]: L1263 has no Hoare annotation [2022-04-08 15:30:28,212 WARN L170 areAnnotationChecker]: L1600 has no Hoare annotation [2022-04-08 15:30:28,212 WARN L170 areAnnotationChecker]: L1600 has no Hoare annotation [2022-04-08 15:30:28,212 WARN L170 areAnnotationChecker]: L1588 has no Hoare annotation [2022-04-08 15:30:28,212 WARN L170 areAnnotationChecker]: L1588 has no Hoare annotation [2022-04-08 15:30:28,212 WARN L170 areAnnotationChecker]: L1610 has no Hoare annotation [2022-04-08 15:30:28,212 WARN L170 areAnnotationChecker]: L1610 has no Hoare annotation [2022-04-08 15:30:28,212 WARN L170 areAnnotationChecker]: L1266 has no Hoare annotation [2022-04-08 15:30:28,212 WARN L170 areAnnotationChecker]: L1266 has no Hoare annotation [2022-04-08 15:30:28,212 WARN L170 areAnnotationChecker]: L1600-2 has no Hoare annotation [2022-04-08 15:30:28,212 WARN L170 areAnnotationChecker]: L1617 has no Hoare annotation [2022-04-08 15:30:28,212 WARN L170 areAnnotationChecker]: L1617 has no Hoare annotation [2022-04-08 15:30:28,212 WARN L170 areAnnotationChecker]: L1270 has no Hoare annotation [2022-04-08 15:30:28,212 WARN L170 areAnnotationChecker]: L1269 has no Hoare annotation [2022-04-08 15:30:28,212 WARN L170 areAnnotationChecker]: L1269 has no Hoare annotation [2022-04-08 15:30:28,212 WARN L170 areAnnotationChecker]: L1617-2 has no Hoare annotation [2022-04-08 15:30:28,212 WARN L170 areAnnotationChecker]: L1617-2 has no Hoare annotation [2022-04-08 15:30:28,212 WARN L170 areAnnotationChecker]: L1639 has no Hoare annotation [2022-04-08 15:30:28,212 WARN L170 areAnnotationChecker]: L1639 has no Hoare annotation [2022-04-08 15:30:28,212 WARN L170 areAnnotationChecker]: L1272 has no Hoare annotation [2022-04-08 15:30:28,212 WARN L170 areAnnotationChecker]: L1272 has no Hoare annotation [2022-04-08 15:30:28,212 WARN L170 areAnnotationChecker]: L1629 has no Hoare annotation [2022-04-08 15:30:28,212 WARN L170 areAnnotationChecker]: L1629 has no Hoare annotation [2022-04-08 15:30:28,212 WARN L170 areAnnotationChecker]: L1639-2 has no Hoare annotation [2022-04-08 15:30:28,212 WARN L170 areAnnotationChecker]: L1639-2 has no Hoare annotation [2022-04-08 15:30:28,212 WARN L170 areAnnotationChecker]: L1273 has no Hoare annotation [2022-04-08 15:30:28,213 WARN L170 areAnnotationChecker]: L1276 has no Hoare annotation [2022-04-08 15:30:28,213 WARN L170 areAnnotationChecker]: L1650 has no Hoare annotation [2022-04-08 15:30:28,213 WARN L170 areAnnotationChecker]: L1650 has no Hoare annotation [2022-04-08 15:30:28,213 WARN L170 areAnnotationChecker]: L1660 has no Hoare annotation [2022-04-08 15:30:28,213 WARN L170 areAnnotationChecker]: L1660 has no Hoare annotation [2022-04-08 15:30:28,213 WARN L170 areAnnotationChecker]: L1650-2 has no Hoare annotation [2022-04-08 15:30:28,213 WARN L170 areAnnotationChecker]: L1664 has no Hoare annotation [2022-04-08 15:30:28,213 WARN L170 areAnnotationChecker]: L1664 has no Hoare annotation [2022-04-08 15:30:28,213 WARN L170 areAnnotationChecker]: L1660-1 has no Hoare annotation [2022-04-08 15:30:28,213 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 15:30:28,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 03:30:28 BoogieIcfgContainer [2022-04-08 15:30:28,220 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 15:30:28,221 INFO L158 Benchmark]: Toolchain (without parser) took 344007.52ms. Allocated memory was 180.4MB in the beginning and 319.8MB in the end (delta: 139.5MB). Free memory was 118.2MB in the beginning and 161.2MB in the end (delta: -42.9MB). Peak memory consumption was 150.3MB. Max. memory is 8.0GB. [2022-04-08 15:30:28,222 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 180.4MB. Free memory is still 137.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 15:30:28,222 INFO L158 Benchmark]: CACSL2BoogieTranslator took 575.06ms. Allocated memory was 180.4MB in the beginning and 221.2MB in the end (delta: 40.9MB). Free memory was 118.1MB in the beginning and 168.5MB in the end (delta: -50.4MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-04-08 15:30:28,222 INFO L158 Benchmark]: Boogie Preprocessor took 139.99ms. Allocated memory is still 221.2MB. Free memory was 168.5MB in the beginning and 159.0MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-08 15:30:28,222 INFO L158 Benchmark]: RCFGBuilder took 1418.76ms. Allocated memory is still 221.2MB. Free memory was 158.5MB in the beginning and 157.8MB in the end (delta: 663.1kB). Peak memory consumption was 72.5MB. Max. memory is 8.0GB. [2022-04-08 15:30:28,222 INFO L158 Benchmark]: TraceAbstraction took 341868.02ms. Allocated memory was 221.2MB in the beginning and 319.8MB in the end (delta: 98.6MB). Free memory was 157.3MB in the beginning and 161.2MB in the end (delta: -3.9MB). Peak memory consumption was 147.7MB. Max. memory is 8.0GB. [2022-04-08 15:30:28,223 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.15ms. Allocated memory is still 180.4MB. Free memory is still 137.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 575.06ms. Allocated memory was 180.4MB in the beginning and 221.2MB in the end (delta: 40.9MB). Free memory was 118.1MB in the beginning and 168.5MB in the end (delta: -50.4MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 139.99ms. Allocated memory is still 221.2MB. Free memory was 168.5MB in the beginning and 159.0MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * RCFGBuilder took 1418.76ms. Allocated memory is still 221.2MB. Free memory was 158.5MB in the beginning and 157.8MB in the end (delta: 663.1kB). Peak memory consumption was 72.5MB. Max. memory is 8.0GB. * TraceAbstraction took 341868.02ms. Allocated memory was 221.2MB in the beginning and 319.8MB in the end (delta: 98.6MB). Free memory was 157.3MB in the beginning and 161.2MB in the end (delta: -3.9MB). Peak memory consumption was 147.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1757]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 1475. Possible FailurePath: [L1054] static int init = 1; [L1055] static SSL_METHOD SSLv3_server_data ; [L1077] SSL *s ; [L1078] int tmp ; [L1082] s = malloc(sizeof(SSL)) [L1083] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1084] s->ctx = malloc(sizeof(SSL_CTX)) [L1085] s->session = malloc(sizeof(SSL_SESSION)) [L1087] s->info_callback = (void (*) ()) __VERIFIER_nondet_ulong() [L1088] s->options = __VERIFIER_nondet_ulong() [L1089] s->verify_mode = __VERIFIER_nondet_int() [L1090] EXPR s->session [L1090] (s->session)->peer = (struct x509_st*) __VERIFIER_nondet_ulong() [L1091] EXPR s->s3 [L1091] (s->s3)->tmp.cert_request = __VERIFIER_nondet_int() [L1092] EXPR s->s3 [L1092] (s->s3)->tmp.new_cipher = malloc(sizeof(struct ssl_cipher_st)) [L1093] EXPR s->s3 [L1093] EXPR (s->s3)->tmp.new_cipher [L1093] ((s->s3)->tmp.new_cipher)->algorithms = __VERIFIER_nondet_ulong() [L1094] EXPR s->s3 [L1094] EXPR (s->s3)->tmp.new_cipher [L1094] ((s->s3)->tmp.new_cipher)->algo_strength = __VERIFIER_nondet_ulong() [L1095] COND FALSE !(__VERIFIER_nondet_int()) [L1101] s->cert = malloc(sizeof(struct cert_st)) [L1102] EXPR s->cert [L1102] (s->cert)->pkeys[0].privatekey = (struct evp_pkey_st*) __VERIFIER_nondet_ulong() [L1105] CALL ssl3_accept(s) [L1111] BUF_MEM *buf ; [L1112] unsigned long l ; [L1113] unsigned long Time ; [L1114] unsigned long tmp ; [L1115] void (*cb)() ; [L1116] long num1 ; [L1117] int ret ; [L1118] int new_state ; [L1119] int state ; [L1120] int skip ; [L1121] int got_new_session ; [L1122] int tmp___1 = __VERIFIER_nondet_int() ; [L1123] int tmp___2 = __VERIFIER_nondet_int() ; [L1124] int tmp___3 = __VERIFIER_nondet_int() ; [L1125] int tmp___4 = __VERIFIER_nondet_int() ; [L1126] int tmp___5 = __VERIFIER_nondet_int() ; [L1127] int tmp___6 = __VERIFIER_nondet_int() ; [L1128] int tmp___7 ; [L1129] long tmp___8 = __VERIFIER_nondet_long() ; [L1130] int tmp___9 = __VERIFIER_nondet_int() ; [L1131] int tmp___10 = __VERIFIER_nondet_int() ; [L1132] int blastFlag ; [L1136] s->state = 8464 [L1137] blastFlag = 0 [L1138] s->hit=__VERIFIER_nondet_int () [L1139] s->state = 8464 [L1140] tmp = __VERIFIER_nondet_int() [L1141] Time = tmp [L1142] cb = (void (*)())((void *)0) [L1143] ret = -1 [L1144] skip = 0 [L1145] got_new_session = 0 [L1146] EXPR s->info_callback [L1146] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1147] EXPR s->info_callback [L1147] cb = s->info_callback [L1151] EXPR s->in_handshake [L1151] s->in_handshake += 1 [L1152] COND FALSE !(tmp___1 & 12288) [L1161] EXPR s->cert [L1161] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1167] COND TRUE 1 [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state [L1194] COND TRUE s->state == 8464 [L1354] s->shutdown = 0 [L1355] ret = __VERIFIER_nondet_int() [L1356] COND TRUE blastFlag == 0 [L1357] blastFlag = 1 [L1361] COND FALSE !(ret <= 0) [L1366] got_new_session = 1 [L1367] s->state = 8496 [L1368] s->init_num = 0 [L1716] EXPR s->s3 [L1716] EXPR (s->s3)->tmp.reuse_message [L1716] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1745] skip = 0 [L1167] COND TRUE 1 [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state [L1203] COND TRUE s->state == 8496 [L1372] ret = __VERIFIER_nondet_int() [L1373] COND TRUE blastFlag == 1 [L1374] blastFlag = 2 [L1378] COND FALSE !(ret <= 0) [L1383] s->hit [L1383] COND FALSE !(s->hit) [L1386] s->state = 8512 [L1388] s->init_num = 0 [L1716] EXPR s->s3 [L1716] EXPR (s->s3)->tmp.reuse_message [L1716] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1745] skip = 0 [L1167] COND TRUE 1 [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state [L1203] COND FALSE !(s->state == 8496) [L1206] EXPR s->state [L1206] COND FALSE !(s->state == 8497) [L1209] EXPR s->state [L1209] COND TRUE s->state == 8512 [L1392] EXPR s->s3 [L1392] EXPR (s->s3)->tmp.new_cipher [L1392] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1392] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1395] ret = __VERIFIER_nondet_int() [L1396] COND TRUE blastFlag == 2 [L1397] blastFlag = 6 [L1401] COND FALSE !(ret <= 0) [L1407] s->state = 8528 [L1408] s->init_num = 0 [L1716] EXPR s->s3 [L1716] EXPR (s->s3)->tmp.reuse_message [L1716] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1745] skip = 0 [L1167] COND TRUE 1 [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state [L1203] COND FALSE !(s->state == 8496) [L1206] EXPR s->state [L1206] COND FALSE !(s->state == 8497) [L1209] EXPR s->state [L1209] COND FALSE !(s->state == 8512) [L1212] EXPR s->state [L1212] COND FALSE !(s->state == 8513) [L1215] EXPR s->state [L1215] COND TRUE s->state == 8528 [L1412] EXPR s->s3 [L1412] EXPR (s->s3)->tmp.new_cipher [L1412] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1412] l = ((s->s3)->tmp.new_cipher)->algorithms [L1413] EXPR s->options [L1413] COND TRUE s->options & 2097152UL [L1414] EXPR s->s3 [L1414] (s->s3)->tmp.use_rsa_tmp = 1 [L1418] EXPR s->s3 [L1418] (s->s3)->tmp.use_rsa_tmp [L1418] COND TRUE (s->s3)->tmp.use_rsa_tmp [L1436] ret = __VERIFIER_nondet_int() [L1437] COND TRUE blastFlag == 6 [L1438] blastFlag = 7 [L1442] COND FALSE !(ret <= 0) [L1459] s->state = 8544 [L1460] s->init_num = 0 [L1716] EXPR s->s3 [L1716] EXPR (s->s3)->tmp.reuse_message [L1716] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1745] skip = 0 [L1167] COND TRUE 1 [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state [L1203] COND FALSE !(s->state == 8496) [L1206] EXPR s->state [L1206] COND FALSE !(s->state == 8497) [L1209] EXPR s->state [L1209] COND FALSE !(s->state == 8512) [L1212] EXPR s->state [L1212] COND FALSE !(s->state == 8513) [L1215] EXPR s->state [L1215] COND FALSE !(s->state == 8528) [L1218] EXPR s->state [L1218] COND FALSE !(s->state == 8529) [L1221] EXPR s->state [L1221] COND TRUE s->state == 8544 [L1464] EXPR s->verify_mode [L1464] COND TRUE s->verify_mode & 1 [L1465] EXPR s->session [L1465] EXPR (s->session)->peer [L1465] COND FALSE !((unsigned long )(s->session)->peer != (unsigned long )((void *)0)) [L1475] EXPR s->s3 [L1475] EXPR (s->s3)->tmp.new_cipher [L1475] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1475] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1485] EXPR s->s3 [L1485] (s->s3)->tmp.cert_request = 1 [L1486] ret = __VERIFIER_nondet_int() [L1487] COND TRUE blastFlag == 7 [L1757] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 189 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 341.7s, OverallIterations: 34, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 306.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 34 mSolverCounterUnknown, 2745 SdHoareTripleChecker+Valid, 164.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2745 mSDsluCounter, 14810 SdHoareTripleChecker+Invalid, 163.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9119 mSDsCounter, 1008 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13883 IncrementalHoareTripleChecker+Invalid, 14925 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1008 mSolverCounterUnsat, 5691 mSDtfsCounter, 13883 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 247 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1449occurred in iteration=32, InterpolantAutomatonStates: 164, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.4s AutomataMinimizationTime, 33 MinimizatonAttempts, 1460 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-04-08 15:30:28,272 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...