/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.03.i.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 15:16:44,324 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 15:16:44,326 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 15:16:44,372 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 15:16:44,373 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 15:16:44,374 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 15:16:44,377 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 15:16:44,380 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 15:16:44,381 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 15:16:44,385 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 15:16:44,386 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 15:16:44,388 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 15:16:44,388 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 15:16:44,390 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 15:16:44,391 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 15:16:44,393 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 15:16:44,394 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 15:16:44,395 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 15:16:44,397 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 15:16:44,401 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 15:16:44,403 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 15:16:44,405 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 15:16:44,405 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 15:16:44,406 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 15:16:44,407 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 15:16:44,414 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 15:16:44,414 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 15:16:44,415 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 15:16:44,416 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 15:16:44,416 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 15:16:44,417 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 15:16:44,417 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 15:16:44,419 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 15:16:44,420 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 15:16:44,420 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 15:16:44,421 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 15:16:44,421 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 15:16:44,422 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 15:16:44,422 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 15:16:44,422 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 15:16:44,423 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 15:16:44,424 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 15:16:44,425 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 15:16:44,436 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 15:16:44,437 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 15:16:44,438 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 15:16:44,438 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 15:16:44,438 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 15:16:44,438 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 15:16:44,438 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 15:16:44,438 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 15:16:44,439 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 15:16:44,439 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 15:16:44,440 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 15:16:44,440 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 15:16:44,440 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 15:16:44,440 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 15:16:44,440 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 15:16:44,440 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 15:16:44,440 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 15:16:44,441 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 15:16:44,441 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 15:16:44,441 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 15:16:44,441 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 15:16:44,441 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 15:16:44,441 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 15:16:44,670 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 15:16:44,688 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 15:16:44,690 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 15:16:44,691 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 15:16:44,692 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 15:16:44,693 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_srvr.blast.03.i.cil.c [2022-04-28 15:16:44,764 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/881bac390/1e8c895c7e9e42a0ac7801317276310f/FLAGcd2b96c4e [2022-04-28 15:16:45,281 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 15:16:45,281 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.03.i.cil.c [2022-04-28 15:16:45,302 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/881bac390/1e8c895c7e9e42a0ac7801317276310f/FLAGcd2b96c4e [2022-04-28 15:16:45,583 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/881bac390/1e8c895c7e9e42a0ac7801317276310f [2022-04-28 15:16:45,586 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 15:16:45,587 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 15:16:45,590 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 15:16:45,590 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 15:16:45,594 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 15:16:45,595 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:16:45" (1/1) ... [2022-04-28 15:16:45,596 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f94b9b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:16:45, skipping insertion in model container [2022-04-28 15:16:45,596 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:16:45" (1/1) ... [2022-04-28 15:16:45,602 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 15:16:45,676 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 15:16:46,041 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.03.i.cil.c[72493,72506] [2022-04-28 15:16:46,062 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 15:16:46,074 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 15:16:46,230 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.03.i.cil.c[72493,72506] [2022-04-28 15:16:46,233 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 15:16:46,250 INFO L208 MainTranslator]: Completed translation [2022-04-28 15:16:46,250 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:16:46 WrapperNode [2022-04-28 15:16:46,250 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 15:16:46,253 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 15:16:46,253 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 15:16:46,253 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 15:16:46,264 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:16:46" (1/1) ... [2022-04-28 15:16:46,264 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:16:46" (1/1) ... [2022-04-28 15:16:46,297 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:16:46" (1/1) ... [2022-04-28 15:16:46,298 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:16:46" (1/1) ... [2022-04-28 15:16:46,381 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:16:46" (1/1) ... [2022-04-28 15:16:46,398 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:16:46" (1/1) ... [2022-04-28 15:16:46,400 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:16:46" (1/1) ... [2022-04-28 15:16:46,406 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 15:16:46,407 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 15:16:46,407 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 15:16:46,415 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 15:16:46,416 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:16:46" (1/1) ... [2022-04-28 15:16:46,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 15:16:46,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 15:16:46,446 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 15:16:46,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 15:16:46,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 15:16:46,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 15:16:46,493 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 15:16:46,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2022-04-28 15:16:46,494 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2022-04-28 15:16:46,494 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 15:16:46,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2022-04-28 15:16:46,494 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-28 15:16:46,494 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-28 15:16:46,495 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-28 15:16:46,495 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 15:16:46,495 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 15:16:46,495 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 15:16:46,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 15:16:46,496 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-28 15:16:46,498 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-28 15:16:46,498 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 15:16:46,498 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-28 15:16:46,498 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-28 15:16:46,498 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-28 15:16:46,498 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2022-04-28 15:16:46,498 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-28 15:16:46,498 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2022-04-28 15:16:46,499 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2022-04-28 15:16:46,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-28 15:16:46,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-28 15:16:46,499 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 15:16:46,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-28 15:16:46,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 15:16:46,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-28 15:16:46,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 15:16:46,499 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-28 15:16:46,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-28 15:16:46,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 15:16:46,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 15:16:46,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 15:16:46,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-28 15:16:46,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-28 15:16:46,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-28 15:16:46,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-28 15:16:46,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 15:16:46,716 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 15:16:46,717 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 15:16:48,527 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 15:16:49,047 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2022-04-28 15:16:49,047 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2022-04-28 15:16:49,071 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 15:16:49,082 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 15:16:49,082 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 15:16:49,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:16:49 BoogieIcfgContainer [2022-04-28 15:16:49,085 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 15:16:49,087 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 15:16:49,087 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 15:16:49,090 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 15:16:49,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 03:16:45" (1/3) ... [2022-04-28 15:16:49,090 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bebb169 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:16:49, skipping insertion in model container [2022-04-28 15:16:49,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:16:46" (2/3) ... [2022-04-28 15:16:49,091 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bebb169 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:16:49, skipping insertion in model container [2022-04-28 15:16:49,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:16:49" (3/3) ... [2022-04-28 15:16:49,094 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.03.i.cil.c [2022-04-28 15:16:49,108 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 15:16:49,108 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 15:16:49,149 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 15:16:49,155 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3d286880, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@305cc782 [2022-04-28 15:16:49,155 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 15:16:49,164 INFO L276 IsEmpty]: Start isEmpty. Operand has 153 states, 145 states have (on average 1.696551724137931) internal successors, (246), 146 states have internal predecessors, (246), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 15:16:49,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-28 15:16:49,173 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:16:49,174 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:16:49,174 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:16:49,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:16:49,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1104936065, now seen corresponding path program 1 times [2022-04-28 15:16:49,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:49,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [62706884] [2022-04-28 15:16:49,193 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:16:49,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1104936065, now seen corresponding path program 2 times [2022-04-28 15:16:49,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:16:49,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879433706] [2022-04-28 15:16:49,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:16:49,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:16:49,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:49,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:16:49,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:49,820 INFO L290 TraceCheckUtils]: 0: Hoare triple {163#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {156#true} is VALID [2022-04-28 15:16:49,821 INFO L290 TraceCheckUtils]: 1: Hoare triple {156#true} assume true; {156#true} is VALID [2022-04-28 15:16:49,821 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {156#true} {156#true} #662#return; {156#true} is VALID [2022-04-28 15:16:49,823 INFO L272 TraceCheckUtils]: 0: Hoare triple {156#true} call ULTIMATE.init(); {163#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:16:49,823 INFO L290 TraceCheckUtils]: 1: Hoare triple {163#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {156#true} is VALID [2022-04-28 15:16:49,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {156#true} assume true; {156#true} is VALID [2022-04-28 15:16:49,824 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {156#true} {156#true} #662#return; {156#true} is VALID [2022-04-28 15:16:49,824 INFO L272 TraceCheckUtils]: 4: Hoare triple {156#true} call #t~ret161 := main(); {156#true} is VALID [2022-04-28 15:16:49,825 INFO L290 TraceCheckUtils]: 5: Hoare triple {156#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~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);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; {156#true} is VALID [2022-04-28 15:16:49,825 INFO L290 TraceCheckUtils]: 6: Hoare triple {156#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {156#true} is VALID [2022-04-28 15:16:49,826 INFO L272 TraceCheckUtils]: 7: Hoare triple {156#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {156#true} is VALID [2022-04-28 15:16:49,833 INFO L290 TraceCheckUtils]: 8: Hoare triple {156#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;~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); {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:49,834 INFO L290 TraceCheckUtils]: 9: Hoare triple {161#(= 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; {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:49,835 INFO L290 TraceCheckUtils]: 10: Hoare triple {161#(= 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; {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:49,836 INFO L290 TraceCheckUtils]: 11: Hoare triple {161#(= 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)))); {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:49,838 INFO L290 TraceCheckUtils]: 12: Hoare triple {161#(= 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); {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:49,839 INFO L290 TraceCheckUtils]: 13: Hoare triple {161#(= 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; {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:49,840 INFO L290 TraceCheckUtils]: 14: Hoare triple {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:49,840 INFO L290 TraceCheckUtils]: 15: Hoare triple {161#(= 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); {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:49,841 INFO L290 TraceCheckUtils]: 16: Hoare triple {161#(= 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); {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:49,842 INFO L290 TraceCheckUtils]: 17: Hoare triple {161#(= 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); {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:49,842 INFO L290 TraceCheckUtils]: 18: Hoare triple {161#(= 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); {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:49,843 INFO L290 TraceCheckUtils]: 19: Hoare triple {161#(= 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); {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:49,843 INFO L290 TraceCheckUtils]: 20: Hoare triple {161#(= 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); {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:49,844 INFO L290 TraceCheckUtils]: 21: Hoare triple {161#(= 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); {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:49,845 INFO L290 TraceCheckUtils]: 22: Hoare triple {161#(= 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); {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:49,846 INFO L290 TraceCheckUtils]: 23: Hoare triple {161#(= 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); {162#(= 8464 |ssl3_accept_#t~mem55|)} is VALID [2022-04-28 15:16:49,846 INFO L290 TraceCheckUtils]: 24: Hoare triple {162#(= 8464 |ssl3_accept_#t~mem55|)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {157#false} is VALID [2022-04-28 15:16:49,847 INFO L290 TraceCheckUtils]: 25: Hoare triple {157#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {157#false} is VALID [2022-04-28 15:16:49,847 INFO L290 TraceCheckUtils]: 26: Hoare triple {157#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {157#false} is VALID [2022-04-28 15:16:49,848 INFO L290 TraceCheckUtils]: 27: Hoare triple {157#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {157#false} is VALID [2022-04-28 15:16:49,849 INFO L290 TraceCheckUtils]: 28: Hoare triple {157#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {157#false} is VALID [2022-04-28 15:16:49,849 INFO L290 TraceCheckUtils]: 29: Hoare triple {157#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {157#false} is VALID [2022-04-28 15:16:49,849 INFO L290 TraceCheckUtils]: 30: Hoare triple {157#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {157#false} is VALID [2022-04-28 15:16:49,849 INFO L290 TraceCheckUtils]: 31: Hoare triple {157#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {157#false} is VALID [2022-04-28 15:16:49,850 INFO L290 TraceCheckUtils]: 32: Hoare triple {157#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {157#false} is VALID [2022-04-28 15:16:49,850 INFO L290 TraceCheckUtils]: 33: Hoare triple {157#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {157#false} is VALID [2022-04-28 15:16:49,850 INFO L290 TraceCheckUtils]: 34: Hoare triple {157#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {157#false} is VALID [2022-04-28 15:16:49,850 INFO L290 TraceCheckUtils]: 35: Hoare triple {157#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {157#false} is VALID [2022-04-28 15:16:49,851 INFO L290 TraceCheckUtils]: 36: Hoare triple {157#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {157#false} is VALID [2022-04-28 15:16:49,852 INFO L290 TraceCheckUtils]: 37: Hoare triple {157#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {157#false} is VALID [2022-04-28 15:16:49,852 INFO L290 TraceCheckUtils]: 38: Hoare triple {157#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {157#false} is VALID [2022-04-28 15:16:49,853 INFO L290 TraceCheckUtils]: 39: Hoare triple {157#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {157#false} is VALID [2022-04-28 15:16:49,853 INFO L290 TraceCheckUtils]: 40: Hoare triple {157#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {157#false} is VALID [2022-04-28 15:16:49,877 INFO L290 TraceCheckUtils]: 41: Hoare triple {157#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {157#false} is VALID [2022-04-28 15:16:49,878 INFO L290 TraceCheckUtils]: 42: Hoare triple {157#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {157#false} is VALID [2022-04-28 15:16:49,878 INFO L290 TraceCheckUtils]: 43: Hoare triple {157#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {157#false} is VALID [2022-04-28 15:16:49,878 INFO L290 TraceCheckUtils]: 44: Hoare triple {157#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {157#false} is VALID [2022-04-28 15:16:49,878 INFO L290 TraceCheckUtils]: 45: Hoare triple {157#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {157#false} is VALID [2022-04-28 15:16:49,881 INFO L290 TraceCheckUtils]: 46: Hoare triple {157#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {157#false} is VALID [2022-04-28 15:16:49,882 INFO L290 TraceCheckUtils]: 47: Hoare triple {157#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {157#false} is VALID [2022-04-28 15:16:49,882 INFO L290 TraceCheckUtils]: 48: Hoare triple {157#false} assume 8672 == #t~mem79;havoc #t~mem79; {157#false} is VALID [2022-04-28 15:16:49,884 INFO L290 TraceCheckUtils]: 49: Hoare triple {157#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {157#false} is VALID [2022-04-28 15:16:49,884 INFO L290 TraceCheckUtils]: 50: Hoare triple {157#false} assume 3 == ~blastFlag~0; {157#false} is VALID [2022-04-28 15:16:49,884 INFO L290 TraceCheckUtils]: 51: Hoare triple {157#false} assume !false; {157#false} is VALID [2022-04-28 15:16:49,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:16:49,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:16:49,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879433706] [2022-04-28 15:16:49,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879433706] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:49,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:49,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:16:49,896 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:16:49,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [62706884] [2022-04-28 15:16:49,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [62706884] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:49,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:49,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:16:49,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808636857] [2022-04-28 15:16:49,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:16:49,903 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2022-04-28 15:16:49,904 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:16:49,907 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:49,980 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:16:49,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:16:49,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:50,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:16:50,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:16:50,013 INFO L87 Difference]: Start difference. First operand has 153 states, 145 states have (on average 1.696551724137931) internal successors, (246), 146 states have internal predecessors, (246), 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 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:52,065 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:16:53,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:53,699 INFO L93 Difference]: Finished difference Result 324 states and 540 transitions. [2022-04-28 15:16:53,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:16:53,699 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2022-04-28 15:16:53,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:16:53,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:53,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 540 transitions. [2022-04-28 15:16:53,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:53,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 540 transitions. [2022-04-28 15:16:53,728 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 540 transitions. [2022-04-28 15:16:54,181 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 540 edges. 540 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:16:54,201 INFO L225 Difference]: With dead ends: 324 [2022-04-28 15:16:54,202 INFO L226 Difference]: Without dead ends: 165 [2022-04-28 15:16:54,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:16:54,214 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 34 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 15:16:54,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 577 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 401 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 15:16:54,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-04-28 15:16:54,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 148. [2022-04-28 15:16:54,265 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:16:54,271 INFO L82 GeneralOperation]: Start isEquivalent. First operand 165 states. Second operand has 148 states, 143 states have (on average 1.5384615384615385) internal successors, (220), 143 states have internal predecessors, (220), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:54,273 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand has 148 states, 143 states have (on average 1.5384615384615385) internal successors, (220), 143 states have internal predecessors, (220), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:54,274 INFO L87 Difference]: Start difference. First operand 165 states. Second operand has 148 states, 143 states have (on average 1.5384615384615385) internal successors, (220), 143 states have internal predecessors, (220), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:54,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:54,288 INFO L93 Difference]: Finished difference Result 165 states and 245 transitions. [2022-04-28 15:16:54,288 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 245 transitions. [2022-04-28 15:16:54,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:54,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:54,290 INFO L74 IsIncluded]: Start isIncluded. First operand has 148 states, 143 states have (on average 1.5384615384615385) internal successors, (220), 143 states have internal predecessors, (220), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 165 states. [2022-04-28 15:16:54,291 INFO L87 Difference]: Start difference. First operand has 148 states, 143 states have (on average 1.5384615384615385) internal successors, (220), 143 states have internal predecessors, (220), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 165 states. [2022-04-28 15:16:54,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:54,298 INFO L93 Difference]: Finished difference Result 165 states and 245 transitions. [2022-04-28 15:16:54,298 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 245 transitions. [2022-04-28 15:16:54,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:54,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:54,300 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:16:54,300 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:16:54,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 143 states have (on average 1.5384615384615385) internal successors, (220), 143 states have internal predecessors, (220), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:54,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 224 transitions. [2022-04-28 15:16:54,308 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 224 transitions. Word has length 52 [2022-04-28 15:16:54,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:16:54,308 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 224 transitions. [2022-04-28 15:16:54,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:54,309 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 148 states and 224 transitions. [2022-04-28 15:16:54,503 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 224 edges. 224 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:16:54,504 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 224 transitions. [2022-04-28 15:16:54,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-28 15:16:54,505 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:16:54,506 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:16:54,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 15:16:54,506 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:16:54,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:16:54,507 INFO L85 PathProgramCache]: Analyzing trace with hash 133985870, now seen corresponding path program 1 times [2022-04-28 15:16:54,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:54,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [881394200] [2022-04-28 15:16:54,532 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:16:54,532 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:16:54,532 INFO L85 PathProgramCache]: Analyzing trace with hash 133985870, now seen corresponding path program 2 times [2022-04-28 15:16:54,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:16:54,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57461548] [2022-04-28 15:16:54,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:16:54,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:16:54,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:54,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:16:54,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:54,757 INFO L290 TraceCheckUtils]: 0: Hoare triple {1449#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {1442#true} is VALID [2022-04-28 15:16:54,757 INFO L290 TraceCheckUtils]: 1: Hoare triple {1442#true} assume true; {1442#true} is VALID [2022-04-28 15:16:54,757 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1442#true} {1442#true} #662#return; {1442#true} is VALID [2022-04-28 15:16:54,758 INFO L272 TraceCheckUtils]: 0: Hoare triple {1442#true} call ULTIMATE.init(); {1449#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:16:54,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {1449#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {1442#true} is VALID [2022-04-28 15:16:54,763 INFO L290 TraceCheckUtils]: 2: Hoare triple {1442#true} assume true; {1442#true} is VALID [2022-04-28 15:16:54,763 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1442#true} {1442#true} #662#return; {1442#true} is VALID [2022-04-28 15:16:54,764 INFO L272 TraceCheckUtils]: 4: Hoare triple {1442#true} call #t~ret161 := main(); {1442#true} is VALID [2022-04-28 15:16:54,764 INFO L290 TraceCheckUtils]: 5: Hoare triple {1442#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~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);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; {1442#true} is VALID [2022-04-28 15:16:54,764 INFO L290 TraceCheckUtils]: 6: Hoare triple {1442#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {1442#true} is VALID [2022-04-28 15:16:54,764 INFO L272 TraceCheckUtils]: 7: Hoare triple {1442#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {1442#true} is VALID [2022-04-28 15:16:54,767 INFO L290 TraceCheckUtils]: 8: Hoare triple {1442#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;~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); {1447#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:54,768 INFO L290 TraceCheckUtils]: 9: Hoare triple {1447#(= 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; {1447#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:54,769 INFO L290 TraceCheckUtils]: 10: Hoare triple {1447#(= 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; {1447#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:54,769 INFO L290 TraceCheckUtils]: 11: Hoare triple {1447#(= 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)))); {1447#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:54,770 INFO L290 TraceCheckUtils]: 12: Hoare triple {1447#(= 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); {1447#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:54,770 INFO L290 TraceCheckUtils]: 13: Hoare triple {1447#(= 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; {1447#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:54,771 INFO L290 TraceCheckUtils]: 14: Hoare triple {1447#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {1447#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:54,771 INFO L290 TraceCheckUtils]: 15: Hoare triple {1447#(= 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); {1447#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:54,772 INFO L290 TraceCheckUtils]: 16: Hoare triple {1447#(= 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); {1447#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:54,773 INFO L290 TraceCheckUtils]: 17: Hoare triple {1447#(= 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); {1447#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:54,773 INFO L290 TraceCheckUtils]: 18: Hoare triple {1447#(= 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); {1447#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:54,774 INFO L290 TraceCheckUtils]: 19: Hoare triple {1447#(= 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); {1447#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:54,774 INFO L290 TraceCheckUtils]: 20: Hoare triple {1447#(= 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); {1448#(= 8464 |ssl3_accept_#t~mem52|)} is VALID [2022-04-28 15:16:54,775 INFO L290 TraceCheckUtils]: 21: Hoare triple {1448#(= 8464 |ssl3_accept_#t~mem52|)} assume 8480 == #t~mem52;havoc #t~mem52; {1443#false} is VALID [2022-04-28 15:16:54,775 INFO L290 TraceCheckUtils]: 22: Hoare triple {1443#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; {1443#false} is VALID [2022-04-28 15:16:54,776 INFO L290 TraceCheckUtils]: 23: Hoare triple {1443#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); {1443#false} is VALID [2022-04-28 15:16:54,777 INFO L290 TraceCheckUtils]: 24: Hoare triple {1443#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); {1443#false} is VALID [2022-04-28 15:16:54,777 INFO L290 TraceCheckUtils]: 25: Hoare triple {1443#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {1443#false} is VALID [2022-04-28 15:16:54,777 INFO L290 TraceCheckUtils]: 26: Hoare triple {1443#false} ~skip~0 := 0; {1443#false} is VALID [2022-04-28 15:16:54,777 INFO L290 TraceCheckUtils]: 27: Hoare triple {1443#false} assume !false; {1443#false} is VALID [2022-04-28 15:16:54,777 INFO L290 TraceCheckUtils]: 28: Hoare triple {1443#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); {1443#false} is VALID [2022-04-28 15:16:54,778 INFO L290 TraceCheckUtils]: 29: Hoare triple {1443#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-28 15:16:54,778 INFO L290 TraceCheckUtils]: 30: Hoare triple {1443#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-28 15:16:54,778 INFO L290 TraceCheckUtils]: 31: Hoare triple {1443#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-28 15:16:54,778 INFO L290 TraceCheckUtils]: 32: Hoare triple {1443#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-28 15:16:54,778 INFO L290 TraceCheckUtils]: 33: Hoare triple {1443#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-28 15:16:54,779 INFO L290 TraceCheckUtils]: 34: Hoare triple {1443#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-28 15:16:54,779 INFO L290 TraceCheckUtils]: 35: Hoare triple {1443#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-28 15:16:54,779 INFO L290 TraceCheckUtils]: 36: Hoare triple {1443#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-28 15:16:54,779 INFO L290 TraceCheckUtils]: 37: Hoare triple {1443#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-28 15:16:54,779 INFO L290 TraceCheckUtils]: 38: Hoare triple {1443#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-28 15:16:54,780 INFO L290 TraceCheckUtils]: 39: Hoare triple {1443#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-28 15:16:54,782 INFO L290 TraceCheckUtils]: 40: Hoare triple {1443#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-28 15:16:54,783 INFO L290 TraceCheckUtils]: 41: Hoare triple {1443#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-28 15:16:54,784 INFO L290 TraceCheckUtils]: 42: Hoare triple {1443#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-28 15:16:54,788 INFO L290 TraceCheckUtils]: 43: Hoare triple {1443#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-28 15:16:54,789 INFO L290 TraceCheckUtils]: 44: Hoare triple {1443#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-28 15:16:54,789 INFO L290 TraceCheckUtils]: 45: Hoare triple {1443#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-28 15:16:54,791 INFO L290 TraceCheckUtils]: 46: Hoare triple {1443#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-28 15:16:54,791 INFO L290 TraceCheckUtils]: 47: Hoare triple {1443#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-28 15:16:54,792 INFO L290 TraceCheckUtils]: 48: Hoare triple {1443#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-28 15:16:54,792 INFO L290 TraceCheckUtils]: 49: Hoare triple {1443#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-28 15:16:54,792 INFO L290 TraceCheckUtils]: 50: Hoare triple {1443#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-28 15:16:54,792 INFO L290 TraceCheckUtils]: 51: Hoare triple {1443#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-28 15:16:54,792 INFO L290 TraceCheckUtils]: 52: Hoare triple {1443#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-28 15:16:54,794 INFO L290 TraceCheckUtils]: 53: Hoare triple {1443#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-28 15:16:54,794 INFO L290 TraceCheckUtils]: 54: Hoare triple {1443#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-28 15:16:54,794 INFO L290 TraceCheckUtils]: 55: Hoare triple {1443#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-28 15:16:54,795 INFO L290 TraceCheckUtils]: 56: Hoare triple {1443#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-28 15:16:54,795 INFO L290 TraceCheckUtils]: 57: Hoare triple {1443#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-28 15:16:54,795 INFO L290 TraceCheckUtils]: 58: Hoare triple {1443#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-28 15:16:54,795 INFO L290 TraceCheckUtils]: 59: Hoare triple {1443#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-28 15:16:54,795 INFO L290 TraceCheckUtils]: 60: Hoare triple {1443#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-28 15:16:54,795 INFO L290 TraceCheckUtils]: 61: Hoare triple {1443#false} assume 8672 == #t~mem79;havoc #t~mem79; {1443#false} is VALID [2022-04-28 15:16:54,796 INFO L290 TraceCheckUtils]: 62: Hoare triple {1443#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {1443#false} is VALID [2022-04-28 15:16:54,796 INFO L290 TraceCheckUtils]: 63: Hoare triple {1443#false} assume 3 == ~blastFlag~0; {1443#false} is VALID [2022-04-28 15:16:54,796 INFO L290 TraceCheckUtils]: 64: Hoare triple {1443#false} assume !false; {1443#false} is VALID [2022-04-28 15:16:54,797 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:16:54,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:16:54,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57461548] [2022-04-28 15:16:54,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57461548] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:54,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:54,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:16:54,798 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:16:54,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [881394200] [2022-04-28 15:16:54,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [881394200] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:54,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:54,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:16:54,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171753799] [2022-04-28 15:16:54,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:16:54,799 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-28 15:16:54,799 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:16:54,800 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:54,856 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:16:54,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:16:54,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:54,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:16:54,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:16:54,860 INFO L87 Difference]: Start difference. First operand 148 states and 224 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:56,888 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:16:58,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:58,024 INFO L93 Difference]: Finished difference Result 287 states and 431 transitions. [2022-04-28 15:16:58,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:16:58,025 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-28 15:16:58,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:16:58,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:58,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 431 transitions. [2022-04-28 15:16:58,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:58,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 431 transitions. [2022-04-28 15:16:58,034 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 431 transitions. [2022-04-28 15:16:58,360 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 431 edges. 431 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:16:58,366 INFO L225 Difference]: With dead ends: 287 [2022-04-28 15:16:58,366 INFO L226 Difference]: Without dead ends: 165 [2022-04-28 15:16:58,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:16:58,375 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 24 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:16:58,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 453 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 350 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 15:16:58,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-04-28 15:16:58,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 148. [2022-04-28 15:16:58,393 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:16:58,394 INFO L82 GeneralOperation]: Start isEquivalent. First operand 165 states. Second operand has 148 states, 143 states have (on average 1.5314685314685315) internal successors, (219), 143 states have internal predecessors, (219), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:58,394 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand has 148 states, 143 states have (on average 1.5314685314685315) internal successors, (219), 143 states have internal predecessors, (219), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:58,395 INFO L87 Difference]: Start difference. First operand 165 states. Second operand has 148 states, 143 states have (on average 1.5314685314685315) internal successors, (219), 143 states have internal predecessors, (219), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:58,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:58,405 INFO L93 Difference]: Finished difference Result 165 states and 244 transitions. [2022-04-28 15:16:58,405 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 244 transitions. [2022-04-28 15:16:58,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:58,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:58,411 INFO L74 IsIncluded]: Start isIncluded. First operand has 148 states, 143 states have (on average 1.5314685314685315) internal successors, (219), 143 states have internal predecessors, (219), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 165 states. [2022-04-28 15:16:58,411 INFO L87 Difference]: Start difference. First operand has 148 states, 143 states have (on average 1.5314685314685315) internal successors, (219), 143 states have internal predecessors, (219), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 165 states. [2022-04-28 15:16:58,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:58,418 INFO L93 Difference]: Finished difference Result 165 states and 244 transitions. [2022-04-28 15:16:58,418 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 244 transitions. [2022-04-28 15:16:58,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:58,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:58,418 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:16:58,419 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:16:58,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 143 states have (on average 1.5314685314685315) internal successors, (219), 143 states have internal predecessors, (219), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:58,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 223 transitions. [2022-04-28 15:16:58,425 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 223 transitions. Word has length 65 [2022-04-28 15:16:58,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:16:58,426 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 223 transitions. [2022-04-28 15:16:58,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:58,427 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 148 states and 223 transitions. [2022-04-28 15:16:58,596 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 223 edges. 223 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:16:58,596 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 223 transitions. [2022-04-28 15:16:58,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-28 15:16:58,597 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:16:58,597 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:16:58,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 15:16:58,598 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:16:58,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:16:58,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1027752574, now seen corresponding path program 1 times [2022-04-28 15:16:58,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:58,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [954418022] [2022-04-28 15:16:58,635 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:16:58,635 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:16:58,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1027752574, now seen corresponding path program 2 times [2022-04-28 15:16:58,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:16:58,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108417473] [2022-04-28 15:16:58,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:16:58,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:16:58,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:58,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:16:58,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:58,795 INFO L290 TraceCheckUtils]: 0: Hoare triple {2661#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {2654#true} is VALID [2022-04-28 15:16:58,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {2654#true} assume true; {2654#true} is VALID [2022-04-28 15:16:58,795 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2654#true} {2654#true} #662#return; {2654#true} is VALID [2022-04-28 15:16:58,798 INFO L272 TraceCheckUtils]: 0: Hoare triple {2654#true} call ULTIMATE.init(); {2661#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:16:58,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {2661#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {2654#true} is VALID [2022-04-28 15:16:58,799 INFO L290 TraceCheckUtils]: 2: Hoare triple {2654#true} assume true; {2654#true} is VALID [2022-04-28 15:16:58,799 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2654#true} {2654#true} #662#return; {2654#true} is VALID [2022-04-28 15:16:58,799 INFO L272 TraceCheckUtils]: 4: Hoare triple {2654#true} call #t~ret161 := main(); {2654#true} is VALID [2022-04-28 15:16:58,799 INFO L290 TraceCheckUtils]: 5: Hoare triple {2654#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~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);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; {2654#true} is VALID [2022-04-28 15:16:58,799 INFO L290 TraceCheckUtils]: 6: Hoare triple {2654#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {2654#true} is VALID [2022-04-28 15:16:58,799 INFO L272 TraceCheckUtils]: 7: Hoare triple {2654#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {2654#true} is VALID [2022-04-28 15:16:58,802 INFO L290 TraceCheckUtils]: 8: Hoare triple {2654#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;~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); {2659#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:58,802 INFO L290 TraceCheckUtils]: 9: Hoare triple {2659#(= 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; {2659#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:58,803 INFO L290 TraceCheckUtils]: 10: Hoare triple {2659#(= 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; {2659#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:58,804 INFO L290 TraceCheckUtils]: 11: Hoare triple {2659#(= 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)))); {2659#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:58,804 INFO L290 TraceCheckUtils]: 12: Hoare triple {2659#(= 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); {2659#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:58,805 INFO L290 TraceCheckUtils]: 13: Hoare triple {2659#(= 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; {2659#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:58,805 INFO L290 TraceCheckUtils]: 14: Hoare triple {2659#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {2659#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:58,807 INFO L290 TraceCheckUtils]: 15: Hoare triple {2659#(= 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); {2660#(= 8464 |ssl3_accept_#t~mem47|)} is VALID [2022-04-28 15:16:58,807 INFO L290 TraceCheckUtils]: 16: Hoare triple {2660#(= 8464 |ssl3_accept_#t~mem47|)} assume 12292 == #t~mem47;havoc #t~mem47; {2655#false} is VALID [2022-04-28 15:16:58,808 INFO L290 TraceCheckUtils]: 17: Hoare triple {2655#false} call write~int(1, ~s.base, 60 + ~s.offset, 4); {2655#false} is VALID [2022-04-28 15:16:58,808 INFO L290 TraceCheckUtils]: 18: Hoare triple {2655#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {2655#false} is VALID [2022-04-28 15:16:58,808 INFO L290 TraceCheckUtils]: 19: Hoare triple {2655#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {2655#false} is VALID [2022-04-28 15:16:58,808 INFO L290 TraceCheckUtils]: 20: Hoare triple {2655#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {2655#false} is VALID [2022-04-28 15:16:58,808 INFO L290 TraceCheckUtils]: 21: Hoare triple {2655#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); {2655#false} is VALID [2022-04-28 15:16:58,808 INFO L290 TraceCheckUtils]: 22: Hoare triple {2655#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {2655#false} is VALID [2022-04-28 15:16:58,808 INFO L290 TraceCheckUtils]: 23: Hoare triple {2655#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); {2655#false} is VALID [2022-04-28 15:16:58,809 INFO L290 TraceCheckUtils]: 24: Hoare triple {2655#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); {2655#false} is VALID [2022-04-28 15:16:58,809 INFO L290 TraceCheckUtils]: 25: Hoare triple {2655#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); {2655#false} is VALID [2022-04-28 15:16:58,809 INFO L290 TraceCheckUtils]: 26: Hoare triple {2655#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {2655#false} is VALID [2022-04-28 15:16:58,809 INFO L290 TraceCheckUtils]: 27: Hoare triple {2655#false} ~skip~0 := 0; {2655#false} is VALID [2022-04-28 15:16:58,809 INFO L290 TraceCheckUtils]: 28: Hoare triple {2655#false} assume !false; {2655#false} is VALID [2022-04-28 15:16:58,809 INFO L290 TraceCheckUtils]: 29: Hoare triple {2655#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); {2655#false} is VALID [2022-04-28 15:16:58,810 INFO L290 TraceCheckUtils]: 30: Hoare triple {2655#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-28 15:16:58,810 INFO L290 TraceCheckUtils]: 31: Hoare triple {2655#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-28 15:16:58,810 INFO L290 TraceCheckUtils]: 32: Hoare triple {2655#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-28 15:16:58,810 INFO L290 TraceCheckUtils]: 33: Hoare triple {2655#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-28 15:16:58,810 INFO L290 TraceCheckUtils]: 34: Hoare triple {2655#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-28 15:16:58,810 INFO L290 TraceCheckUtils]: 35: Hoare triple {2655#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-28 15:16:58,810 INFO L290 TraceCheckUtils]: 36: Hoare triple {2655#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-28 15:16:58,811 INFO L290 TraceCheckUtils]: 37: Hoare triple {2655#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-28 15:16:58,811 INFO L290 TraceCheckUtils]: 38: Hoare triple {2655#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-28 15:16:58,811 INFO L290 TraceCheckUtils]: 39: Hoare triple {2655#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-28 15:16:58,811 INFO L290 TraceCheckUtils]: 40: Hoare triple {2655#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-28 15:16:58,811 INFO L290 TraceCheckUtils]: 41: Hoare triple {2655#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-28 15:16:58,811 INFO L290 TraceCheckUtils]: 42: Hoare triple {2655#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-28 15:16:58,812 INFO L290 TraceCheckUtils]: 43: Hoare triple {2655#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-28 15:16:58,812 INFO L290 TraceCheckUtils]: 44: Hoare triple {2655#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-28 15:16:58,812 INFO L290 TraceCheckUtils]: 45: Hoare triple {2655#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-28 15:16:58,812 INFO L290 TraceCheckUtils]: 46: Hoare triple {2655#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-28 15:16:58,812 INFO L290 TraceCheckUtils]: 47: Hoare triple {2655#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-28 15:16:58,812 INFO L290 TraceCheckUtils]: 48: Hoare triple {2655#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-28 15:16:58,812 INFO L290 TraceCheckUtils]: 49: Hoare triple {2655#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-28 15:16:58,813 INFO L290 TraceCheckUtils]: 50: Hoare triple {2655#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-28 15:16:58,813 INFO L290 TraceCheckUtils]: 51: Hoare triple {2655#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-28 15:16:58,813 INFO L290 TraceCheckUtils]: 52: Hoare triple {2655#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-28 15:16:58,813 INFO L290 TraceCheckUtils]: 53: Hoare triple {2655#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-28 15:16:58,813 INFO L290 TraceCheckUtils]: 54: Hoare triple {2655#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-28 15:16:58,813 INFO L290 TraceCheckUtils]: 55: Hoare triple {2655#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-28 15:16:58,813 INFO L290 TraceCheckUtils]: 56: Hoare triple {2655#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-28 15:16:58,814 INFO L290 TraceCheckUtils]: 57: Hoare triple {2655#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-28 15:16:58,814 INFO L290 TraceCheckUtils]: 58: Hoare triple {2655#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-28 15:16:58,814 INFO L290 TraceCheckUtils]: 59: Hoare triple {2655#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-28 15:16:58,814 INFO L290 TraceCheckUtils]: 60: Hoare triple {2655#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-28 15:16:58,814 INFO L290 TraceCheckUtils]: 61: Hoare triple {2655#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-28 15:16:58,814 INFO L290 TraceCheckUtils]: 62: Hoare triple {2655#false} assume 8672 == #t~mem79;havoc #t~mem79; {2655#false} is VALID [2022-04-28 15:16:58,815 INFO L290 TraceCheckUtils]: 63: Hoare triple {2655#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {2655#false} is VALID [2022-04-28 15:16:58,815 INFO L290 TraceCheckUtils]: 64: Hoare triple {2655#false} assume 3 == ~blastFlag~0; {2655#false} is VALID [2022-04-28 15:16:58,815 INFO L290 TraceCheckUtils]: 65: Hoare triple {2655#false} assume !false; {2655#false} is VALID [2022-04-28 15:16:58,815 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:16:58,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:16:58,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108417473] [2022-04-28 15:16:58,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108417473] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:58,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:58,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:16:58,816 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:16:58,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [954418022] [2022-04-28 15:16:58,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [954418022] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:58,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:58,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:16:58,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375026056] [2022-04-28 15:16:58,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:16:58,817 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-28 15:16:58,818 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:16:58,818 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:58,877 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:16:58,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:16:58,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:58,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:16:58,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:16:58,878 INFO L87 Difference]: Start difference. First operand 148 states and 223 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:00,903 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:17:01,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:01,966 INFO L93 Difference]: Finished difference Result 286 states and 429 transitions. [2022-04-28 15:17:01,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:17:01,966 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-28 15:17:01,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:17:01,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:01,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 429 transitions. [2022-04-28 15:17:01,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:01,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 429 transitions. [2022-04-28 15:17:01,975 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 429 transitions. [2022-04-28 15:17:02,280 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 429 edges. 429 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:02,283 INFO L225 Difference]: With dead ends: 286 [2022-04-28 15:17:02,283 INFO L226 Difference]: Without dead ends: 164 [2022-04-28 15:17:02,283 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:17:02,284 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 28 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:17:02,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 455 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 348 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 15:17:02,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-04-28 15:17:02,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 148. [2022-04-28 15:17:02,292 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:17:02,293 INFO L82 GeneralOperation]: Start isEquivalent. First operand 164 states. Second operand has 148 states, 143 states have (on average 1.5244755244755244) internal successors, (218), 143 states have internal predecessors, (218), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:02,293 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand has 148 states, 143 states have (on average 1.5244755244755244) internal successors, (218), 143 states have internal predecessors, (218), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:02,294 INFO L87 Difference]: Start difference. First operand 164 states. Second operand has 148 states, 143 states have (on average 1.5244755244755244) internal successors, (218), 143 states have internal predecessors, (218), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:02,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:02,298 INFO L93 Difference]: Finished difference Result 164 states and 242 transitions. [2022-04-28 15:17:02,298 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 242 transitions. [2022-04-28 15:17:02,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:02,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:02,299 INFO L74 IsIncluded]: Start isIncluded. First operand has 148 states, 143 states have (on average 1.5244755244755244) internal successors, (218), 143 states have internal predecessors, (218), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 164 states. [2022-04-28 15:17:02,300 INFO L87 Difference]: Start difference. First operand has 148 states, 143 states have (on average 1.5244755244755244) internal successors, (218), 143 states have internal predecessors, (218), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 164 states. [2022-04-28 15:17:02,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:02,304 INFO L93 Difference]: Finished difference Result 164 states and 242 transitions. [2022-04-28 15:17:02,304 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 242 transitions. [2022-04-28 15:17:02,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:02,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:02,304 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:17:02,305 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:17:02,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 143 states have (on average 1.5244755244755244) internal successors, (218), 143 states have internal predecessors, (218), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:02,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 222 transitions. [2022-04-28 15:17:02,309 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 222 transitions. Word has length 66 [2022-04-28 15:17:02,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:17:02,309 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 222 transitions. [2022-04-28 15:17:02,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:02,310 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 148 states and 222 transitions. [2022-04-28 15:17:02,459 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 222 edges. 222 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:02,459 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 222 transitions. [2022-04-28 15:17:02,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-28 15:17:02,460 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:17:02,460 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:17:02,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 15:17:02,460 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:17:02,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:17:02,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1865763346, now seen corresponding path program 1 times [2022-04-28 15:17:02,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:02,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1886026543] [2022-04-28 15:17:02,490 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 15:17:02,490 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:17:02,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1865763346, now seen corresponding path program 2 times [2022-04-28 15:17:02,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:17:02,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785773941] [2022-04-28 15:17:02,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:17:02,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:17:02,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:02,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:17:02,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:02,695 INFO L290 TraceCheckUtils]: 0: Hoare triple {3869#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {3862#true} is VALID [2022-04-28 15:17:02,696 INFO L290 TraceCheckUtils]: 1: Hoare triple {3862#true} assume true; {3862#true} is VALID [2022-04-28 15:17:02,696 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3862#true} {3862#true} #662#return; {3862#true} is VALID [2022-04-28 15:17:02,697 INFO L272 TraceCheckUtils]: 0: Hoare triple {3862#true} call ULTIMATE.init(); {3869#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:17:02,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {3869#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {3862#true} is VALID [2022-04-28 15:17:02,697 INFO L290 TraceCheckUtils]: 2: Hoare triple {3862#true} assume true; {3862#true} is VALID [2022-04-28 15:17:02,697 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3862#true} {3862#true} #662#return; {3862#true} is VALID [2022-04-28 15:17:02,697 INFO L272 TraceCheckUtils]: 4: Hoare triple {3862#true} call #t~ret161 := main(); {3862#true} is VALID [2022-04-28 15:17:02,697 INFO L290 TraceCheckUtils]: 5: Hoare triple {3862#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~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);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; {3862#true} is VALID [2022-04-28 15:17:02,701 INFO L290 TraceCheckUtils]: 6: Hoare triple {3862#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {3862#true} is VALID [2022-04-28 15:17:02,701 INFO L272 TraceCheckUtils]: 7: Hoare triple {3862#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {3862#true} is VALID [2022-04-28 15:17:02,703 INFO L290 TraceCheckUtils]: 8: Hoare triple {3862#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;~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); {3867#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:02,704 INFO L290 TraceCheckUtils]: 9: Hoare triple {3867#(= 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; {3867#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:02,704 INFO L290 TraceCheckUtils]: 10: Hoare triple {3867#(= 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; {3867#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:02,705 INFO L290 TraceCheckUtils]: 11: Hoare triple {3867#(= 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)))); {3867#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:02,705 INFO L290 TraceCheckUtils]: 12: Hoare triple {3867#(= 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); {3867#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:02,706 INFO L290 TraceCheckUtils]: 13: Hoare triple {3867#(= 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; {3867#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:02,706 INFO L290 TraceCheckUtils]: 14: Hoare triple {3867#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {3867#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:02,707 INFO L290 TraceCheckUtils]: 15: Hoare triple {3867#(= 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); {3867#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:02,707 INFO L290 TraceCheckUtils]: 16: Hoare triple {3867#(= 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); {3868#(= 8464 |ssl3_accept_#t~mem48|)} is VALID [2022-04-28 15:17:02,708 INFO L290 TraceCheckUtils]: 17: Hoare triple {3868#(= 8464 |ssl3_accept_#t~mem48|)} assume 16384 == #t~mem48;havoc #t~mem48; {3863#false} is VALID [2022-04-28 15:17:02,708 INFO L290 TraceCheckUtils]: 18: Hoare triple {3863#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {3863#false} is VALID [2022-04-28 15:17:02,708 INFO L290 TraceCheckUtils]: 19: Hoare triple {3863#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {3863#false} is VALID [2022-04-28 15:17:02,708 INFO L290 TraceCheckUtils]: 20: Hoare triple {3863#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {3863#false} is VALID [2022-04-28 15:17:02,708 INFO L290 TraceCheckUtils]: 21: Hoare triple {3863#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); {3863#false} is VALID [2022-04-28 15:17:02,708 INFO L290 TraceCheckUtils]: 22: Hoare triple {3863#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {3863#false} is VALID [2022-04-28 15:17:02,708 INFO L290 TraceCheckUtils]: 23: Hoare triple {3863#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); {3863#false} is VALID [2022-04-28 15:17:02,709 INFO L290 TraceCheckUtils]: 24: Hoare triple {3863#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); {3863#false} is VALID [2022-04-28 15:17:02,709 INFO L290 TraceCheckUtils]: 25: Hoare triple {3863#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); {3863#false} is VALID [2022-04-28 15:17:02,709 INFO L290 TraceCheckUtils]: 26: Hoare triple {3863#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {3863#false} is VALID [2022-04-28 15:17:02,709 INFO L290 TraceCheckUtils]: 27: Hoare triple {3863#false} ~skip~0 := 0; {3863#false} is VALID [2022-04-28 15:17:02,709 INFO L290 TraceCheckUtils]: 28: Hoare triple {3863#false} assume !false; {3863#false} is VALID [2022-04-28 15:17:02,709 INFO L290 TraceCheckUtils]: 29: Hoare triple {3863#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); {3863#false} is VALID [2022-04-28 15:17:02,709 INFO L290 TraceCheckUtils]: 30: Hoare triple {3863#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-28 15:17:02,710 INFO L290 TraceCheckUtils]: 31: Hoare triple {3863#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-28 15:17:02,710 INFO L290 TraceCheckUtils]: 32: Hoare triple {3863#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-28 15:17:02,710 INFO L290 TraceCheckUtils]: 33: Hoare triple {3863#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-28 15:17:02,710 INFO L290 TraceCheckUtils]: 34: Hoare triple {3863#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-28 15:17:02,711 INFO L290 TraceCheckUtils]: 35: Hoare triple {3863#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-28 15:17:02,711 INFO L290 TraceCheckUtils]: 36: Hoare triple {3863#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-28 15:17:02,711 INFO L290 TraceCheckUtils]: 37: Hoare triple {3863#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-28 15:17:02,711 INFO L290 TraceCheckUtils]: 38: Hoare triple {3863#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-28 15:17:02,711 INFO L290 TraceCheckUtils]: 39: Hoare triple {3863#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-28 15:17:02,711 INFO L290 TraceCheckUtils]: 40: Hoare triple {3863#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-28 15:17:02,711 INFO L290 TraceCheckUtils]: 41: Hoare triple {3863#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-28 15:17:02,711 INFO L290 TraceCheckUtils]: 42: Hoare triple {3863#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-28 15:17:02,712 INFO L290 TraceCheckUtils]: 43: Hoare triple {3863#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-28 15:17:02,716 INFO L290 TraceCheckUtils]: 44: Hoare triple {3863#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-28 15:17:02,717 INFO L290 TraceCheckUtils]: 45: Hoare triple {3863#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-28 15:17:02,717 INFO L290 TraceCheckUtils]: 46: Hoare triple {3863#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-28 15:17:02,718 INFO L290 TraceCheckUtils]: 47: Hoare triple {3863#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-28 15:17:02,721 INFO L290 TraceCheckUtils]: 48: Hoare triple {3863#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-28 15:17:02,722 INFO L290 TraceCheckUtils]: 49: Hoare triple {3863#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-28 15:17:02,722 INFO L290 TraceCheckUtils]: 50: Hoare triple {3863#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-28 15:17:02,722 INFO L290 TraceCheckUtils]: 51: Hoare triple {3863#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-28 15:17:02,722 INFO L290 TraceCheckUtils]: 52: Hoare triple {3863#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-28 15:17:02,722 INFO L290 TraceCheckUtils]: 53: Hoare triple {3863#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-28 15:17:02,723 INFO L290 TraceCheckUtils]: 54: Hoare triple {3863#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-28 15:17:02,724 INFO L290 TraceCheckUtils]: 55: Hoare triple {3863#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-28 15:17:02,724 INFO L290 TraceCheckUtils]: 56: Hoare triple {3863#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-28 15:17:02,725 INFO L290 TraceCheckUtils]: 57: Hoare triple {3863#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-28 15:17:02,725 INFO L290 TraceCheckUtils]: 58: Hoare triple {3863#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-28 15:17:02,725 INFO L290 TraceCheckUtils]: 59: Hoare triple {3863#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-28 15:17:02,725 INFO L290 TraceCheckUtils]: 60: Hoare triple {3863#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-28 15:17:02,725 INFO L290 TraceCheckUtils]: 61: Hoare triple {3863#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-28 15:17:02,725 INFO L290 TraceCheckUtils]: 62: Hoare triple {3863#false} assume 8672 == #t~mem79;havoc #t~mem79; {3863#false} is VALID [2022-04-28 15:17:02,725 INFO L290 TraceCheckUtils]: 63: Hoare triple {3863#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {3863#false} is VALID [2022-04-28 15:17:02,725 INFO L290 TraceCheckUtils]: 64: Hoare triple {3863#false} assume 3 == ~blastFlag~0; {3863#false} is VALID [2022-04-28 15:17:02,726 INFO L290 TraceCheckUtils]: 65: Hoare triple {3863#false} assume !false; {3863#false} is VALID [2022-04-28 15:17:02,726 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:17:02,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:17:02,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785773941] [2022-04-28 15:17:02,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785773941] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:02,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:02,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:02,727 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:17:02,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1886026543] [2022-04-28 15:17:02,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1886026543] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:02,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:02,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:02,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564840149] [2022-04-28 15:17:02,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:17:02,728 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-28 15:17:02,728 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:17:02,728 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:02,782 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:02,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:17:02,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:02,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:17:02,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:17:02,783 INFO L87 Difference]: Start difference. First operand 148 states and 222 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:04,804 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:17:05,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:05,813 INFO L93 Difference]: Finished difference Result 286 states and 428 transitions. [2022-04-28 15:17:05,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:17:05,813 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-28 15:17:05,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:17:05,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:05,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 428 transitions. [2022-04-28 15:17:05,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:05,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 428 transitions. [2022-04-28 15:17:05,822 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 428 transitions. [2022-04-28 15:17:06,121 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 428 edges. 428 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:06,124 INFO L225 Difference]: With dead ends: 286 [2022-04-28 15:17:06,124 INFO L226 Difference]: Without dead ends: 164 [2022-04-28 15:17:06,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:17:06,125 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 26 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:17:06,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 455 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 348 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 15:17:06,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-04-28 15:17:06,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 148. [2022-04-28 15:17:06,133 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:17:06,134 INFO L82 GeneralOperation]: Start isEquivalent. First operand 164 states. Second operand has 148 states, 143 states have (on average 1.5174825174825175) internal successors, (217), 143 states have internal predecessors, (217), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:06,134 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand has 148 states, 143 states have (on average 1.5174825174825175) internal successors, (217), 143 states have internal predecessors, (217), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:06,135 INFO L87 Difference]: Start difference. First operand 164 states. Second operand has 148 states, 143 states have (on average 1.5174825174825175) internal successors, (217), 143 states have internal predecessors, (217), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:06,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:06,139 INFO L93 Difference]: Finished difference Result 164 states and 241 transitions. [2022-04-28 15:17:06,139 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 241 transitions. [2022-04-28 15:17:06,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:06,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:06,140 INFO L74 IsIncluded]: Start isIncluded. First operand has 148 states, 143 states have (on average 1.5174825174825175) internal successors, (217), 143 states have internal predecessors, (217), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 164 states. [2022-04-28 15:17:06,140 INFO L87 Difference]: Start difference. First operand has 148 states, 143 states have (on average 1.5174825174825175) internal successors, (217), 143 states have internal predecessors, (217), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 164 states. [2022-04-28 15:17:06,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:06,145 INFO L93 Difference]: Finished difference Result 164 states and 241 transitions. [2022-04-28 15:17:06,145 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 241 transitions. [2022-04-28 15:17:06,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:06,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:06,146 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:17:06,146 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:17:06,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 143 states have (on average 1.5174825174825175) internal successors, (217), 143 states have internal predecessors, (217), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:06,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 221 transitions. [2022-04-28 15:17:06,150 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 221 transitions. Word has length 66 [2022-04-28 15:17:06,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:17:06,151 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 221 transitions. [2022-04-28 15:17:06,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:06,151 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 148 states and 221 transitions. [2022-04-28 15:17:06,346 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 221 edges. 221 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:06,346 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 221 transitions. [2022-04-28 15:17:06,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-28 15:17:06,347 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:17:06,347 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:17:06,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 15:17:06,348 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:17:06,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:17:06,348 INFO L85 PathProgramCache]: Analyzing trace with hash -354488375, now seen corresponding path program 1 times [2022-04-28 15:17:06,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:06,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [751443507] [2022-04-28 15:17:06,372 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:17:06,373 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:17:06,373 INFO L85 PathProgramCache]: Analyzing trace with hash -354488375, now seen corresponding path program 2 times [2022-04-28 15:17:06,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:17:06,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243287587] [2022-04-28 15:17:06,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:17:06,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:17:06,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:06,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:17:06,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:06,535 INFO L290 TraceCheckUtils]: 0: Hoare triple {5077#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {5070#true} is VALID [2022-04-28 15:17:06,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {5070#true} assume true; {5070#true} is VALID [2022-04-28 15:17:06,536 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5070#true} {5070#true} #662#return; {5070#true} is VALID [2022-04-28 15:17:06,537 INFO L272 TraceCheckUtils]: 0: Hoare triple {5070#true} call ULTIMATE.init(); {5077#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:17:06,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {5077#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {5070#true} is VALID [2022-04-28 15:17:06,537 INFO L290 TraceCheckUtils]: 2: Hoare triple {5070#true} assume true; {5070#true} is VALID [2022-04-28 15:17:06,537 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5070#true} {5070#true} #662#return; {5070#true} is VALID [2022-04-28 15:17:06,537 INFO L272 TraceCheckUtils]: 4: Hoare triple {5070#true} call #t~ret161 := main(); {5070#true} is VALID [2022-04-28 15:17:06,537 INFO L290 TraceCheckUtils]: 5: Hoare triple {5070#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~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);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; {5070#true} is VALID [2022-04-28 15:17:06,537 INFO L290 TraceCheckUtils]: 6: Hoare triple {5070#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {5070#true} is VALID [2022-04-28 15:17:06,537 INFO L272 TraceCheckUtils]: 7: Hoare triple {5070#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {5070#true} is VALID [2022-04-28 15:17:06,540 INFO L290 TraceCheckUtils]: 8: Hoare triple {5070#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;~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); {5075#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:06,540 INFO L290 TraceCheckUtils]: 9: Hoare triple {5075#(= 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; {5075#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:06,541 INFO L290 TraceCheckUtils]: 10: Hoare triple {5075#(= 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; {5075#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:06,542 INFO L290 TraceCheckUtils]: 11: Hoare triple {5075#(= 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)))); {5075#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:06,542 INFO L290 TraceCheckUtils]: 12: Hoare triple {5075#(= 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); {5075#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:06,542 INFO L290 TraceCheckUtils]: 13: Hoare triple {5075#(= 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; {5075#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:06,543 INFO L290 TraceCheckUtils]: 14: Hoare triple {5075#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {5075#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:06,544 INFO L290 TraceCheckUtils]: 15: Hoare triple {5075#(= 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); {5075#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:06,544 INFO L290 TraceCheckUtils]: 16: Hoare triple {5075#(= 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); {5075#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:06,545 INFO L290 TraceCheckUtils]: 17: Hoare triple {5075#(= 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); {5075#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:06,545 INFO L290 TraceCheckUtils]: 18: Hoare triple {5075#(= 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); {5075#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:06,546 INFO L290 TraceCheckUtils]: 19: Hoare triple {5075#(= 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); {5075#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:06,546 INFO L290 TraceCheckUtils]: 20: Hoare triple {5075#(= 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); {5075#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:06,546 INFO L290 TraceCheckUtils]: 21: Hoare triple {5075#(= 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); {5076#(= 8464 |ssl3_accept_#t~mem53|)} is VALID [2022-04-28 15:17:06,547 INFO L290 TraceCheckUtils]: 22: Hoare triple {5076#(= 8464 |ssl3_accept_#t~mem53|)} assume 8481 == #t~mem53;havoc #t~mem53; {5071#false} is VALID [2022-04-28 15:17:06,547 INFO L290 TraceCheckUtils]: 23: Hoare triple {5071#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; {5071#false} is VALID [2022-04-28 15:17:06,547 INFO L290 TraceCheckUtils]: 24: Hoare triple {5071#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); {5071#false} is VALID [2022-04-28 15:17:06,547 INFO L290 TraceCheckUtils]: 25: Hoare triple {5071#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); {5071#false} is VALID [2022-04-28 15:17:06,547 INFO L290 TraceCheckUtils]: 26: Hoare triple {5071#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {5071#false} is VALID [2022-04-28 15:17:06,549 INFO L290 TraceCheckUtils]: 27: Hoare triple {5071#false} ~skip~0 := 0; {5071#false} is VALID [2022-04-28 15:17:06,549 INFO L290 TraceCheckUtils]: 28: Hoare triple {5071#false} assume !false; {5071#false} is VALID [2022-04-28 15:17:06,549 INFO L290 TraceCheckUtils]: 29: Hoare triple {5071#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); {5071#false} is VALID [2022-04-28 15:17:06,549 INFO L290 TraceCheckUtils]: 30: Hoare triple {5071#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-28 15:17:06,550 INFO L290 TraceCheckUtils]: 31: Hoare triple {5071#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-28 15:17:06,550 INFO L290 TraceCheckUtils]: 32: Hoare triple {5071#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-28 15:17:06,550 INFO L290 TraceCheckUtils]: 33: Hoare triple {5071#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-28 15:17:06,550 INFO L290 TraceCheckUtils]: 34: Hoare triple {5071#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-28 15:17:06,550 INFO L290 TraceCheckUtils]: 35: Hoare triple {5071#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-28 15:17:06,550 INFO L290 TraceCheckUtils]: 36: Hoare triple {5071#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-28 15:17:06,550 INFO L290 TraceCheckUtils]: 37: Hoare triple {5071#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-28 15:17:06,550 INFO L290 TraceCheckUtils]: 38: Hoare triple {5071#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-28 15:17:06,551 INFO L290 TraceCheckUtils]: 39: Hoare triple {5071#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-28 15:17:06,552 INFO L290 TraceCheckUtils]: 40: Hoare triple {5071#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-28 15:17:06,552 INFO L290 TraceCheckUtils]: 41: Hoare triple {5071#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-28 15:17:06,552 INFO L290 TraceCheckUtils]: 42: Hoare triple {5071#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-28 15:17:06,552 INFO L290 TraceCheckUtils]: 43: Hoare triple {5071#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-28 15:17:06,552 INFO L290 TraceCheckUtils]: 44: Hoare triple {5071#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-28 15:17:06,552 INFO L290 TraceCheckUtils]: 45: Hoare triple {5071#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-28 15:17:06,553 INFO L290 TraceCheckUtils]: 46: Hoare triple {5071#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-28 15:17:06,553 INFO L290 TraceCheckUtils]: 47: Hoare triple {5071#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-28 15:17:06,553 INFO L290 TraceCheckUtils]: 48: Hoare triple {5071#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-28 15:17:06,553 INFO L290 TraceCheckUtils]: 49: Hoare triple {5071#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-28 15:17:06,553 INFO L290 TraceCheckUtils]: 50: Hoare triple {5071#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-28 15:17:06,553 INFO L290 TraceCheckUtils]: 51: Hoare triple {5071#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-28 15:17:06,553 INFO L290 TraceCheckUtils]: 52: Hoare triple {5071#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-28 15:17:06,553 INFO L290 TraceCheckUtils]: 53: Hoare triple {5071#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-28 15:17:06,553 INFO L290 TraceCheckUtils]: 54: Hoare triple {5071#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-28 15:17:06,554 INFO L290 TraceCheckUtils]: 55: Hoare triple {5071#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-28 15:17:06,554 INFO L290 TraceCheckUtils]: 56: Hoare triple {5071#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-28 15:17:06,554 INFO L290 TraceCheckUtils]: 57: Hoare triple {5071#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-28 15:17:06,554 INFO L290 TraceCheckUtils]: 58: Hoare triple {5071#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-28 15:17:06,554 INFO L290 TraceCheckUtils]: 59: Hoare triple {5071#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-28 15:17:06,554 INFO L290 TraceCheckUtils]: 60: Hoare triple {5071#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-28 15:17:06,554 INFO L290 TraceCheckUtils]: 61: Hoare triple {5071#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-28 15:17:06,554 INFO L290 TraceCheckUtils]: 62: Hoare triple {5071#false} assume 8672 == #t~mem79;havoc #t~mem79; {5071#false} is VALID [2022-04-28 15:17:06,555 INFO L290 TraceCheckUtils]: 63: Hoare triple {5071#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {5071#false} is VALID [2022-04-28 15:17:06,555 INFO L290 TraceCheckUtils]: 64: Hoare triple {5071#false} assume 3 == ~blastFlag~0; {5071#false} is VALID [2022-04-28 15:17:06,555 INFO L290 TraceCheckUtils]: 65: Hoare triple {5071#false} assume !false; {5071#false} is VALID [2022-04-28 15:17:06,557 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:17:06,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:17:06,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243287587] [2022-04-28 15:17:06,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243287587] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:06,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:06,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:06,558 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:17:06,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [751443507] [2022-04-28 15:17:06,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [751443507] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:06,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:06,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:06,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467667292] [2022-04-28 15:17:06,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:17:06,559 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-28 15:17:06,559 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:17:06,559 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:06,622 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:06,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:17:06,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:06,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:17:06,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:17:06,623 INFO L87 Difference]: Start difference. First operand 148 states and 221 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:08,652 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:17:09,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:09,735 INFO L93 Difference]: Finished difference Result 284 states and 425 transitions. [2022-04-28 15:17:09,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:17:09,735 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-28 15:17:09,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:17:09,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:09,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 425 transitions. [2022-04-28 15:17:09,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:09,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 425 transitions. [2022-04-28 15:17:09,741 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 425 transitions. [2022-04-28 15:17:10,034 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 425 edges. 425 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:10,036 INFO L225 Difference]: With dead ends: 284 [2022-04-28 15:17:10,037 INFO L226 Difference]: Without dead ends: 162 [2022-04-28 15:17:10,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:17:10,038 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 20 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:17:10,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 459 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 344 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 15:17:10,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-04-28 15:17:10,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 148. [2022-04-28 15:17:10,045 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:17:10,045 INFO L82 GeneralOperation]: Start isEquivalent. First operand 162 states. Second operand has 148 states, 143 states have (on average 1.5104895104895104) internal successors, (216), 143 states have internal predecessors, (216), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:10,046 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand has 148 states, 143 states have (on average 1.5104895104895104) internal successors, (216), 143 states have internal predecessors, (216), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:10,046 INFO L87 Difference]: Start difference. First operand 162 states. Second operand has 148 states, 143 states have (on average 1.5104895104895104) internal successors, (216), 143 states have internal predecessors, (216), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:10,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:10,049 INFO L93 Difference]: Finished difference Result 162 states and 238 transitions. [2022-04-28 15:17:10,049 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 238 transitions. [2022-04-28 15:17:10,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:10,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:10,051 INFO L74 IsIncluded]: Start isIncluded. First operand has 148 states, 143 states have (on average 1.5104895104895104) internal successors, (216), 143 states have internal predecessors, (216), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 162 states. [2022-04-28 15:17:10,051 INFO L87 Difference]: Start difference. First operand has 148 states, 143 states have (on average 1.5104895104895104) internal successors, (216), 143 states have internal predecessors, (216), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 162 states. [2022-04-28 15:17:10,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:10,054 INFO L93 Difference]: Finished difference Result 162 states and 238 transitions. [2022-04-28 15:17:10,054 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 238 transitions. [2022-04-28 15:17:10,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:10,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:10,055 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:17:10,055 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:17:10,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 143 states have (on average 1.5104895104895104) internal successors, (216), 143 states have internal predecessors, (216), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:10,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 220 transitions. [2022-04-28 15:17:10,059 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 220 transitions. Word has length 66 [2022-04-28 15:17:10,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:17:10,059 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 220 transitions. [2022-04-28 15:17:10,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:10,059 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 148 states and 220 transitions. [2022-04-28 15:17:10,242 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 220 edges. 220 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:10,242 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 220 transitions. [2022-04-28 15:17:10,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-28 15:17:10,243 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:17:10,243 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:17:10,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 15:17:10,244 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:17:10,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:17:10,244 INFO L85 PathProgramCache]: Analyzing trace with hash 146163146, now seen corresponding path program 1 times [2022-04-28 15:17:10,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:10,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [196919500] [2022-04-28 15:17:10,262 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:17:10,262 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:17:10,262 INFO L85 PathProgramCache]: Analyzing trace with hash 146163146, now seen corresponding path program 2 times [2022-04-28 15:17:10,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:17:10,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232664307] [2022-04-28 15:17:10,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:17:10,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:17:10,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:10,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:17:10,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:10,434 INFO L290 TraceCheckUtils]: 0: Hoare triple {6277#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {6270#true} is VALID [2022-04-28 15:17:10,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {6270#true} assume true; {6270#true} is VALID [2022-04-28 15:17:10,434 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6270#true} {6270#true} #662#return; {6270#true} is VALID [2022-04-28 15:17:10,435 INFO L272 TraceCheckUtils]: 0: Hoare triple {6270#true} call ULTIMATE.init(); {6277#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:17:10,435 INFO L290 TraceCheckUtils]: 1: Hoare triple {6277#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {6270#true} is VALID [2022-04-28 15:17:10,436 INFO L290 TraceCheckUtils]: 2: Hoare triple {6270#true} assume true; {6270#true} is VALID [2022-04-28 15:17:10,436 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6270#true} {6270#true} #662#return; {6270#true} is VALID [2022-04-28 15:17:10,438 INFO L272 TraceCheckUtils]: 4: Hoare triple {6270#true} call #t~ret161 := main(); {6270#true} is VALID [2022-04-28 15:17:10,439 INFO L290 TraceCheckUtils]: 5: Hoare triple {6270#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~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);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; {6270#true} is VALID [2022-04-28 15:17:10,439 INFO L290 TraceCheckUtils]: 6: Hoare triple {6270#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {6270#true} is VALID [2022-04-28 15:17:10,439 INFO L272 TraceCheckUtils]: 7: Hoare triple {6270#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {6270#true} is VALID [2022-04-28 15:17:10,441 INFO L290 TraceCheckUtils]: 8: Hoare triple {6270#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;~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); {6275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:10,442 INFO L290 TraceCheckUtils]: 9: Hoare triple {6275#(= 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; {6275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:10,442 INFO L290 TraceCheckUtils]: 10: Hoare triple {6275#(= 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; {6275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:10,443 INFO L290 TraceCheckUtils]: 11: Hoare triple {6275#(= 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)))); {6275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:10,443 INFO L290 TraceCheckUtils]: 12: Hoare triple {6275#(= 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); {6275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:10,444 INFO L290 TraceCheckUtils]: 13: Hoare triple {6275#(= 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; {6275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:10,444 INFO L290 TraceCheckUtils]: 14: Hoare triple {6275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {6275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:10,445 INFO L290 TraceCheckUtils]: 15: Hoare triple {6275#(= 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); {6275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:10,445 INFO L290 TraceCheckUtils]: 16: Hoare triple {6275#(= 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); {6275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:10,445 INFO L290 TraceCheckUtils]: 17: Hoare triple {6275#(= 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); {6275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:10,446 INFO L290 TraceCheckUtils]: 18: Hoare triple {6275#(= 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); {6275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:10,446 INFO L290 TraceCheckUtils]: 19: Hoare triple {6275#(= 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); {6275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:10,447 INFO L290 TraceCheckUtils]: 20: Hoare triple {6275#(= 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); {6275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:10,447 INFO L290 TraceCheckUtils]: 21: Hoare triple {6275#(= 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); {6275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:10,447 INFO L290 TraceCheckUtils]: 22: Hoare triple {6275#(= 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); {6276#(= 8464 |ssl3_accept_#t~mem54|)} is VALID [2022-04-28 15:17:10,448 INFO L290 TraceCheckUtils]: 23: Hoare triple {6276#(= 8464 |ssl3_accept_#t~mem54|)} assume 8482 == #t~mem54;havoc #t~mem54; {6271#false} is VALID [2022-04-28 15:17:10,448 INFO L290 TraceCheckUtils]: 24: Hoare triple {6271#false} call write~int(3, ~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-28 15:17:10,448 INFO L290 TraceCheckUtils]: 25: Hoare triple {6271#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); {6271#false} is VALID [2022-04-28 15:17:10,448 INFO L290 TraceCheckUtils]: 26: Hoare triple {6271#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {6271#false} is VALID [2022-04-28 15:17:10,448 INFO L290 TraceCheckUtils]: 27: Hoare triple {6271#false} ~skip~0 := 0; {6271#false} is VALID [2022-04-28 15:17:10,448 INFO L290 TraceCheckUtils]: 28: Hoare triple {6271#false} assume !false; {6271#false} is VALID [2022-04-28 15:17:10,448 INFO L290 TraceCheckUtils]: 29: Hoare triple {6271#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); {6271#false} is VALID [2022-04-28 15:17:10,448 INFO L290 TraceCheckUtils]: 30: Hoare triple {6271#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-28 15:17:10,448 INFO L290 TraceCheckUtils]: 31: Hoare triple {6271#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-28 15:17:10,448 INFO L290 TraceCheckUtils]: 32: Hoare triple {6271#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-28 15:17:10,449 INFO L290 TraceCheckUtils]: 33: Hoare triple {6271#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-28 15:17:10,449 INFO L290 TraceCheckUtils]: 34: Hoare triple {6271#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-28 15:17:10,449 INFO L290 TraceCheckUtils]: 35: Hoare triple {6271#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-28 15:17:10,449 INFO L290 TraceCheckUtils]: 36: Hoare triple {6271#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-28 15:17:10,449 INFO L290 TraceCheckUtils]: 37: Hoare triple {6271#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-28 15:17:10,449 INFO L290 TraceCheckUtils]: 38: Hoare triple {6271#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-28 15:17:10,449 INFO L290 TraceCheckUtils]: 39: Hoare triple {6271#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-28 15:17:10,450 INFO L290 TraceCheckUtils]: 40: Hoare triple {6271#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-28 15:17:10,450 INFO L290 TraceCheckUtils]: 41: Hoare triple {6271#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-28 15:17:10,450 INFO L290 TraceCheckUtils]: 42: Hoare triple {6271#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-28 15:17:10,450 INFO L290 TraceCheckUtils]: 43: Hoare triple {6271#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-28 15:17:10,450 INFO L290 TraceCheckUtils]: 44: Hoare triple {6271#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-28 15:17:10,450 INFO L290 TraceCheckUtils]: 45: Hoare triple {6271#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-28 15:17:10,450 INFO L290 TraceCheckUtils]: 46: Hoare triple {6271#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-28 15:17:10,450 INFO L290 TraceCheckUtils]: 47: Hoare triple {6271#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-28 15:17:10,450 INFO L290 TraceCheckUtils]: 48: Hoare triple {6271#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-28 15:17:10,451 INFO L290 TraceCheckUtils]: 49: Hoare triple {6271#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-28 15:17:10,451 INFO L290 TraceCheckUtils]: 50: Hoare triple {6271#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-28 15:17:10,451 INFO L290 TraceCheckUtils]: 51: Hoare triple {6271#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-28 15:17:10,451 INFO L290 TraceCheckUtils]: 52: Hoare triple {6271#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-28 15:17:10,451 INFO L290 TraceCheckUtils]: 53: Hoare triple {6271#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-28 15:17:10,451 INFO L290 TraceCheckUtils]: 54: Hoare triple {6271#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-28 15:17:10,451 INFO L290 TraceCheckUtils]: 55: Hoare triple {6271#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-28 15:17:10,451 INFO L290 TraceCheckUtils]: 56: Hoare triple {6271#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-28 15:17:10,452 INFO L290 TraceCheckUtils]: 57: Hoare triple {6271#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-28 15:17:10,452 INFO L290 TraceCheckUtils]: 58: Hoare triple {6271#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-28 15:17:10,452 INFO L290 TraceCheckUtils]: 59: Hoare triple {6271#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-28 15:17:10,452 INFO L290 TraceCheckUtils]: 60: Hoare triple {6271#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-28 15:17:10,452 INFO L290 TraceCheckUtils]: 61: Hoare triple {6271#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-28 15:17:10,452 INFO L290 TraceCheckUtils]: 62: Hoare triple {6271#false} assume 8672 == #t~mem79;havoc #t~mem79; {6271#false} is VALID [2022-04-28 15:17:10,452 INFO L290 TraceCheckUtils]: 63: Hoare triple {6271#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {6271#false} is VALID [2022-04-28 15:17:10,452 INFO L290 TraceCheckUtils]: 64: Hoare triple {6271#false} assume 3 == ~blastFlag~0; {6271#false} is VALID [2022-04-28 15:17:10,452 INFO L290 TraceCheckUtils]: 65: Hoare triple {6271#false} assume !false; {6271#false} is VALID [2022-04-28 15:17:10,453 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:17:10,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:17:10,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232664307] [2022-04-28 15:17:10,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232664307] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:10,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:10,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:10,454 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:17:10,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [196919500] [2022-04-28 15:17:10,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [196919500] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:10,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:10,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:10,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928359113] [2022-04-28 15:17:10,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:17:10,455 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-28 15:17:10,455 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:17:10,455 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:10,510 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:10,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:17:10,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:10,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:17:10,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:17:10,511 INFO L87 Difference]: Start difference. First operand 148 states and 220 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:12,533 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:17:13,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:13,561 INFO L93 Difference]: Finished difference Result 283 states and 423 transitions. [2022-04-28 15:17:13,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:17:13,562 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-28 15:17:13,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:17:13,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:13,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 423 transitions. [2022-04-28 15:17:13,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:13,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 423 transitions. [2022-04-28 15:17:13,568 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 423 transitions. [2022-04-28 15:17:13,862 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 423 edges. 423 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:13,865 INFO L225 Difference]: With dead ends: 283 [2022-04-28 15:17:13,865 INFO L226 Difference]: Without dead ends: 161 [2022-04-28 15:17:13,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:17:13,868 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 18 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:17:13,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 461 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 342 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 15:17:13,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-04-28 15:17:13,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 148. [2022-04-28 15:17:13,881 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:17:13,882 INFO L82 GeneralOperation]: Start isEquivalent. First operand 161 states. Second operand has 148 states, 143 states have (on average 1.5034965034965035) internal successors, (215), 143 states have internal predecessors, (215), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:13,882 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand has 148 states, 143 states have (on average 1.5034965034965035) internal successors, (215), 143 states have internal predecessors, (215), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:13,883 INFO L87 Difference]: Start difference. First operand 161 states. Second operand has 148 states, 143 states have (on average 1.5034965034965035) internal successors, (215), 143 states have internal predecessors, (215), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:13,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:13,886 INFO L93 Difference]: Finished difference Result 161 states and 236 transitions. [2022-04-28 15:17:13,886 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 236 transitions. [2022-04-28 15:17:13,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:13,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:13,887 INFO L74 IsIncluded]: Start isIncluded. First operand has 148 states, 143 states have (on average 1.5034965034965035) internal successors, (215), 143 states have internal predecessors, (215), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 161 states. [2022-04-28 15:17:13,887 INFO L87 Difference]: Start difference. First operand has 148 states, 143 states have (on average 1.5034965034965035) internal successors, (215), 143 states have internal predecessors, (215), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 161 states. [2022-04-28 15:17:13,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:13,891 INFO L93 Difference]: Finished difference Result 161 states and 236 transitions. [2022-04-28 15:17:13,891 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 236 transitions. [2022-04-28 15:17:13,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:13,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:13,891 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:17:13,891 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:17:13,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 143 states have (on average 1.5034965034965035) internal successors, (215), 143 states have internal predecessors, (215), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:13,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 219 transitions. [2022-04-28 15:17:13,895 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 219 transitions. Word has length 66 [2022-04-28 15:17:13,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:17:13,895 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 219 transitions. [2022-04-28 15:17:13,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:13,895 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 148 states and 219 transitions. [2022-04-28 15:17:14,062 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 219 edges. 219 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:14,063 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 219 transitions. [2022-04-28 15:17:14,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-28 15:17:14,063 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:17:14,063 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:17:14,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 15:17:14,064 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:17:14,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:17:14,064 INFO L85 PathProgramCache]: Analyzing trace with hash -674199881, now seen corresponding path program 1 times [2022-04-28 15:17:14,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:14,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [413243478] [2022-04-28 15:17:14,081 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 15:17:14,081 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:17:14,081 INFO L85 PathProgramCache]: Analyzing trace with hash -674199881, now seen corresponding path program 2 times [2022-04-28 15:17:14,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:17:14,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321076139] [2022-04-28 15:17:14,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:17:14,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:17:14,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:14,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:17:14,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:14,252 INFO L290 TraceCheckUtils]: 0: Hoare triple {7473#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {7466#true} is VALID [2022-04-28 15:17:14,253 INFO L290 TraceCheckUtils]: 1: Hoare triple {7466#true} assume true; {7466#true} is VALID [2022-04-28 15:17:14,253 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7466#true} {7466#true} #662#return; {7466#true} is VALID [2022-04-28 15:17:14,254 INFO L272 TraceCheckUtils]: 0: Hoare triple {7466#true} call ULTIMATE.init(); {7473#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:17:14,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {7473#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {7466#true} is VALID [2022-04-28 15:17:14,254 INFO L290 TraceCheckUtils]: 2: Hoare triple {7466#true} assume true; {7466#true} is VALID [2022-04-28 15:17:14,254 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7466#true} {7466#true} #662#return; {7466#true} is VALID [2022-04-28 15:17:14,254 INFO L272 TraceCheckUtils]: 4: Hoare triple {7466#true} call #t~ret161 := main(); {7466#true} is VALID [2022-04-28 15:17:14,254 INFO L290 TraceCheckUtils]: 5: Hoare triple {7466#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~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);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; {7466#true} is VALID [2022-04-28 15:17:14,255 INFO L290 TraceCheckUtils]: 6: Hoare triple {7466#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {7466#true} is VALID [2022-04-28 15:17:14,255 INFO L272 TraceCheckUtils]: 7: Hoare triple {7466#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {7466#true} is VALID [2022-04-28 15:17:14,257 INFO L290 TraceCheckUtils]: 8: Hoare triple {7466#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;~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); {7471#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:14,257 INFO L290 TraceCheckUtils]: 9: Hoare triple {7471#(= 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; {7471#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:14,258 INFO L290 TraceCheckUtils]: 10: Hoare triple {7471#(= 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; {7471#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:14,259 INFO L290 TraceCheckUtils]: 11: Hoare triple {7471#(= 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)))); {7471#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:14,259 INFO L290 TraceCheckUtils]: 12: Hoare triple {7471#(= 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); {7471#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:14,260 INFO L290 TraceCheckUtils]: 13: Hoare triple {7471#(= 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; {7471#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:14,261 INFO L290 TraceCheckUtils]: 14: Hoare triple {7471#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {7471#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:14,261 INFO L290 TraceCheckUtils]: 15: Hoare triple {7471#(= 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); {7471#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:14,262 INFO L290 TraceCheckUtils]: 16: Hoare triple {7471#(= 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); {7471#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:14,262 INFO L290 TraceCheckUtils]: 17: Hoare triple {7471#(= 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); {7472#(= 8464 |ssl3_accept_#t~mem49|)} is VALID [2022-04-28 15:17:14,263 INFO L290 TraceCheckUtils]: 18: Hoare triple {7472#(= 8464 |ssl3_accept_#t~mem49|)} assume 8192 == #t~mem49;havoc #t~mem49; {7467#false} is VALID [2022-04-28 15:17:14,263 INFO L290 TraceCheckUtils]: 19: Hoare triple {7467#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {7467#false} is VALID [2022-04-28 15:17:14,263 INFO L290 TraceCheckUtils]: 20: Hoare triple {7467#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {7467#false} is VALID [2022-04-28 15:17:14,263 INFO L290 TraceCheckUtils]: 21: Hoare triple {7467#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {7467#false} is VALID [2022-04-28 15:17:14,263 INFO L290 TraceCheckUtils]: 22: Hoare triple {7467#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); {7467#false} is VALID [2022-04-28 15:17:14,263 INFO L290 TraceCheckUtils]: 23: Hoare triple {7467#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {7467#false} is VALID [2022-04-28 15:17:14,263 INFO L290 TraceCheckUtils]: 24: Hoare triple {7467#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); {7467#false} is VALID [2022-04-28 15:17:14,263 INFO L290 TraceCheckUtils]: 25: Hoare triple {7467#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); {7467#false} is VALID [2022-04-28 15:17:14,263 INFO L290 TraceCheckUtils]: 26: Hoare triple {7467#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); {7467#false} is VALID [2022-04-28 15:17:14,264 INFO L290 TraceCheckUtils]: 27: Hoare triple {7467#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {7467#false} is VALID [2022-04-28 15:17:14,264 INFO L290 TraceCheckUtils]: 28: Hoare triple {7467#false} ~skip~0 := 0; {7467#false} is VALID [2022-04-28 15:17:14,264 INFO L290 TraceCheckUtils]: 29: Hoare triple {7467#false} assume !false; {7467#false} is VALID [2022-04-28 15:17:14,264 INFO L290 TraceCheckUtils]: 30: Hoare triple {7467#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); {7467#false} is VALID [2022-04-28 15:17:14,264 INFO L290 TraceCheckUtils]: 31: Hoare triple {7467#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-28 15:17:14,264 INFO L290 TraceCheckUtils]: 32: Hoare triple {7467#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-28 15:17:14,264 INFO L290 TraceCheckUtils]: 33: Hoare triple {7467#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-28 15:17:14,264 INFO L290 TraceCheckUtils]: 34: Hoare triple {7467#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-28 15:17:14,264 INFO L290 TraceCheckUtils]: 35: Hoare triple {7467#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-28 15:17:14,264 INFO L290 TraceCheckUtils]: 36: Hoare triple {7467#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-28 15:17:14,265 INFO L290 TraceCheckUtils]: 37: Hoare triple {7467#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-28 15:17:14,265 INFO L290 TraceCheckUtils]: 38: Hoare triple {7467#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-28 15:17:14,265 INFO L290 TraceCheckUtils]: 39: Hoare triple {7467#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-28 15:17:14,265 INFO L290 TraceCheckUtils]: 40: Hoare triple {7467#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-28 15:17:14,265 INFO L290 TraceCheckUtils]: 41: Hoare triple {7467#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-28 15:17:14,265 INFO L290 TraceCheckUtils]: 42: Hoare triple {7467#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-28 15:17:14,265 INFO L290 TraceCheckUtils]: 43: Hoare triple {7467#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-28 15:17:14,265 INFO L290 TraceCheckUtils]: 44: Hoare triple {7467#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-28 15:17:14,265 INFO L290 TraceCheckUtils]: 45: Hoare triple {7467#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-28 15:17:14,265 INFO L290 TraceCheckUtils]: 46: Hoare triple {7467#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-28 15:17:14,266 INFO L290 TraceCheckUtils]: 47: Hoare triple {7467#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-28 15:17:14,266 INFO L290 TraceCheckUtils]: 48: Hoare triple {7467#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-28 15:17:14,266 INFO L290 TraceCheckUtils]: 49: Hoare triple {7467#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-28 15:17:14,266 INFO L290 TraceCheckUtils]: 50: Hoare triple {7467#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-28 15:17:14,266 INFO L290 TraceCheckUtils]: 51: Hoare triple {7467#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-28 15:17:14,266 INFO L290 TraceCheckUtils]: 52: Hoare triple {7467#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-28 15:17:14,266 INFO L290 TraceCheckUtils]: 53: Hoare triple {7467#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-28 15:17:14,266 INFO L290 TraceCheckUtils]: 54: Hoare triple {7467#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-28 15:17:14,266 INFO L290 TraceCheckUtils]: 55: Hoare triple {7467#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-28 15:17:14,266 INFO L290 TraceCheckUtils]: 56: Hoare triple {7467#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-28 15:17:14,266 INFO L290 TraceCheckUtils]: 57: Hoare triple {7467#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-28 15:17:14,267 INFO L290 TraceCheckUtils]: 58: Hoare triple {7467#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-28 15:17:14,267 INFO L290 TraceCheckUtils]: 59: Hoare triple {7467#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-28 15:17:14,267 INFO L290 TraceCheckUtils]: 60: Hoare triple {7467#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-28 15:17:14,267 INFO L290 TraceCheckUtils]: 61: Hoare triple {7467#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-28 15:17:14,267 INFO L290 TraceCheckUtils]: 62: Hoare triple {7467#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-28 15:17:14,267 INFO L290 TraceCheckUtils]: 63: Hoare triple {7467#false} assume 8672 == #t~mem79;havoc #t~mem79; {7467#false} is VALID [2022-04-28 15:17:14,267 INFO L290 TraceCheckUtils]: 64: Hoare triple {7467#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {7467#false} is VALID [2022-04-28 15:17:14,267 INFO L290 TraceCheckUtils]: 65: Hoare triple {7467#false} assume 3 == ~blastFlag~0; {7467#false} is VALID [2022-04-28 15:17:14,267 INFO L290 TraceCheckUtils]: 66: Hoare triple {7467#false} assume !false; {7467#false} is VALID [2022-04-28 15:17:14,268 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:17:14,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:17:14,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321076139] [2022-04-28 15:17:14,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321076139] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:14,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:14,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:14,270 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:17:14,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [413243478] [2022-04-28 15:17:14,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [413243478] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:14,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:14,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:14,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266693509] [2022-04-28 15:17:14,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:17:14,271 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-28 15:17:14,271 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:17:14,271 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-28 15:17:14,331 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-28 15:17:14,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:17:14,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:14,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:17:14,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:17:14,332 INFO L87 Difference]: Start difference. First operand 148 states and 219 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-28 15:17:16,357 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:17:17,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:17,308 INFO L93 Difference]: Finished difference Result 283 states and 422 transitions. [2022-04-28 15:17:17,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:17:17,308 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-28 15:17:17,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:17:17,309 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-28 15:17:17,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 422 transitions. [2022-04-28 15:17:17,312 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-28 15:17:17,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 422 transitions. [2022-04-28 15:17:17,314 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 422 transitions. [2022-04-28 15:17:17,658 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 422 edges. 422 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:17,661 INFO L225 Difference]: With dead ends: 283 [2022-04-28 15:17:17,661 INFO L226 Difference]: Without dead ends: 161 [2022-04-28 15:17:17,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:17:17,662 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 22 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:17:17,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 461 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 342 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 15:17:17,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-04-28 15:17:17,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 148. [2022-04-28 15:17:17,668 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:17:17,668 INFO L82 GeneralOperation]: Start isEquivalent. First operand 161 states. Second operand has 148 states, 143 states have (on average 1.4965034965034965) internal successors, (214), 143 states have internal predecessors, (214), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:17,669 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand has 148 states, 143 states have (on average 1.4965034965034965) internal successors, (214), 143 states have internal predecessors, (214), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:17,669 INFO L87 Difference]: Start difference. First operand 161 states. Second operand has 148 states, 143 states have (on average 1.4965034965034965) internal successors, (214), 143 states have internal predecessors, (214), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:17,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:17,672 INFO L93 Difference]: Finished difference Result 161 states and 235 transitions. [2022-04-28 15:17:17,672 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 235 transitions. [2022-04-28 15:17:17,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:17,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:17,673 INFO L74 IsIncluded]: Start isIncluded. First operand has 148 states, 143 states have (on average 1.4965034965034965) internal successors, (214), 143 states have internal predecessors, (214), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 161 states. [2022-04-28 15:17:17,673 INFO L87 Difference]: Start difference. First operand has 148 states, 143 states have (on average 1.4965034965034965) internal successors, (214), 143 states have internal predecessors, (214), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 161 states. [2022-04-28 15:17:17,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:17,676 INFO L93 Difference]: Finished difference Result 161 states and 235 transitions. [2022-04-28 15:17:17,676 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 235 transitions. [2022-04-28 15:17:17,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:17,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:17,677 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:17:17,677 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:17:17,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 143 states have (on average 1.4965034965034965) internal successors, (214), 143 states have internal predecessors, (214), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:17,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 218 transitions. [2022-04-28 15:17:17,680 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 218 transitions. Word has length 67 [2022-04-28 15:17:17,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:17:17,680 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 218 transitions. [2022-04-28 15:17:17,681 INFO L496 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-28 15:17:17,681 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 148 states and 218 transitions. [2022-04-28 15:17:17,862 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 218 edges. 218 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:17,862 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 218 transitions. [2022-04-28 15:17:17,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-28 15:17:17,863 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:17:17,863 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:17:17,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-28 15:17:17,863 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:17:17,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:17:17,864 INFO L85 PathProgramCache]: Analyzing trace with hash -2142445385, now seen corresponding path program 1 times [2022-04-28 15:17:17,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:17,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2028319921] [2022-04-28 15:17:17,897 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 15:17:17,898 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:17:17,898 INFO L85 PathProgramCache]: Analyzing trace with hash -2142445385, now seen corresponding path program 2 times [2022-04-28 15:17:17,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:17:17,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150664784] [2022-04-28 15:17:17,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:17:17,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:17:17,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:18,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:17:18,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:18,041 INFO L290 TraceCheckUtils]: 0: Hoare triple {8669#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {8662#true} is VALID [2022-04-28 15:17:18,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {8662#true} assume true; {8662#true} is VALID [2022-04-28 15:17:18,041 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8662#true} {8662#true} #662#return; {8662#true} is VALID [2022-04-28 15:17:18,042 INFO L272 TraceCheckUtils]: 0: Hoare triple {8662#true} call ULTIMATE.init(); {8669#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:17:18,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {8669#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {8662#true} is VALID [2022-04-28 15:17:18,042 INFO L290 TraceCheckUtils]: 2: Hoare triple {8662#true} assume true; {8662#true} is VALID [2022-04-28 15:17:18,042 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8662#true} {8662#true} #662#return; {8662#true} is VALID [2022-04-28 15:17:18,042 INFO L272 TraceCheckUtils]: 4: Hoare triple {8662#true} call #t~ret161 := main(); {8662#true} is VALID [2022-04-28 15:17:18,043 INFO L290 TraceCheckUtils]: 5: Hoare triple {8662#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~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);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; {8662#true} is VALID [2022-04-28 15:17:18,043 INFO L290 TraceCheckUtils]: 6: Hoare triple {8662#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {8662#true} is VALID [2022-04-28 15:17:18,043 INFO L272 TraceCheckUtils]: 7: Hoare triple {8662#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {8662#true} is VALID [2022-04-28 15:17:18,045 INFO L290 TraceCheckUtils]: 8: Hoare triple {8662#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;~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); {8667#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:18,046 INFO L290 TraceCheckUtils]: 9: Hoare triple {8667#(= 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; {8667#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:18,047 INFO L290 TraceCheckUtils]: 10: Hoare triple {8667#(= 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; {8667#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:18,047 INFO L290 TraceCheckUtils]: 11: Hoare triple {8667#(= 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)))); {8667#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:18,048 INFO L290 TraceCheckUtils]: 12: Hoare triple {8667#(= 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); {8667#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:18,048 INFO L290 TraceCheckUtils]: 13: Hoare triple {8667#(= 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; {8667#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:18,048 INFO L290 TraceCheckUtils]: 14: Hoare triple {8667#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {8667#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:18,049 INFO L290 TraceCheckUtils]: 15: Hoare triple {8667#(= 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); {8667#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:18,049 INFO L290 TraceCheckUtils]: 16: Hoare triple {8667#(= 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); {8667#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:18,050 INFO L290 TraceCheckUtils]: 17: Hoare triple {8667#(= 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); {8667#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:18,050 INFO L290 TraceCheckUtils]: 18: Hoare triple {8667#(= 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); {8668#(= 8464 |ssl3_accept_#t~mem50|)} is VALID [2022-04-28 15:17:18,051 INFO L290 TraceCheckUtils]: 19: Hoare triple {8668#(= 8464 |ssl3_accept_#t~mem50|)} assume 24576 == #t~mem50;havoc #t~mem50; {8663#false} is VALID [2022-04-28 15:17:18,051 INFO L290 TraceCheckUtils]: 20: Hoare triple {8663#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {8663#false} is VALID [2022-04-28 15:17:18,051 INFO L290 TraceCheckUtils]: 21: Hoare triple {8663#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {8663#false} is VALID [2022-04-28 15:17:18,051 INFO L290 TraceCheckUtils]: 22: Hoare triple {8663#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {8663#false} is VALID [2022-04-28 15:17:18,051 INFO L290 TraceCheckUtils]: 23: Hoare triple {8663#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); {8663#false} is VALID [2022-04-28 15:17:18,051 INFO L290 TraceCheckUtils]: 24: Hoare triple {8663#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {8663#false} is VALID [2022-04-28 15:17:18,051 INFO L290 TraceCheckUtils]: 25: Hoare triple {8663#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); {8663#false} is VALID [2022-04-28 15:17:18,051 INFO L290 TraceCheckUtils]: 26: Hoare triple {8663#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); {8663#false} is VALID [2022-04-28 15:17:18,051 INFO L290 TraceCheckUtils]: 27: Hoare triple {8663#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); {8663#false} is VALID [2022-04-28 15:17:18,052 INFO L290 TraceCheckUtils]: 28: Hoare triple {8663#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {8663#false} is VALID [2022-04-28 15:17:18,052 INFO L290 TraceCheckUtils]: 29: Hoare triple {8663#false} ~skip~0 := 0; {8663#false} is VALID [2022-04-28 15:17:18,052 INFO L290 TraceCheckUtils]: 30: Hoare triple {8663#false} assume !false; {8663#false} is VALID [2022-04-28 15:17:18,052 INFO L290 TraceCheckUtils]: 31: Hoare triple {8663#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); {8663#false} is VALID [2022-04-28 15:17:18,052 INFO L290 TraceCheckUtils]: 32: Hoare triple {8663#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-28 15:17:18,052 INFO L290 TraceCheckUtils]: 33: Hoare triple {8663#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-28 15:17:18,052 INFO L290 TraceCheckUtils]: 34: Hoare triple {8663#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-28 15:17:18,052 INFO L290 TraceCheckUtils]: 35: Hoare triple {8663#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-28 15:17:18,052 INFO L290 TraceCheckUtils]: 36: Hoare triple {8663#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-28 15:17:18,052 INFO L290 TraceCheckUtils]: 37: Hoare triple {8663#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-28 15:17:18,052 INFO L290 TraceCheckUtils]: 38: Hoare triple {8663#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-28 15:17:18,053 INFO L290 TraceCheckUtils]: 39: Hoare triple {8663#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-28 15:17:18,053 INFO L290 TraceCheckUtils]: 40: Hoare triple {8663#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-28 15:17:18,054 INFO L290 TraceCheckUtils]: 41: Hoare triple {8663#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-28 15:17:18,054 INFO L290 TraceCheckUtils]: 42: Hoare triple {8663#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-28 15:17:18,054 INFO L290 TraceCheckUtils]: 43: Hoare triple {8663#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-28 15:17:18,054 INFO L290 TraceCheckUtils]: 44: Hoare triple {8663#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-28 15:17:18,054 INFO L290 TraceCheckUtils]: 45: Hoare triple {8663#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-28 15:17:18,054 INFO L290 TraceCheckUtils]: 46: Hoare triple {8663#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-28 15:17:18,054 INFO L290 TraceCheckUtils]: 47: Hoare triple {8663#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-28 15:17:18,054 INFO L290 TraceCheckUtils]: 48: Hoare triple {8663#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-28 15:17:18,054 INFO L290 TraceCheckUtils]: 49: Hoare triple {8663#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-28 15:17:18,054 INFO L290 TraceCheckUtils]: 50: Hoare triple {8663#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-28 15:17:18,054 INFO L290 TraceCheckUtils]: 51: Hoare triple {8663#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-28 15:17:18,055 INFO L290 TraceCheckUtils]: 52: Hoare triple {8663#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-28 15:17:18,055 INFO L290 TraceCheckUtils]: 53: Hoare triple {8663#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-28 15:17:18,055 INFO L290 TraceCheckUtils]: 54: Hoare triple {8663#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-28 15:17:18,055 INFO L290 TraceCheckUtils]: 55: Hoare triple {8663#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-28 15:17:18,055 INFO L290 TraceCheckUtils]: 56: Hoare triple {8663#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-28 15:17:18,055 INFO L290 TraceCheckUtils]: 57: Hoare triple {8663#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-28 15:17:18,055 INFO L290 TraceCheckUtils]: 58: Hoare triple {8663#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-28 15:17:18,055 INFO L290 TraceCheckUtils]: 59: Hoare triple {8663#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-28 15:17:18,055 INFO L290 TraceCheckUtils]: 60: Hoare triple {8663#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-28 15:17:18,055 INFO L290 TraceCheckUtils]: 61: Hoare triple {8663#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-28 15:17:18,056 INFO L290 TraceCheckUtils]: 62: Hoare triple {8663#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-28 15:17:18,056 INFO L290 TraceCheckUtils]: 63: Hoare triple {8663#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-28 15:17:18,056 INFO L290 TraceCheckUtils]: 64: Hoare triple {8663#false} assume 8672 == #t~mem79;havoc #t~mem79; {8663#false} is VALID [2022-04-28 15:17:18,056 INFO L290 TraceCheckUtils]: 65: Hoare triple {8663#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {8663#false} is VALID [2022-04-28 15:17:18,056 INFO L290 TraceCheckUtils]: 66: Hoare triple {8663#false} assume 3 == ~blastFlag~0; {8663#false} is VALID [2022-04-28 15:17:18,056 INFO L290 TraceCheckUtils]: 67: Hoare triple {8663#false} assume !false; {8663#false} is VALID [2022-04-28 15:17:18,057 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:17:18,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:17:18,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150664784] [2022-04-28 15:17:18,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150664784] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:18,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:18,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:18,058 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:17:18,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2028319921] [2022-04-28 15:17:18,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2028319921] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:18,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:18,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:18,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359234293] [2022-04-28 15:17:18,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:17:18,059 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-28 15:17:18,059 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:17:18,059 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:18,121 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:18,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:17:18,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:18,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:17:18,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:17:18,122 INFO L87 Difference]: Start difference. First operand 148 states and 218 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:20,149 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:17:21,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:21,239 INFO L93 Difference]: Finished difference Result 283 states and 421 transitions. [2022-04-28 15:17:21,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:17:21,239 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-28 15:17:21,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:17:21,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:21,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 421 transitions. [2022-04-28 15:17:21,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:21,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 421 transitions. [2022-04-28 15:17:21,246 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 421 transitions. [2022-04-28 15:17:21,592 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 421 edges. 421 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:21,595 INFO L225 Difference]: With dead ends: 283 [2022-04-28 15:17:21,595 INFO L226 Difference]: Without dead ends: 161 [2022-04-28 15:17:21,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:17:21,596 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 20 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:17:21,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 461 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 342 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 15:17:21,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-04-28 15:17:21,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 148. [2022-04-28 15:17:21,601 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:17:21,602 INFO L82 GeneralOperation]: Start isEquivalent. First operand 161 states. Second operand has 148 states, 143 states have (on average 1.4895104895104896) internal successors, (213), 143 states have internal predecessors, (213), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:21,602 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand has 148 states, 143 states have (on average 1.4895104895104896) internal successors, (213), 143 states have internal predecessors, (213), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:21,602 INFO L87 Difference]: Start difference. First operand 161 states. Second operand has 148 states, 143 states have (on average 1.4895104895104896) internal successors, (213), 143 states have internal predecessors, (213), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:21,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:21,606 INFO L93 Difference]: Finished difference Result 161 states and 234 transitions. [2022-04-28 15:17:21,606 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 234 transitions. [2022-04-28 15:17:21,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:21,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:21,607 INFO L74 IsIncluded]: Start isIncluded. First operand has 148 states, 143 states have (on average 1.4895104895104896) internal successors, (213), 143 states have internal predecessors, (213), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 161 states. [2022-04-28 15:17:21,607 INFO L87 Difference]: Start difference. First operand has 148 states, 143 states have (on average 1.4895104895104896) internal successors, (213), 143 states have internal predecessors, (213), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 161 states. [2022-04-28 15:17:21,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:21,610 INFO L93 Difference]: Finished difference Result 161 states and 234 transitions. [2022-04-28 15:17:21,610 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 234 transitions. [2022-04-28 15:17:21,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:21,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:21,611 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:17:21,611 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:17:21,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 143 states have (on average 1.4895104895104896) internal successors, (213), 143 states have internal predecessors, (213), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:21,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 217 transitions. [2022-04-28 15:17:21,615 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 217 transitions. Word has length 68 [2022-04-28 15:17:21,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:17:21,615 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 217 transitions. [2022-04-28 15:17:21,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:21,615 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 148 states and 217 transitions. [2022-04-28 15:17:21,799 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 217 edges. 217 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:21,799 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 217 transitions. [2022-04-28 15:17:21,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-28 15:17:21,799 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:17:21,800 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:17:21,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-28 15:17:21,800 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:17:21,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:17:21,800 INFO L85 PathProgramCache]: Analyzing trace with hash -452212548, now seen corresponding path program 1 times [2022-04-28 15:17:21,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:21,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1105408981] [2022-04-28 15:17:21,834 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 15:17:21,834 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:17:21,835 INFO L85 PathProgramCache]: Analyzing trace with hash -452212548, now seen corresponding path program 2 times [2022-04-28 15:17:21,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:17:21,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373204450] [2022-04-28 15:17:21,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:17:21,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:17:21,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:21,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:17:21,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:21,974 INFO L290 TraceCheckUtils]: 0: Hoare triple {9865#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {9858#true} is VALID [2022-04-28 15:17:21,975 INFO L290 TraceCheckUtils]: 1: Hoare triple {9858#true} assume true; {9858#true} is VALID [2022-04-28 15:17:21,975 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9858#true} {9858#true} #662#return; {9858#true} is VALID [2022-04-28 15:17:21,976 INFO L272 TraceCheckUtils]: 0: Hoare triple {9858#true} call ULTIMATE.init(); {9865#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:17:21,976 INFO L290 TraceCheckUtils]: 1: Hoare triple {9865#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {9858#true} is VALID [2022-04-28 15:17:21,976 INFO L290 TraceCheckUtils]: 2: Hoare triple {9858#true} assume true; {9858#true} is VALID [2022-04-28 15:17:21,976 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9858#true} {9858#true} #662#return; {9858#true} is VALID [2022-04-28 15:17:21,976 INFO L272 TraceCheckUtils]: 4: Hoare triple {9858#true} call #t~ret161 := main(); {9858#true} is VALID [2022-04-28 15:17:21,977 INFO L290 TraceCheckUtils]: 5: Hoare triple {9858#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~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);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; {9858#true} is VALID [2022-04-28 15:17:21,977 INFO L290 TraceCheckUtils]: 6: Hoare triple {9858#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {9858#true} is VALID [2022-04-28 15:17:21,977 INFO L272 TraceCheckUtils]: 7: Hoare triple {9858#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {9858#true} is VALID [2022-04-28 15:17:21,979 INFO L290 TraceCheckUtils]: 8: Hoare triple {9858#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;~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); {9863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:21,980 INFO L290 TraceCheckUtils]: 9: Hoare triple {9863#(= 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; {9863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:21,980 INFO L290 TraceCheckUtils]: 10: Hoare triple {9863#(= 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; {9863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:21,981 INFO L290 TraceCheckUtils]: 11: Hoare triple {9863#(= 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)))); {9863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:21,981 INFO L290 TraceCheckUtils]: 12: Hoare triple {9863#(= 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); {9863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:21,982 INFO L290 TraceCheckUtils]: 13: Hoare triple {9863#(= 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; {9863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:21,982 INFO L290 TraceCheckUtils]: 14: Hoare triple {9863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {9863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:21,983 INFO L290 TraceCheckUtils]: 15: Hoare triple {9863#(= 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); {9863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:21,983 INFO L290 TraceCheckUtils]: 16: Hoare triple {9863#(= 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); {9863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:21,984 INFO L290 TraceCheckUtils]: 17: Hoare triple {9863#(= 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); {9863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:21,984 INFO L290 TraceCheckUtils]: 18: Hoare triple {9863#(= 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); {9863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:21,985 INFO L290 TraceCheckUtils]: 19: Hoare triple {9863#(= 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); {9864#(= 8464 |ssl3_accept_#t~mem51|)} is VALID [2022-04-28 15:17:21,985 INFO L290 TraceCheckUtils]: 20: Hoare triple {9864#(= 8464 |ssl3_accept_#t~mem51|)} assume 8195 == #t~mem51;havoc #t~mem51; {9859#false} is VALID [2022-04-28 15:17:21,985 INFO L290 TraceCheckUtils]: 21: Hoare triple {9859#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {9859#false} is VALID [2022-04-28 15:17:21,985 INFO L290 TraceCheckUtils]: 22: Hoare triple {9859#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {9859#false} is VALID [2022-04-28 15:17:21,985 INFO L290 TraceCheckUtils]: 23: Hoare triple {9859#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {9859#false} is VALID [2022-04-28 15:17:21,985 INFO L290 TraceCheckUtils]: 24: Hoare triple {9859#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); {9859#false} is VALID [2022-04-28 15:17:21,985 INFO L290 TraceCheckUtils]: 25: Hoare triple {9859#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {9859#false} is VALID [2022-04-28 15:17:21,986 INFO L290 TraceCheckUtils]: 26: Hoare triple {9859#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); {9859#false} is VALID [2022-04-28 15:17:21,986 INFO L290 TraceCheckUtils]: 27: Hoare triple {9859#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); {9859#false} is VALID [2022-04-28 15:17:21,986 INFO L290 TraceCheckUtils]: 28: Hoare triple {9859#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); {9859#false} is VALID [2022-04-28 15:17:21,986 INFO L290 TraceCheckUtils]: 29: Hoare triple {9859#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {9859#false} is VALID [2022-04-28 15:17:21,986 INFO L290 TraceCheckUtils]: 30: Hoare triple {9859#false} ~skip~0 := 0; {9859#false} is VALID [2022-04-28 15:17:21,986 INFO L290 TraceCheckUtils]: 31: Hoare triple {9859#false} assume !false; {9859#false} is VALID [2022-04-28 15:17:21,986 INFO L290 TraceCheckUtils]: 32: Hoare triple {9859#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); {9859#false} is VALID [2022-04-28 15:17:21,986 INFO L290 TraceCheckUtils]: 33: Hoare triple {9859#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-28 15:17:21,986 INFO L290 TraceCheckUtils]: 34: Hoare triple {9859#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-28 15:17:21,986 INFO L290 TraceCheckUtils]: 35: Hoare triple {9859#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-28 15:17:21,986 INFO L290 TraceCheckUtils]: 36: Hoare triple {9859#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-28 15:17:21,987 INFO L290 TraceCheckUtils]: 37: Hoare triple {9859#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-28 15:17:21,987 INFO L290 TraceCheckUtils]: 38: Hoare triple {9859#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-28 15:17:21,987 INFO L290 TraceCheckUtils]: 39: Hoare triple {9859#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-28 15:17:21,987 INFO L290 TraceCheckUtils]: 40: Hoare triple {9859#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-28 15:17:21,987 INFO L290 TraceCheckUtils]: 41: Hoare triple {9859#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-28 15:17:21,987 INFO L290 TraceCheckUtils]: 42: Hoare triple {9859#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-28 15:17:21,987 INFO L290 TraceCheckUtils]: 43: Hoare triple {9859#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-28 15:17:21,987 INFO L290 TraceCheckUtils]: 44: Hoare triple {9859#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-28 15:17:21,987 INFO L290 TraceCheckUtils]: 45: Hoare triple {9859#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-28 15:17:21,987 INFO L290 TraceCheckUtils]: 46: Hoare triple {9859#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-28 15:17:21,988 INFO L290 TraceCheckUtils]: 47: Hoare triple {9859#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-28 15:17:21,988 INFO L290 TraceCheckUtils]: 48: Hoare triple {9859#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-28 15:17:21,988 INFO L290 TraceCheckUtils]: 49: Hoare triple {9859#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-28 15:17:21,988 INFO L290 TraceCheckUtils]: 50: Hoare triple {9859#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-28 15:17:21,988 INFO L290 TraceCheckUtils]: 51: Hoare triple {9859#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-28 15:17:21,988 INFO L290 TraceCheckUtils]: 52: Hoare triple {9859#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-28 15:17:21,988 INFO L290 TraceCheckUtils]: 53: Hoare triple {9859#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-28 15:17:21,988 INFO L290 TraceCheckUtils]: 54: Hoare triple {9859#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-28 15:17:21,988 INFO L290 TraceCheckUtils]: 55: Hoare triple {9859#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-28 15:17:21,988 INFO L290 TraceCheckUtils]: 56: Hoare triple {9859#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-28 15:17:21,988 INFO L290 TraceCheckUtils]: 57: Hoare triple {9859#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-28 15:17:21,989 INFO L290 TraceCheckUtils]: 58: Hoare triple {9859#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-28 15:17:21,989 INFO L290 TraceCheckUtils]: 59: Hoare triple {9859#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-28 15:17:21,989 INFO L290 TraceCheckUtils]: 60: Hoare triple {9859#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-28 15:17:21,989 INFO L290 TraceCheckUtils]: 61: Hoare triple {9859#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-28 15:17:21,989 INFO L290 TraceCheckUtils]: 62: Hoare triple {9859#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-28 15:17:21,989 INFO L290 TraceCheckUtils]: 63: Hoare triple {9859#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-28 15:17:21,989 INFO L290 TraceCheckUtils]: 64: Hoare triple {9859#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-28 15:17:21,989 INFO L290 TraceCheckUtils]: 65: Hoare triple {9859#false} assume 8672 == #t~mem79;havoc #t~mem79; {9859#false} is VALID [2022-04-28 15:17:21,989 INFO L290 TraceCheckUtils]: 66: Hoare triple {9859#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {9859#false} is VALID [2022-04-28 15:17:21,989 INFO L290 TraceCheckUtils]: 67: Hoare triple {9859#false} assume 3 == ~blastFlag~0; {9859#false} is VALID [2022-04-28 15:17:21,990 INFO L290 TraceCheckUtils]: 68: Hoare triple {9859#false} assume !false; {9859#false} is VALID [2022-04-28 15:17:21,990 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:17:21,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:17:21,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373204450] [2022-04-28 15:17:21,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373204450] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:21,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:21,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:21,991 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:17:21,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1105408981] [2022-04-28 15:17:21,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1105408981] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:21,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:21,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:21,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136882179] [2022-04-28 15:17:21,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:17:21,992 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2022-04-28 15:17:21,992 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:17:21,992 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:22,053 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:22,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:17:22,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:22,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:17:22,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:17:22,055 INFO L87 Difference]: Start difference. First operand 148 states and 217 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:24,081 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:17:25,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:25,125 INFO L93 Difference]: Finished difference Result 273 states and 407 transitions. [2022-04-28 15:17:25,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:17:25,125 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2022-04-28 15:17:25,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:17:25,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:25,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 407 transitions. [2022-04-28 15:17:25,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:25,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 407 transitions. [2022-04-28 15:17:25,135 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 407 transitions. [2022-04-28 15:17:25,468 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 407 edges. 407 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:25,470 INFO L225 Difference]: With dead ends: 273 [2022-04-28 15:17:25,471 INFO L226 Difference]: Without dead ends: 151 [2022-04-28 15:17:25,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:17:25,472 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 11 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:17:25,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 475 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 328 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 15:17:25,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-04-28 15:17:25,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 148. [2022-04-28 15:17:25,476 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:17:25,477 INFO L82 GeneralOperation]: Start isEquivalent. First operand 151 states. Second operand has 148 states, 143 states have (on average 1.4825174825174825) internal successors, (212), 143 states have internal predecessors, (212), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:25,477 INFO L74 IsIncluded]: Start isIncluded. First operand 151 states. Second operand has 148 states, 143 states have (on average 1.4825174825174825) internal successors, (212), 143 states have internal predecessors, (212), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:25,477 INFO L87 Difference]: Start difference. First operand 151 states. Second operand has 148 states, 143 states have (on average 1.4825174825174825) internal successors, (212), 143 states have internal predecessors, (212), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:25,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:25,480 INFO L93 Difference]: Finished difference Result 151 states and 220 transitions. [2022-04-28 15:17:25,480 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 220 transitions. [2022-04-28 15:17:25,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:25,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:25,481 INFO L74 IsIncluded]: Start isIncluded. First operand has 148 states, 143 states have (on average 1.4825174825174825) internal successors, (212), 143 states have internal predecessors, (212), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 151 states. [2022-04-28 15:17:25,481 INFO L87 Difference]: Start difference. First operand has 148 states, 143 states have (on average 1.4825174825174825) internal successors, (212), 143 states have internal predecessors, (212), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 151 states. [2022-04-28 15:17:25,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:25,484 INFO L93 Difference]: Finished difference Result 151 states and 220 transitions. [2022-04-28 15:17:25,484 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 220 transitions. [2022-04-28 15:17:25,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:25,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:25,484 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:17:25,484 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:17:25,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 143 states have (on average 1.4825174825174825) internal successors, (212), 143 states have internal predecessors, (212), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:25,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 216 transitions. [2022-04-28 15:17:25,487 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 216 transitions. Word has length 69 [2022-04-28 15:17:25,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:17:25,488 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 216 transitions. [2022-04-28 15:17:25,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:25,488 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 148 states and 216 transitions. [2022-04-28 15:17:25,671 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 216 edges. 216 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:25,671 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 216 transitions. [2022-04-28 15:17:25,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-28 15:17:25,672 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:17:25,672 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:17:25,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-28 15:17:25,673 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:17:25,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:17:25,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1752801627, now seen corresponding path program 1 times [2022-04-28 15:17:25,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:25,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [173959369] [2022-04-28 15:17:25,695 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:17:25,695 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:17:25,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1752801627, now seen corresponding path program 2 times [2022-04-28 15:17:25,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:17:25,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238017504] [2022-04-28 15:17:25,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:17:25,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:17:25,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:25,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:17:25,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:25,848 INFO L290 TraceCheckUtils]: 0: Hoare triple {11021#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {11014#true} is VALID [2022-04-28 15:17:25,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {11014#true} assume true; {11014#true} is VALID [2022-04-28 15:17:25,848 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11014#true} {11014#true} #662#return; {11014#true} is VALID [2022-04-28 15:17:25,849 INFO L272 TraceCheckUtils]: 0: Hoare triple {11014#true} call ULTIMATE.init(); {11021#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:17:25,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {11021#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {11014#true} is VALID [2022-04-28 15:17:25,850 INFO L290 TraceCheckUtils]: 2: Hoare triple {11014#true} assume true; {11014#true} is VALID [2022-04-28 15:17:25,850 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11014#true} {11014#true} #662#return; {11014#true} is VALID [2022-04-28 15:17:25,850 INFO L272 TraceCheckUtils]: 4: Hoare triple {11014#true} call #t~ret161 := main(); {11014#true} is VALID [2022-04-28 15:17:25,850 INFO L290 TraceCheckUtils]: 5: Hoare triple {11014#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~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);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; {11014#true} is VALID [2022-04-28 15:17:25,850 INFO L290 TraceCheckUtils]: 6: Hoare triple {11014#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {11014#true} is VALID [2022-04-28 15:17:25,850 INFO L272 TraceCheckUtils]: 7: Hoare triple {11014#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {11014#true} is VALID [2022-04-28 15:17:25,850 INFO L290 TraceCheckUtils]: 8: Hoare triple {11014#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;~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); {11014#true} is VALID [2022-04-28 15:17:25,850 INFO L290 TraceCheckUtils]: 9: Hoare triple {11014#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; {11014#true} is VALID [2022-04-28 15:17:25,850 INFO L290 TraceCheckUtils]: 10: Hoare triple {11014#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; {11014#true} is VALID [2022-04-28 15:17:25,850 INFO L290 TraceCheckUtils]: 11: Hoare triple {11014#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {11014#true} is VALID [2022-04-28 15:17:25,851 INFO L290 TraceCheckUtils]: 12: Hoare triple {11014#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {11014#true} is VALID [2022-04-28 15:17:25,851 INFO L290 TraceCheckUtils]: 13: Hoare triple {11014#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {11014#true} is VALID [2022-04-28 15:17:25,851 INFO L290 TraceCheckUtils]: 14: Hoare triple {11014#true} assume !false; {11014#true} is VALID [2022-04-28 15:17:25,851 INFO L290 TraceCheckUtils]: 15: Hoare triple {11014#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); {11014#true} is VALID [2022-04-28 15:17:25,851 INFO L290 TraceCheckUtils]: 16: Hoare triple {11014#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {11014#true} is VALID [2022-04-28 15:17:25,851 INFO L290 TraceCheckUtils]: 17: Hoare triple {11014#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {11014#true} is VALID [2022-04-28 15:17:25,851 INFO L290 TraceCheckUtils]: 18: Hoare triple {11014#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {11014#true} is VALID [2022-04-28 15:17:25,851 INFO L290 TraceCheckUtils]: 19: Hoare triple {11014#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {11014#true} is VALID [2022-04-28 15:17:25,851 INFO L290 TraceCheckUtils]: 20: Hoare triple {11014#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {11014#true} is VALID [2022-04-28 15:17:25,851 INFO L290 TraceCheckUtils]: 21: Hoare triple {11014#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {11014#true} is VALID [2022-04-28 15:17:25,852 INFO L290 TraceCheckUtils]: 22: Hoare triple {11014#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {11014#true} is VALID [2022-04-28 15:17:25,852 INFO L290 TraceCheckUtils]: 23: Hoare triple {11014#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {11014#true} is VALID [2022-04-28 15:17:25,852 INFO L290 TraceCheckUtils]: 24: Hoare triple {11014#true} assume 8464 == #t~mem55;havoc #t~mem55; {11014#true} is VALID [2022-04-28 15:17:25,852 INFO L290 TraceCheckUtils]: 25: Hoare triple {11014#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; {11014#true} is VALID [2022-04-28 15:17:25,852 INFO L290 TraceCheckUtils]: 26: Hoare triple {11014#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {11014#true} is VALID [2022-04-28 15:17:25,853 INFO L290 TraceCheckUtils]: 27: Hoare triple {11014#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); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:17:25,854 INFO L290 TraceCheckUtils]: 28: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:17:25,854 INFO L290 TraceCheckUtils]: 29: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:17:25,855 INFO L290 TraceCheckUtils]: 30: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} ~skip~0 := 0; {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:17:25,855 INFO L290 TraceCheckUtils]: 31: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !false; {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:17:25,855 INFO L290 TraceCheckUtils]: 32: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:17:25,856 INFO L290 TraceCheckUtils]: 33: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:17:25,856 INFO L290 TraceCheckUtils]: 34: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:17:25,857 INFO L290 TraceCheckUtils]: 35: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:17:25,857 INFO L290 TraceCheckUtils]: 36: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:17:25,858 INFO L290 TraceCheckUtils]: 37: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:17:25,858 INFO L290 TraceCheckUtils]: 38: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:17:25,858 INFO L290 TraceCheckUtils]: 39: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:17:25,859 INFO L290 TraceCheckUtils]: 40: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:17:25,859 INFO L290 TraceCheckUtils]: 41: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:17:25,860 INFO L290 TraceCheckUtils]: 42: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:17:25,860 INFO L290 TraceCheckUtils]: 43: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:17:25,860 INFO L290 TraceCheckUtils]: 44: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:17:25,861 INFO L290 TraceCheckUtils]: 45: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:17:25,861 INFO L290 TraceCheckUtils]: 46: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:17:25,862 INFO L290 TraceCheckUtils]: 47: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:17:25,862 INFO L290 TraceCheckUtils]: 48: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:17:25,863 INFO L290 TraceCheckUtils]: 49: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:17:25,863 INFO L290 TraceCheckUtils]: 50: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:17:25,863 INFO L290 TraceCheckUtils]: 51: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:17:25,864 INFO L290 TraceCheckUtils]: 52: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:17:25,864 INFO L290 TraceCheckUtils]: 53: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:17:25,865 INFO L290 TraceCheckUtils]: 54: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:17:25,865 INFO L290 TraceCheckUtils]: 55: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:17:25,865 INFO L290 TraceCheckUtils]: 56: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:17:25,866 INFO L290 TraceCheckUtils]: 57: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:17:25,866 INFO L290 TraceCheckUtils]: 58: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:17:25,867 INFO L290 TraceCheckUtils]: 59: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:17:25,867 INFO L290 TraceCheckUtils]: 60: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:17:25,868 INFO L290 TraceCheckUtils]: 61: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:17:25,868 INFO L290 TraceCheckUtils]: 62: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:17:25,868 INFO L290 TraceCheckUtils]: 63: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:17:25,869 INFO L290 TraceCheckUtils]: 64: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {11020#(not (= |ssl3_accept_#t~mem79| 8672))} is VALID [2022-04-28 15:17:25,869 INFO L290 TraceCheckUtils]: 65: Hoare triple {11020#(not (= |ssl3_accept_#t~mem79| 8672))} assume 8672 == #t~mem79;havoc #t~mem79; {11015#false} is VALID [2022-04-28 15:17:25,869 INFO L290 TraceCheckUtils]: 66: Hoare triple {11015#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {11015#false} is VALID [2022-04-28 15:17:25,869 INFO L290 TraceCheckUtils]: 67: Hoare triple {11015#false} assume 3 == ~blastFlag~0; {11015#false} is VALID [2022-04-28 15:17:25,869 INFO L290 TraceCheckUtils]: 68: Hoare triple {11015#false} assume !false; {11015#false} is VALID [2022-04-28 15:17:25,870 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:17:25,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:17:25,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238017504] [2022-04-28 15:17:25,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238017504] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:25,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:25,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:25,871 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:17:25,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [173959369] [2022-04-28 15:17:25,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [173959369] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:25,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:25,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:25,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420603963] [2022-04-28 15:17:25,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:17:25,872 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2022-04-28 15:17:25,872 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:17:25,872 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:25,937 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:25,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:17:25,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:25,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:17:25,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:17:25,938 INFO L87 Difference]: Start difference. First operand 148 states and 216 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:27,964 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:17:29,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:29,246 INFO L93 Difference]: Finished difference Result 384 states and 578 transitions. [2022-04-28 15:17:29,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:17:29,246 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2022-04-28 15:17:29,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:17:29,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:29,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 567 transitions. [2022-04-28 15:17:29,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:29,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 567 transitions. [2022-04-28 15:17:29,258 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 567 transitions. [2022-04-28 15:17:29,740 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 567 edges. 567 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:29,745 INFO L225 Difference]: With dead ends: 384 [2022-04-28 15:17:29,745 INFO L226 Difference]: Without dead ends: 262 [2022-04-28 15:17:29,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:17:29,747 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 110 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 15:17:29,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 313 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 464 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 15:17:29,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-04-28 15:17:29,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 191. [2022-04-28 15:17:29,754 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:17:29,755 INFO L82 GeneralOperation]: Start isEquivalent. First operand 262 states. Second operand has 191 states, 186 states have (on average 1.5698924731182795) internal successors, (292), 186 states have internal predecessors, (292), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:29,755 INFO L74 IsIncluded]: Start isIncluded. First operand 262 states. Second operand has 191 states, 186 states have (on average 1.5698924731182795) internal successors, (292), 186 states have internal predecessors, (292), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:29,755 INFO L87 Difference]: Start difference. First operand 262 states. Second operand has 191 states, 186 states have (on average 1.5698924731182795) internal successors, (292), 186 states have internal predecessors, (292), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:29,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:29,762 INFO L93 Difference]: Finished difference Result 262 states and 391 transitions. [2022-04-28 15:17:29,762 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 391 transitions. [2022-04-28 15:17:29,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:29,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:29,764 INFO L74 IsIncluded]: Start isIncluded. First operand has 191 states, 186 states have (on average 1.5698924731182795) internal successors, (292), 186 states have internal predecessors, (292), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 262 states. [2022-04-28 15:17:29,764 INFO L87 Difference]: Start difference. First operand has 191 states, 186 states have (on average 1.5698924731182795) internal successors, (292), 186 states have internal predecessors, (292), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 262 states. [2022-04-28 15:17:29,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:29,770 INFO L93 Difference]: Finished difference Result 262 states and 391 transitions. [2022-04-28 15:17:29,770 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 391 transitions. [2022-04-28 15:17:29,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:29,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:29,771 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:17:29,771 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:17:29,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 186 states have (on average 1.5698924731182795) internal successors, (292), 186 states have internal predecessors, (292), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:29,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 296 transitions. [2022-04-28 15:17:29,777 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 296 transitions. Word has length 69 [2022-04-28 15:17:29,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:17:29,777 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 296 transitions. [2022-04-28 15:17:29,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:29,777 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 191 states and 296 transitions. [2022-04-28 15:17:30,044 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 296 edges. 296 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:30,044 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 296 transitions. [2022-04-28 15:17:30,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-04-28 15:17:30,045 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:17:30,045 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:17:30,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-28 15:17:30,045 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:17:30,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:17:30,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1490539961, now seen corresponding path program 1 times [2022-04-28 15:17:30,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:30,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1906149269] [2022-04-28 15:17:30,070 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:17:30,070 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:17:30,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1490539961, now seen corresponding path program 2 times [2022-04-28 15:17:30,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:17:30,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885530644] [2022-04-28 15:17:30,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:17:30,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:17:30,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:30,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:17:30,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:30,218 INFO L290 TraceCheckUtils]: 0: Hoare triple {12707#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {12700#true} is VALID [2022-04-28 15:17:30,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {12700#true} assume true; {12700#true} is VALID [2022-04-28 15:17:30,218 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12700#true} {12700#true} #662#return; {12700#true} is VALID [2022-04-28 15:17:30,219 INFO L272 TraceCheckUtils]: 0: Hoare triple {12700#true} call ULTIMATE.init(); {12707#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:17:30,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {12707#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {12700#true} is VALID [2022-04-28 15:17:30,220 INFO L290 TraceCheckUtils]: 2: Hoare triple {12700#true} assume true; {12700#true} is VALID [2022-04-28 15:17:30,220 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12700#true} {12700#true} #662#return; {12700#true} is VALID [2022-04-28 15:17:30,220 INFO L272 TraceCheckUtils]: 4: Hoare triple {12700#true} call #t~ret161 := main(); {12700#true} is VALID [2022-04-28 15:17:30,220 INFO L290 TraceCheckUtils]: 5: Hoare triple {12700#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~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);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; {12700#true} is VALID [2022-04-28 15:17:30,220 INFO L290 TraceCheckUtils]: 6: Hoare triple {12700#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {12700#true} is VALID [2022-04-28 15:17:30,220 INFO L272 TraceCheckUtils]: 7: Hoare triple {12700#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {12700#true} is VALID [2022-04-28 15:17:30,220 INFO L290 TraceCheckUtils]: 8: Hoare triple {12700#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;~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); {12700#true} is VALID [2022-04-28 15:17:30,220 INFO L290 TraceCheckUtils]: 9: Hoare triple {12700#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; {12700#true} is VALID [2022-04-28 15:17:30,221 INFO L290 TraceCheckUtils]: 10: Hoare triple {12700#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; {12700#true} is VALID [2022-04-28 15:17:30,221 INFO L290 TraceCheckUtils]: 11: Hoare triple {12700#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {12700#true} is VALID [2022-04-28 15:17:30,221 INFO L290 TraceCheckUtils]: 12: Hoare triple {12700#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {12700#true} is VALID [2022-04-28 15:17:30,221 INFO L290 TraceCheckUtils]: 13: Hoare triple {12700#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {12700#true} is VALID [2022-04-28 15:17:30,221 INFO L290 TraceCheckUtils]: 14: Hoare triple {12700#true} assume !false; {12700#true} is VALID [2022-04-28 15:17:30,221 INFO L290 TraceCheckUtils]: 15: Hoare triple {12700#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); {12700#true} is VALID [2022-04-28 15:17:30,235 INFO L290 TraceCheckUtils]: 16: Hoare triple {12700#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {12700#true} is VALID [2022-04-28 15:17:30,235 INFO L290 TraceCheckUtils]: 17: Hoare triple {12700#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {12700#true} is VALID [2022-04-28 15:17:30,235 INFO L290 TraceCheckUtils]: 18: Hoare triple {12700#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {12700#true} is VALID [2022-04-28 15:17:30,235 INFO L290 TraceCheckUtils]: 19: Hoare triple {12700#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {12700#true} is VALID [2022-04-28 15:17:30,236 INFO L290 TraceCheckUtils]: 20: Hoare triple {12700#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {12700#true} is VALID [2022-04-28 15:17:30,236 INFO L290 TraceCheckUtils]: 21: Hoare triple {12700#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {12700#true} is VALID [2022-04-28 15:17:30,236 INFO L290 TraceCheckUtils]: 22: Hoare triple {12700#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {12700#true} is VALID [2022-04-28 15:17:30,236 INFO L290 TraceCheckUtils]: 23: Hoare triple {12700#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {12700#true} is VALID [2022-04-28 15:17:30,236 INFO L290 TraceCheckUtils]: 24: Hoare triple {12700#true} assume 8464 == #t~mem55;havoc #t~mem55; {12700#true} is VALID [2022-04-28 15:17:30,236 INFO L290 TraceCheckUtils]: 25: Hoare triple {12700#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; {12700#true} is VALID [2022-04-28 15:17:30,236 INFO L290 TraceCheckUtils]: 26: Hoare triple {12700#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {12700#true} is VALID [2022-04-28 15:17:30,239 INFO L290 TraceCheckUtils]: 27: Hoare triple {12700#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); {12705#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:30,239 INFO L290 TraceCheckUtils]: 28: Hoare triple {12705#(= 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); {12705#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:30,240 INFO L290 TraceCheckUtils]: 29: Hoare triple {12705#(= 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; {12705#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:30,240 INFO L290 TraceCheckUtils]: 30: Hoare triple {12705#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {12705#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:30,241 INFO L290 TraceCheckUtils]: 31: Hoare triple {12705#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {12705#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:30,241 INFO L290 TraceCheckUtils]: 32: Hoare triple {12705#(= 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); {12705#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:30,242 INFO L290 TraceCheckUtils]: 33: Hoare triple {12705#(= 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); {12705#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:30,242 INFO L290 TraceCheckUtils]: 34: Hoare triple {12705#(= 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); {12705#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:30,242 INFO L290 TraceCheckUtils]: 35: Hoare triple {12705#(= 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); {12705#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:30,243 INFO L290 TraceCheckUtils]: 36: Hoare triple {12705#(= 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); {12705#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:30,243 INFO L290 TraceCheckUtils]: 37: Hoare triple {12705#(= 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); {12705#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:30,244 INFO L290 TraceCheckUtils]: 38: Hoare triple {12705#(= 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); {12705#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:30,244 INFO L290 TraceCheckUtils]: 39: Hoare triple {12705#(= 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); {12705#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:30,244 INFO L290 TraceCheckUtils]: 40: Hoare triple {12705#(= 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); {12705#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:30,245 INFO L290 TraceCheckUtils]: 41: Hoare triple {12705#(= 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); {12705#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:30,245 INFO L290 TraceCheckUtils]: 42: Hoare triple {12705#(= 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); {12705#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:30,246 INFO L290 TraceCheckUtils]: 43: Hoare triple {12705#(= 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); {12706#(= |ssl3_accept_#t~mem58| 8496)} is VALID [2022-04-28 15:17:30,246 INFO L290 TraceCheckUtils]: 44: Hoare triple {12706#(= |ssl3_accept_#t~mem58| 8496)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {12701#false} is VALID [2022-04-28 15:17:30,246 INFO L290 TraceCheckUtils]: 45: Hoare triple {12701#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {12701#false} is VALID [2022-04-28 15:17:30,246 INFO L290 TraceCheckUtils]: 46: Hoare triple {12701#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {12701#false} is VALID [2022-04-28 15:17:30,246 INFO L290 TraceCheckUtils]: 47: Hoare triple {12701#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {12701#false} is VALID [2022-04-28 15:17:30,247 INFO L290 TraceCheckUtils]: 48: Hoare triple {12701#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {12701#false} is VALID [2022-04-28 15:17:30,247 INFO L290 TraceCheckUtils]: 49: Hoare triple {12701#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {12701#false} is VALID [2022-04-28 15:17:30,247 INFO L290 TraceCheckUtils]: 50: Hoare triple {12701#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {12701#false} is VALID [2022-04-28 15:17:30,247 INFO L290 TraceCheckUtils]: 51: Hoare triple {12701#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {12701#false} is VALID [2022-04-28 15:17:30,247 INFO L290 TraceCheckUtils]: 52: Hoare triple {12701#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {12701#false} is VALID [2022-04-28 15:17:30,247 INFO L290 TraceCheckUtils]: 53: Hoare triple {12701#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {12701#false} is VALID [2022-04-28 15:17:30,247 INFO L290 TraceCheckUtils]: 54: Hoare triple {12701#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {12701#false} is VALID [2022-04-28 15:17:30,247 INFO L290 TraceCheckUtils]: 55: Hoare triple {12701#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {12701#false} is VALID [2022-04-28 15:17:30,247 INFO L290 TraceCheckUtils]: 56: Hoare triple {12701#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {12701#false} is VALID [2022-04-28 15:17:30,247 INFO L290 TraceCheckUtils]: 57: Hoare triple {12701#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {12701#false} is VALID [2022-04-28 15:17:30,248 INFO L290 TraceCheckUtils]: 58: Hoare triple {12701#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {12701#false} is VALID [2022-04-28 15:17:30,248 INFO L290 TraceCheckUtils]: 59: Hoare triple {12701#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {12701#false} is VALID [2022-04-28 15:17:30,248 INFO L290 TraceCheckUtils]: 60: Hoare triple {12701#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {12701#false} is VALID [2022-04-28 15:17:30,248 INFO L290 TraceCheckUtils]: 61: Hoare triple {12701#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {12701#false} is VALID [2022-04-28 15:17:30,248 INFO L290 TraceCheckUtils]: 62: Hoare triple {12701#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {12701#false} is VALID [2022-04-28 15:17:30,248 INFO L290 TraceCheckUtils]: 63: Hoare triple {12701#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {12701#false} is VALID [2022-04-28 15:17:30,248 INFO L290 TraceCheckUtils]: 64: Hoare triple {12701#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {12701#false} is VALID [2022-04-28 15:17:30,248 INFO L290 TraceCheckUtils]: 65: Hoare triple {12701#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 72 + ~s.offset, 4); {12701#false} is VALID [2022-04-28 15:17:30,248 INFO L290 TraceCheckUtils]: 66: Hoare triple {12701#false} assume 8673 == #t~mem80;havoc #t~mem80; {12701#false} is VALID [2022-04-28 15:17:30,249 INFO L290 TraceCheckUtils]: 67: Hoare triple {12701#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {12701#false} is VALID [2022-04-28 15:17:30,249 INFO L290 TraceCheckUtils]: 68: Hoare triple {12701#false} assume 3 == ~blastFlag~0; {12701#false} is VALID [2022-04-28 15:17:30,249 INFO L290 TraceCheckUtils]: 69: Hoare triple {12701#false} assume !false; {12701#false} is VALID [2022-04-28 15:17:30,249 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:17:30,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:17:30,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885530644] [2022-04-28 15:17:30,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885530644] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:30,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:30,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:30,250 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:17:30,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1906149269] [2022-04-28 15:17:30,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1906149269] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:30,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:30,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:30,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071092349] [2022-04-28 15:17:30,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:17:30,251 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 70 [2022-04-28 15:17:30,251 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:17:30,251 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:30,309 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-28 15:17:30,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:17:30,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:30,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:17:30,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:17:30,311 INFO L87 Difference]: Start difference. First operand 191 states and 296 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:32,337 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:17:33,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:33,326 INFO L93 Difference]: Finished difference Result 399 states and 628 transitions. [2022-04-28 15:17:33,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:17:33,326 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 70 [2022-04-28 15:17:33,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:17:33,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:33,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 457 transitions. [2022-04-28 15:17:33,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:33,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 457 transitions. [2022-04-28 15:17:33,332 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 457 transitions. [2022-04-28 15:17:33,662 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 457 edges. 457 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:33,666 INFO L225 Difference]: With dead ends: 399 [2022-04-28 15:17:33,666 INFO L226 Difference]: Without dead ends: 234 [2022-04-28 15:17:33,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:17:33,667 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 34 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:17:33,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 473 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 384 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 15:17:33,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2022-04-28 15:17:33,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 213. [2022-04-28 15:17:33,675 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:17:33,676 INFO L82 GeneralOperation]: Start isEquivalent. First operand 234 states. Second operand has 213 states, 208 states have (on average 1.5865384615384615) internal successors, (330), 208 states have internal predecessors, (330), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:33,676 INFO L74 IsIncluded]: Start isIncluded. First operand 234 states. Second operand has 213 states, 208 states have (on average 1.5865384615384615) internal successors, (330), 208 states have internal predecessors, (330), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:33,677 INFO L87 Difference]: Start difference. First operand 234 states. Second operand has 213 states, 208 states have (on average 1.5865384615384615) internal successors, (330), 208 states have internal predecessors, (330), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:33,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:33,681 INFO L93 Difference]: Finished difference Result 234 states and 361 transitions. [2022-04-28 15:17:33,681 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 361 transitions. [2022-04-28 15:17:33,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:33,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:33,682 INFO L74 IsIncluded]: Start isIncluded. First operand has 213 states, 208 states have (on average 1.5865384615384615) internal successors, (330), 208 states have internal predecessors, (330), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 234 states. [2022-04-28 15:17:33,683 INFO L87 Difference]: Start difference. First operand has 213 states, 208 states have (on average 1.5865384615384615) internal successors, (330), 208 states have internal predecessors, (330), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 234 states. [2022-04-28 15:17:33,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:33,687 INFO L93 Difference]: Finished difference Result 234 states and 361 transitions. [2022-04-28 15:17:33,688 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 361 transitions. [2022-04-28 15:17:33,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:33,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:33,688 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:17:33,688 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:17:33,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 208 states have (on average 1.5865384615384615) internal successors, (330), 208 states have internal predecessors, (330), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:33,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 334 transitions. [2022-04-28 15:17:33,693 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 334 transitions. Word has length 70 [2022-04-28 15:17:33,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:17:33,694 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 334 transitions. [2022-04-28 15:17:33,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:33,694 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 213 states and 334 transitions. [2022-04-28 15:17:33,929 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 334 edges. 334 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:33,929 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 334 transitions. [2022-04-28 15:17:33,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-04-28 15:17:33,932 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:17:33,932 INFO L195 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:17:33,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-28 15:17:33,932 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:17:33,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:17:33,933 INFO L85 PathProgramCache]: Analyzing trace with hash 308122582, now seen corresponding path program 1 times [2022-04-28 15:17:33,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:33,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [978534655] [2022-04-28 15:17:33,985 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:17:33,985 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:17:33,985 INFO L85 PathProgramCache]: Analyzing trace with hash 308122582, now seen corresponding path program 2 times [2022-04-28 15:17:33,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:17:33,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501844125] [2022-04-28 15:17:33,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:17:33,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:17:34,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:34,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:17:34,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:34,115 INFO L290 TraceCheckUtils]: 0: Hoare triple {14411#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {14404#true} is VALID [2022-04-28 15:17:34,115 INFO L290 TraceCheckUtils]: 1: Hoare triple {14404#true} assume true; {14404#true} is VALID [2022-04-28 15:17:34,115 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14404#true} {14404#true} #662#return; {14404#true} is VALID [2022-04-28 15:17:34,116 INFO L272 TraceCheckUtils]: 0: Hoare triple {14404#true} call ULTIMATE.init(); {14411#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:17:34,116 INFO L290 TraceCheckUtils]: 1: Hoare triple {14411#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {14404#true} is VALID [2022-04-28 15:17:34,116 INFO L290 TraceCheckUtils]: 2: Hoare triple {14404#true} assume true; {14404#true} is VALID [2022-04-28 15:17:34,116 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14404#true} {14404#true} #662#return; {14404#true} is VALID [2022-04-28 15:17:34,116 INFO L272 TraceCheckUtils]: 4: Hoare triple {14404#true} call #t~ret161 := main(); {14404#true} is VALID [2022-04-28 15:17:34,116 INFO L290 TraceCheckUtils]: 5: Hoare triple {14404#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~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);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; {14404#true} is VALID [2022-04-28 15:17:34,117 INFO L290 TraceCheckUtils]: 6: Hoare triple {14404#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {14404#true} is VALID [2022-04-28 15:17:34,117 INFO L272 TraceCheckUtils]: 7: Hoare triple {14404#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {14404#true} is VALID [2022-04-28 15:17:34,117 INFO L290 TraceCheckUtils]: 8: Hoare triple {14404#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;~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); {14404#true} is VALID [2022-04-28 15:17:34,117 INFO L290 TraceCheckUtils]: 9: Hoare triple {14404#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; {14404#true} is VALID [2022-04-28 15:17:34,117 INFO L290 TraceCheckUtils]: 10: Hoare triple {14404#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; {14404#true} is VALID [2022-04-28 15:17:34,117 INFO L290 TraceCheckUtils]: 11: Hoare triple {14404#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {14404#true} is VALID [2022-04-28 15:17:34,117 INFO L290 TraceCheckUtils]: 12: Hoare triple {14404#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {14404#true} is VALID [2022-04-28 15:17:34,117 INFO L290 TraceCheckUtils]: 13: Hoare triple {14404#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {14404#true} is VALID [2022-04-28 15:17:34,117 INFO L290 TraceCheckUtils]: 14: Hoare triple {14404#true} assume !false; {14404#true} is VALID [2022-04-28 15:17:34,118 INFO L290 TraceCheckUtils]: 15: Hoare triple {14404#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); {14404#true} is VALID [2022-04-28 15:17:34,118 INFO L290 TraceCheckUtils]: 16: Hoare triple {14404#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {14404#true} is VALID [2022-04-28 15:17:34,118 INFO L290 TraceCheckUtils]: 17: Hoare triple {14404#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {14404#true} is VALID [2022-04-28 15:17:34,118 INFO L290 TraceCheckUtils]: 18: Hoare triple {14404#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {14404#true} is VALID [2022-04-28 15:17:34,118 INFO L290 TraceCheckUtils]: 19: Hoare triple {14404#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {14404#true} is VALID [2022-04-28 15:17:34,118 INFO L290 TraceCheckUtils]: 20: Hoare triple {14404#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {14404#true} is VALID [2022-04-28 15:17:34,118 INFO L290 TraceCheckUtils]: 21: Hoare triple {14404#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {14404#true} is VALID [2022-04-28 15:17:34,118 INFO L290 TraceCheckUtils]: 22: Hoare triple {14404#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {14404#true} is VALID [2022-04-28 15:17:34,118 INFO L290 TraceCheckUtils]: 23: Hoare triple {14404#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {14404#true} is VALID [2022-04-28 15:17:34,118 INFO L290 TraceCheckUtils]: 24: Hoare triple {14404#true} assume 8464 == #t~mem55;havoc #t~mem55; {14404#true} is VALID [2022-04-28 15:17:34,119 INFO L290 TraceCheckUtils]: 25: Hoare triple {14404#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; {14404#true} is VALID [2022-04-28 15:17:34,119 INFO L290 TraceCheckUtils]: 26: Hoare triple {14404#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {14404#true} is VALID [2022-04-28 15:17:34,120 INFO L290 TraceCheckUtils]: 27: Hoare triple {14404#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); {14409#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:34,120 INFO L290 TraceCheckUtils]: 28: Hoare triple {14409#(= 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); {14409#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:34,121 INFO L290 TraceCheckUtils]: 29: Hoare triple {14409#(= 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; {14409#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:34,121 INFO L290 TraceCheckUtils]: 30: Hoare triple {14409#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {14409#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:34,122 INFO L290 TraceCheckUtils]: 31: Hoare triple {14409#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {14409#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:34,122 INFO L290 TraceCheckUtils]: 32: Hoare triple {14409#(= 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); {14409#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:34,122 INFO L290 TraceCheckUtils]: 33: Hoare triple {14409#(= 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); {14409#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:34,123 INFO L290 TraceCheckUtils]: 34: Hoare triple {14409#(= 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); {14409#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:34,123 INFO L290 TraceCheckUtils]: 35: Hoare triple {14409#(= 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); {14409#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:34,124 INFO L290 TraceCheckUtils]: 36: Hoare triple {14409#(= 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); {14409#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:34,124 INFO L290 TraceCheckUtils]: 37: Hoare triple {14409#(= 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); {14410#(= |ssl3_accept_#t~mem52| 8496)} is VALID [2022-04-28 15:17:34,124 INFO L290 TraceCheckUtils]: 38: Hoare triple {14410#(= |ssl3_accept_#t~mem52| 8496)} assume 8480 == #t~mem52;havoc #t~mem52; {14405#false} is VALID [2022-04-28 15:17:34,124 INFO L290 TraceCheckUtils]: 39: Hoare triple {14405#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; {14405#false} is VALID [2022-04-28 15:17:34,125 INFO L290 TraceCheckUtils]: 40: Hoare triple {14405#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); {14405#false} is VALID [2022-04-28 15:17:34,125 INFO L290 TraceCheckUtils]: 41: Hoare triple {14405#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); {14405#false} is VALID [2022-04-28 15:17:34,125 INFO L290 TraceCheckUtils]: 42: Hoare triple {14405#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {14405#false} is VALID [2022-04-28 15:17:34,125 INFO L290 TraceCheckUtils]: 43: Hoare triple {14405#false} ~skip~0 := 0; {14405#false} is VALID [2022-04-28 15:17:34,125 INFO L290 TraceCheckUtils]: 44: Hoare triple {14405#false} assume !false; {14405#false} is VALID [2022-04-28 15:17:34,125 INFO L290 TraceCheckUtils]: 45: Hoare triple {14405#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); {14405#false} is VALID [2022-04-28 15:17:34,125 INFO L290 TraceCheckUtils]: 46: Hoare triple {14405#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {14405#false} is VALID [2022-04-28 15:17:34,125 INFO L290 TraceCheckUtils]: 47: Hoare triple {14405#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {14405#false} is VALID [2022-04-28 15:17:34,126 INFO L290 TraceCheckUtils]: 48: Hoare triple {14405#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {14405#false} is VALID [2022-04-28 15:17:34,126 INFO L290 TraceCheckUtils]: 49: Hoare triple {14405#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {14405#false} is VALID [2022-04-28 15:17:34,126 INFO L290 TraceCheckUtils]: 50: Hoare triple {14405#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {14405#false} is VALID [2022-04-28 15:17:34,126 INFO L290 TraceCheckUtils]: 51: Hoare triple {14405#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {14405#false} is VALID [2022-04-28 15:17:34,126 INFO L290 TraceCheckUtils]: 52: Hoare triple {14405#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {14405#false} is VALID [2022-04-28 15:17:34,126 INFO L290 TraceCheckUtils]: 53: Hoare triple {14405#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {14405#false} is VALID [2022-04-28 15:17:34,126 INFO L290 TraceCheckUtils]: 54: Hoare triple {14405#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {14405#false} is VALID [2022-04-28 15:17:34,126 INFO L290 TraceCheckUtils]: 55: Hoare triple {14405#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {14405#false} is VALID [2022-04-28 15:17:34,126 INFO L290 TraceCheckUtils]: 56: Hoare triple {14405#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {14405#false} is VALID [2022-04-28 15:17:34,127 INFO L290 TraceCheckUtils]: 57: Hoare triple {14405#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {14405#false} is VALID [2022-04-28 15:17:34,127 INFO L290 TraceCheckUtils]: 58: Hoare triple {14405#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {14405#false} is VALID [2022-04-28 15:17:34,127 INFO L290 TraceCheckUtils]: 59: Hoare triple {14405#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {14405#false} is VALID [2022-04-28 15:17:34,127 INFO L290 TraceCheckUtils]: 60: Hoare triple {14405#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {14405#false} is VALID [2022-04-28 15:17:34,127 INFO L290 TraceCheckUtils]: 61: Hoare triple {14405#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {14405#false} is VALID [2022-04-28 15:17:34,127 INFO L290 TraceCheckUtils]: 62: Hoare triple {14405#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {14405#false} is VALID [2022-04-28 15:17:34,127 INFO L290 TraceCheckUtils]: 63: Hoare triple {14405#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {14405#false} is VALID [2022-04-28 15:17:34,127 INFO L290 TraceCheckUtils]: 64: Hoare triple {14405#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {14405#false} is VALID [2022-04-28 15:17:34,127 INFO L290 TraceCheckUtils]: 65: Hoare triple {14405#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {14405#false} is VALID [2022-04-28 15:17:34,128 INFO L290 TraceCheckUtils]: 66: Hoare triple {14405#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {14405#false} is VALID [2022-04-28 15:17:34,128 INFO L290 TraceCheckUtils]: 67: Hoare triple {14405#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {14405#false} is VALID [2022-04-28 15:17:34,128 INFO L290 TraceCheckUtils]: 68: Hoare triple {14405#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {14405#false} is VALID [2022-04-28 15:17:34,128 INFO L290 TraceCheckUtils]: 69: Hoare triple {14405#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {14405#false} is VALID [2022-04-28 15:17:34,128 INFO L290 TraceCheckUtils]: 70: Hoare triple {14405#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {14405#false} is VALID [2022-04-28 15:17:34,128 INFO L290 TraceCheckUtils]: 71: Hoare triple {14405#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {14405#false} is VALID [2022-04-28 15:17:34,128 INFO L290 TraceCheckUtils]: 72: Hoare triple {14405#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {14405#false} is VALID [2022-04-28 15:17:34,128 INFO L290 TraceCheckUtils]: 73: Hoare triple {14405#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {14405#false} is VALID [2022-04-28 15:17:34,128 INFO L290 TraceCheckUtils]: 74: Hoare triple {14405#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {14405#false} is VALID [2022-04-28 15:17:34,129 INFO L290 TraceCheckUtils]: 75: Hoare triple {14405#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {14405#false} is VALID [2022-04-28 15:17:34,129 INFO L290 TraceCheckUtils]: 76: Hoare triple {14405#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {14405#false} is VALID [2022-04-28 15:17:34,129 INFO L290 TraceCheckUtils]: 77: Hoare triple {14405#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {14405#false} is VALID [2022-04-28 15:17:34,129 INFO L290 TraceCheckUtils]: 78: Hoare triple {14405#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 72 + ~s.offset, 4); {14405#false} is VALID [2022-04-28 15:17:34,129 INFO L290 TraceCheckUtils]: 79: Hoare triple {14405#false} assume 8673 == #t~mem80;havoc #t~mem80; {14405#false} is VALID [2022-04-28 15:17:34,129 INFO L290 TraceCheckUtils]: 80: Hoare triple {14405#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {14405#false} is VALID [2022-04-28 15:17:34,129 INFO L290 TraceCheckUtils]: 81: Hoare triple {14405#false} assume 3 == ~blastFlag~0; {14405#false} is VALID [2022-04-28 15:17:34,129 INFO L290 TraceCheckUtils]: 82: Hoare triple {14405#false} assume !false; {14405#false} is VALID [2022-04-28 15:17:34,130 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:17:34,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:17:34,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501844125] [2022-04-28 15:17:34,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501844125] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:34,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:34,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:34,130 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:17:34,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [978534655] [2022-04-28 15:17:34,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [978534655] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:34,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:34,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:34,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797110816] [2022-04-28 15:17:34,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:17:34,131 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 83 [2022-04-28 15:17:34,132 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:17:34,132 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:34,198 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:34,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:17:34,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:34,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:17:34,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:17:34,199 INFO L87 Difference]: Start difference. First operand 213 states and 334 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:36,228 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:17:37,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:37,369 INFO L93 Difference]: Finished difference Result 421 states and 665 transitions. [2022-04-28 15:17:37,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:17:37,370 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 83 [2022-04-28 15:17:37,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:17:37,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:37,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 456 transitions. [2022-04-28 15:17:37,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:37,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 456 transitions. [2022-04-28 15:17:37,374 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 456 transitions. [2022-04-28 15:17:37,678 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 456 edges. 456 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:37,681 INFO L225 Difference]: With dead ends: 421 [2022-04-28 15:17:37,681 INFO L226 Difference]: Without dead ends: 234 [2022-04-28 15:17:37,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:17:37,683 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 39 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:17:37,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 473 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 383 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 15:17:37,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2022-04-28 15:17:37,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 213. [2022-04-28 15:17:37,691 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:17:37,691 INFO L82 GeneralOperation]: Start isEquivalent. First operand 234 states. Second operand has 213 states, 208 states have (on average 1.5817307692307692) internal successors, (329), 208 states have internal predecessors, (329), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:37,692 INFO L74 IsIncluded]: Start isIncluded. First operand 234 states. Second operand has 213 states, 208 states have (on average 1.5817307692307692) internal successors, (329), 208 states have internal predecessors, (329), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:37,692 INFO L87 Difference]: Start difference. First operand 234 states. Second operand has 213 states, 208 states have (on average 1.5817307692307692) internal successors, (329), 208 states have internal predecessors, (329), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:37,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:37,697 INFO L93 Difference]: Finished difference Result 234 states and 360 transitions. [2022-04-28 15:17:37,697 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 360 transitions. [2022-04-28 15:17:37,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:37,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:37,698 INFO L74 IsIncluded]: Start isIncluded. First operand has 213 states, 208 states have (on average 1.5817307692307692) internal successors, (329), 208 states have internal predecessors, (329), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 234 states. [2022-04-28 15:17:37,698 INFO L87 Difference]: Start difference. First operand has 213 states, 208 states have (on average 1.5817307692307692) internal successors, (329), 208 states have internal predecessors, (329), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 234 states. [2022-04-28 15:17:37,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:37,703 INFO L93 Difference]: Finished difference Result 234 states and 360 transitions. [2022-04-28 15:17:37,703 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 360 transitions. [2022-04-28 15:17:37,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:37,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:37,704 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:17:37,704 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:17:37,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 208 states have (on average 1.5817307692307692) internal successors, (329), 208 states have internal predecessors, (329), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:37,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 333 transitions. [2022-04-28 15:17:37,709 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 333 transitions. Word has length 83 [2022-04-28 15:17:37,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:17:37,709 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 333 transitions. [2022-04-28 15:17:37,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:37,709 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 213 states and 333 transitions. [2022-04-28 15:17:37,950 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 333 edges. 333 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:37,950 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 333 transitions. [2022-04-28 15:17:37,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-28 15:17:37,951 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:17:37,951 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:17:37,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-28 15:17:37,952 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:17:37,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:17:37,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1233411814, now seen corresponding path program 1 times [2022-04-28 15:17:37,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:37,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [255388656] [2022-04-28 15:17:37,991 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:17:37,991 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:17:37,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1233411814, now seen corresponding path program 2 times [2022-04-28 15:17:37,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:17:37,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680329785] [2022-04-28 15:17:37,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:17:37,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:17:38,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:38,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:17:38,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:38,122 INFO L290 TraceCheckUtils]: 0: Hoare triple {16159#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {16152#true} is VALID [2022-04-28 15:17:38,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {16152#true} assume true; {16152#true} is VALID [2022-04-28 15:17:38,123 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16152#true} {16152#true} #662#return; {16152#true} is VALID [2022-04-28 15:17:38,124 INFO L272 TraceCheckUtils]: 0: Hoare triple {16152#true} call ULTIMATE.init(); {16159#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:17:38,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {16159#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {16152#true} is VALID [2022-04-28 15:17:38,124 INFO L290 TraceCheckUtils]: 2: Hoare triple {16152#true} assume true; {16152#true} is VALID [2022-04-28 15:17:38,124 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16152#true} {16152#true} #662#return; {16152#true} is VALID [2022-04-28 15:17:38,124 INFO L272 TraceCheckUtils]: 4: Hoare triple {16152#true} call #t~ret161 := main(); {16152#true} is VALID [2022-04-28 15:17:38,124 INFO L290 TraceCheckUtils]: 5: Hoare triple {16152#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~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);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; {16152#true} is VALID [2022-04-28 15:17:38,124 INFO L290 TraceCheckUtils]: 6: Hoare triple {16152#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {16152#true} is VALID [2022-04-28 15:17:38,124 INFO L272 TraceCheckUtils]: 7: Hoare triple {16152#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {16152#true} is VALID [2022-04-28 15:17:38,124 INFO L290 TraceCheckUtils]: 8: Hoare triple {16152#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;~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); {16152#true} is VALID [2022-04-28 15:17:38,124 INFO L290 TraceCheckUtils]: 9: Hoare triple {16152#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; {16152#true} is VALID [2022-04-28 15:17:38,125 INFO L290 TraceCheckUtils]: 10: Hoare triple {16152#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; {16152#true} is VALID [2022-04-28 15:17:38,125 INFO L290 TraceCheckUtils]: 11: Hoare triple {16152#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {16152#true} is VALID [2022-04-28 15:17:38,125 INFO L290 TraceCheckUtils]: 12: Hoare triple {16152#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {16152#true} is VALID [2022-04-28 15:17:38,125 INFO L290 TraceCheckUtils]: 13: Hoare triple {16152#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {16152#true} is VALID [2022-04-28 15:17:38,125 INFO L290 TraceCheckUtils]: 14: Hoare triple {16152#true} assume !false; {16152#true} is VALID [2022-04-28 15:17:38,125 INFO L290 TraceCheckUtils]: 15: Hoare triple {16152#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); {16152#true} is VALID [2022-04-28 15:17:38,125 INFO L290 TraceCheckUtils]: 16: Hoare triple {16152#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {16152#true} is VALID [2022-04-28 15:17:38,125 INFO L290 TraceCheckUtils]: 17: Hoare triple {16152#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {16152#true} is VALID [2022-04-28 15:17:38,125 INFO L290 TraceCheckUtils]: 18: Hoare triple {16152#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {16152#true} is VALID [2022-04-28 15:17:38,126 INFO L290 TraceCheckUtils]: 19: Hoare triple {16152#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {16152#true} is VALID [2022-04-28 15:17:38,126 INFO L290 TraceCheckUtils]: 20: Hoare triple {16152#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {16152#true} is VALID [2022-04-28 15:17:38,126 INFO L290 TraceCheckUtils]: 21: Hoare triple {16152#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {16152#true} is VALID [2022-04-28 15:17:38,126 INFO L290 TraceCheckUtils]: 22: Hoare triple {16152#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {16152#true} is VALID [2022-04-28 15:17:38,126 INFO L290 TraceCheckUtils]: 23: Hoare triple {16152#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {16152#true} is VALID [2022-04-28 15:17:38,126 INFO L290 TraceCheckUtils]: 24: Hoare triple {16152#true} assume 8464 == #t~mem55;havoc #t~mem55; {16152#true} is VALID [2022-04-28 15:17:38,126 INFO L290 TraceCheckUtils]: 25: Hoare triple {16152#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; {16152#true} is VALID [2022-04-28 15:17:38,126 INFO L290 TraceCheckUtils]: 26: Hoare triple {16152#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {16152#true} is VALID [2022-04-28 15:17:38,126 INFO L290 TraceCheckUtils]: 27: Hoare triple {16152#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); {16152#true} is VALID [2022-04-28 15:17:38,126 INFO L290 TraceCheckUtils]: 28: Hoare triple {16152#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); {16152#true} is VALID [2022-04-28 15:17:38,127 INFO L290 TraceCheckUtils]: 29: Hoare triple {16152#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {16152#true} is VALID [2022-04-28 15:17:38,127 INFO L290 TraceCheckUtils]: 30: Hoare triple {16152#true} ~skip~0 := 0; {16152#true} is VALID [2022-04-28 15:17:38,127 INFO L290 TraceCheckUtils]: 31: Hoare triple {16152#true} assume !false; {16152#true} is VALID [2022-04-28 15:17:38,127 INFO L290 TraceCheckUtils]: 32: Hoare triple {16152#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); {16152#true} is VALID [2022-04-28 15:17:38,127 INFO L290 TraceCheckUtils]: 33: Hoare triple {16152#true} assume 12292 == #t~mem47;havoc #t~mem47; {16152#true} is VALID [2022-04-28 15:17:38,127 INFO L290 TraceCheckUtils]: 34: Hoare triple {16152#true} call write~int(1, ~s.base, 60 + ~s.offset, 4); {16152#true} is VALID [2022-04-28 15:17:38,127 INFO L290 TraceCheckUtils]: 35: Hoare triple {16152#true} call write~int(1, ~s.base, 56 + ~s.offset, 4); {16152#true} is VALID [2022-04-28 15:17:38,127 INFO L290 TraceCheckUtils]: 36: Hoare triple {16152#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {16152#true} is VALID [2022-04-28 15:17:38,127 INFO L290 TraceCheckUtils]: 37: Hoare triple {16152#true} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {16152#true} is VALID [2022-04-28 15:17:38,127 INFO L290 TraceCheckUtils]: 38: Hoare triple {16152#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); {16152#true} is VALID [2022-04-28 15:17:38,128 INFO L290 TraceCheckUtils]: 39: Hoare triple {16152#true} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {16152#true} is VALID [2022-04-28 15:17:38,128 INFO L290 TraceCheckUtils]: 40: Hoare triple {16152#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); {16152#true} is VALID [2022-04-28 15:17:38,129 INFO L290 TraceCheckUtils]: 41: Hoare triple {16152#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); {16157#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:17:38,129 INFO L290 TraceCheckUtils]: 42: Hoare triple {16157#(= (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); {16157#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:17:38,130 INFO L290 TraceCheckUtils]: 43: Hoare triple {16157#(= (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; {16157#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:17:38,130 INFO L290 TraceCheckUtils]: 44: Hoare triple {16157#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} ~skip~0 := 0; {16157#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:17:38,131 INFO L290 TraceCheckUtils]: 45: Hoare triple {16157#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} assume !false; {16157#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:17:38,131 INFO L290 TraceCheckUtils]: 46: Hoare triple {16157#(= (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); {16157#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:17:38,132 INFO L290 TraceCheckUtils]: 47: Hoare triple {16157#(= (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); {16157#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:17:38,132 INFO L290 TraceCheckUtils]: 48: Hoare triple {16157#(= (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); {16157#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:17:38,132 INFO L290 TraceCheckUtils]: 49: Hoare triple {16157#(= (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); {16157#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:17:38,133 INFO L290 TraceCheckUtils]: 50: Hoare triple {16157#(= (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); {16157#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:17:38,133 INFO L290 TraceCheckUtils]: 51: Hoare triple {16157#(= (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); {16158#(= |ssl3_accept_#t~mem52| 8480)} is VALID [2022-04-28 15:17:38,134 INFO L290 TraceCheckUtils]: 52: Hoare triple {16158#(= |ssl3_accept_#t~mem52| 8480)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {16153#false} is VALID [2022-04-28 15:17:38,134 INFO L290 TraceCheckUtils]: 53: Hoare triple {16153#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {16153#false} is VALID [2022-04-28 15:17:38,134 INFO L290 TraceCheckUtils]: 54: Hoare triple {16153#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {16153#false} is VALID [2022-04-28 15:17:38,134 INFO L290 TraceCheckUtils]: 55: Hoare triple {16153#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {16153#false} is VALID [2022-04-28 15:17:38,134 INFO L290 TraceCheckUtils]: 56: Hoare triple {16153#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {16153#false} is VALID [2022-04-28 15:17:38,134 INFO L290 TraceCheckUtils]: 57: Hoare triple {16153#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {16153#false} is VALID [2022-04-28 15:17:38,134 INFO L290 TraceCheckUtils]: 58: Hoare triple {16153#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {16153#false} is VALID [2022-04-28 15:17:38,134 INFO L290 TraceCheckUtils]: 59: Hoare triple {16153#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {16153#false} is VALID [2022-04-28 15:17:38,134 INFO L290 TraceCheckUtils]: 60: Hoare triple {16153#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {16153#false} is VALID [2022-04-28 15:17:38,134 INFO L290 TraceCheckUtils]: 61: Hoare triple {16153#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {16153#false} is VALID [2022-04-28 15:17:38,135 INFO L290 TraceCheckUtils]: 62: Hoare triple {16153#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {16153#false} is VALID [2022-04-28 15:17:38,135 INFO L290 TraceCheckUtils]: 63: Hoare triple {16153#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {16153#false} is VALID [2022-04-28 15:17:38,135 INFO L290 TraceCheckUtils]: 64: Hoare triple {16153#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {16153#false} is VALID [2022-04-28 15:17:38,135 INFO L290 TraceCheckUtils]: 65: Hoare triple {16153#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {16153#false} is VALID [2022-04-28 15:17:38,135 INFO L290 TraceCheckUtils]: 66: Hoare triple {16153#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {16153#false} is VALID [2022-04-28 15:17:38,135 INFO L290 TraceCheckUtils]: 67: Hoare triple {16153#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {16153#false} is VALID [2022-04-28 15:17:38,135 INFO L290 TraceCheckUtils]: 68: Hoare triple {16153#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {16153#false} is VALID [2022-04-28 15:17:38,135 INFO L290 TraceCheckUtils]: 69: Hoare triple {16153#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {16153#false} is VALID [2022-04-28 15:17:38,135 INFO L290 TraceCheckUtils]: 70: Hoare triple {16153#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {16153#false} is VALID [2022-04-28 15:17:38,135 INFO L290 TraceCheckUtils]: 71: Hoare triple {16153#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {16153#false} is VALID [2022-04-28 15:17:38,136 INFO L290 TraceCheckUtils]: 72: Hoare triple {16153#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {16153#false} is VALID [2022-04-28 15:17:38,136 INFO L290 TraceCheckUtils]: 73: Hoare triple {16153#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {16153#false} is VALID [2022-04-28 15:17:38,136 INFO L290 TraceCheckUtils]: 74: Hoare triple {16153#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {16153#false} is VALID [2022-04-28 15:17:38,136 INFO L290 TraceCheckUtils]: 75: Hoare triple {16153#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {16153#false} is VALID [2022-04-28 15:17:38,136 INFO L290 TraceCheckUtils]: 76: Hoare triple {16153#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {16153#false} is VALID [2022-04-28 15:17:38,136 INFO L290 TraceCheckUtils]: 77: Hoare triple {16153#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {16153#false} is VALID [2022-04-28 15:17:38,136 INFO L290 TraceCheckUtils]: 78: Hoare triple {16153#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {16153#false} is VALID [2022-04-28 15:17:38,136 INFO L290 TraceCheckUtils]: 79: Hoare triple {16153#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 72 + ~s.offset, 4); {16153#false} is VALID [2022-04-28 15:17:38,136 INFO L290 TraceCheckUtils]: 80: Hoare triple {16153#false} assume 8673 == #t~mem80;havoc #t~mem80; {16153#false} is VALID [2022-04-28 15:17:38,136 INFO L290 TraceCheckUtils]: 81: Hoare triple {16153#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {16153#false} is VALID [2022-04-28 15:17:38,136 INFO L290 TraceCheckUtils]: 82: Hoare triple {16153#false} assume 3 == ~blastFlag~0; {16153#false} is VALID [2022-04-28 15:17:38,137 INFO L290 TraceCheckUtils]: 83: Hoare triple {16153#false} assume !false; {16153#false} is VALID [2022-04-28 15:17:38,137 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 15:17:38,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:17:38,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680329785] [2022-04-28 15:17:38,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680329785] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:38,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:38,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:38,138 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:17:38,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [255388656] [2022-04-28 15:17:38,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [255388656] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:38,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:38,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:38,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806994562] [2022-04-28 15:17:38,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:17:38,139 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 84 [2022-04-28 15:17:38,139 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:17:38,139 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:38,214 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:38,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:17:38,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:38,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:17:38,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:17:38,215 INFO L87 Difference]: Start difference. First operand 213 states and 333 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:41,383 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:17:43,388 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:17:45,411 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:17:47,434 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:17:48,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:48,608 INFO L93 Difference]: Finished difference Result 429 states and 679 transitions. [2022-04-28 15:17:48,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:17:48,609 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 84 [2022-04-28 15:17:48,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:17:48,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:48,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 434 transitions. [2022-04-28 15:17:48,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:48,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 434 transitions. [2022-04-28 15:17:48,615 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 434 transitions. [2022-04-28 15:17:48,970 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 434 edges. 434 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:48,974 INFO L225 Difference]: With dead ends: 429 [2022-04-28 15:17:48,975 INFO L226 Difference]: Without dead ends: 242 [2022-04-28 15:17:48,975 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:17:48,976 INFO L413 NwaCegarLoop]: 222 mSDtfsCounter, 22 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 10 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2022-04-28 15:17:48,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 548 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 389 Invalid, 3 Unknown, 0 Unchecked, 7.5s Time] [2022-04-28 15:17:48,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-04-28 15:17:48,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 229. [2022-04-28 15:17:48,984 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:17:48,985 INFO L82 GeneralOperation]: Start isEquivalent. First operand 242 states. Second operand has 229 states, 224 states have (on average 1.5848214285714286) internal successors, (355), 224 states have internal predecessors, (355), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:48,985 INFO L74 IsIncluded]: Start isIncluded. First operand 242 states. Second operand has 229 states, 224 states have (on average 1.5848214285714286) internal successors, (355), 224 states have internal predecessors, (355), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:48,985 INFO L87 Difference]: Start difference. First operand 242 states. Second operand has 229 states, 224 states have (on average 1.5848214285714286) internal successors, (355), 224 states have internal predecessors, (355), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:48,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:48,990 INFO L93 Difference]: Finished difference Result 242 states and 375 transitions. [2022-04-28 15:17:48,990 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 375 transitions. [2022-04-28 15:17:48,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:48,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:48,991 INFO L74 IsIncluded]: Start isIncluded. First operand has 229 states, 224 states have (on average 1.5848214285714286) internal successors, (355), 224 states have internal predecessors, (355), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 242 states. [2022-04-28 15:17:48,991 INFO L87 Difference]: Start difference. First operand has 229 states, 224 states have (on average 1.5848214285714286) internal successors, (355), 224 states have internal predecessors, (355), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 242 states. [2022-04-28 15:17:48,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:48,996 INFO L93 Difference]: Finished difference Result 242 states and 375 transitions. [2022-04-28 15:17:48,996 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 375 transitions. [2022-04-28 15:17:48,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:48,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:48,997 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:17:48,997 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:17:48,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 224 states have (on average 1.5848214285714286) internal successors, (355), 224 states have internal predecessors, (355), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:49,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 359 transitions. [2022-04-28 15:17:49,002 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 359 transitions. Word has length 84 [2022-04-28 15:17:49,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:17:49,002 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 359 transitions. [2022-04-28 15:17:49,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:49,003 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 229 states and 359 transitions. [2022-04-28 15:17:49,275 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 359 edges. 359 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:49,279 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 359 transitions. [2022-04-28 15:17:49,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-28 15:17:49,280 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:17:49,280 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:17:49,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-28 15:17:49,281 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:17:49,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:17:49,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1133208273, now seen corresponding path program 1 times [2022-04-28 15:17:49,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:49,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [908646243] [2022-04-28 15:17:49,318 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:17:49,318 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:17:49,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1133208273, now seen corresponding path program 2 times [2022-04-28 15:17:49,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:17:49,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713010556] [2022-04-28 15:17:49,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:17:49,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:17:49,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:49,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:17:49,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:49,489 INFO L290 TraceCheckUtils]: 0: Hoare triple {17971#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {17964#true} is VALID [2022-04-28 15:17:49,489 INFO L290 TraceCheckUtils]: 1: Hoare triple {17964#true} assume true; {17964#true} is VALID [2022-04-28 15:17:49,489 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17964#true} {17964#true} #662#return; {17964#true} is VALID [2022-04-28 15:17:49,490 INFO L272 TraceCheckUtils]: 0: Hoare triple {17964#true} call ULTIMATE.init(); {17971#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:17:49,490 INFO L290 TraceCheckUtils]: 1: Hoare triple {17971#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {17964#true} is VALID [2022-04-28 15:17:49,490 INFO L290 TraceCheckUtils]: 2: Hoare triple {17964#true} assume true; {17964#true} is VALID [2022-04-28 15:17:49,490 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17964#true} {17964#true} #662#return; {17964#true} is VALID [2022-04-28 15:17:49,491 INFO L272 TraceCheckUtils]: 4: Hoare triple {17964#true} call #t~ret161 := main(); {17964#true} is VALID [2022-04-28 15:17:49,491 INFO L290 TraceCheckUtils]: 5: Hoare triple {17964#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~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);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; {17964#true} is VALID [2022-04-28 15:17:49,491 INFO L290 TraceCheckUtils]: 6: Hoare triple {17964#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {17964#true} is VALID [2022-04-28 15:17:49,491 INFO L272 TraceCheckUtils]: 7: Hoare triple {17964#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {17964#true} is VALID [2022-04-28 15:17:49,491 INFO L290 TraceCheckUtils]: 8: Hoare triple {17964#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;~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); {17964#true} is VALID [2022-04-28 15:17:49,491 INFO L290 TraceCheckUtils]: 9: Hoare triple {17964#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; {17964#true} is VALID [2022-04-28 15:17:49,491 INFO L290 TraceCheckUtils]: 10: Hoare triple {17964#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; {17964#true} is VALID [2022-04-28 15:17:49,491 INFO L290 TraceCheckUtils]: 11: Hoare triple {17964#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {17964#true} is VALID [2022-04-28 15:17:49,491 INFO L290 TraceCheckUtils]: 12: Hoare triple {17964#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {17964#true} is VALID [2022-04-28 15:17:49,491 INFO L290 TraceCheckUtils]: 13: Hoare triple {17964#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {17964#true} is VALID [2022-04-28 15:17:49,492 INFO L290 TraceCheckUtils]: 14: Hoare triple {17964#true} assume !false; {17964#true} is VALID [2022-04-28 15:17:49,492 INFO L290 TraceCheckUtils]: 15: Hoare triple {17964#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); {17964#true} is VALID [2022-04-28 15:17:49,492 INFO L290 TraceCheckUtils]: 16: Hoare triple {17964#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {17964#true} is VALID [2022-04-28 15:17:49,492 INFO L290 TraceCheckUtils]: 17: Hoare triple {17964#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {17964#true} is VALID [2022-04-28 15:17:49,492 INFO L290 TraceCheckUtils]: 18: Hoare triple {17964#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {17964#true} is VALID [2022-04-28 15:17:49,492 INFO L290 TraceCheckUtils]: 19: Hoare triple {17964#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {17964#true} is VALID [2022-04-28 15:17:49,492 INFO L290 TraceCheckUtils]: 20: Hoare triple {17964#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {17964#true} is VALID [2022-04-28 15:17:49,492 INFO L290 TraceCheckUtils]: 21: Hoare triple {17964#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {17964#true} is VALID [2022-04-28 15:17:49,492 INFO L290 TraceCheckUtils]: 22: Hoare triple {17964#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {17964#true} is VALID [2022-04-28 15:17:49,492 INFO L290 TraceCheckUtils]: 23: Hoare triple {17964#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {17964#true} is VALID [2022-04-28 15:17:49,493 INFO L290 TraceCheckUtils]: 24: Hoare triple {17964#true} assume 8464 == #t~mem55;havoc #t~mem55; {17964#true} is VALID [2022-04-28 15:17:49,493 INFO L290 TraceCheckUtils]: 25: Hoare triple {17964#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; {17964#true} is VALID [2022-04-28 15:17:49,493 INFO L290 TraceCheckUtils]: 26: Hoare triple {17964#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {17964#true} is VALID [2022-04-28 15:17:49,494 INFO L290 TraceCheckUtils]: 27: Hoare triple {17964#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); {17969#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:49,495 INFO L290 TraceCheckUtils]: 28: Hoare triple {17969#(= 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); {17969#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:49,495 INFO L290 TraceCheckUtils]: 29: Hoare triple {17969#(= 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; {17969#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:49,495 INFO L290 TraceCheckUtils]: 30: Hoare triple {17969#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {17969#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:49,496 INFO L290 TraceCheckUtils]: 31: Hoare triple {17969#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {17969#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:49,496 INFO L290 TraceCheckUtils]: 32: Hoare triple {17969#(= 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); {17969#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:49,497 INFO L290 TraceCheckUtils]: 33: Hoare triple {17969#(= 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); {17969#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:49,497 INFO L290 TraceCheckUtils]: 34: Hoare triple {17969#(= 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); {17969#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:49,497 INFO L290 TraceCheckUtils]: 35: Hoare triple {17969#(= 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); {17969#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:49,498 INFO L290 TraceCheckUtils]: 36: Hoare triple {17969#(= 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); {17969#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:49,498 INFO L290 TraceCheckUtils]: 37: Hoare triple {17969#(= 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); {17969#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:49,499 INFO L290 TraceCheckUtils]: 38: Hoare triple {17969#(= 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); {17970#(= |ssl3_accept_#t~mem53| 8496)} is VALID [2022-04-28 15:17:49,499 INFO L290 TraceCheckUtils]: 39: Hoare triple {17970#(= |ssl3_accept_#t~mem53| 8496)} assume 8481 == #t~mem53;havoc #t~mem53; {17965#false} is VALID [2022-04-28 15:17:49,499 INFO L290 TraceCheckUtils]: 40: Hoare triple {17965#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; {17965#false} is VALID [2022-04-28 15:17:49,499 INFO L290 TraceCheckUtils]: 41: Hoare triple {17965#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); {17965#false} is VALID [2022-04-28 15:17:49,499 INFO L290 TraceCheckUtils]: 42: Hoare triple {17965#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); {17965#false} is VALID [2022-04-28 15:17:49,500 INFO L290 TraceCheckUtils]: 43: Hoare triple {17965#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {17965#false} is VALID [2022-04-28 15:17:49,500 INFO L290 TraceCheckUtils]: 44: Hoare triple {17965#false} ~skip~0 := 0; {17965#false} is VALID [2022-04-28 15:17:49,500 INFO L290 TraceCheckUtils]: 45: Hoare triple {17965#false} assume !false; {17965#false} is VALID [2022-04-28 15:17:49,500 INFO L290 TraceCheckUtils]: 46: Hoare triple {17965#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); {17965#false} is VALID [2022-04-28 15:17:49,500 INFO L290 TraceCheckUtils]: 47: Hoare triple {17965#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {17965#false} is VALID [2022-04-28 15:17:49,500 INFO L290 TraceCheckUtils]: 48: Hoare triple {17965#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {17965#false} is VALID [2022-04-28 15:17:49,500 INFO L290 TraceCheckUtils]: 49: Hoare triple {17965#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {17965#false} is VALID [2022-04-28 15:17:49,500 INFO L290 TraceCheckUtils]: 50: Hoare triple {17965#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {17965#false} is VALID [2022-04-28 15:17:49,500 INFO L290 TraceCheckUtils]: 51: Hoare triple {17965#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {17965#false} is VALID [2022-04-28 15:17:49,500 INFO L290 TraceCheckUtils]: 52: Hoare triple {17965#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {17965#false} is VALID [2022-04-28 15:17:49,501 INFO L290 TraceCheckUtils]: 53: Hoare triple {17965#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {17965#false} is VALID [2022-04-28 15:17:49,501 INFO L290 TraceCheckUtils]: 54: Hoare triple {17965#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {17965#false} is VALID [2022-04-28 15:17:49,501 INFO L290 TraceCheckUtils]: 55: Hoare triple {17965#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {17965#false} is VALID [2022-04-28 15:17:49,501 INFO L290 TraceCheckUtils]: 56: Hoare triple {17965#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {17965#false} is VALID [2022-04-28 15:17:49,501 INFO L290 TraceCheckUtils]: 57: Hoare triple {17965#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {17965#false} is VALID [2022-04-28 15:17:49,501 INFO L290 TraceCheckUtils]: 58: Hoare triple {17965#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {17965#false} is VALID [2022-04-28 15:17:49,501 INFO L290 TraceCheckUtils]: 59: Hoare triple {17965#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {17965#false} is VALID [2022-04-28 15:17:49,501 INFO L290 TraceCheckUtils]: 60: Hoare triple {17965#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {17965#false} is VALID [2022-04-28 15:17:49,501 INFO L290 TraceCheckUtils]: 61: Hoare triple {17965#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {17965#false} is VALID [2022-04-28 15:17:49,501 INFO L290 TraceCheckUtils]: 62: Hoare triple {17965#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {17965#false} is VALID [2022-04-28 15:17:49,502 INFO L290 TraceCheckUtils]: 63: Hoare triple {17965#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {17965#false} is VALID [2022-04-28 15:17:49,502 INFO L290 TraceCheckUtils]: 64: Hoare triple {17965#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {17965#false} is VALID [2022-04-28 15:17:49,502 INFO L290 TraceCheckUtils]: 65: Hoare triple {17965#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {17965#false} is VALID [2022-04-28 15:17:49,502 INFO L290 TraceCheckUtils]: 66: Hoare triple {17965#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {17965#false} is VALID [2022-04-28 15:17:49,502 INFO L290 TraceCheckUtils]: 67: Hoare triple {17965#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {17965#false} is VALID [2022-04-28 15:17:49,502 INFO L290 TraceCheckUtils]: 68: Hoare triple {17965#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {17965#false} is VALID [2022-04-28 15:17:49,502 INFO L290 TraceCheckUtils]: 69: Hoare triple {17965#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {17965#false} is VALID [2022-04-28 15:17:49,502 INFO L290 TraceCheckUtils]: 70: Hoare triple {17965#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {17965#false} is VALID [2022-04-28 15:17:49,502 INFO L290 TraceCheckUtils]: 71: Hoare triple {17965#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {17965#false} is VALID [2022-04-28 15:17:49,502 INFO L290 TraceCheckUtils]: 72: Hoare triple {17965#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {17965#false} is VALID [2022-04-28 15:17:49,503 INFO L290 TraceCheckUtils]: 73: Hoare triple {17965#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {17965#false} is VALID [2022-04-28 15:17:49,503 INFO L290 TraceCheckUtils]: 74: Hoare triple {17965#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {17965#false} is VALID [2022-04-28 15:17:49,503 INFO L290 TraceCheckUtils]: 75: Hoare triple {17965#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {17965#false} is VALID [2022-04-28 15:17:49,503 INFO L290 TraceCheckUtils]: 76: Hoare triple {17965#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {17965#false} is VALID [2022-04-28 15:17:49,503 INFO L290 TraceCheckUtils]: 77: Hoare triple {17965#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {17965#false} is VALID [2022-04-28 15:17:49,503 INFO L290 TraceCheckUtils]: 78: Hoare triple {17965#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {17965#false} is VALID [2022-04-28 15:17:49,503 INFO L290 TraceCheckUtils]: 79: Hoare triple {17965#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 72 + ~s.offset, 4); {17965#false} is VALID [2022-04-28 15:17:49,503 INFO L290 TraceCheckUtils]: 80: Hoare triple {17965#false} assume 8673 == #t~mem80;havoc #t~mem80; {17965#false} is VALID [2022-04-28 15:17:49,503 INFO L290 TraceCheckUtils]: 81: Hoare triple {17965#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {17965#false} is VALID [2022-04-28 15:17:49,503 INFO L290 TraceCheckUtils]: 82: Hoare triple {17965#false} assume 3 == ~blastFlag~0; {17965#false} is VALID [2022-04-28 15:17:49,504 INFO L290 TraceCheckUtils]: 83: Hoare triple {17965#false} assume !false; {17965#false} is VALID [2022-04-28 15:17:49,504 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:17:49,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:17:49,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713010556] [2022-04-28 15:17:49,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713010556] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:49,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:49,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:49,505 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:17:49,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [908646243] [2022-04-28 15:17:49,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [908646243] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:49,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:49,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:49,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668645695] [2022-04-28 15:17:49,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:17:49,506 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 84 [2022-04-28 15:17:49,506 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:17:49,506 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:49,585 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:49,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:17:49,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:49,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:17:49,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:17:49,588 INFO L87 Difference]: Start difference. First operand 229 states and 359 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:51,614 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:17:52,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:52,628 INFO L93 Difference]: Finished difference Result 451 states and 713 transitions. [2022-04-28 15:17:52,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:17:52,628 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 84 [2022-04-28 15:17:52,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:17:52,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:52,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 453 transitions. [2022-04-28 15:17:52,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:52,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 453 transitions. [2022-04-28 15:17:52,634 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 453 transitions. [2022-04-28 15:17:53,004 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 453 edges. 453 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:53,009 INFO L225 Difference]: With dead ends: 451 [2022-04-28 15:17:53,010 INFO L226 Difference]: Without dead ends: 248 [2022-04-28 15:17:53,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:17:53,011 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 37 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:17:53,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 477 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 379 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 15:17:53,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-04-28 15:17:53,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 229. [2022-04-28 15:17:53,020 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:17:53,021 INFO L82 GeneralOperation]: Start isEquivalent. First operand 248 states. Second operand has 229 states, 224 states have (on average 1.5803571428571428) internal successors, (354), 224 states have internal predecessors, (354), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:53,021 INFO L74 IsIncluded]: Start isIncluded. First operand 248 states. Second operand has 229 states, 224 states have (on average 1.5803571428571428) internal successors, (354), 224 states have internal predecessors, (354), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:53,022 INFO L87 Difference]: Start difference. First operand 248 states. Second operand has 229 states, 224 states have (on average 1.5803571428571428) internal successors, (354), 224 states have internal predecessors, (354), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:53,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:53,026 INFO L93 Difference]: Finished difference Result 248 states and 383 transitions. [2022-04-28 15:17:53,026 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 383 transitions. [2022-04-28 15:17:53,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:53,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:53,027 INFO L74 IsIncluded]: Start isIncluded. First operand has 229 states, 224 states have (on average 1.5803571428571428) internal successors, (354), 224 states have internal predecessors, (354), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 248 states. [2022-04-28 15:17:53,028 INFO L87 Difference]: Start difference. First operand has 229 states, 224 states have (on average 1.5803571428571428) internal successors, (354), 224 states have internal predecessors, (354), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 248 states. [2022-04-28 15:17:53,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:53,033 INFO L93 Difference]: Finished difference Result 248 states and 383 transitions. [2022-04-28 15:17:53,033 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 383 transitions. [2022-04-28 15:17:53,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:53,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:53,033 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:17:53,033 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:17:53,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 224 states have (on average 1.5803571428571428) internal successors, (354), 224 states have internal predecessors, (354), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:53,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 358 transitions. [2022-04-28 15:17:53,039 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 358 transitions. Word has length 84 [2022-04-28 15:17:53,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:17:53,039 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 358 transitions. [2022-04-28 15:17:53,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:53,039 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 229 states and 358 transitions. [2022-04-28 15:17:53,334 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 358 edges. 358 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:53,334 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 358 transitions. [2022-04-28 15:17:53,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-28 15:17:53,335 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:17:53,335 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:17:53,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-28 15:17:53,336 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:17:53,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:17:53,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1502086990, now seen corresponding path program 1 times [2022-04-28 15:17:53,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:53,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [17905964] [2022-04-28 15:17:53,377 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:17:53,377 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:17:53,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1502086990, now seen corresponding path program 2 times [2022-04-28 15:17:53,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:17:53,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167371734] [2022-04-28 15:17:53,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:17:53,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:17:53,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:53,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:17:53,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:53,510 INFO L290 TraceCheckUtils]: 0: Hoare triple {19839#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {19832#true} is VALID [2022-04-28 15:17:53,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {19832#true} assume true; {19832#true} is VALID [2022-04-28 15:17:53,510 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19832#true} {19832#true} #662#return; {19832#true} is VALID [2022-04-28 15:17:53,511 INFO L272 TraceCheckUtils]: 0: Hoare triple {19832#true} call ULTIMATE.init(); {19839#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:17:53,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {19839#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {19832#true} is VALID [2022-04-28 15:17:53,511 INFO L290 TraceCheckUtils]: 2: Hoare triple {19832#true} assume true; {19832#true} is VALID [2022-04-28 15:17:53,511 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19832#true} {19832#true} #662#return; {19832#true} is VALID [2022-04-28 15:17:53,512 INFO L272 TraceCheckUtils]: 4: Hoare triple {19832#true} call #t~ret161 := main(); {19832#true} is VALID [2022-04-28 15:17:53,512 INFO L290 TraceCheckUtils]: 5: Hoare triple {19832#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~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);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; {19832#true} is VALID [2022-04-28 15:17:53,512 INFO L290 TraceCheckUtils]: 6: Hoare triple {19832#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {19832#true} is VALID [2022-04-28 15:17:53,512 INFO L272 TraceCheckUtils]: 7: Hoare triple {19832#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {19832#true} is VALID [2022-04-28 15:17:53,512 INFO L290 TraceCheckUtils]: 8: Hoare triple {19832#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;~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); {19832#true} is VALID [2022-04-28 15:17:53,512 INFO L290 TraceCheckUtils]: 9: Hoare triple {19832#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; {19832#true} is VALID [2022-04-28 15:17:53,512 INFO L290 TraceCheckUtils]: 10: Hoare triple {19832#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; {19832#true} is VALID [2022-04-28 15:17:53,512 INFO L290 TraceCheckUtils]: 11: Hoare triple {19832#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {19832#true} is VALID [2022-04-28 15:17:53,512 INFO L290 TraceCheckUtils]: 12: Hoare triple {19832#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {19832#true} is VALID [2022-04-28 15:17:53,512 INFO L290 TraceCheckUtils]: 13: Hoare triple {19832#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {19832#true} is VALID [2022-04-28 15:17:53,513 INFO L290 TraceCheckUtils]: 14: Hoare triple {19832#true} assume !false; {19832#true} is VALID [2022-04-28 15:17:53,513 INFO L290 TraceCheckUtils]: 15: Hoare triple {19832#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); {19832#true} is VALID [2022-04-28 15:17:53,513 INFO L290 TraceCheckUtils]: 16: Hoare triple {19832#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {19832#true} is VALID [2022-04-28 15:17:53,513 INFO L290 TraceCheckUtils]: 17: Hoare triple {19832#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {19832#true} is VALID [2022-04-28 15:17:53,513 INFO L290 TraceCheckUtils]: 18: Hoare triple {19832#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {19832#true} is VALID [2022-04-28 15:17:53,513 INFO L290 TraceCheckUtils]: 19: Hoare triple {19832#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {19832#true} is VALID [2022-04-28 15:17:53,513 INFO L290 TraceCheckUtils]: 20: Hoare triple {19832#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {19832#true} is VALID [2022-04-28 15:17:53,513 INFO L290 TraceCheckUtils]: 21: Hoare triple {19832#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {19832#true} is VALID [2022-04-28 15:17:53,513 INFO L290 TraceCheckUtils]: 22: Hoare triple {19832#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {19832#true} is VALID [2022-04-28 15:17:53,513 INFO L290 TraceCheckUtils]: 23: Hoare triple {19832#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {19832#true} is VALID [2022-04-28 15:17:53,514 INFO L290 TraceCheckUtils]: 24: Hoare triple {19832#true} assume 8464 == #t~mem55;havoc #t~mem55; {19832#true} is VALID [2022-04-28 15:17:53,514 INFO L290 TraceCheckUtils]: 25: Hoare triple {19832#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; {19832#true} is VALID [2022-04-28 15:17:53,514 INFO L290 TraceCheckUtils]: 26: Hoare triple {19832#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {19832#true} is VALID [2022-04-28 15:17:53,515 INFO L290 TraceCheckUtils]: 27: Hoare triple {19832#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); {19837#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:53,515 INFO L290 TraceCheckUtils]: 28: Hoare triple {19837#(= 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); {19837#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:53,516 INFO L290 TraceCheckUtils]: 29: Hoare triple {19837#(= 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; {19837#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:53,516 INFO L290 TraceCheckUtils]: 30: Hoare triple {19837#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {19837#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:53,517 INFO L290 TraceCheckUtils]: 31: Hoare triple {19837#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {19837#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:53,517 INFO L290 TraceCheckUtils]: 32: Hoare triple {19837#(= 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); {19837#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:53,517 INFO L290 TraceCheckUtils]: 33: Hoare triple {19837#(= 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); {19837#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:53,518 INFO L290 TraceCheckUtils]: 34: Hoare triple {19837#(= 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); {19837#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:53,518 INFO L290 TraceCheckUtils]: 35: Hoare triple {19837#(= 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); {19837#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:53,519 INFO L290 TraceCheckUtils]: 36: Hoare triple {19837#(= 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); {19837#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:53,519 INFO L290 TraceCheckUtils]: 37: Hoare triple {19837#(= 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); {19837#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:53,520 INFO L290 TraceCheckUtils]: 38: Hoare triple {19837#(= 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); {19837#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:53,520 INFO L290 TraceCheckUtils]: 39: Hoare triple {19837#(= 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); {19838#(= |ssl3_accept_#t~mem54| 8496)} is VALID [2022-04-28 15:17:53,520 INFO L290 TraceCheckUtils]: 40: Hoare triple {19838#(= |ssl3_accept_#t~mem54| 8496)} assume 8482 == #t~mem54;havoc #t~mem54; {19833#false} is VALID [2022-04-28 15:17:53,521 INFO L290 TraceCheckUtils]: 41: Hoare triple {19833#false} call write~int(3, ~s.base, 72 + ~s.offset, 4); {19833#false} is VALID [2022-04-28 15:17:53,521 INFO L290 TraceCheckUtils]: 42: Hoare triple {19833#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); {19833#false} is VALID [2022-04-28 15:17:53,521 INFO L290 TraceCheckUtils]: 43: Hoare triple {19833#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {19833#false} is VALID [2022-04-28 15:17:53,521 INFO L290 TraceCheckUtils]: 44: Hoare triple {19833#false} ~skip~0 := 0; {19833#false} is VALID [2022-04-28 15:17:53,521 INFO L290 TraceCheckUtils]: 45: Hoare triple {19833#false} assume !false; {19833#false} is VALID [2022-04-28 15:17:53,521 INFO L290 TraceCheckUtils]: 46: Hoare triple {19833#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); {19833#false} is VALID [2022-04-28 15:17:53,521 INFO L290 TraceCheckUtils]: 47: Hoare triple {19833#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {19833#false} is VALID [2022-04-28 15:17:53,521 INFO L290 TraceCheckUtils]: 48: Hoare triple {19833#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {19833#false} is VALID [2022-04-28 15:17:53,521 INFO L290 TraceCheckUtils]: 49: Hoare triple {19833#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {19833#false} is VALID [2022-04-28 15:17:53,521 INFO L290 TraceCheckUtils]: 50: Hoare triple {19833#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {19833#false} is VALID [2022-04-28 15:17:53,522 INFO L290 TraceCheckUtils]: 51: Hoare triple {19833#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {19833#false} is VALID [2022-04-28 15:17:53,522 INFO L290 TraceCheckUtils]: 52: Hoare triple {19833#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {19833#false} is VALID [2022-04-28 15:17:53,522 INFO L290 TraceCheckUtils]: 53: Hoare triple {19833#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {19833#false} is VALID [2022-04-28 15:17:53,522 INFO L290 TraceCheckUtils]: 54: Hoare triple {19833#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {19833#false} is VALID [2022-04-28 15:17:53,522 INFO L290 TraceCheckUtils]: 55: Hoare triple {19833#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {19833#false} is VALID [2022-04-28 15:17:53,522 INFO L290 TraceCheckUtils]: 56: Hoare triple {19833#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {19833#false} is VALID [2022-04-28 15:17:53,522 INFO L290 TraceCheckUtils]: 57: Hoare triple {19833#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {19833#false} is VALID [2022-04-28 15:17:53,522 INFO L290 TraceCheckUtils]: 58: Hoare triple {19833#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {19833#false} is VALID [2022-04-28 15:17:53,522 INFO L290 TraceCheckUtils]: 59: Hoare triple {19833#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {19833#false} is VALID [2022-04-28 15:17:53,522 INFO L290 TraceCheckUtils]: 60: Hoare triple {19833#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {19833#false} is VALID [2022-04-28 15:17:53,523 INFO L290 TraceCheckUtils]: 61: Hoare triple {19833#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {19833#false} is VALID [2022-04-28 15:17:53,523 INFO L290 TraceCheckUtils]: 62: Hoare triple {19833#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {19833#false} is VALID [2022-04-28 15:17:53,523 INFO L290 TraceCheckUtils]: 63: Hoare triple {19833#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {19833#false} is VALID [2022-04-28 15:17:53,523 INFO L290 TraceCheckUtils]: 64: Hoare triple {19833#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {19833#false} is VALID [2022-04-28 15:17:53,523 INFO L290 TraceCheckUtils]: 65: Hoare triple {19833#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {19833#false} is VALID [2022-04-28 15:17:53,523 INFO L290 TraceCheckUtils]: 66: Hoare triple {19833#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {19833#false} is VALID [2022-04-28 15:17:53,523 INFO L290 TraceCheckUtils]: 67: Hoare triple {19833#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {19833#false} is VALID [2022-04-28 15:17:53,523 INFO L290 TraceCheckUtils]: 68: Hoare triple {19833#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {19833#false} is VALID [2022-04-28 15:17:53,523 INFO L290 TraceCheckUtils]: 69: Hoare triple {19833#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {19833#false} is VALID [2022-04-28 15:17:53,524 INFO L290 TraceCheckUtils]: 70: Hoare triple {19833#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {19833#false} is VALID [2022-04-28 15:17:53,524 INFO L290 TraceCheckUtils]: 71: Hoare triple {19833#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {19833#false} is VALID [2022-04-28 15:17:53,524 INFO L290 TraceCheckUtils]: 72: Hoare triple {19833#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {19833#false} is VALID [2022-04-28 15:17:53,524 INFO L290 TraceCheckUtils]: 73: Hoare triple {19833#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {19833#false} is VALID [2022-04-28 15:17:53,524 INFO L290 TraceCheckUtils]: 74: Hoare triple {19833#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {19833#false} is VALID [2022-04-28 15:17:53,524 INFO L290 TraceCheckUtils]: 75: Hoare triple {19833#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {19833#false} is VALID [2022-04-28 15:17:53,524 INFO L290 TraceCheckUtils]: 76: Hoare triple {19833#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {19833#false} is VALID [2022-04-28 15:17:53,524 INFO L290 TraceCheckUtils]: 77: Hoare triple {19833#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {19833#false} is VALID [2022-04-28 15:17:53,524 INFO L290 TraceCheckUtils]: 78: Hoare triple {19833#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {19833#false} is VALID [2022-04-28 15:17:53,524 INFO L290 TraceCheckUtils]: 79: Hoare triple {19833#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 72 + ~s.offset, 4); {19833#false} is VALID [2022-04-28 15:17:53,525 INFO L290 TraceCheckUtils]: 80: Hoare triple {19833#false} assume 8673 == #t~mem80;havoc #t~mem80; {19833#false} is VALID [2022-04-28 15:17:53,525 INFO L290 TraceCheckUtils]: 81: Hoare triple {19833#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {19833#false} is VALID [2022-04-28 15:17:53,525 INFO L290 TraceCheckUtils]: 82: Hoare triple {19833#false} assume 3 == ~blastFlag~0; {19833#false} is VALID [2022-04-28 15:17:53,525 INFO L290 TraceCheckUtils]: 83: Hoare triple {19833#false} assume !false; {19833#false} is VALID [2022-04-28 15:17:53,525 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:17:53,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:17:53,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167371734] [2022-04-28 15:17:53,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167371734] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:53,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:53,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:53,526 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:17:53,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [17905964] [2022-04-28 15:17:53,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [17905964] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:53,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:53,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:53,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626227145] [2022-04-28 15:17:53,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:17:53,527 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 84 [2022-04-28 15:17:53,527 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:17:53,527 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:53,600 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:53,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:17:53,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:53,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:17:53,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:17:53,601 INFO L87 Difference]: Start difference. First operand 229 states and 358 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:55,631 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:17:56,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:56,587 INFO L93 Difference]: Finished difference Result 450 states and 710 transitions. [2022-04-28 15:17:56,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:17:56,588 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 84 [2022-04-28 15:17:56,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:17:56,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:56,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 451 transitions. [2022-04-28 15:17:56,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:56,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 451 transitions. [2022-04-28 15:17:56,594 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 451 transitions. [2022-04-28 15:17:56,987 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 451 edges. 451 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:56,991 INFO L225 Difference]: With dead ends: 450 [2022-04-28 15:17:56,991 INFO L226 Difference]: Without dead ends: 247 [2022-04-28 15:17:56,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:17:56,995 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 35 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:17:56,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 479 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 377 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 15:17:56,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-04-28 15:17:57,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 229. [2022-04-28 15:17:57,003 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:17:57,003 INFO L82 GeneralOperation]: Start isEquivalent. First operand 247 states. Second operand has 229 states, 224 states have (on average 1.5758928571428572) internal successors, (353), 224 states have internal predecessors, (353), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:57,004 INFO L74 IsIncluded]: Start isIncluded. First operand 247 states. Second operand has 229 states, 224 states have (on average 1.5758928571428572) internal successors, (353), 224 states have internal predecessors, (353), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:57,004 INFO L87 Difference]: Start difference. First operand 247 states. Second operand has 229 states, 224 states have (on average 1.5758928571428572) internal successors, (353), 224 states have internal predecessors, (353), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:57,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:57,008 INFO L93 Difference]: Finished difference Result 247 states and 381 transitions. [2022-04-28 15:17:57,008 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 381 transitions. [2022-04-28 15:17:57,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:57,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:57,010 INFO L74 IsIncluded]: Start isIncluded. First operand has 229 states, 224 states have (on average 1.5758928571428572) internal successors, (353), 224 states have internal predecessors, (353), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 247 states. [2022-04-28 15:17:57,010 INFO L87 Difference]: Start difference. First operand has 229 states, 224 states have (on average 1.5758928571428572) internal successors, (353), 224 states have internal predecessors, (353), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 247 states. [2022-04-28 15:17:57,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:57,016 INFO L93 Difference]: Finished difference Result 247 states and 381 transitions. [2022-04-28 15:17:57,016 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 381 transitions. [2022-04-28 15:17:57,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:57,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:57,016 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:17:57,016 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:17:57,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 224 states have (on average 1.5758928571428572) internal successors, (353), 224 states have internal predecessors, (353), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:57,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 357 transitions. [2022-04-28 15:17:57,022 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 357 transitions. Word has length 84 [2022-04-28 15:17:57,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:17:57,022 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 357 transitions. [2022-04-28 15:17:57,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:57,022 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 229 states and 357 transitions. [2022-04-28 15:17:57,305 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 357 edges. 357 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:57,305 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 357 transitions. [2022-04-28 15:17:57,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-28 15:17:57,306 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:17:57,306 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:17:57,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-28 15:17:57,306 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:17:57,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:17:57,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1487677531, now seen corresponding path program 1 times [2022-04-28 15:17:57,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:57,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1614681067] [2022-04-28 15:17:57,344 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:17:57,344 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:17:57,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1487677531, now seen corresponding path program 2 times [2022-04-28 15:17:57,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:17:57,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036196902] [2022-04-28 15:17:57,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:17:57,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:17:57,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:57,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:17:57,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:57,515 INFO L290 TraceCheckUtils]: 0: Hoare triple {21704#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {21696#true} is VALID [2022-04-28 15:17:57,515 INFO L290 TraceCheckUtils]: 1: Hoare triple {21696#true} assume true; {21696#true} is VALID [2022-04-28 15:17:57,515 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21696#true} {21696#true} #662#return; {21696#true} is VALID [2022-04-28 15:17:57,516 INFO L272 TraceCheckUtils]: 0: Hoare triple {21696#true} call ULTIMATE.init(); {21704#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:17:57,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {21704#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {21696#true} is VALID [2022-04-28 15:17:57,516 INFO L290 TraceCheckUtils]: 2: Hoare triple {21696#true} assume true; {21696#true} is VALID [2022-04-28 15:17:57,516 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21696#true} {21696#true} #662#return; {21696#true} is VALID [2022-04-28 15:17:57,517 INFO L272 TraceCheckUtils]: 4: Hoare triple {21696#true} call #t~ret161 := main(); {21696#true} is VALID [2022-04-28 15:17:57,517 INFO L290 TraceCheckUtils]: 5: Hoare triple {21696#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~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);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; {21696#true} is VALID [2022-04-28 15:17:57,517 INFO L290 TraceCheckUtils]: 6: Hoare triple {21696#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {21696#true} is VALID [2022-04-28 15:17:57,517 INFO L272 TraceCheckUtils]: 7: Hoare triple {21696#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {21696#true} is VALID [2022-04-28 15:17:57,517 INFO L290 TraceCheckUtils]: 8: Hoare triple {21696#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;~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); {21696#true} is VALID [2022-04-28 15:17:57,517 INFO L290 TraceCheckUtils]: 9: Hoare triple {21696#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; {21696#true} is VALID [2022-04-28 15:17:57,517 INFO L290 TraceCheckUtils]: 10: Hoare triple {21696#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; {21696#true} is VALID [2022-04-28 15:17:57,517 INFO L290 TraceCheckUtils]: 11: Hoare triple {21696#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {21696#true} is VALID [2022-04-28 15:17:57,517 INFO L290 TraceCheckUtils]: 12: Hoare triple {21696#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {21696#true} is VALID [2022-04-28 15:17:57,517 INFO L290 TraceCheckUtils]: 13: Hoare triple {21696#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {21696#true} is VALID [2022-04-28 15:17:57,518 INFO L290 TraceCheckUtils]: 14: Hoare triple {21696#true} assume !false; {21696#true} is VALID [2022-04-28 15:17:57,518 INFO L290 TraceCheckUtils]: 15: Hoare triple {21696#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); {21696#true} is VALID [2022-04-28 15:17:57,518 INFO L290 TraceCheckUtils]: 16: Hoare triple {21696#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {21696#true} is VALID [2022-04-28 15:17:57,518 INFO L290 TraceCheckUtils]: 17: Hoare triple {21696#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {21696#true} is VALID [2022-04-28 15:17:57,518 INFO L290 TraceCheckUtils]: 18: Hoare triple {21696#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {21696#true} is VALID [2022-04-28 15:17:57,518 INFO L290 TraceCheckUtils]: 19: Hoare triple {21696#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {21696#true} is VALID [2022-04-28 15:17:57,518 INFO L290 TraceCheckUtils]: 20: Hoare triple {21696#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {21696#true} is VALID [2022-04-28 15:17:57,518 INFO L290 TraceCheckUtils]: 21: Hoare triple {21696#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {21696#true} is VALID [2022-04-28 15:17:57,518 INFO L290 TraceCheckUtils]: 22: Hoare triple {21696#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {21696#true} is VALID [2022-04-28 15:17:57,518 INFO L290 TraceCheckUtils]: 23: Hoare triple {21696#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {21696#true} is VALID [2022-04-28 15:17:57,519 INFO L290 TraceCheckUtils]: 24: Hoare triple {21696#true} assume 8464 == #t~mem55;havoc #t~mem55; {21696#true} is VALID [2022-04-28 15:17:57,519 INFO L290 TraceCheckUtils]: 25: Hoare triple {21696#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; {21696#true} is VALID [2022-04-28 15:17:57,519 INFO L290 TraceCheckUtils]: 26: Hoare triple {21696#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {21696#true} is VALID [2022-04-28 15:17:57,519 INFO L290 TraceCheckUtils]: 27: Hoare triple {21696#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); {21696#true} is VALID [2022-04-28 15:17:57,519 INFO L290 TraceCheckUtils]: 28: Hoare triple {21696#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); {21696#true} is VALID [2022-04-28 15:17:57,519 INFO L290 TraceCheckUtils]: 29: Hoare triple {21696#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {21696#true} is VALID [2022-04-28 15:17:57,519 INFO L290 TraceCheckUtils]: 30: Hoare triple {21696#true} ~skip~0 := 0; {21696#true} is VALID [2022-04-28 15:17:57,519 INFO L290 TraceCheckUtils]: 31: Hoare triple {21696#true} assume !false; {21696#true} is VALID [2022-04-28 15:17:57,520 INFO L290 TraceCheckUtils]: 32: Hoare triple {21696#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); {21701#(= |ssl3_accept_#t~mem47| (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:57,520 INFO L290 TraceCheckUtils]: 33: Hoare triple {21701#(= |ssl3_accept_#t~mem47| (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 12292 == #t~mem47;havoc #t~mem47; {21702#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:57,521 INFO L290 TraceCheckUtils]: 34: Hoare triple {21702#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call write~int(1, ~s.base, 60 + ~s.offset, 4); {21702#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:57,522 INFO L290 TraceCheckUtils]: 35: Hoare triple {21702#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call write~int(1, ~s.base, 56 + ~s.offset, 4); {21702#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:57,522 INFO L290 TraceCheckUtils]: 36: Hoare triple {21702#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {21702#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:57,522 INFO L290 TraceCheckUtils]: 37: Hoare triple {21702#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {21702#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:57,523 INFO L290 TraceCheckUtils]: 38: Hoare triple {21702#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} 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); {21702#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:57,524 INFO L290 TraceCheckUtils]: 39: Hoare triple {21702#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {21702#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:57,525 INFO L290 TraceCheckUtils]: 40: Hoare triple {21702#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} 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); {21703#(= 12292 |ssl3_accept_#t~mem85|)} is VALID [2022-04-28 15:17:57,525 INFO L290 TraceCheckUtils]: 41: Hoare triple {21703#(= 12292 |ssl3_accept_#t~mem85|)} assume 12292 != #t~mem85;havoc #t~mem85; {21697#false} is VALID [2022-04-28 15:17:57,525 INFO L290 TraceCheckUtils]: 42: Hoare triple {21697#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; {21697#false} is VALID [2022-04-28 15:17:57,525 INFO L290 TraceCheckUtils]: 43: Hoare triple {21697#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); {21697#false} is VALID [2022-04-28 15:17:57,525 INFO L290 TraceCheckUtils]: 44: Hoare triple {21697#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {21697#false} is VALID [2022-04-28 15:17:57,526 INFO L290 TraceCheckUtils]: 45: Hoare triple {21697#false} ~skip~0 := 0; {21697#false} is VALID [2022-04-28 15:17:57,526 INFO L290 TraceCheckUtils]: 46: Hoare triple {21697#false} assume !false; {21697#false} is VALID [2022-04-28 15:17:57,526 INFO L290 TraceCheckUtils]: 47: Hoare triple {21697#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); {21697#false} is VALID [2022-04-28 15:17:57,526 INFO L290 TraceCheckUtils]: 48: Hoare triple {21697#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {21697#false} is VALID [2022-04-28 15:17:57,526 INFO L290 TraceCheckUtils]: 49: Hoare triple {21697#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {21697#false} is VALID [2022-04-28 15:17:57,526 INFO L290 TraceCheckUtils]: 50: Hoare triple {21697#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {21697#false} is VALID [2022-04-28 15:17:57,526 INFO L290 TraceCheckUtils]: 51: Hoare triple {21697#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {21697#false} is VALID [2022-04-28 15:17:57,526 INFO L290 TraceCheckUtils]: 52: Hoare triple {21697#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {21697#false} is VALID [2022-04-28 15:17:57,526 INFO L290 TraceCheckUtils]: 53: Hoare triple {21697#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {21697#false} is VALID [2022-04-28 15:17:57,527 INFO L290 TraceCheckUtils]: 54: Hoare triple {21697#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {21697#false} is VALID [2022-04-28 15:17:57,527 INFO L290 TraceCheckUtils]: 55: Hoare triple {21697#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {21697#false} is VALID [2022-04-28 15:17:57,527 INFO L290 TraceCheckUtils]: 56: Hoare triple {21697#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {21697#false} is VALID [2022-04-28 15:17:57,527 INFO L290 TraceCheckUtils]: 57: Hoare triple {21697#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {21697#false} is VALID [2022-04-28 15:17:57,527 INFO L290 TraceCheckUtils]: 58: Hoare triple {21697#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {21697#false} is VALID [2022-04-28 15:17:57,527 INFO L290 TraceCheckUtils]: 59: Hoare triple {21697#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {21697#false} is VALID [2022-04-28 15:17:57,527 INFO L290 TraceCheckUtils]: 60: Hoare triple {21697#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {21697#false} is VALID [2022-04-28 15:17:57,527 INFO L290 TraceCheckUtils]: 61: Hoare triple {21697#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {21697#false} is VALID [2022-04-28 15:17:57,527 INFO L290 TraceCheckUtils]: 62: Hoare triple {21697#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {21697#false} is VALID [2022-04-28 15:17:57,527 INFO L290 TraceCheckUtils]: 63: Hoare triple {21697#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {21697#false} is VALID [2022-04-28 15:17:57,528 INFO L290 TraceCheckUtils]: 64: Hoare triple {21697#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {21697#false} is VALID [2022-04-28 15:17:57,528 INFO L290 TraceCheckUtils]: 65: Hoare triple {21697#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {21697#false} is VALID [2022-04-28 15:17:57,528 INFO L290 TraceCheckUtils]: 66: Hoare triple {21697#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {21697#false} is VALID [2022-04-28 15:17:57,528 INFO L290 TraceCheckUtils]: 67: Hoare triple {21697#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {21697#false} is VALID [2022-04-28 15:17:57,528 INFO L290 TraceCheckUtils]: 68: Hoare triple {21697#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {21697#false} is VALID [2022-04-28 15:17:57,528 INFO L290 TraceCheckUtils]: 69: Hoare triple {21697#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {21697#false} is VALID [2022-04-28 15:17:57,528 INFO L290 TraceCheckUtils]: 70: Hoare triple {21697#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {21697#false} is VALID [2022-04-28 15:17:57,528 INFO L290 TraceCheckUtils]: 71: Hoare triple {21697#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {21697#false} is VALID [2022-04-28 15:17:57,528 INFO L290 TraceCheckUtils]: 72: Hoare triple {21697#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {21697#false} is VALID [2022-04-28 15:17:57,528 INFO L290 TraceCheckUtils]: 73: Hoare triple {21697#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {21697#false} is VALID [2022-04-28 15:17:57,529 INFO L290 TraceCheckUtils]: 74: Hoare triple {21697#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {21697#false} is VALID [2022-04-28 15:17:57,529 INFO L290 TraceCheckUtils]: 75: Hoare triple {21697#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {21697#false} is VALID [2022-04-28 15:17:57,529 INFO L290 TraceCheckUtils]: 76: Hoare triple {21697#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {21697#false} is VALID [2022-04-28 15:17:57,529 INFO L290 TraceCheckUtils]: 77: Hoare triple {21697#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {21697#false} is VALID [2022-04-28 15:17:57,529 INFO L290 TraceCheckUtils]: 78: Hoare triple {21697#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {21697#false} is VALID [2022-04-28 15:17:57,529 INFO L290 TraceCheckUtils]: 79: Hoare triple {21697#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {21697#false} is VALID [2022-04-28 15:17:57,529 INFO L290 TraceCheckUtils]: 80: Hoare triple {21697#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 72 + ~s.offset, 4); {21697#false} is VALID [2022-04-28 15:17:57,529 INFO L290 TraceCheckUtils]: 81: Hoare triple {21697#false} assume 8673 == #t~mem80;havoc #t~mem80; {21697#false} is VALID [2022-04-28 15:17:57,529 INFO L290 TraceCheckUtils]: 82: Hoare triple {21697#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {21697#false} is VALID [2022-04-28 15:17:57,529 INFO L290 TraceCheckUtils]: 83: Hoare triple {21697#false} assume 3 == ~blastFlag~0; {21697#false} is VALID [2022-04-28 15:17:57,529 INFO L290 TraceCheckUtils]: 84: Hoare triple {21697#false} assume !false; {21697#false} is VALID [2022-04-28 15:17:57,530 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 15:17:57,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:17:57,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036196902] [2022-04-28 15:17:57,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036196902] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:57,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:57,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 15:17:57,532 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:17:57,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1614681067] [2022-04-28 15:17:57,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1614681067] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:57,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:57,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 15:17:57,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471530074] [2022-04-28 15:17:57,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:17:57,533 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 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 85 [2022-04-28 15:17:57,533 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:17:57,534 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:57,604 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:57,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 15:17:57,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:57,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 15:17:57,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:17:57,605 INFO L87 Difference]: Start difference. First operand 229 states and 357 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:01,248 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-28 15:18:03,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-28 15:18:05,277 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:18:07,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-28 15:18:09,328 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:18:10,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:10,407 INFO L93 Difference]: Finished difference Result 441 states and 696 transitions. [2022-04-28 15:18:10,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 15:18:10,408 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 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 85 [2022-04-28 15:18:10,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:18:10,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:10,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 403 transitions. [2022-04-28 15:18:10,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:10,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 403 transitions. [2022-04-28 15:18:10,411 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 403 transitions. [2022-04-28 15:18:10,675 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 403 edges. 403 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:18:10,678 INFO L225 Difference]: With dead ends: 441 [2022-04-28 15:18:10,678 INFO L226 Difference]: Without dead ends: 238 [2022-04-28 15:18:10,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 15:18:10,679 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 3 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 4 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:18:10,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 593 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 422 Invalid, 4 Unknown, 0 Unchecked, 10.0s Time] [2022-04-28 15:18:10,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-04-28 15:18:10,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2022-04-28 15:18:10,687 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:18:10,688 INFO L82 GeneralOperation]: Start isEquivalent. First operand 238 states. Second operand has 238 states, 233 states have (on average 1.5622317596566524) internal successors, (364), 233 states have internal predecessors, (364), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:10,688 INFO L74 IsIncluded]: Start isIncluded. First operand 238 states. Second operand has 238 states, 233 states have (on average 1.5622317596566524) internal successors, (364), 233 states have internal predecessors, (364), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:10,688 INFO L87 Difference]: Start difference. First operand 238 states. Second operand has 238 states, 233 states have (on average 1.5622317596566524) internal successors, (364), 233 states have internal predecessors, (364), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:10,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:10,693 INFO L93 Difference]: Finished difference Result 238 states and 368 transitions. [2022-04-28 15:18:10,693 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 368 transitions. [2022-04-28 15:18:10,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:18:10,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:18:10,694 INFO L74 IsIncluded]: Start isIncluded. First operand has 238 states, 233 states have (on average 1.5622317596566524) internal successors, (364), 233 states have internal predecessors, (364), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 238 states. [2022-04-28 15:18:10,694 INFO L87 Difference]: Start difference. First operand has 238 states, 233 states have (on average 1.5622317596566524) internal successors, (364), 233 states have internal predecessors, (364), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 238 states. [2022-04-28 15:18:10,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:10,698 INFO L93 Difference]: Finished difference Result 238 states and 368 transitions. [2022-04-28 15:18:10,699 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 368 transitions. [2022-04-28 15:18:10,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:18:10,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:18:10,699 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:18:10,699 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:18:10,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 233 states have (on average 1.5622317596566524) internal successors, (364), 233 states have internal predecessors, (364), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:10,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 368 transitions. [2022-04-28 15:18:10,705 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 368 transitions. Word has length 85 [2022-04-28 15:18:10,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:18:10,705 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 368 transitions. [2022-04-28 15:18:10,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:10,705 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 238 states and 368 transitions. [2022-04-28 15:18:11,019 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 368 edges. 368 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:18:11,019 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 368 transitions. [2022-04-28 15:18:11,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-28 15:18:11,020 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:18:11,020 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:18:11,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-28 15:18:11,021 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:18:11,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:18:11,021 INFO L85 PathProgramCache]: Analyzing trace with hash 681790009, now seen corresponding path program 1 times [2022-04-28 15:18:11,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:18:11,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1894469161] [2022-04-28 15:18:11,057 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:18:11,058 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:18:11,058 INFO L85 PathProgramCache]: Analyzing trace with hash 681790009, now seen corresponding path program 2 times [2022-04-28 15:18:11,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:18:11,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572168296] [2022-04-28 15:18:11,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:18:11,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:18:11,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:18:11,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:18:11,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:18:11,208 INFO L290 TraceCheckUtils]: 0: Hoare triple {23550#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {23543#true} is VALID [2022-04-28 15:18:11,208 INFO L290 TraceCheckUtils]: 1: Hoare triple {23543#true} assume true; {23543#true} is VALID [2022-04-28 15:18:11,208 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23543#true} {23543#true} #662#return; {23543#true} is VALID [2022-04-28 15:18:11,209 INFO L272 TraceCheckUtils]: 0: Hoare triple {23543#true} call ULTIMATE.init(); {23550#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:18:11,209 INFO L290 TraceCheckUtils]: 1: Hoare triple {23550#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {23543#true} is VALID [2022-04-28 15:18:11,209 INFO L290 TraceCheckUtils]: 2: Hoare triple {23543#true} assume true; {23543#true} is VALID [2022-04-28 15:18:11,209 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23543#true} {23543#true} #662#return; {23543#true} is VALID [2022-04-28 15:18:11,209 INFO L272 TraceCheckUtils]: 4: Hoare triple {23543#true} call #t~ret161 := main(); {23543#true} is VALID [2022-04-28 15:18:11,209 INFO L290 TraceCheckUtils]: 5: Hoare triple {23543#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~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);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; {23543#true} is VALID [2022-04-28 15:18:11,209 INFO L290 TraceCheckUtils]: 6: Hoare triple {23543#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {23543#true} is VALID [2022-04-28 15:18:11,210 INFO L272 TraceCheckUtils]: 7: Hoare triple {23543#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {23543#true} is VALID [2022-04-28 15:18:11,210 INFO L290 TraceCheckUtils]: 8: Hoare triple {23543#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;~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); {23543#true} is VALID [2022-04-28 15:18:11,210 INFO L290 TraceCheckUtils]: 9: Hoare triple {23543#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; {23543#true} is VALID [2022-04-28 15:18:11,210 INFO L290 TraceCheckUtils]: 10: Hoare triple {23543#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; {23543#true} is VALID [2022-04-28 15:18:11,210 INFO L290 TraceCheckUtils]: 11: Hoare triple {23543#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {23543#true} is VALID [2022-04-28 15:18:11,210 INFO L290 TraceCheckUtils]: 12: Hoare triple {23543#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {23543#true} is VALID [2022-04-28 15:18:11,210 INFO L290 TraceCheckUtils]: 13: Hoare triple {23543#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {23543#true} is VALID [2022-04-28 15:18:11,210 INFO L290 TraceCheckUtils]: 14: Hoare triple {23543#true} assume !false; {23543#true} is VALID [2022-04-28 15:18:11,210 INFO L290 TraceCheckUtils]: 15: Hoare triple {23543#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); {23543#true} is VALID [2022-04-28 15:18:11,210 INFO L290 TraceCheckUtils]: 16: Hoare triple {23543#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {23543#true} is VALID [2022-04-28 15:18:11,211 INFO L290 TraceCheckUtils]: 17: Hoare triple {23543#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {23543#true} is VALID [2022-04-28 15:18:11,211 INFO L290 TraceCheckUtils]: 18: Hoare triple {23543#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {23543#true} is VALID [2022-04-28 15:18:11,211 INFO L290 TraceCheckUtils]: 19: Hoare triple {23543#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {23543#true} is VALID [2022-04-28 15:18:11,211 INFO L290 TraceCheckUtils]: 20: Hoare triple {23543#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {23543#true} is VALID [2022-04-28 15:18:11,211 INFO L290 TraceCheckUtils]: 21: Hoare triple {23543#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {23543#true} is VALID [2022-04-28 15:18:11,211 INFO L290 TraceCheckUtils]: 22: Hoare triple {23543#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {23543#true} is VALID [2022-04-28 15:18:11,211 INFO L290 TraceCheckUtils]: 23: Hoare triple {23543#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {23543#true} is VALID [2022-04-28 15:18:11,211 INFO L290 TraceCheckUtils]: 24: Hoare triple {23543#true} assume 8464 == #t~mem55;havoc #t~mem55; {23543#true} is VALID [2022-04-28 15:18:11,215 INFO L290 TraceCheckUtils]: 25: Hoare triple {23543#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; {23543#true} is VALID [2022-04-28 15:18:11,215 INFO L290 TraceCheckUtils]: 26: Hoare triple {23543#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {23543#true} is VALID [2022-04-28 15:18:11,217 INFO L290 TraceCheckUtils]: 27: Hoare triple {23543#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); {23548#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-28 15:18:11,217 INFO L290 TraceCheckUtils]: 28: Hoare triple {23548#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {23548#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-28 15:18:11,218 INFO L290 TraceCheckUtils]: 29: Hoare triple {23548#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {23548#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-28 15:18:11,218 INFO L290 TraceCheckUtils]: 30: Hoare triple {23548#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} ~skip~0 := 0; {23548#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-28 15:18:11,218 INFO L290 TraceCheckUtils]: 31: Hoare triple {23548#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} assume !false; {23548#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-28 15:18:11,219 INFO L290 TraceCheckUtils]: 32: Hoare triple {23548#(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); {23548#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-28 15:18:11,219 INFO L290 TraceCheckUtils]: 33: Hoare triple {23548#(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); {23549#(not (= |ssl3_accept_#t~mem48| 16384))} is VALID [2022-04-28 15:18:11,220 INFO L290 TraceCheckUtils]: 34: Hoare triple {23549#(not (= |ssl3_accept_#t~mem48| 16384))} assume 16384 == #t~mem48;havoc #t~mem48; {23544#false} is VALID [2022-04-28 15:18:11,220 INFO L290 TraceCheckUtils]: 35: Hoare triple {23544#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {23544#false} is VALID [2022-04-28 15:18:11,220 INFO L290 TraceCheckUtils]: 36: Hoare triple {23544#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {23544#false} is VALID [2022-04-28 15:18:11,220 INFO L290 TraceCheckUtils]: 37: Hoare triple {23544#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {23544#false} is VALID [2022-04-28 15:18:11,220 INFO L290 TraceCheckUtils]: 38: Hoare triple {23544#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); {23544#false} is VALID [2022-04-28 15:18:11,220 INFO L290 TraceCheckUtils]: 39: Hoare triple {23544#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {23544#false} is VALID [2022-04-28 15:18:11,220 INFO L290 TraceCheckUtils]: 40: Hoare triple {23544#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); {23544#false} is VALID [2022-04-28 15:18:11,220 INFO L290 TraceCheckUtils]: 41: Hoare triple {23544#false} assume 12292 != #t~mem85;havoc #t~mem85; {23544#false} is VALID [2022-04-28 15:18:11,220 INFO L290 TraceCheckUtils]: 42: Hoare triple {23544#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; {23544#false} is VALID [2022-04-28 15:18:11,221 INFO L290 TraceCheckUtils]: 43: Hoare triple {23544#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); {23544#false} is VALID [2022-04-28 15:18:11,221 INFO L290 TraceCheckUtils]: 44: Hoare triple {23544#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {23544#false} is VALID [2022-04-28 15:18:11,221 INFO L290 TraceCheckUtils]: 45: Hoare triple {23544#false} ~skip~0 := 0; {23544#false} is VALID [2022-04-28 15:18:11,221 INFO L290 TraceCheckUtils]: 46: Hoare triple {23544#false} assume !false; {23544#false} is VALID [2022-04-28 15:18:11,221 INFO L290 TraceCheckUtils]: 47: Hoare triple {23544#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); {23544#false} is VALID [2022-04-28 15:18:11,221 INFO L290 TraceCheckUtils]: 48: Hoare triple {23544#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {23544#false} is VALID [2022-04-28 15:18:11,221 INFO L290 TraceCheckUtils]: 49: Hoare triple {23544#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {23544#false} is VALID [2022-04-28 15:18:11,221 INFO L290 TraceCheckUtils]: 50: Hoare triple {23544#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {23544#false} is VALID [2022-04-28 15:18:11,221 INFO L290 TraceCheckUtils]: 51: Hoare triple {23544#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {23544#false} is VALID [2022-04-28 15:18:11,221 INFO L290 TraceCheckUtils]: 52: Hoare triple {23544#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {23544#false} is VALID [2022-04-28 15:18:11,222 INFO L290 TraceCheckUtils]: 53: Hoare triple {23544#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {23544#false} is VALID [2022-04-28 15:18:11,222 INFO L290 TraceCheckUtils]: 54: Hoare triple {23544#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {23544#false} is VALID [2022-04-28 15:18:11,222 INFO L290 TraceCheckUtils]: 55: Hoare triple {23544#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {23544#false} is VALID [2022-04-28 15:18:11,222 INFO L290 TraceCheckUtils]: 56: Hoare triple {23544#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {23544#false} is VALID [2022-04-28 15:18:11,222 INFO L290 TraceCheckUtils]: 57: Hoare triple {23544#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {23544#false} is VALID [2022-04-28 15:18:11,222 INFO L290 TraceCheckUtils]: 58: Hoare triple {23544#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {23544#false} is VALID [2022-04-28 15:18:11,222 INFO L290 TraceCheckUtils]: 59: Hoare triple {23544#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {23544#false} is VALID [2022-04-28 15:18:11,222 INFO L290 TraceCheckUtils]: 60: Hoare triple {23544#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {23544#false} is VALID [2022-04-28 15:18:11,222 INFO L290 TraceCheckUtils]: 61: Hoare triple {23544#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {23544#false} is VALID [2022-04-28 15:18:11,223 INFO L290 TraceCheckUtils]: 62: Hoare triple {23544#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {23544#false} is VALID [2022-04-28 15:18:11,223 INFO L290 TraceCheckUtils]: 63: Hoare triple {23544#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {23544#false} is VALID [2022-04-28 15:18:11,223 INFO L290 TraceCheckUtils]: 64: Hoare triple {23544#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {23544#false} is VALID [2022-04-28 15:18:11,223 INFO L290 TraceCheckUtils]: 65: Hoare triple {23544#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {23544#false} is VALID [2022-04-28 15:18:11,223 INFO L290 TraceCheckUtils]: 66: Hoare triple {23544#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {23544#false} is VALID [2022-04-28 15:18:11,223 INFO L290 TraceCheckUtils]: 67: Hoare triple {23544#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {23544#false} is VALID [2022-04-28 15:18:11,223 INFO L290 TraceCheckUtils]: 68: Hoare triple {23544#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {23544#false} is VALID [2022-04-28 15:18:11,223 INFO L290 TraceCheckUtils]: 69: Hoare triple {23544#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {23544#false} is VALID [2022-04-28 15:18:11,223 INFO L290 TraceCheckUtils]: 70: Hoare triple {23544#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {23544#false} is VALID [2022-04-28 15:18:11,223 INFO L290 TraceCheckUtils]: 71: Hoare triple {23544#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {23544#false} is VALID [2022-04-28 15:18:11,224 INFO L290 TraceCheckUtils]: 72: Hoare triple {23544#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {23544#false} is VALID [2022-04-28 15:18:11,224 INFO L290 TraceCheckUtils]: 73: Hoare triple {23544#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {23544#false} is VALID [2022-04-28 15:18:11,224 INFO L290 TraceCheckUtils]: 74: Hoare triple {23544#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {23544#false} is VALID [2022-04-28 15:18:11,224 INFO L290 TraceCheckUtils]: 75: Hoare triple {23544#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {23544#false} is VALID [2022-04-28 15:18:11,224 INFO L290 TraceCheckUtils]: 76: Hoare triple {23544#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {23544#false} is VALID [2022-04-28 15:18:11,224 INFO L290 TraceCheckUtils]: 77: Hoare triple {23544#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {23544#false} is VALID [2022-04-28 15:18:11,224 INFO L290 TraceCheckUtils]: 78: Hoare triple {23544#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {23544#false} is VALID [2022-04-28 15:18:11,224 INFO L290 TraceCheckUtils]: 79: Hoare triple {23544#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {23544#false} is VALID [2022-04-28 15:18:11,224 INFO L290 TraceCheckUtils]: 80: Hoare triple {23544#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 72 + ~s.offset, 4); {23544#false} is VALID [2022-04-28 15:18:11,225 INFO L290 TraceCheckUtils]: 81: Hoare triple {23544#false} assume 8673 == #t~mem80;havoc #t~mem80; {23544#false} is VALID [2022-04-28 15:18:11,225 INFO L290 TraceCheckUtils]: 82: Hoare triple {23544#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {23544#false} is VALID [2022-04-28 15:18:11,225 INFO L290 TraceCheckUtils]: 83: Hoare triple {23544#false} assume 3 == ~blastFlag~0; {23544#false} is VALID [2022-04-28 15:18:11,225 INFO L290 TraceCheckUtils]: 84: Hoare triple {23544#false} assume !false; {23544#false} is VALID [2022-04-28 15:18:11,225 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:18:11,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:18:11,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572168296] [2022-04-28 15:18:11,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572168296] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:18:11,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:18:11,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:18:11,226 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:18:11,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1894469161] [2022-04-28 15:18:11,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1894469161] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:18:11,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:18:11,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:18:11,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447809133] [2022-04-28 15:18:11,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:18:11,227 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2022-04-28 15:18:11,227 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:18:11,227 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:11,297 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:18:11,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:18:11,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:18:11,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:18:11,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:18:11,298 INFO L87 Difference]: Start difference. First operand 238 states and 368 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:13,324 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:18:14,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:14,442 INFO L93 Difference]: Finished difference Result 573 states and 893 transitions. [2022-04-28 15:18:14,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:18:14,442 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2022-04-28 15:18:14,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:18:14,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:14,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 567 transitions. [2022-04-28 15:18:14,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:14,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 567 transitions. [2022-04-28 15:18:14,447 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 567 transitions. [2022-04-28 15:18:14,837 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 567 edges. 567 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:18:14,867 INFO L225 Difference]: With dead ends: 573 [2022-04-28 15:18:14,868 INFO L226 Difference]: Without dead ends: 361 [2022-04-28 15:18:14,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:18:14,871 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 142 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 64 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 15:18:14,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 314 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 464 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 15:18:14,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2022-04-28 15:18:14,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 250. [2022-04-28 15:18:14,882 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:18:14,883 INFO L82 GeneralOperation]: Start isEquivalent. First operand 361 states. Second operand has 250 states, 245 states have (on average 1.546938775510204) internal successors, (379), 245 states have internal predecessors, (379), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:14,883 INFO L74 IsIncluded]: Start isIncluded. First operand 361 states. Second operand has 250 states, 245 states have (on average 1.546938775510204) internal successors, (379), 245 states have internal predecessors, (379), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:14,884 INFO L87 Difference]: Start difference. First operand 361 states. Second operand has 250 states, 245 states have (on average 1.546938775510204) internal successors, (379), 245 states have internal predecessors, (379), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:14,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:14,891 INFO L93 Difference]: Finished difference Result 361 states and 551 transitions. [2022-04-28 15:18:14,891 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 551 transitions. [2022-04-28 15:18:14,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:18:14,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:18:14,892 INFO L74 IsIncluded]: Start isIncluded. First operand has 250 states, 245 states have (on average 1.546938775510204) internal successors, (379), 245 states have internal predecessors, (379), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 361 states. [2022-04-28 15:18:14,892 INFO L87 Difference]: Start difference. First operand has 250 states, 245 states have (on average 1.546938775510204) internal successors, (379), 245 states have internal predecessors, (379), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 361 states. [2022-04-28 15:18:14,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:14,900 INFO L93 Difference]: Finished difference Result 361 states and 551 transitions. [2022-04-28 15:18:14,900 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 551 transitions. [2022-04-28 15:18:14,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:18:14,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:18:14,900 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:18:14,901 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:18:14,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 245 states have (on average 1.546938775510204) internal successors, (379), 245 states have internal predecessors, (379), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:14,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 383 transitions. [2022-04-28 15:18:14,906 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 383 transitions. Word has length 85 [2022-04-28 15:18:14,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:18:14,907 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 383 transitions. [2022-04-28 15:18:14,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:14,907 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 383 transitions. [2022-04-28 15:18:15,188 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 383 edges. 383 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:18:15,191 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 383 transitions. [2022-04-28 15:18:15,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-28 15:18:15,192 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:18:15,192 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:18:15,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-28 15:18:15,192 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:18:15,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:18:15,193 INFO L85 PathProgramCache]: Analyzing trace with hash -2033895406, now seen corresponding path program 1 times [2022-04-28 15:18:15,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:18:15,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [511227052] [2022-04-28 15:18:15,235 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:18:15,235 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:18:15,235 INFO L85 PathProgramCache]: Analyzing trace with hash -2033895406, now seen corresponding path program 2 times [2022-04-28 15:18:15,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:18:15,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281635414] [2022-04-28 15:18:15,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:18:15,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:18:15,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:18:15,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:18:15,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:18:15,389 INFO L290 TraceCheckUtils]: 0: Hoare triple {25930#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {25923#true} is VALID [2022-04-28 15:18:15,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {25923#true} assume true; {25923#true} is VALID [2022-04-28 15:18:15,389 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25923#true} {25923#true} #662#return; {25923#true} is VALID [2022-04-28 15:18:15,390 INFO L272 TraceCheckUtils]: 0: Hoare triple {25923#true} call ULTIMATE.init(); {25930#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:18:15,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {25930#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {25923#true} is VALID [2022-04-28 15:18:15,390 INFO L290 TraceCheckUtils]: 2: Hoare triple {25923#true} assume true; {25923#true} is VALID [2022-04-28 15:18:15,390 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25923#true} {25923#true} #662#return; {25923#true} is VALID [2022-04-28 15:18:15,391 INFO L272 TraceCheckUtils]: 4: Hoare triple {25923#true} call #t~ret161 := main(); {25923#true} is VALID [2022-04-28 15:18:15,391 INFO L290 TraceCheckUtils]: 5: Hoare triple {25923#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~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);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; {25923#true} is VALID [2022-04-28 15:18:15,391 INFO L290 TraceCheckUtils]: 6: Hoare triple {25923#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {25923#true} is VALID [2022-04-28 15:18:15,391 INFO L272 TraceCheckUtils]: 7: Hoare triple {25923#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {25923#true} is VALID [2022-04-28 15:18:15,391 INFO L290 TraceCheckUtils]: 8: Hoare triple {25923#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;~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); {25923#true} is VALID [2022-04-28 15:18:15,391 INFO L290 TraceCheckUtils]: 9: Hoare triple {25923#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; {25923#true} is VALID [2022-04-28 15:18:15,391 INFO L290 TraceCheckUtils]: 10: Hoare triple {25923#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; {25923#true} is VALID [2022-04-28 15:18:15,391 INFO L290 TraceCheckUtils]: 11: Hoare triple {25923#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {25923#true} is VALID [2022-04-28 15:18:15,391 INFO L290 TraceCheckUtils]: 12: Hoare triple {25923#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {25923#true} is VALID [2022-04-28 15:18:15,391 INFO L290 TraceCheckUtils]: 13: Hoare triple {25923#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {25923#true} is VALID [2022-04-28 15:18:15,392 INFO L290 TraceCheckUtils]: 14: Hoare triple {25923#true} assume !false; {25923#true} is VALID [2022-04-28 15:18:15,392 INFO L290 TraceCheckUtils]: 15: Hoare triple {25923#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); {25923#true} is VALID [2022-04-28 15:18:15,392 INFO L290 TraceCheckUtils]: 16: Hoare triple {25923#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {25923#true} is VALID [2022-04-28 15:18:15,392 INFO L290 TraceCheckUtils]: 17: Hoare triple {25923#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {25923#true} is VALID [2022-04-28 15:18:15,392 INFO L290 TraceCheckUtils]: 18: Hoare triple {25923#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {25923#true} is VALID [2022-04-28 15:18:15,392 INFO L290 TraceCheckUtils]: 19: Hoare triple {25923#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {25923#true} is VALID [2022-04-28 15:18:15,392 INFO L290 TraceCheckUtils]: 20: Hoare triple {25923#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {25923#true} is VALID [2022-04-28 15:18:15,392 INFO L290 TraceCheckUtils]: 21: Hoare triple {25923#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {25923#true} is VALID [2022-04-28 15:18:15,392 INFO L290 TraceCheckUtils]: 22: Hoare triple {25923#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {25923#true} is VALID [2022-04-28 15:18:15,392 INFO L290 TraceCheckUtils]: 23: Hoare triple {25923#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {25923#true} is VALID [2022-04-28 15:18:15,393 INFO L290 TraceCheckUtils]: 24: Hoare triple {25923#true} assume 8464 == #t~mem55;havoc #t~mem55; {25923#true} is VALID [2022-04-28 15:18:15,393 INFO L290 TraceCheckUtils]: 25: Hoare triple {25923#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; {25923#true} is VALID [2022-04-28 15:18:15,393 INFO L290 TraceCheckUtils]: 26: Hoare triple {25923#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {25923#true} is VALID [2022-04-28 15:18:15,394 INFO L290 TraceCheckUtils]: 27: Hoare triple {25923#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); {25928#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:15,394 INFO L290 TraceCheckUtils]: 28: Hoare triple {25928#(= 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); {25928#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:15,395 INFO L290 TraceCheckUtils]: 29: Hoare triple {25928#(= 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; {25928#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:15,395 INFO L290 TraceCheckUtils]: 30: Hoare triple {25928#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {25928#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:15,395 INFO L290 TraceCheckUtils]: 31: Hoare triple {25928#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {25928#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:15,396 INFO L290 TraceCheckUtils]: 32: Hoare triple {25928#(= 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); {25928#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:15,396 INFO L290 TraceCheckUtils]: 33: Hoare triple {25928#(= 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); {25928#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:15,397 INFO L290 TraceCheckUtils]: 34: Hoare triple {25928#(= 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); {25929#(= |ssl3_accept_#t~mem49| 8496)} is VALID [2022-04-28 15:18:15,397 INFO L290 TraceCheckUtils]: 35: Hoare triple {25929#(= |ssl3_accept_#t~mem49| 8496)} assume 8192 == #t~mem49;havoc #t~mem49; {25924#false} is VALID [2022-04-28 15:18:15,397 INFO L290 TraceCheckUtils]: 36: Hoare triple {25924#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {25924#false} is VALID [2022-04-28 15:18:15,397 INFO L290 TraceCheckUtils]: 37: Hoare triple {25924#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {25924#false} is VALID [2022-04-28 15:18:15,397 INFO L290 TraceCheckUtils]: 38: Hoare triple {25924#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {25924#false} is VALID [2022-04-28 15:18:15,398 INFO L290 TraceCheckUtils]: 39: Hoare triple {25924#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); {25924#false} is VALID [2022-04-28 15:18:15,398 INFO L290 TraceCheckUtils]: 40: Hoare triple {25924#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {25924#false} is VALID [2022-04-28 15:18:15,398 INFO L290 TraceCheckUtils]: 41: Hoare triple {25924#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); {25924#false} is VALID [2022-04-28 15:18:15,398 INFO L290 TraceCheckUtils]: 42: Hoare triple {25924#false} assume 12292 != #t~mem85;havoc #t~mem85; {25924#false} is VALID [2022-04-28 15:18:15,398 INFO L290 TraceCheckUtils]: 43: Hoare triple {25924#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; {25924#false} is VALID [2022-04-28 15:18:15,398 INFO L290 TraceCheckUtils]: 44: Hoare triple {25924#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); {25924#false} is VALID [2022-04-28 15:18:15,398 INFO L290 TraceCheckUtils]: 45: Hoare triple {25924#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {25924#false} is VALID [2022-04-28 15:18:15,398 INFO L290 TraceCheckUtils]: 46: Hoare triple {25924#false} ~skip~0 := 0; {25924#false} is VALID [2022-04-28 15:18:15,398 INFO L290 TraceCheckUtils]: 47: Hoare triple {25924#false} assume !false; {25924#false} is VALID [2022-04-28 15:18:15,398 INFO L290 TraceCheckUtils]: 48: Hoare triple {25924#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); {25924#false} is VALID [2022-04-28 15:18:15,398 INFO L290 TraceCheckUtils]: 49: Hoare triple {25924#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {25924#false} is VALID [2022-04-28 15:18:15,399 INFO L290 TraceCheckUtils]: 50: Hoare triple {25924#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {25924#false} is VALID [2022-04-28 15:18:15,399 INFO L290 TraceCheckUtils]: 51: Hoare triple {25924#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {25924#false} is VALID [2022-04-28 15:18:15,399 INFO L290 TraceCheckUtils]: 52: Hoare triple {25924#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {25924#false} is VALID [2022-04-28 15:18:15,399 INFO L290 TraceCheckUtils]: 53: Hoare triple {25924#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {25924#false} is VALID [2022-04-28 15:18:15,399 INFO L290 TraceCheckUtils]: 54: Hoare triple {25924#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {25924#false} is VALID [2022-04-28 15:18:15,399 INFO L290 TraceCheckUtils]: 55: Hoare triple {25924#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {25924#false} is VALID [2022-04-28 15:18:15,399 INFO L290 TraceCheckUtils]: 56: Hoare triple {25924#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {25924#false} is VALID [2022-04-28 15:18:15,399 INFO L290 TraceCheckUtils]: 57: Hoare triple {25924#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {25924#false} is VALID [2022-04-28 15:18:15,399 INFO L290 TraceCheckUtils]: 58: Hoare triple {25924#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {25924#false} is VALID [2022-04-28 15:18:15,399 INFO L290 TraceCheckUtils]: 59: Hoare triple {25924#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {25924#false} is VALID [2022-04-28 15:18:15,400 INFO L290 TraceCheckUtils]: 60: Hoare triple {25924#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {25924#false} is VALID [2022-04-28 15:18:15,400 INFO L290 TraceCheckUtils]: 61: Hoare triple {25924#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {25924#false} is VALID [2022-04-28 15:18:15,400 INFO L290 TraceCheckUtils]: 62: Hoare triple {25924#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {25924#false} is VALID [2022-04-28 15:18:15,400 INFO L290 TraceCheckUtils]: 63: Hoare triple {25924#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {25924#false} is VALID [2022-04-28 15:18:15,400 INFO L290 TraceCheckUtils]: 64: Hoare triple {25924#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {25924#false} is VALID [2022-04-28 15:18:15,400 INFO L290 TraceCheckUtils]: 65: Hoare triple {25924#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {25924#false} is VALID [2022-04-28 15:18:15,400 INFO L290 TraceCheckUtils]: 66: Hoare triple {25924#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {25924#false} is VALID [2022-04-28 15:18:15,400 INFO L290 TraceCheckUtils]: 67: Hoare triple {25924#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {25924#false} is VALID [2022-04-28 15:18:15,400 INFO L290 TraceCheckUtils]: 68: Hoare triple {25924#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {25924#false} is VALID [2022-04-28 15:18:15,400 INFO L290 TraceCheckUtils]: 69: Hoare triple {25924#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {25924#false} is VALID [2022-04-28 15:18:15,400 INFO L290 TraceCheckUtils]: 70: Hoare triple {25924#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {25924#false} is VALID [2022-04-28 15:18:15,401 INFO L290 TraceCheckUtils]: 71: Hoare triple {25924#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {25924#false} is VALID [2022-04-28 15:18:15,401 INFO L290 TraceCheckUtils]: 72: Hoare triple {25924#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {25924#false} is VALID [2022-04-28 15:18:15,401 INFO L290 TraceCheckUtils]: 73: Hoare triple {25924#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {25924#false} is VALID [2022-04-28 15:18:15,401 INFO L290 TraceCheckUtils]: 74: Hoare triple {25924#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {25924#false} is VALID [2022-04-28 15:18:15,401 INFO L290 TraceCheckUtils]: 75: Hoare triple {25924#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {25924#false} is VALID [2022-04-28 15:18:15,401 INFO L290 TraceCheckUtils]: 76: Hoare triple {25924#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {25924#false} is VALID [2022-04-28 15:18:15,401 INFO L290 TraceCheckUtils]: 77: Hoare triple {25924#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {25924#false} is VALID [2022-04-28 15:18:15,401 INFO L290 TraceCheckUtils]: 78: Hoare triple {25924#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {25924#false} is VALID [2022-04-28 15:18:15,401 INFO L290 TraceCheckUtils]: 79: Hoare triple {25924#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {25924#false} is VALID [2022-04-28 15:18:15,401 INFO L290 TraceCheckUtils]: 80: Hoare triple {25924#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {25924#false} is VALID [2022-04-28 15:18:15,402 INFO L290 TraceCheckUtils]: 81: Hoare triple {25924#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 72 + ~s.offset, 4); {25924#false} is VALID [2022-04-28 15:18:15,402 INFO L290 TraceCheckUtils]: 82: Hoare triple {25924#false} assume 8673 == #t~mem80;havoc #t~mem80; {25924#false} is VALID [2022-04-28 15:18:15,402 INFO L290 TraceCheckUtils]: 83: Hoare triple {25924#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {25924#false} is VALID [2022-04-28 15:18:15,402 INFO L290 TraceCheckUtils]: 84: Hoare triple {25924#false} assume 3 == ~blastFlag~0; {25924#false} is VALID [2022-04-28 15:18:15,402 INFO L290 TraceCheckUtils]: 85: Hoare triple {25924#false} assume !false; {25924#false} is VALID [2022-04-28 15:18:15,402 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:18:15,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:18:15,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281635414] [2022-04-28 15:18:15,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281635414] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:18:15,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:18:15,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:18:15,403 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:18:15,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [511227052] [2022-04-28 15:18:15,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [511227052] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:18:15,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:18:15,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:18:15,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553566651] [2022-04-28 15:18:15,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:18:15,404 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 86 [2022-04-28 15:18:15,404 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:18:15,404 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:15,477 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:18:15,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:18:15,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:18:15,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:18:15,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:18:15,479 INFO L87 Difference]: Start difference. First operand 250 states and 383 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:19,278 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:18:21,282 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:18:23,311 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:18:25,337 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:18:26,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:26,321 INFO L93 Difference]: Finished difference Result 501 states and 771 transitions. [2022-04-28 15:18:26,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:18:26,321 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 86 [2022-04-28 15:18:26,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:18:26,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:26,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 449 transitions. [2022-04-28 15:18:26,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:26,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 449 transitions. [2022-04-28 15:18:26,327 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 449 transitions. [2022-04-28 15:18:26,620 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 449 edges. 449 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:18:26,625 INFO L225 Difference]: With dead ends: 501 [2022-04-28 15:18:26,625 INFO L226 Difference]: Without dead ends: 277 [2022-04-28 15:18:26,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:18:26,627 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 38 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 10 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2022-04-28 15:18:26,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 479 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 378 Invalid, 3 Unknown, 0 Unchecked, 8.1s Time] [2022-04-28 15:18:26,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2022-04-28 15:18:26,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 250. [2022-04-28 15:18:26,636 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:18:26,636 INFO L82 GeneralOperation]: Start isEquivalent. First operand 277 states. Second operand has 250 states, 245 states have (on average 1.542857142857143) internal successors, (378), 245 states have internal predecessors, (378), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:26,637 INFO L74 IsIncluded]: Start isIncluded. First operand 277 states. Second operand has 250 states, 245 states have (on average 1.542857142857143) internal successors, (378), 245 states have internal predecessors, (378), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:26,637 INFO L87 Difference]: Start difference. First operand 277 states. Second operand has 250 states, 245 states have (on average 1.542857142857143) internal successors, (378), 245 states have internal predecessors, (378), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:26,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:26,642 INFO L93 Difference]: Finished difference Result 277 states and 417 transitions. [2022-04-28 15:18:26,642 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 417 transitions. [2022-04-28 15:18:26,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:18:26,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:18:26,643 INFO L74 IsIncluded]: Start isIncluded. First operand has 250 states, 245 states have (on average 1.542857142857143) internal successors, (378), 245 states have internal predecessors, (378), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 277 states. [2022-04-28 15:18:26,643 INFO L87 Difference]: Start difference. First operand has 250 states, 245 states have (on average 1.542857142857143) internal successors, (378), 245 states have internal predecessors, (378), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 277 states. [2022-04-28 15:18:26,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:26,648 INFO L93 Difference]: Finished difference Result 277 states and 417 transitions. [2022-04-28 15:18:26,648 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 417 transitions. [2022-04-28 15:18:26,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:18:26,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:18:26,648 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:18:26,649 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:18:26,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 245 states have (on average 1.542857142857143) internal successors, (378), 245 states have internal predecessors, (378), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:26,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 382 transitions. [2022-04-28 15:18:26,654 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 382 transitions. Word has length 86 [2022-04-28 15:18:26,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:18:26,654 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 382 transitions. [2022-04-28 15:18:26,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:26,654 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 382 transitions. [2022-04-28 15:18:26,929 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 382 edges. 382 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:18:26,929 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 382 transitions. [2022-04-28 15:18:26,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-28 15:18:26,931 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:18:26,932 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:18:26,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-28 15:18:26,932 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:18:26,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:18:26,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1050188318, now seen corresponding path program 1 times [2022-04-28 15:18:26,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:18:26,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1716636762] [2022-04-28 15:18:26,978 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:18:26,978 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:18:26,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1050188318, now seen corresponding path program 2 times [2022-04-28 15:18:26,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:18:26,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541241667] [2022-04-28 15:18:26,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:18:26,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:18:27,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:18:27,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:18:27,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:18:27,116 INFO L290 TraceCheckUtils]: 0: Hoare triple {27998#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {27991#true} is VALID [2022-04-28 15:18:27,116 INFO L290 TraceCheckUtils]: 1: Hoare triple {27991#true} assume true; {27991#true} is VALID [2022-04-28 15:18:27,116 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27991#true} {27991#true} #662#return; {27991#true} is VALID [2022-04-28 15:18:27,118 INFO L272 TraceCheckUtils]: 0: Hoare triple {27991#true} call ULTIMATE.init(); {27998#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:18:27,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {27998#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {27991#true} is VALID [2022-04-28 15:18:27,118 INFO L290 TraceCheckUtils]: 2: Hoare triple {27991#true} assume true; {27991#true} is VALID [2022-04-28 15:18:27,118 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27991#true} {27991#true} #662#return; {27991#true} is VALID [2022-04-28 15:18:27,119 INFO L272 TraceCheckUtils]: 4: Hoare triple {27991#true} call #t~ret161 := main(); {27991#true} is VALID [2022-04-28 15:18:27,119 INFO L290 TraceCheckUtils]: 5: Hoare triple {27991#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~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);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; {27991#true} is VALID [2022-04-28 15:18:27,119 INFO L290 TraceCheckUtils]: 6: Hoare triple {27991#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {27991#true} is VALID [2022-04-28 15:18:27,119 INFO L272 TraceCheckUtils]: 7: Hoare triple {27991#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {27991#true} is VALID [2022-04-28 15:18:27,119 INFO L290 TraceCheckUtils]: 8: Hoare triple {27991#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;~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); {27991#true} is VALID [2022-04-28 15:18:27,119 INFO L290 TraceCheckUtils]: 9: Hoare triple {27991#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; {27991#true} is VALID [2022-04-28 15:18:27,119 INFO L290 TraceCheckUtils]: 10: Hoare triple {27991#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; {27991#true} is VALID [2022-04-28 15:18:27,119 INFO L290 TraceCheckUtils]: 11: Hoare triple {27991#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {27991#true} is VALID [2022-04-28 15:18:27,119 INFO L290 TraceCheckUtils]: 12: Hoare triple {27991#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {27991#true} is VALID [2022-04-28 15:18:27,119 INFO L290 TraceCheckUtils]: 13: Hoare triple {27991#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {27991#true} is VALID [2022-04-28 15:18:27,120 INFO L290 TraceCheckUtils]: 14: Hoare triple {27991#true} assume !false; {27991#true} is VALID [2022-04-28 15:18:27,120 INFO L290 TraceCheckUtils]: 15: Hoare triple {27991#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); {27991#true} is VALID [2022-04-28 15:18:27,120 INFO L290 TraceCheckUtils]: 16: Hoare triple {27991#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {27991#true} is VALID [2022-04-28 15:18:27,120 INFO L290 TraceCheckUtils]: 17: Hoare triple {27991#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {27991#true} is VALID [2022-04-28 15:18:27,120 INFO L290 TraceCheckUtils]: 18: Hoare triple {27991#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {27991#true} is VALID [2022-04-28 15:18:27,120 INFO L290 TraceCheckUtils]: 19: Hoare triple {27991#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {27991#true} is VALID [2022-04-28 15:18:27,120 INFO L290 TraceCheckUtils]: 20: Hoare triple {27991#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {27991#true} is VALID [2022-04-28 15:18:27,120 INFO L290 TraceCheckUtils]: 21: Hoare triple {27991#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {27991#true} is VALID [2022-04-28 15:18:27,120 INFO L290 TraceCheckUtils]: 22: Hoare triple {27991#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {27991#true} is VALID [2022-04-28 15:18:27,120 INFO L290 TraceCheckUtils]: 23: Hoare triple {27991#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {27991#true} is VALID [2022-04-28 15:18:27,120 INFO L290 TraceCheckUtils]: 24: Hoare triple {27991#true} assume 8464 == #t~mem55;havoc #t~mem55; {27991#true} is VALID [2022-04-28 15:18:27,121 INFO L290 TraceCheckUtils]: 25: Hoare triple {27991#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; {27991#true} is VALID [2022-04-28 15:18:27,121 INFO L290 TraceCheckUtils]: 26: Hoare triple {27991#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {27991#true} is VALID [2022-04-28 15:18:27,122 INFO L290 TraceCheckUtils]: 27: Hoare triple {27991#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); {27996#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:27,122 INFO L290 TraceCheckUtils]: 28: Hoare triple {27996#(not (= 24576 (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); {27996#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:27,123 INFO L290 TraceCheckUtils]: 29: Hoare triple {27996#(not (= 24576 (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; {27996#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:27,123 INFO L290 TraceCheckUtils]: 30: Hoare triple {27996#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} ~skip~0 := 0; {27996#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:27,124 INFO L290 TraceCheckUtils]: 31: Hoare triple {27996#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {27996#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:27,124 INFO L290 TraceCheckUtils]: 32: Hoare triple {27996#(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); {27996#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:27,124 INFO L290 TraceCheckUtils]: 33: Hoare triple {27996#(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); {27996#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:27,125 INFO L290 TraceCheckUtils]: 34: Hoare triple {27996#(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); {27996#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:27,125 INFO L290 TraceCheckUtils]: 35: Hoare triple {27996#(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); {27997#(not (= 24576 |ssl3_accept_#t~mem50|))} is VALID [2022-04-28 15:18:27,126 INFO L290 TraceCheckUtils]: 36: Hoare triple {27997#(not (= 24576 |ssl3_accept_#t~mem50|))} assume 24576 == #t~mem50;havoc #t~mem50; {27992#false} is VALID [2022-04-28 15:18:27,126 INFO L290 TraceCheckUtils]: 37: Hoare triple {27992#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {27992#false} is VALID [2022-04-28 15:18:27,126 INFO L290 TraceCheckUtils]: 38: Hoare triple {27992#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {27992#false} is VALID [2022-04-28 15:18:27,126 INFO L290 TraceCheckUtils]: 39: Hoare triple {27992#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {27992#false} is VALID [2022-04-28 15:18:27,126 INFO L290 TraceCheckUtils]: 40: Hoare triple {27992#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); {27992#false} is VALID [2022-04-28 15:18:27,126 INFO L290 TraceCheckUtils]: 41: Hoare triple {27992#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {27992#false} is VALID [2022-04-28 15:18:27,126 INFO L290 TraceCheckUtils]: 42: Hoare triple {27992#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); {27992#false} is VALID [2022-04-28 15:18:27,138 INFO L290 TraceCheckUtils]: 43: Hoare triple {27992#false} assume 12292 != #t~mem85;havoc #t~mem85; {27992#false} is VALID [2022-04-28 15:18:27,139 INFO L290 TraceCheckUtils]: 44: Hoare triple {27992#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; {27992#false} is VALID [2022-04-28 15:18:27,139 INFO L290 TraceCheckUtils]: 45: Hoare triple {27992#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); {27992#false} is VALID [2022-04-28 15:18:27,139 INFO L290 TraceCheckUtils]: 46: Hoare triple {27992#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {27992#false} is VALID [2022-04-28 15:18:27,139 INFO L290 TraceCheckUtils]: 47: Hoare triple {27992#false} ~skip~0 := 0; {27992#false} is VALID [2022-04-28 15:18:27,139 INFO L290 TraceCheckUtils]: 48: Hoare triple {27992#false} assume !false; {27992#false} is VALID [2022-04-28 15:18:27,139 INFO L290 TraceCheckUtils]: 49: Hoare triple {27992#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); {27992#false} is VALID [2022-04-28 15:18:27,139 INFO L290 TraceCheckUtils]: 50: Hoare triple {27992#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {27992#false} is VALID [2022-04-28 15:18:27,139 INFO L290 TraceCheckUtils]: 51: Hoare triple {27992#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {27992#false} is VALID [2022-04-28 15:18:27,139 INFO L290 TraceCheckUtils]: 52: Hoare triple {27992#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {27992#false} is VALID [2022-04-28 15:18:27,140 INFO L290 TraceCheckUtils]: 53: Hoare triple {27992#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {27992#false} is VALID [2022-04-28 15:18:27,140 INFO L290 TraceCheckUtils]: 54: Hoare triple {27992#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {27992#false} is VALID [2022-04-28 15:18:27,140 INFO L290 TraceCheckUtils]: 55: Hoare triple {27992#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {27992#false} is VALID [2022-04-28 15:18:27,140 INFO L290 TraceCheckUtils]: 56: Hoare triple {27992#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {27992#false} is VALID [2022-04-28 15:18:27,140 INFO L290 TraceCheckUtils]: 57: Hoare triple {27992#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {27992#false} is VALID [2022-04-28 15:18:27,140 INFO L290 TraceCheckUtils]: 58: Hoare triple {27992#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {27992#false} is VALID [2022-04-28 15:18:27,140 INFO L290 TraceCheckUtils]: 59: Hoare triple {27992#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {27992#false} is VALID [2022-04-28 15:18:27,140 INFO L290 TraceCheckUtils]: 60: Hoare triple {27992#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {27992#false} is VALID [2022-04-28 15:18:27,140 INFO L290 TraceCheckUtils]: 61: Hoare triple {27992#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {27992#false} is VALID [2022-04-28 15:18:27,140 INFO L290 TraceCheckUtils]: 62: Hoare triple {27992#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {27992#false} is VALID [2022-04-28 15:18:27,140 INFO L290 TraceCheckUtils]: 63: Hoare triple {27992#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {27992#false} is VALID [2022-04-28 15:18:27,141 INFO L290 TraceCheckUtils]: 64: Hoare triple {27992#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {27992#false} is VALID [2022-04-28 15:18:27,141 INFO L290 TraceCheckUtils]: 65: Hoare triple {27992#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {27992#false} is VALID [2022-04-28 15:18:27,141 INFO L290 TraceCheckUtils]: 66: Hoare triple {27992#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {27992#false} is VALID [2022-04-28 15:18:27,141 INFO L290 TraceCheckUtils]: 67: Hoare triple {27992#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {27992#false} is VALID [2022-04-28 15:18:27,141 INFO L290 TraceCheckUtils]: 68: Hoare triple {27992#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {27992#false} is VALID [2022-04-28 15:18:27,141 INFO L290 TraceCheckUtils]: 69: Hoare triple {27992#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {27992#false} is VALID [2022-04-28 15:18:27,141 INFO L290 TraceCheckUtils]: 70: Hoare triple {27992#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {27992#false} is VALID [2022-04-28 15:18:27,141 INFO L290 TraceCheckUtils]: 71: Hoare triple {27992#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {27992#false} is VALID [2022-04-28 15:18:27,141 INFO L290 TraceCheckUtils]: 72: Hoare triple {27992#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {27992#false} is VALID [2022-04-28 15:18:27,141 INFO L290 TraceCheckUtils]: 73: Hoare triple {27992#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {27992#false} is VALID [2022-04-28 15:18:27,142 INFO L290 TraceCheckUtils]: 74: Hoare triple {27992#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {27992#false} is VALID [2022-04-28 15:18:27,142 INFO L290 TraceCheckUtils]: 75: Hoare triple {27992#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {27992#false} is VALID [2022-04-28 15:18:27,142 INFO L290 TraceCheckUtils]: 76: Hoare triple {27992#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {27992#false} is VALID [2022-04-28 15:18:27,142 INFO L290 TraceCheckUtils]: 77: Hoare triple {27992#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {27992#false} is VALID [2022-04-28 15:18:27,142 INFO L290 TraceCheckUtils]: 78: Hoare triple {27992#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {27992#false} is VALID [2022-04-28 15:18:27,142 INFO L290 TraceCheckUtils]: 79: Hoare triple {27992#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {27992#false} is VALID [2022-04-28 15:18:27,142 INFO L290 TraceCheckUtils]: 80: Hoare triple {27992#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {27992#false} is VALID [2022-04-28 15:18:27,142 INFO L290 TraceCheckUtils]: 81: Hoare triple {27992#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {27992#false} is VALID [2022-04-28 15:18:27,142 INFO L290 TraceCheckUtils]: 82: Hoare triple {27992#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 72 + ~s.offset, 4); {27992#false} is VALID [2022-04-28 15:18:27,142 INFO L290 TraceCheckUtils]: 83: Hoare triple {27992#false} assume 8673 == #t~mem80;havoc #t~mem80; {27992#false} is VALID [2022-04-28 15:18:27,143 INFO L290 TraceCheckUtils]: 84: Hoare triple {27992#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {27992#false} is VALID [2022-04-28 15:18:27,143 INFO L290 TraceCheckUtils]: 85: Hoare triple {27992#false} assume 3 == ~blastFlag~0; {27992#false} is VALID [2022-04-28 15:18:27,143 INFO L290 TraceCheckUtils]: 86: Hoare triple {27992#false} assume !false; {27992#false} is VALID [2022-04-28 15:18:27,144 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:18:27,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:18:27,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541241667] [2022-04-28 15:18:27,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541241667] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:18:27,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:18:27,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:18:27,145 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:18:27,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1716636762] [2022-04-28 15:18:27,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1716636762] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:18:27,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:18:27,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:18:27,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479137890] [2022-04-28 15:18:27,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:18:27,145 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 87 [2022-04-28 15:18:27,146 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:18:27,146 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:27,218 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:18:27,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:18:27,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:18:27,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:18:27,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:18:27,219 INFO L87 Difference]: Start difference. First operand 250 states and 382 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:29,243 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:18:30,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:30,405 INFO L93 Difference]: Finished difference Result 585 states and 902 transitions. [2022-04-28 15:18:30,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:18:30,405 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 87 [2022-04-28 15:18:30,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:18:30,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:30,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 566 transitions. [2022-04-28 15:18:30,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:30,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 566 transitions. [2022-04-28 15:18:30,410 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 566 transitions. [2022-04-28 15:18:30,796 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 566 edges. 566 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:18:30,801 INFO L225 Difference]: With dead ends: 585 [2022-04-28 15:18:30,802 INFO L226 Difference]: Without dead ends: 361 [2022-04-28 15:18:30,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:18:30,802 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 139 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 64 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 15:18:30,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 314 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 464 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 15:18:30,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2022-04-28 15:18:30,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 252. [2022-04-28 15:18:30,813 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:18:30,813 INFO L82 GeneralOperation]: Start isEquivalent. First operand 361 states. Second operand has 252 states, 247 states have (on average 1.5303643724696356) internal successors, (378), 247 states have internal predecessors, (378), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:30,814 INFO L74 IsIncluded]: Start isIncluded. First operand 361 states. Second operand has 252 states, 247 states have (on average 1.5303643724696356) internal successors, (378), 247 states have internal predecessors, (378), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:30,814 INFO L87 Difference]: Start difference. First operand 361 states. Second operand has 252 states, 247 states have (on average 1.5303643724696356) internal successors, (378), 247 states have internal predecessors, (378), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:30,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:30,821 INFO L93 Difference]: Finished difference Result 361 states and 546 transitions. [2022-04-28 15:18:30,821 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 546 transitions. [2022-04-28 15:18:30,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:18:30,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:18:30,822 INFO L74 IsIncluded]: Start isIncluded. First operand has 252 states, 247 states have (on average 1.5303643724696356) internal successors, (378), 247 states have internal predecessors, (378), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 361 states. [2022-04-28 15:18:30,823 INFO L87 Difference]: Start difference. First operand has 252 states, 247 states have (on average 1.5303643724696356) internal successors, (378), 247 states have internal predecessors, (378), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 361 states. [2022-04-28 15:18:30,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:30,830 INFO L93 Difference]: Finished difference Result 361 states and 546 transitions. [2022-04-28 15:18:30,830 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 546 transitions. [2022-04-28 15:18:30,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:18:30,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:18:30,831 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:18:30,831 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:18:30,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 247 states have (on average 1.5303643724696356) internal successors, (378), 247 states have internal predecessors, (378), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:30,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 382 transitions. [2022-04-28 15:18:30,845 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 382 transitions. Word has length 87 [2022-04-28 15:18:30,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:18:30,846 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 382 transitions. [2022-04-28 15:18:30,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:30,846 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 252 states and 382 transitions. [2022-04-28 15:18:31,188 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 382 edges. 382 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:18:31,188 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 382 transitions. [2022-04-28 15:18:31,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-04-28 15:18:31,189 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:18:31,189 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:18:31,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-28 15:18:31,190 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:18:31,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:18:31,190 INFO L85 PathProgramCache]: Analyzing trace with hash -756478377, now seen corresponding path program 1 times [2022-04-28 15:18:31,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:18:31,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [917172787] [2022-04-28 15:18:31,229 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:18:31,229 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:18:31,229 INFO L85 PathProgramCache]: Analyzing trace with hash -756478377, now seen corresponding path program 2 times [2022-04-28 15:18:31,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:18:31,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491582786] [2022-04-28 15:18:31,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:18:31,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:18:31,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:18:31,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:18:31,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:18:31,401 INFO L290 TraceCheckUtils]: 0: Hoare triple {30406#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {30399#true} is VALID [2022-04-28 15:18:31,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {30399#true} assume true; {30399#true} is VALID [2022-04-28 15:18:31,401 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30399#true} {30399#true} #662#return; {30399#true} is VALID [2022-04-28 15:18:31,402 INFO L272 TraceCheckUtils]: 0: Hoare triple {30399#true} call ULTIMATE.init(); {30406#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:18:31,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {30406#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {30399#true} is VALID [2022-04-28 15:18:31,402 INFO L290 TraceCheckUtils]: 2: Hoare triple {30399#true} assume true; {30399#true} is VALID [2022-04-28 15:18:31,402 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30399#true} {30399#true} #662#return; {30399#true} is VALID [2022-04-28 15:18:31,402 INFO L272 TraceCheckUtils]: 4: Hoare triple {30399#true} call #t~ret161 := main(); {30399#true} is VALID [2022-04-28 15:18:31,402 INFO L290 TraceCheckUtils]: 5: Hoare triple {30399#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~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);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; {30399#true} is VALID [2022-04-28 15:18:31,402 INFO L290 TraceCheckUtils]: 6: Hoare triple {30399#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {30399#true} is VALID [2022-04-28 15:18:31,403 INFO L272 TraceCheckUtils]: 7: Hoare triple {30399#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {30399#true} is VALID [2022-04-28 15:18:31,403 INFO L290 TraceCheckUtils]: 8: Hoare triple {30399#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;~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); {30399#true} is VALID [2022-04-28 15:18:31,403 INFO L290 TraceCheckUtils]: 9: Hoare triple {30399#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; {30399#true} is VALID [2022-04-28 15:18:31,403 INFO L290 TraceCheckUtils]: 10: Hoare triple {30399#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; {30399#true} is VALID [2022-04-28 15:18:31,403 INFO L290 TraceCheckUtils]: 11: Hoare triple {30399#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {30399#true} is VALID [2022-04-28 15:18:31,403 INFO L290 TraceCheckUtils]: 12: Hoare triple {30399#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {30399#true} is VALID [2022-04-28 15:18:31,403 INFO L290 TraceCheckUtils]: 13: Hoare triple {30399#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {30399#true} is VALID [2022-04-28 15:18:31,403 INFO L290 TraceCheckUtils]: 14: Hoare triple {30399#true} assume !false; {30399#true} is VALID [2022-04-28 15:18:31,403 INFO L290 TraceCheckUtils]: 15: Hoare triple {30399#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); {30399#true} is VALID [2022-04-28 15:18:31,403 INFO L290 TraceCheckUtils]: 16: Hoare triple {30399#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {30399#true} is VALID [2022-04-28 15:18:31,404 INFO L290 TraceCheckUtils]: 17: Hoare triple {30399#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {30399#true} is VALID [2022-04-28 15:18:31,404 INFO L290 TraceCheckUtils]: 18: Hoare triple {30399#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {30399#true} is VALID [2022-04-28 15:18:31,404 INFO L290 TraceCheckUtils]: 19: Hoare triple {30399#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {30399#true} is VALID [2022-04-28 15:18:31,404 INFO L290 TraceCheckUtils]: 20: Hoare triple {30399#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {30399#true} is VALID [2022-04-28 15:18:31,404 INFO L290 TraceCheckUtils]: 21: Hoare triple {30399#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {30399#true} is VALID [2022-04-28 15:18:31,404 INFO L290 TraceCheckUtils]: 22: Hoare triple {30399#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {30399#true} is VALID [2022-04-28 15:18:31,404 INFO L290 TraceCheckUtils]: 23: Hoare triple {30399#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {30399#true} is VALID [2022-04-28 15:18:31,404 INFO L290 TraceCheckUtils]: 24: Hoare triple {30399#true} assume 8464 == #t~mem55;havoc #t~mem55; {30399#true} is VALID [2022-04-28 15:18:31,404 INFO L290 TraceCheckUtils]: 25: Hoare triple {30399#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; {30399#true} is VALID [2022-04-28 15:18:31,404 INFO L290 TraceCheckUtils]: 26: Hoare triple {30399#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {30399#true} is VALID [2022-04-28 15:18:31,406 INFO L290 TraceCheckUtils]: 27: Hoare triple {30399#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); {30404#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:31,406 INFO L290 TraceCheckUtils]: 28: Hoare triple {30404#(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); {30404#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:31,406 INFO L290 TraceCheckUtils]: 29: Hoare triple {30404#(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; {30404#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:31,407 INFO L290 TraceCheckUtils]: 30: Hoare triple {30404#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} ~skip~0 := 0; {30404#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:31,407 INFO L290 TraceCheckUtils]: 31: Hoare triple {30404#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {30404#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:31,408 INFO L290 TraceCheckUtils]: 32: Hoare triple {30404#(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); {30404#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:31,408 INFO L290 TraceCheckUtils]: 33: Hoare triple {30404#(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); {30404#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:31,408 INFO L290 TraceCheckUtils]: 34: Hoare triple {30404#(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); {30404#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:31,409 INFO L290 TraceCheckUtils]: 35: Hoare triple {30404#(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); {30404#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:31,409 INFO L290 TraceCheckUtils]: 36: Hoare triple {30404#(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); {30405#(not (= |ssl3_accept_#t~mem51| 8195))} is VALID [2022-04-28 15:18:31,409 INFO L290 TraceCheckUtils]: 37: Hoare triple {30405#(not (= |ssl3_accept_#t~mem51| 8195))} assume 8195 == #t~mem51;havoc #t~mem51; {30400#false} is VALID [2022-04-28 15:18:31,410 INFO L290 TraceCheckUtils]: 38: Hoare triple {30400#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {30400#false} is VALID [2022-04-28 15:18:31,410 INFO L290 TraceCheckUtils]: 39: Hoare triple {30400#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {30400#false} is VALID [2022-04-28 15:18:31,410 INFO L290 TraceCheckUtils]: 40: Hoare triple {30400#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {30400#false} is VALID [2022-04-28 15:18:31,410 INFO L290 TraceCheckUtils]: 41: Hoare triple {30400#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); {30400#false} is VALID [2022-04-28 15:18:31,410 INFO L290 TraceCheckUtils]: 42: Hoare triple {30400#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {30400#false} is VALID [2022-04-28 15:18:31,410 INFO L290 TraceCheckUtils]: 43: Hoare triple {30400#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); {30400#false} is VALID [2022-04-28 15:18:31,410 INFO L290 TraceCheckUtils]: 44: Hoare triple {30400#false} assume 12292 != #t~mem85;havoc #t~mem85; {30400#false} is VALID [2022-04-28 15:18:31,410 INFO L290 TraceCheckUtils]: 45: Hoare triple {30400#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; {30400#false} is VALID [2022-04-28 15:18:31,410 INFO L290 TraceCheckUtils]: 46: Hoare triple {30400#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); {30400#false} is VALID [2022-04-28 15:18:31,410 INFO L290 TraceCheckUtils]: 47: Hoare triple {30400#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {30400#false} is VALID [2022-04-28 15:18:31,411 INFO L290 TraceCheckUtils]: 48: Hoare triple {30400#false} ~skip~0 := 0; {30400#false} is VALID [2022-04-28 15:18:31,411 INFO L290 TraceCheckUtils]: 49: Hoare triple {30400#false} assume !false; {30400#false} is VALID [2022-04-28 15:18:31,411 INFO L290 TraceCheckUtils]: 50: Hoare triple {30400#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); {30400#false} is VALID [2022-04-28 15:18:31,411 INFO L290 TraceCheckUtils]: 51: Hoare triple {30400#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {30400#false} is VALID [2022-04-28 15:18:31,411 INFO L290 TraceCheckUtils]: 52: Hoare triple {30400#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {30400#false} is VALID [2022-04-28 15:18:31,411 INFO L290 TraceCheckUtils]: 53: Hoare triple {30400#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {30400#false} is VALID [2022-04-28 15:18:31,411 INFO L290 TraceCheckUtils]: 54: Hoare triple {30400#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {30400#false} is VALID [2022-04-28 15:18:31,411 INFO L290 TraceCheckUtils]: 55: Hoare triple {30400#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {30400#false} is VALID [2022-04-28 15:18:31,411 INFO L290 TraceCheckUtils]: 56: Hoare triple {30400#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {30400#false} is VALID [2022-04-28 15:18:31,411 INFO L290 TraceCheckUtils]: 57: Hoare triple {30400#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {30400#false} is VALID [2022-04-28 15:18:31,412 INFO L290 TraceCheckUtils]: 58: Hoare triple {30400#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {30400#false} is VALID [2022-04-28 15:18:31,412 INFO L290 TraceCheckUtils]: 59: Hoare triple {30400#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {30400#false} is VALID [2022-04-28 15:18:31,412 INFO L290 TraceCheckUtils]: 60: Hoare triple {30400#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {30400#false} is VALID [2022-04-28 15:18:31,412 INFO L290 TraceCheckUtils]: 61: Hoare triple {30400#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {30400#false} is VALID [2022-04-28 15:18:31,412 INFO L290 TraceCheckUtils]: 62: Hoare triple {30400#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {30400#false} is VALID [2022-04-28 15:18:31,412 INFO L290 TraceCheckUtils]: 63: Hoare triple {30400#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {30400#false} is VALID [2022-04-28 15:18:31,412 INFO L290 TraceCheckUtils]: 64: Hoare triple {30400#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {30400#false} is VALID [2022-04-28 15:18:31,412 INFO L290 TraceCheckUtils]: 65: Hoare triple {30400#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {30400#false} is VALID [2022-04-28 15:18:31,412 INFO L290 TraceCheckUtils]: 66: Hoare triple {30400#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {30400#false} is VALID [2022-04-28 15:18:31,412 INFO L290 TraceCheckUtils]: 67: Hoare triple {30400#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {30400#false} is VALID [2022-04-28 15:18:31,413 INFO L290 TraceCheckUtils]: 68: Hoare triple {30400#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {30400#false} is VALID [2022-04-28 15:18:31,413 INFO L290 TraceCheckUtils]: 69: Hoare triple {30400#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {30400#false} is VALID [2022-04-28 15:18:31,413 INFO L290 TraceCheckUtils]: 70: Hoare triple {30400#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {30400#false} is VALID [2022-04-28 15:18:31,413 INFO L290 TraceCheckUtils]: 71: Hoare triple {30400#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {30400#false} is VALID [2022-04-28 15:18:31,413 INFO L290 TraceCheckUtils]: 72: Hoare triple {30400#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {30400#false} is VALID [2022-04-28 15:18:31,413 INFO L290 TraceCheckUtils]: 73: Hoare triple {30400#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {30400#false} is VALID [2022-04-28 15:18:31,413 INFO L290 TraceCheckUtils]: 74: Hoare triple {30400#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {30400#false} is VALID [2022-04-28 15:18:31,413 INFO L290 TraceCheckUtils]: 75: Hoare triple {30400#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {30400#false} is VALID [2022-04-28 15:18:31,413 INFO L290 TraceCheckUtils]: 76: Hoare triple {30400#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {30400#false} is VALID [2022-04-28 15:18:31,413 INFO L290 TraceCheckUtils]: 77: Hoare triple {30400#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {30400#false} is VALID [2022-04-28 15:18:31,413 INFO L290 TraceCheckUtils]: 78: Hoare triple {30400#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {30400#false} is VALID [2022-04-28 15:18:31,414 INFO L290 TraceCheckUtils]: 79: Hoare triple {30400#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {30400#false} is VALID [2022-04-28 15:18:31,414 INFO L290 TraceCheckUtils]: 80: Hoare triple {30400#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {30400#false} is VALID [2022-04-28 15:18:31,414 INFO L290 TraceCheckUtils]: 81: Hoare triple {30400#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {30400#false} is VALID [2022-04-28 15:18:31,414 INFO L290 TraceCheckUtils]: 82: Hoare triple {30400#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {30400#false} is VALID [2022-04-28 15:18:31,414 INFO L290 TraceCheckUtils]: 83: Hoare triple {30400#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 72 + ~s.offset, 4); {30400#false} is VALID [2022-04-28 15:18:31,414 INFO L290 TraceCheckUtils]: 84: Hoare triple {30400#false} assume 8673 == #t~mem80;havoc #t~mem80; {30400#false} is VALID [2022-04-28 15:18:31,414 INFO L290 TraceCheckUtils]: 85: Hoare triple {30400#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {30400#false} is VALID [2022-04-28 15:18:31,414 INFO L290 TraceCheckUtils]: 86: Hoare triple {30400#false} assume 3 == ~blastFlag~0; {30400#false} is VALID [2022-04-28 15:18:31,414 INFO L290 TraceCheckUtils]: 87: Hoare triple {30400#false} assume !false; {30400#false} is VALID [2022-04-28 15:18:31,415 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:18:31,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:18:31,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491582786] [2022-04-28 15:18:31,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491582786] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:18:31,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:18:31,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:18:31,415 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:18:31,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [917172787] [2022-04-28 15:18:31,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [917172787] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:18:31,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:18:31,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:18:31,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859438338] [2022-04-28 15:18:31,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:18:31,417 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 88 [2022-04-28 15:18:31,417 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:18:31,417 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:31,490 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:18:31,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:18:31,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:18:31,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:18:31,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:18:31,491 INFO L87 Difference]: Start difference. First operand 252 states and 382 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:33,517 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:18:34,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:34,645 INFO L93 Difference]: Finished difference Result 587 states and 898 transitions. [2022-04-28 15:18:34,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:18:34,645 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 88 [2022-04-28 15:18:34,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:18:34,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:34,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 565 transitions. [2022-04-28 15:18:34,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:34,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 565 transitions. [2022-04-28 15:18:34,651 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 565 transitions. [2022-04-28 15:18:35,035 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 565 edges. 565 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:18:35,043 INFO L225 Difference]: With dead ends: 587 [2022-04-28 15:18:35,043 INFO L226 Difference]: Without dead ends: 361 [2022-04-28 15:18:35,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:18:35,044 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 137 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 64 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 15:18:35,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 314 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 464 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 15:18:35,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2022-04-28 15:18:35,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 253. [2022-04-28 15:18:35,055 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:18:35,055 INFO L82 GeneralOperation]: Start isEquivalent. First operand 361 states. Second operand has 253 states, 248 states have (on average 1.5161290322580645) internal successors, (376), 248 states have internal predecessors, (376), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:35,056 INFO L74 IsIncluded]: Start isIncluded. First operand 361 states. Second operand has 253 states, 248 states have (on average 1.5161290322580645) internal successors, (376), 248 states have internal predecessors, (376), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:35,056 INFO L87 Difference]: Start difference. First operand 361 states. Second operand has 253 states, 248 states have (on average 1.5161290322580645) internal successors, (376), 248 states have internal predecessors, (376), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:35,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:35,063 INFO L93 Difference]: Finished difference Result 361 states and 542 transitions. [2022-04-28 15:18:35,063 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 542 transitions. [2022-04-28 15:18:35,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:18:35,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:18:35,064 INFO L74 IsIncluded]: Start isIncluded. First operand has 253 states, 248 states have (on average 1.5161290322580645) internal successors, (376), 248 states have internal predecessors, (376), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 361 states. [2022-04-28 15:18:35,065 INFO L87 Difference]: Start difference. First operand has 253 states, 248 states have (on average 1.5161290322580645) internal successors, (376), 248 states have internal predecessors, (376), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 361 states. [2022-04-28 15:18:35,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:35,072 INFO L93 Difference]: Finished difference Result 361 states and 542 transitions. [2022-04-28 15:18:35,072 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 542 transitions. [2022-04-28 15:18:35,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:18:35,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:18:35,072 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:18:35,072 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:18:35,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 248 states have (on average 1.5161290322580645) internal successors, (376), 248 states have internal predecessors, (376), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:35,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 380 transitions. [2022-04-28 15:18:35,078 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 380 transitions. Word has length 88 [2022-04-28 15:18:35,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:18:35,078 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 380 transitions. [2022-04-28 15:18:35,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:35,078 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 253 states and 380 transitions. [2022-04-28 15:18:35,365 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 380 edges. 380 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:18:35,365 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 380 transitions. [2022-04-28 15:18:35,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-04-28 15:18:35,366 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:18:35,366 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:18:35,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-28 15:18:35,367 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:18:35,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:18:35,367 INFO L85 PathProgramCache]: Analyzing trace with hash -220711809, now seen corresponding path program 1 times [2022-04-28 15:18:35,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:18:35,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2105323974] [2022-04-28 15:18:35,406 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:18:35,406 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:18:35,406 INFO L85 PathProgramCache]: Analyzing trace with hash -220711809, now seen corresponding path program 2 times [2022-04-28 15:18:35,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:18:35,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452558446] [2022-04-28 15:18:35,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:18:35,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:18:35,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:18:35,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:18:35,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:18:35,549 INFO L290 TraceCheckUtils]: 0: Hoare triple {32820#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {32813#true} is VALID [2022-04-28 15:18:35,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {32813#true} assume true; {32813#true} is VALID [2022-04-28 15:18:35,549 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32813#true} {32813#true} #662#return; {32813#true} is VALID [2022-04-28 15:18:35,550 INFO L272 TraceCheckUtils]: 0: Hoare triple {32813#true} call ULTIMATE.init(); {32820#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:18:35,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {32820#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {32813#true} is VALID [2022-04-28 15:18:35,550 INFO L290 TraceCheckUtils]: 2: Hoare triple {32813#true} assume true; {32813#true} is VALID [2022-04-28 15:18:35,550 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32813#true} {32813#true} #662#return; {32813#true} is VALID [2022-04-28 15:18:35,550 INFO L272 TraceCheckUtils]: 4: Hoare triple {32813#true} call #t~ret161 := main(); {32813#true} is VALID [2022-04-28 15:18:35,551 INFO L290 TraceCheckUtils]: 5: Hoare triple {32813#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~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);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; {32813#true} is VALID [2022-04-28 15:18:35,551 INFO L290 TraceCheckUtils]: 6: Hoare triple {32813#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {32813#true} is VALID [2022-04-28 15:18:35,551 INFO L272 TraceCheckUtils]: 7: Hoare triple {32813#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {32813#true} is VALID [2022-04-28 15:18:35,551 INFO L290 TraceCheckUtils]: 8: Hoare triple {32813#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;~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); {32813#true} is VALID [2022-04-28 15:18:35,551 INFO L290 TraceCheckUtils]: 9: Hoare triple {32813#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; {32813#true} is VALID [2022-04-28 15:18:35,551 INFO L290 TraceCheckUtils]: 10: Hoare triple {32813#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; {32813#true} is VALID [2022-04-28 15:18:35,551 INFO L290 TraceCheckUtils]: 11: Hoare triple {32813#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {32813#true} is VALID [2022-04-28 15:18:35,551 INFO L290 TraceCheckUtils]: 12: Hoare triple {32813#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {32813#true} is VALID [2022-04-28 15:18:35,551 INFO L290 TraceCheckUtils]: 13: Hoare triple {32813#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {32813#true} is VALID [2022-04-28 15:18:35,551 INFO L290 TraceCheckUtils]: 14: Hoare triple {32813#true} assume !false; {32813#true} is VALID [2022-04-28 15:18:35,552 INFO L290 TraceCheckUtils]: 15: Hoare triple {32813#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); {32813#true} is VALID [2022-04-28 15:18:35,552 INFO L290 TraceCheckUtils]: 16: Hoare triple {32813#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {32813#true} is VALID [2022-04-28 15:18:35,552 INFO L290 TraceCheckUtils]: 17: Hoare triple {32813#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {32813#true} is VALID [2022-04-28 15:18:35,552 INFO L290 TraceCheckUtils]: 18: Hoare triple {32813#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {32813#true} is VALID [2022-04-28 15:18:35,552 INFO L290 TraceCheckUtils]: 19: Hoare triple {32813#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {32813#true} is VALID [2022-04-28 15:18:35,552 INFO L290 TraceCheckUtils]: 20: Hoare triple {32813#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {32813#true} is VALID [2022-04-28 15:18:35,552 INFO L290 TraceCheckUtils]: 21: Hoare triple {32813#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {32813#true} is VALID [2022-04-28 15:18:35,552 INFO L290 TraceCheckUtils]: 22: Hoare triple {32813#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {32813#true} is VALID [2022-04-28 15:18:35,552 INFO L290 TraceCheckUtils]: 23: Hoare triple {32813#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {32813#true} is VALID [2022-04-28 15:18:35,552 INFO L290 TraceCheckUtils]: 24: Hoare triple {32813#true} assume 8464 == #t~mem55;havoc #t~mem55; {32813#true} is VALID [2022-04-28 15:18:35,553 INFO L290 TraceCheckUtils]: 25: Hoare triple {32813#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; {32813#true} is VALID [2022-04-28 15:18:35,553 INFO L290 TraceCheckUtils]: 26: Hoare triple {32813#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {32813#true} is VALID [2022-04-28 15:18:35,553 INFO L290 TraceCheckUtils]: 27: Hoare triple {32813#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); {32813#true} is VALID [2022-04-28 15:18:35,553 INFO L290 TraceCheckUtils]: 28: Hoare triple {32813#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); {32813#true} is VALID [2022-04-28 15:18:35,553 INFO L290 TraceCheckUtils]: 29: Hoare triple {32813#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {32813#true} is VALID [2022-04-28 15:18:35,553 INFO L290 TraceCheckUtils]: 30: Hoare triple {32813#true} ~skip~0 := 0; {32813#true} is VALID [2022-04-28 15:18:35,553 INFO L290 TraceCheckUtils]: 31: Hoare triple {32813#true} assume !false; {32813#true} is VALID [2022-04-28 15:18:35,553 INFO L290 TraceCheckUtils]: 32: Hoare triple {32813#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); {32813#true} is VALID [2022-04-28 15:18:35,553 INFO L290 TraceCheckUtils]: 33: Hoare triple {32813#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {32813#true} is VALID [2022-04-28 15:18:35,553 INFO L290 TraceCheckUtils]: 34: Hoare triple {32813#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {32813#true} is VALID [2022-04-28 15:18:35,554 INFO L290 TraceCheckUtils]: 35: Hoare triple {32813#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {32813#true} is VALID [2022-04-28 15:18:35,554 INFO L290 TraceCheckUtils]: 36: Hoare triple {32813#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {32813#true} is VALID [2022-04-28 15:18:35,554 INFO L290 TraceCheckUtils]: 37: Hoare triple {32813#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {32813#true} is VALID [2022-04-28 15:18:35,554 INFO L290 TraceCheckUtils]: 38: Hoare triple {32813#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {32813#true} is VALID [2022-04-28 15:18:35,554 INFO L290 TraceCheckUtils]: 39: Hoare triple {32813#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {32813#true} is VALID [2022-04-28 15:18:35,554 INFO L290 TraceCheckUtils]: 40: Hoare triple {32813#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {32813#true} is VALID [2022-04-28 15:18:35,554 INFO L290 TraceCheckUtils]: 41: Hoare triple {32813#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {32813#true} is VALID [2022-04-28 15:18:35,554 INFO L290 TraceCheckUtils]: 42: Hoare triple {32813#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {32813#true} is VALID [2022-04-28 15:18:35,554 INFO L290 TraceCheckUtils]: 43: Hoare triple {32813#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {32813#true} is VALID [2022-04-28 15:18:35,554 INFO L290 TraceCheckUtils]: 44: Hoare triple {32813#true} assume 8496 == #t~mem58;havoc #t~mem58; {32813#true} is VALID [2022-04-28 15:18:35,555 INFO L290 TraceCheckUtils]: 45: Hoare triple {32813#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {32813#true} is VALID [2022-04-28 15:18:35,555 INFO L290 TraceCheckUtils]: 46: Hoare triple {32813#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {32813#true} is VALID [2022-04-28 15:18:35,555 INFO L290 TraceCheckUtils]: 47: Hoare triple {32813#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {32813#true} is VALID [2022-04-28 15:18:35,556 INFO L290 TraceCheckUtils]: 48: Hoare triple {32813#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {32818#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:35,556 INFO L290 TraceCheckUtils]: 49: Hoare triple {32818#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {32818#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:35,557 INFO L290 TraceCheckUtils]: 50: Hoare triple {32818#(= 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); {32818#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:35,557 INFO L290 TraceCheckUtils]: 51: Hoare triple {32818#(= 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; {32818#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:35,558 INFO L290 TraceCheckUtils]: 52: Hoare triple {32818#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {32818#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:35,558 INFO L290 TraceCheckUtils]: 53: Hoare triple {32818#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {32818#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:35,558 INFO L290 TraceCheckUtils]: 54: Hoare triple {32818#(= 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); {32818#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:35,559 INFO L290 TraceCheckUtils]: 55: Hoare triple {32818#(= 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); {32818#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:35,559 INFO L290 TraceCheckUtils]: 56: Hoare triple {32818#(= 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); {32818#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:35,560 INFO L290 TraceCheckUtils]: 57: Hoare triple {32818#(= 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); {32818#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:35,560 INFO L290 TraceCheckUtils]: 58: Hoare triple {32818#(= 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); {32818#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:35,561 INFO L290 TraceCheckUtils]: 59: Hoare triple {32818#(= 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); {32818#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:35,561 INFO L290 TraceCheckUtils]: 60: Hoare triple {32818#(= 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); {32818#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:35,561 INFO L290 TraceCheckUtils]: 61: Hoare triple {32818#(= 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); {32818#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:35,562 INFO L290 TraceCheckUtils]: 62: Hoare triple {32818#(= 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); {32818#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:35,562 INFO L290 TraceCheckUtils]: 63: Hoare triple {32818#(= 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); {32818#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:35,563 INFO L290 TraceCheckUtils]: 64: Hoare triple {32818#(= 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); {32818#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:35,563 INFO L290 TraceCheckUtils]: 65: Hoare triple {32818#(= 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); {32818#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:35,564 INFO L290 TraceCheckUtils]: 66: Hoare triple {32818#(= 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); {32818#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:35,564 INFO L290 TraceCheckUtils]: 67: Hoare triple {32818#(= 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); {32818#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:35,564 INFO L290 TraceCheckUtils]: 68: Hoare triple {32818#(= 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); {32818#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:35,565 INFO L290 TraceCheckUtils]: 69: Hoare triple {32818#(= 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); {32818#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:35,565 INFO L290 TraceCheckUtils]: 70: Hoare triple {32818#(= 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); {32818#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:35,566 INFO L290 TraceCheckUtils]: 71: Hoare triple {32818#(= 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); {32818#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:35,566 INFO L290 TraceCheckUtils]: 72: Hoare triple {32818#(= 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); {32818#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:35,567 INFO L290 TraceCheckUtils]: 73: Hoare triple {32818#(= 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); {32818#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:35,567 INFO L290 TraceCheckUtils]: 74: Hoare triple {32818#(= 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); {32818#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:35,567 INFO L290 TraceCheckUtils]: 75: Hoare triple {32818#(= 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); {32818#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:35,568 INFO L290 TraceCheckUtils]: 76: Hoare triple {32818#(= 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); {32818#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:35,568 INFO L290 TraceCheckUtils]: 77: Hoare triple {32818#(= 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); {32818#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:35,569 INFO L290 TraceCheckUtils]: 78: Hoare triple {32818#(= 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); {32818#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:35,569 INFO L290 TraceCheckUtils]: 79: Hoare triple {32818#(= 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); {32818#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:35,570 INFO L290 TraceCheckUtils]: 80: Hoare triple {32818#(= 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); {32818#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:35,570 INFO L290 TraceCheckUtils]: 81: Hoare triple {32818#(= 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); {32818#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:35,570 INFO L290 TraceCheckUtils]: 82: Hoare triple {32818#(= 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); {32818#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:35,571 INFO L290 TraceCheckUtils]: 83: Hoare triple {32818#(= 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); {32818#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:35,571 INFO L290 TraceCheckUtils]: 84: Hoare triple {32818#(= 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); {32819#(= |ssl3_accept_#t~mem77| 8656)} is VALID [2022-04-28 15:18:35,572 INFO L290 TraceCheckUtils]: 85: Hoare triple {32819#(= |ssl3_accept_#t~mem77| 8656)} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {32814#false} is VALID [2022-04-28 15:18:35,572 INFO L290 TraceCheckUtils]: 86: Hoare triple {32814#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {32814#false} is VALID [2022-04-28 15:18:35,572 INFO L290 TraceCheckUtils]: 87: Hoare triple {32814#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 72 + ~s.offset, 4); {32814#false} is VALID [2022-04-28 15:18:35,572 INFO L290 TraceCheckUtils]: 88: Hoare triple {32814#false} assume 8673 == #t~mem80;havoc #t~mem80; {32814#false} is VALID [2022-04-28 15:18:35,572 INFO L290 TraceCheckUtils]: 89: Hoare triple {32814#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {32814#false} is VALID [2022-04-28 15:18:35,572 INFO L290 TraceCheckUtils]: 90: Hoare triple {32814#false} assume 3 == ~blastFlag~0; {32814#false} is VALID [2022-04-28 15:18:35,572 INFO L290 TraceCheckUtils]: 91: Hoare triple {32814#false} assume !false; {32814#false} is VALID [2022-04-28 15:18:35,573 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 15:18:35,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:18:35,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452558446] [2022-04-28 15:18:35,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452558446] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:18:35,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:18:35,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:18:35,574 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:18:35,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2105323974] [2022-04-28 15:18:35,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2105323974] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:18:35,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:18:35,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:18:35,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635852695] [2022-04-28 15:18:35,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:18:35,574 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2022-04-28 15:18:35,575 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:18:35,575 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:35,645 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:18:35,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:18:35,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:18:35,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:18:35,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:18:35,646 INFO L87 Difference]: Start difference. First operand 253 states and 380 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:37,671 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:18:38,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:38,920 INFO L93 Difference]: Finished difference Result 585 states and 887 transitions. [2022-04-28 15:18:38,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:18:38,920 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2022-04-28 15:18:38,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:18:38,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:38,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 537 transitions. [2022-04-28 15:18:38,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:38,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 537 transitions. [2022-04-28 15:18:38,926 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 537 transitions. [2022-04-28 15:18:39,294 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 537 edges. 537 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:18:39,299 INFO L225 Difference]: With dead ends: 585 [2022-04-28 15:18:39,299 INFO L226 Difference]: Without dead ends: 358 [2022-04-28 15:18:39,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:18:39,300 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 75 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 15:18:39,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 469 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 527 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 15:18:39,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2022-04-28 15:18:39,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 296. [2022-04-28 15:18:39,313 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:18:39,313 INFO L82 GeneralOperation]: Start isEquivalent. First operand 358 states. Second operand has 296 states, 291 states have (on average 1.5498281786941581) internal successors, (451), 291 states have internal predecessors, (451), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:39,314 INFO L74 IsIncluded]: Start isIncluded. First operand 358 states. Second operand has 296 states, 291 states have (on average 1.5498281786941581) internal successors, (451), 291 states have internal predecessors, (451), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:39,314 INFO L87 Difference]: Start difference. First operand 358 states. Second operand has 296 states, 291 states have (on average 1.5498281786941581) internal successors, (451), 291 states have internal predecessors, (451), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:39,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:39,321 INFO L93 Difference]: Finished difference Result 358 states and 536 transitions. [2022-04-28 15:18:39,321 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 536 transitions. [2022-04-28 15:18:39,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:18:39,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:18:39,322 INFO L74 IsIncluded]: Start isIncluded. First operand has 296 states, 291 states have (on average 1.5498281786941581) internal successors, (451), 291 states have internal predecessors, (451), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 358 states. [2022-04-28 15:18:39,322 INFO L87 Difference]: Start difference. First operand has 296 states, 291 states have (on average 1.5498281786941581) internal successors, (451), 291 states have internal predecessors, (451), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 358 states. [2022-04-28 15:18:39,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:39,329 INFO L93 Difference]: Finished difference Result 358 states and 536 transitions. [2022-04-28 15:18:39,329 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 536 transitions. [2022-04-28 15:18:39,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:18:39,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:18:39,330 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:18:39,330 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:18:39,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 291 states have (on average 1.5498281786941581) internal successors, (451), 291 states have internal predecessors, (451), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:39,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 455 transitions. [2022-04-28 15:18:39,337 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 455 transitions. Word has length 92 [2022-04-28 15:18:39,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:18:39,337 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 455 transitions. [2022-04-28 15:18:39,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:39,337 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 296 states and 455 transitions. [2022-04-28 15:18:39,676 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 455 edges. 455 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:18:39,676 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 455 transitions. [2022-04-28 15:18:39,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-04-28 15:18:39,679 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:18:39,679 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:18:39,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-28 15:18:39,680 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:18:39,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:18:39,680 INFO L85 PathProgramCache]: Analyzing trace with hash 2024867645, now seen corresponding path program 1 times [2022-04-28 15:18:39,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:18:39,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1784297844] [2022-04-28 15:18:39,727 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:18:39,727 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:18:39,727 INFO L85 PathProgramCache]: Analyzing trace with hash 2024867645, now seen corresponding path program 2 times [2022-04-28 15:18:39,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:18:39,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339069543] [2022-04-28 15:18:39,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:18:39,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:18:39,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:18:39,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:18:39,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:18:39,894 INFO L290 TraceCheckUtils]: 0: Hoare triple {35310#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {35303#true} is VALID [2022-04-28 15:18:39,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {35303#true} assume true; {35303#true} is VALID [2022-04-28 15:18:39,894 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35303#true} {35303#true} #662#return; {35303#true} is VALID [2022-04-28 15:18:39,895 INFO L272 TraceCheckUtils]: 0: Hoare triple {35303#true} call ULTIMATE.init(); {35310#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:18:39,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {35310#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {35303#true} is VALID [2022-04-28 15:18:39,896 INFO L290 TraceCheckUtils]: 2: Hoare triple {35303#true} assume true; {35303#true} is VALID [2022-04-28 15:18:39,896 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35303#true} {35303#true} #662#return; {35303#true} is VALID [2022-04-28 15:18:39,896 INFO L272 TraceCheckUtils]: 4: Hoare triple {35303#true} call #t~ret161 := main(); {35303#true} is VALID [2022-04-28 15:18:39,896 INFO L290 TraceCheckUtils]: 5: Hoare triple {35303#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~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);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; {35303#true} is VALID [2022-04-28 15:18:39,896 INFO L290 TraceCheckUtils]: 6: Hoare triple {35303#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {35303#true} is VALID [2022-04-28 15:18:39,896 INFO L272 TraceCheckUtils]: 7: Hoare triple {35303#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {35303#true} is VALID [2022-04-28 15:18:39,896 INFO L290 TraceCheckUtils]: 8: Hoare triple {35303#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;~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); {35303#true} is VALID [2022-04-28 15:18:39,896 INFO L290 TraceCheckUtils]: 9: Hoare triple {35303#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; {35303#true} is VALID [2022-04-28 15:18:39,897 INFO L290 TraceCheckUtils]: 10: Hoare triple {35303#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; {35303#true} is VALID [2022-04-28 15:18:39,897 INFO L290 TraceCheckUtils]: 11: Hoare triple {35303#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {35303#true} is VALID [2022-04-28 15:18:39,897 INFO L290 TraceCheckUtils]: 12: Hoare triple {35303#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {35303#true} is VALID [2022-04-28 15:18:39,897 INFO L290 TraceCheckUtils]: 13: Hoare triple {35303#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {35303#true} is VALID [2022-04-28 15:18:39,897 INFO L290 TraceCheckUtils]: 14: Hoare triple {35303#true} assume !false; {35303#true} is VALID [2022-04-28 15:18:39,897 INFO L290 TraceCheckUtils]: 15: Hoare triple {35303#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); {35303#true} is VALID [2022-04-28 15:18:39,897 INFO L290 TraceCheckUtils]: 16: Hoare triple {35303#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {35303#true} is VALID [2022-04-28 15:18:39,897 INFO L290 TraceCheckUtils]: 17: Hoare triple {35303#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {35303#true} is VALID [2022-04-28 15:18:39,897 INFO L290 TraceCheckUtils]: 18: Hoare triple {35303#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {35303#true} is VALID [2022-04-28 15:18:39,897 INFO L290 TraceCheckUtils]: 19: Hoare triple {35303#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {35303#true} is VALID [2022-04-28 15:18:39,897 INFO L290 TraceCheckUtils]: 20: Hoare triple {35303#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {35303#true} is VALID [2022-04-28 15:18:39,898 INFO L290 TraceCheckUtils]: 21: Hoare triple {35303#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {35303#true} is VALID [2022-04-28 15:18:39,898 INFO L290 TraceCheckUtils]: 22: Hoare triple {35303#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {35303#true} is VALID [2022-04-28 15:18:39,898 INFO L290 TraceCheckUtils]: 23: Hoare triple {35303#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {35303#true} is VALID [2022-04-28 15:18:39,898 INFO L290 TraceCheckUtils]: 24: Hoare triple {35303#true} assume 8464 == #t~mem55;havoc #t~mem55; {35303#true} is VALID [2022-04-28 15:18:39,898 INFO L290 TraceCheckUtils]: 25: Hoare triple {35303#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; {35303#true} is VALID [2022-04-28 15:18:39,898 INFO L290 TraceCheckUtils]: 26: Hoare triple {35303#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {35303#true} is VALID [2022-04-28 15:18:39,898 INFO L290 TraceCheckUtils]: 27: Hoare triple {35303#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); {35303#true} is VALID [2022-04-28 15:18:39,898 INFO L290 TraceCheckUtils]: 28: Hoare triple {35303#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); {35303#true} is VALID [2022-04-28 15:18:39,898 INFO L290 TraceCheckUtils]: 29: Hoare triple {35303#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {35303#true} is VALID [2022-04-28 15:18:39,898 INFO L290 TraceCheckUtils]: 30: Hoare triple {35303#true} ~skip~0 := 0; {35303#true} is VALID [2022-04-28 15:18:39,899 INFO L290 TraceCheckUtils]: 31: Hoare triple {35303#true} assume !false; {35303#true} is VALID [2022-04-28 15:18:39,899 INFO L290 TraceCheckUtils]: 32: Hoare triple {35303#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); {35303#true} is VALID [2022-04-28 15:18:39,899 INFO L290 TraceCheckUtils]: 33: Hoare triple {35303#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {35303#true} is VALID [2022-04-28 15:18:39,899 INFO L290 TraceCheckUtils]: 34: Hoare triple {35303#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {35303#true} is VALID [2022-04-28 15:18:39,899 INFO L290 TraceCheckUtils]: 35: Hoare triple {35303#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {35303#true} is VALID [2022-04-28 15:18:39,899 INFO L290 TraceCheckUtils]: 36: Hoare triple {35303#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {35303#true} is VALID [2022-04-28 15:18:39,899 INFO L290 TraceCheckUtils]: 37: Hoare triple {35303#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {35303#true} is VALID [2022-04-28 15:18:39,899 INFO L290 TraceCheckUtils]: 38: Hoare triple {35303#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {35303#true} is VALID [2022-04-28 15:18:39,899 INFO L290 TraceCheckUtils]: 39: Hoare triple {35303#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {35303#true} is VALID [2022-04-28 15:18:39,900 INFO L290 TraceCheckUtils]: 40: Hoare triple {35303#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {35303#true} is VALID [2022-04-28 15:18:39,900 INFO L290 TraceCheckUtils]: 41: Hoare triple {35303#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {35303#true} is VALID [2022-04-28 15:18:39,900 INFO L290 TraceCheckUtils]: 42: Hoare triple {35303#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {35303#true} is VALID [2022-04-28 15:18:39,900 INFO L290 TraceCheckUtils]: 43: Hoare triple {35303#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {35303#true} is VALID [2022-04-28 15:18:39,900 INFO L290 TraceCheckUtils]: 44: Hoare triple {35303#true} assume 8496 == #t~mem58;havoc #t~mem58; {35303#true} is VALID [2022-04-28 15:18:39,900 INFO L290 TraceCheckUtils]: 45: Hoare triple {35303#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {35303#true} is VALID [2022-04-28 15:18:39,900 INFO L290 TraceCheckUtils]: 46: Hoare triple {35303#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {35303#true} is VALID [2022-04-28 15:18:39,900 INFO L290 TraceCheckUtils]: 47: Hoare triple {35303#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {35303#true} is VALID [2022-04-28 15:18:39,901 INFO L290 TraceCheckUtils]: 48: Hoare triple {35303#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 72 + ~s.offset, 4); {35308#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:39,902 INFO L290 TraceCheckUtils]: 49: Hoare triple {35308#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {35308#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:39,902 INFO L290 TraceCheckUtils]: 50: Hoare triple {35308#(not (= 8673 (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); {35308#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:39,903 INFO L290 TraceCheckUtils]: 51: Hoare triple {35308#(not (= 8673 (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; {35308#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:39,903 INFO L290 TraceCheckUtils]: 52: Hoare triple {35308#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} ~skip~0 := 0; {35308#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:39,904 INFO L290 TraceCheckUtils]: 53: Hoare triple {35308#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {35308#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:39,904 INFO L290 TraceCheckUtils]: 54: Hoare triple {35308#(not (= 8673 (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); {35308#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:39,905 INFO L290 TraceCheckUtils]: 55: Hoare triple {35308#(not (= 8673 (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); {35308#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:39,905 INFO L290 TraceCheckUtils]: 56: Hoare triple {35308#(not (= 8673 (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); {35308#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:39,905 INFO L290 TraceCheckUtils]: 57: Hoare triple {35308#(not (= 8673 (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); {35308#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:39,906 INFO L290 TraceCheckUtils]: 58: Hoare triple {35308#(not (= 8673 (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); {35308#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:39,906 INFO L290 TraceCheckUtils]: 59: Hoare triple {35308#(not (= 8673 (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); {35308#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:39,907 INFO L290 TraceCheckUtils]: 60: Hoare triple {35308#(not (= 8673 (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); {35308#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:39,907 INFO L290 TraceCheckUtils]: 61: Hoare triple {35308#(not (= 8673 (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); {35308#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:39,908 INFO L290 TraceCheckUtils]: 62: Hoare triple {35308#(not (= 8673 (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); {35308#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:39,908 INFO L290 TraceCheckUtils]: 63: Hoare triple {35308#(not (= 8673 (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); {35308#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:39,908 INFO L290 TraceCheckUtils]: 64: Hoare triple {35308#(not (= 8673 (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); {35308#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:39,909 INFO L290 TraceCheckUtils]: 65: Hoare triple {35308#(not (= 8673 (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); {35308#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:39,909 INFO L290 TraceCheckUtils]: 66: Hoare triple {35308#(not (= 8673 (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); {35308#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:39,910 INFO L290 TraceCheckUtils]: 67: Hoare triple {35308#(not (= 8673 (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); {35308#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:39,910 INFO L290 TraceCheckUtils]: 68: Hoare triple {35308#(not (= 8673 (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); {35308#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:39,911 INFO L290 TraceCheckUtils]: 69: Hoare triple {35308#(not (= 8673 (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); {35308#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:39,911 INFO L290 TraceCheckUtils]: 70: Hoare triple {35308#(not (= 8673 (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); {35308#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:39,911 INFO L290 TraceCheckUtils]: 71: Hoare triple {35308#(not (= 8673 (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); {35308#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:39,912 INFO L290 TraceCheckUtils]: 72: Hoare triple {35308#(not (= 8673 (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); {35308#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:39,912 INFO L290 TraceCheckUtils]: 73: Hoare triple {35308#(not (= 8673 (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); {35308#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:39,913 INFO L290 TraceCheckUtils]: 74: Hoare triple {35308#(not (= 8673 (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); {35308#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:39,913 INFO L290 TraceCheckUtils]: 75: Hoare triple {35308#(not (= 8673 (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); {35308#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:39,913 INFO L290 TraceCheckUtils]: 76: Hoare triple {35308#(not (= 8673 (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); {35308#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:39,914 INFO L290 TraceCheckUtils]: 77: Hoare triple {35308#(not (= 8673 (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); {35308#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:39,914 INFO L290 TraceCheckUtils]: 78: Hoare triple {35308#(not (= 8673 (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); {35308#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:39,915 INFO L290 TraceCheckUtils]: 79: Hoare triple {35308#(not (= 8673 (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); {35308#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:39,915 INFO L290 TraceCheckUtils]: 80: Hoare triple {35308#(not (= 8673 (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); {35308#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:39,916 INFO L290 TraceCheckUtils]: 81: Hoare triple {35308#(not (= 8673 (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); {35308#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:39,916 INFO L290 TraceCheckUtils]: 82: Hoare triple {35308#(not (= 8673 (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); {35308#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:39,916 INFO L290 TraceCheckUtils]: 83: Hoare triple {35308#(not (= 8673 (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); {35308#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:39,917 INFO L290 TraceCheckUtils]: 84: Hoare triple {35308#(not (= 8673 (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); {35308#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:39,917 INFO L290 TraceCheckUtils]: 85: Hoare triple {35308#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {35308#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:39,918 INFO L290 TraceCheckUtils]: 86: Hoare triple {35308#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {35308#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:39,918 INFO L290 TraceCheckUtils]: 87: Hoare triple {35308#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 72 + ~s.offset, 4); {35309#(not (= |ssl3_accept_#t~mem80| 8673))} is VALID [2022-04-28 15:18:39,918 INFO L290 TraceCheckUtils]: 88: Hoare triple {35309#(not (= |ssl3_accept_#t~mem80| 8673))} assume 8673 == #t~mem80;havoc #t~mem80; {35304#false} is VALID [2022-04-28 15:18:39,918 INFO L290 TraceCheckUtils]: 89: Hoare triple {35304#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {35304#false} is VALID [2022-04-28 15:18:39,919 INFO L290 TraceCheckUtils]: 90: Hoare triple {35304#false} assume 3 == ~blastFlag~0; {35304#false} is VALID [2022-04-28 15:18:39,919 INFO L290 TraceCheckUtils]: 91: Hoare triple {35304#false} assume !false; {35304#false} is VALID [2022-04-28 15:18:39,919 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 15:18:39,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:18:39,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339069543] [2022-04-28 15:18:39,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339069543] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:18:39,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:18:39,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:18:39,920 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:18:39,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1784297844] [2022-04-28 15:18:39,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1784297844] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:18:39,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:18:39,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:18:39,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478071129] [2022-04-28 15:18:39,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:18:39,921 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2022-04-28 15:18:39,921 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:18:39,921 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:39,995 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:18:39,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:18:39,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:18:39,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:18:39,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:18:39,996 INFO L87 Difference]: Start difference. First operand 296 states and 455 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:42,015 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:18:43,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:43,146 INFO L93 Difference]: Finished difference Result 674 states and 1042 transitions. [2022-04-28 15:18:43,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:18:43,146 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2022-04-28 15:18:43,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:18:43,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:43,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 564 transitions. [2022-04-28 15:18:43,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:43,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 564 transitions. [2022-04-28 15:18:43,151 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 564 transitions. [2022-04-28 15:18:43,531 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 564 edges. 564 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:18:43,538 INFO L225 Difference]: With dead ends: 674 [2022-04-28 15:18:43,538 INFO L226 Difference]: Without dead ends: 402 [2022-04-28 15:18:43,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:18:43,539 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 108 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 61 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 15:18:43,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 324 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 469 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 15:18:43,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2022-04-28 15:18:43,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 323. [2022-04-28 15:18:43,553 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:18:43,554 INFO L82 GeneralOperation]: Start isEquivalent. First operand 402 states. Second operand has 323 states, 318 states have (on average 1.5849056603773586) internal successors, (504), 318 states have internal predecessors, (504), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:43,554 INFO L74 IsIncluded]: Start isIncluded. First operand 402 states. Second operand has 323 states, 318 states have (on average 1.5849056603773586) internal successors, (504), 318 states have internal predecessors, (504), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:43,555 INFO L87 Difference]: Start difference. First operand 402 states. Second operand has 323 states, 318 states have (on average 1.5849056603773586) internal successors, (504), 318 states have internal predecessors, (504), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:43,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:43,563 INFO L93 Difference]: Finished difference Result 402 states and 613 transitions. [2022-04-28 15:18:43,564 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 613 transitions. [2022-04-28 15:18:43,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:18:43,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:18:43,565 INFO L74 IsIncluded]: Start isIncluded. First operand has 323 states, 318 states have (on average 1.5849056603773586) internal successors, (504), 318 states have internal predecessors, (504), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 402 states. [2022-04-28 15:18:43,565 INFO L87 Difference]: Start difference. First operand has 323 states, 318 states have (on average 1.5849056603773586) internal successors, (504), 318 states have internal predecessors, (504), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 402 states. [2022-04-28 15:18:43,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:43,574 INFO L93 Difference]: Finished difference Result 402 states and 613 transitions. [2022-04-28 15:18:43,574 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 613 transitions. [2022-04-28 15:18:43,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:18:43,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:18:43,575 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:18:43,575 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:18:43,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 318 states have (on average 1.5849056603773586) internal successors, (504), 318 states have internal predecessors, (504), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:43,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 508 transitions. [2022-04-28 15:18:43,596 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 508 transitions. Word has length 92 [2022-04-28 15:18:43,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:18:43,596 INFO L495 AbstractCegarLoop]: Abstraction has 323 states and 508 transitions. [2022-04-28 15:18:43,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:43,596 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 323 states and 508 transitions. [2022-04-28 15:18:43,979 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 508 edges. 508 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:18:43,979 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 508 transitions. [2022-04-28 15:18:43,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-04-28 15:18:43,983 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:18:43,983 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:18:43,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-28 15:18:43,984 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:18:43,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:18:43,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1693775945, now seen corresponding path program 1 times [2022-04-28 15:18:43,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:18:43,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [702895091] [2022-04-28 15:18:44,051 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:18:44,052 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:18:44,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1693775945, now seen corresponding path program 2 times [2022-04-28 15:18:44,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:18:44,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18647052] [2022-04-28 15:18:44,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:18:44,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:18:44,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:18:44,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:18:44,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:18:44,194 INFO L290 TraceCheckUtils]: 0: Hoare triple {38120#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {38113#true} is VALID [2022-04-28 15:18:44,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {38113#true} assume true; {38113#true} is VALID [2022-04-28 15:18:44,194 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38113#true} {38113#true} #662#return; {38113#true} is VALID [2022-04-28 15:18:44,195 INFO L272 TraceCheckUtils]: 0: Hoare triple {38113#true} call ULTIMATE.init(); {38120#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:18:44,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {38120#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {38113#true} is VALID [2022-04-28 15:18:44,195 INFO L290 TraceCheckUtils]: 2: Hoare triple {38113#true} assume true; {38113#true} is VALID [2022-04-28 15:18:44,195 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38113#true} {38113#true} #662#return; {38113#true} is VALID [2022-04-28 15:18:44,195 INFO L272 TraceCheckUtils]: 4: Hoare triple {38113#true} call #t~ret161 := main(); {38113#true} is VALID [2022-04-28 15:18:44,196 INFO L290 TraceCheckUtils]: 5: Hoare triple {38113#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~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);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; {38113#true} is VALID [2022-04-28 15:18:44,196 INFO L290 TraceCheckUtils]: 6: Hoare triple {38113#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {38113#true} is VALID [2022-04-28 15:18:44,196 INFO L272 TraceCheckUtils]: 7: Hoare triple {38113#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {38113#true} is VALID [2022-04-28 15:18:44,196 INFO L290 TraceCheckUtils]: 8: Hoare triple {38113#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;~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); {38113#true} is VALID [2022-04-28 15:18:44,196 INFO L290 TraceCheckUtils]: 9: Hoare triple {38113#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; {38113#true} is VALID [2022-04-28 15:18:44,196 INFO L290 TraceCheckUtils]: 10: Hoare triple {38113#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; {38113#true} is VALID [2022-04-28 15:18:44,196 INFO L290 TraceCheckUtils]: 11: Hoare triple {38113#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {38113#true} is VALID [2022-04-28 15:18:44,196 INFO L290 TraceCheckUtils]: 12: Hoare triple {38113#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {38113#true} is VALID [2022-04-28 15:18:44,196 INFO L290 TraceCheckUtils]: 13: Hoare triple {38113#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {38113#true} is VALID [2022-04-28 15:18:44,196 INFO L290 TraceCheckUtils]: 14: Hoare triple {38113#true} assume !false; {38113#true} is VALID [2022-04-28 15:18:44,197 INFO L290 TraceCheckUtils]: 15: Hoare triple {38113#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); {38113#true} is VALID [2022-04-28 15:18:44,197 INFO L290 TraceCheckUtils]: 16: Hoare triple {38113#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {38113#true} is VALID [2022-04-28 15:18:44,197 INFO L290 TraceCheckUtils]: 17: Hoare triple {38113#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {38113#true} is VALID [2022-04-28 15:18:44,197 INFO L290 TraceCheckUtils]: 18: Hoare triple {38113#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {38113#true} is VALID [2022-04-28 15:18:44,197 INFO L290 TraceCheckUtils]: 19: Hoare triple {38113#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {38113#true} is VALID [2022-04-28 15:18:44,197 INFO L290 TraceCheckUtils]: 20: Hoare triple {38113#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {38113#true} is VALID [2022-04-28 15:18:44,197 INFO L290 TraceCheckUtils]: 21: Hoare triple {38113#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {38113#true} is VALID [2022-04-28 15:18:44,197 INFO L290 TraceCheckUtils]: 22: Hoare triple {38113#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {38113#true} is VALID [2022-04-28 15:18:44,197 INFO L290 TraceCheckUtils]: 23: Hoare triple {38113#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {38113#true} is VALID [2022-04-28 15:18:44,198 INFO L290 TraceCheckUtils]: 24: Hoare triple {38113#true} assume 8464 == #t~mem55;havoc #t~mem55; {38113#true} is VALID [2022-04-28 15:18:44,198 INFO L290 TraceCheckUtils]: 25: Hoare triple {38113#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; {38113#true} is VALID [2022-04-28 15:18:44,198 INFO L290 TraceCheckUtils]: 26: Hoare triple {38113#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {38113#true} is VALID [2022-04-28 15:18:44,198 INFO L290 TraceCheckUtils]: 27: Hoare triple {38113#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); {38113#true} is VALID [2022-04-28 15:18:44,198 INFO L290 TraceCheckUtils]: 28: Hoare triple {38113#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); {38113#true} is VALID [2022-04-28 15:18:44,198 INFO L290 TraceCheckUtils]: 29: Hoare triple {38113#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {38113#true} is VALID [2022-04-28 15:18:44,198 INFO L290 TraceCheckUtils]: 30: Hoare triple {38113#true} ~skip~0 := 0; {38113#true} is VALID [2022-04-28 15:18:44,198 INFO L290 TraceCheckUtils]: 31: Hoare triple {38113#true} assume !false; {38113#true} is VALID [2022-04-28 15:18:44,198 INFO L290 TraceCheckUtils]: 32: Hoare triple {38113#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); {38113#true} is VALID [2022-04-28 15:18:44,198 INFO L290 TraceCheckUtils]: 33: Hoare triple {38113#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {38113#true} is VALID [2022-04-28 15:18:44,199 INFO L290 TraceCheckUtils]: 34: Hoare triple {38113#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {38113#true} is VALID [2022-04-28 15:18:44,199 INFO L290 TraceCheckUtils]: 35: Hoare triple {38113#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {38113#true} is VALID [2022-04-28 15:18:44,199 INFO L290 TraceCheckUtils]: 36: Hoare triple {38113#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {38113#true} is VALID [2022-04-28 15:18:44,199 INFO L290 TraceCheckUtils]: 37: Hoare triple {38113#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {38113#true} is VALID [2022-04-28 15:18:44,199 INFO L290 TraceCheckUtils]: 38: Hoare triple {38113#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {38113#true} is VALID [2022-04-28 15:18:44,199 INFO L290 TraceCheckUtils]: 39: Hoare triple {38113#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {38113#true} is VALID [2022-04-28 15:18:44,199 INFO L290 TraceCheckUtils]: 40: Hoare triple {38113#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {38113#true} is VALID [2022-04-28 15:18:44,199 INFO L290 TraceCheckUtils]: 41: Hoare triple {38113#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {38113#true} is VALID [2022-04-28 15:18:44,199 INFO L290 TraceCheckUtils]: 42: Hoare triple {38113#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {38113#true} is VALID [2022-04-28 15:18:44,199 INFO L290 TraceCheckUtils]: 43: Hoare triple {38113#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {38113#true} is VALID [2022-04-28 15:18:44,200 INFO L290 TraceCheckUtils]: 44: Hoare triple {38113#true} assume 8496 == #t~mem58;havoc #t~mem58; {38113#true} is VALID [2022-04-28 15:18:44,200 INFO L290 TraceCheckUtils]: 45: Hoare triple {38113#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {38113#true} is VALID [2022-04-28 15:18:44,200 INFO L290 TraceCheckUtils]: 46: Hoare triple {38113#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {38113#true} is VALID [2022-04-28 15:18:44,200 INFO L290 TraceCheckUtils]: 47: Hoare triple {38113#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {38113#true} is VALID [2022-04-28 15:18:44,201 INFO L290 TraceCheckUtils]: 48: Hoare triple {38113#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {38118#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:44,201 INFO L290 TraceCheckUtils]: 49: Hoare triple {38118#(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); {38118#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:44,202 INFO L290 TraceCheckUtils]: 50: Hoare triple {38118#(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); {38118#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:44,202 INFO L290 TraceCheckUtils]: 51: Hoare triple {38118#(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; {38118#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:44,203 INFO L290 TraceCheckUtils]: 52: Hoare triple {38118#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} ~skip~0 := 0; {38118#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:44,203 INFO L290 TraceCheckUtils]: 53: Hoare triple {38118#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {38118#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:44,204 INFO L290 TraceCheckUtils]: 54: Hoare triple {38118#(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); {38118#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:44,204 INFO L290 TraceCheckUtils]: 55: Hoare triple {38118#(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); {38118#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:44,204 INFO L290 TraceCheckUtils]: 56: Hoare triple {38118#(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); {38118#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:44,205 INFO L290 TraceCheckUtils]: 57: Hoare triple {38118#(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); {38118#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:44,205 INFO L290 TraceCheckUtils]: 58: Hoare triple {38118#(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); {38118#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:44,206 INFO L290 TraceCheckUtils]: 59: Hoare triple {38118#(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); {38118#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:44,206 INFO L290 TraceCheckUtils]: 60: Hoare triple {38118#(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); {38118#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:44,206 INFO L290 TraceCheckUtils]: 61: Hoare triple {38118#(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); {38118#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:44,207 INFO L290 TraceCheckUtils]: 62: Hoare triple {38118#(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); {38118#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:44,207 INFO L290 TraceCheckUtils]: 63: Hoare triple {38118#(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); {38118#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:44,208 INFO L290 TraceCheckUtils]: 64: Hoare triple {38118#(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); {38118#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:44,208 INFO L290 TraceCheckUtils]: 65: Hoare triple {38118#(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); {38118#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:44,209 INFO L290 TraceCheckUtils]: 66: Hoare triple {38118#(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); {38118#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:44,209 INFO L290 TraceCheckUtils]: 67: Hoare triple {38118#(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); {38118#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:44,209 INFO L290 TraceCheckUtils]: 68: Hoare triple {38118#(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); {38118#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:44,210 INFO L290 TraceCheckUtils]: 69: Hoare triple {38118#(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); {38118#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:44,210 INFO L290 TraceCheckUtils]: 70: Hoare triple {38118#(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); {38118#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:44,211 INFO L290 TraceCheckUtils]: 71: Hoare triple {38118#(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); {38118#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:44,211 INFO L290 TraceCheckUtils]: 72: Hoare triple {38118#(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); {38118#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:44,211 INFO L290 TraceCheckUtils]: 73: Hoare triple {38118#(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); {38118#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:44,212 INFO L290 TraceCheckUtils]: 74: Hoare triple {38118#(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); {38118#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:44,212 INFO L290 TraceCheckUtils]: 75: Hoare triple {38118#(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); {38119#(not (= 8448 |ssl3_accept_#t~mem68|))} is VALID [2022-04-28 15:18:44,213 INFO L290 TraceCheckUtils]: 76: Hoare triple {38119#(not (= 8448 |ssl3_accept_#t~mem68|))} assume 8448 == #t~mem68;havoc #t~mem68; {38114#false} is VALID [2022-04-28 15:18:44,213 INFO L290 TraceCheckUtils]: 77: Hoare triple {38114#false} assume !(~num1~0 > 0); {38114#false} is VALID [2022-04-28 15:18:44,213 INFO L290 TraceCheckUtils]: 78: Hoare triple {38114#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; {38114#false} is VALID [2022-04-28 15:18:44,213 INFO L290 TraceCheckUtils]: 79: Hoare triple {38114#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); {38114#false} is VALID [2022-04-28 15:18:44,213 INFO L290 TraceCheckUtils]: 80: Hoare triple {38114#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {38114#false} is VALID [2022-04-28 15:18:44,213 INFO L290 TraceCheckUtils]: 81: Hoare triple {38114#false} ~skip~0 := 0; {38114#false} is VALID [2022-04-28 15:18:44,213 INFO L290 TraceCheckUtils]: 82: Hoare triple {38114#false} assume !false; {38114#false} is VALID [2022-04-28 15:18:44,213 INFO L290 TraceCheckUtils]: 83: Hoare triple {38114#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); {38114#false} is VALID [2022-04-28 15:18:44,213 INFO L290 TraceCheckUtils]: 84: Hoare triple {38114#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {38114#false} is VALID [2022-04-28 15:18:44,213 INFO L290 TraceCheckUtils]: 85: Hoare triple {38114#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {38114#false} is VALID [2022-04-28 15:18:44,214 INFO L290 TraceCheckUtils]: 86: Hoare triple {38114#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {38114#false} is VALID [2022-04-28 15:18:44,214 INFO L290 TraceCheckUtils]: 87: Hoare triple {38114#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {38114#false} is VALID [2022-04-28 15:18:44,214 INFO L290 TraceCheckUtils]: 88: Hoare triple {38114#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {38114#false} is VALID [2022-04-28 15:18:44,214 INFO L290 TraceCheckUtils]: 89: Hoare triple {38114#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {38114#false} is VALID [2022-04-28 15:18:44,214 INFO L290 TraceCheckUtils]: 90: Hoare triple {38114#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {38114#false} is VALID [2022-04-28 15:18:44,214 INFO L290 TraceCheckUtils]: 91: Hoare triple {38114#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {38114#false} is VALID [2022-04-28 15:18:44,214 INFO L290 TraceCheckUtils]: 92: Hoare triple {38114#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {38114#false} is VALID [2022-04-28 15:18:44,214 INFO L290 TraceCheckUtils]: 93: Hoare triple {38114#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {38114#false} is VALID [2022-04-28 15:18:44,214 INFO L290 TraceCheckUtils]: 94: Hoare triple {38114#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {38114#false} is VALID [2022-04-28 15:18:44,214 INFO L290 TraceCheckUtils]: 95: Hoare triple {38114#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {38114#false} is VALID [2022-04-28 15:18:44,215 INFO L290 TraceCheckUtils]: 96: Hoare triple {38114#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {38114#false} is VALID [2022-04-28 15:18:44,215 INFO L290 TraceCheckUtils]: 97: Hoare triple {38114#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {38114#false} is VALID [2022-04-28 15:18:44,215 INFO L290 TraceCheckUtils]: 98: Hoare triple {38114#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {38114#false} is VALID [2022-04-28 15:18:44,215 INFO L290 TraceCheckUtils]: 99: Hoare triple {38114#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {38114#false} is VALID [2022-04-28 15:18:44,215 INFO L290 TraceCheckUtils]: 100: Hoare triple {38114#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {38114#false} is VALID [2022-04-28 15:18:44,215 INFO L290 TraceCheckUtils]: 101: Hoare triple {38114#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {38114#false} is VALID [2022-04-28 15:18:44,215 INFO L290 TraceCheckUtils]: 102: Hoare triple {38114#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {38114#false} is VALID [2022-04-28 15:18:44,215 INFO L290 TraceCheckUtils]: 103: Hoare triple {38114#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {38114#false} is VALID [2022-04-28 15:18:44,215 INFO L290 TraceCheckUtils]: 104: Hoare triple {38114#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {38114#false} is VALID [2022-04-28 15:18:44,215 INFO L290 TraceCheckUtils]: 105: Hoare triple {38114#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {38114#false} is VALID [2022-04-28 15:18:44,216 INFO L290 TraceCheckUtils]: 106: Hoare triple {38114#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {38114#false} is VALID [2022-04-28 15:18:44,216 INFO L290 TraceCheckUtils]: 107: Hoare triple {38114#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {38114#false} is VALID [2022-04-28 15:18:44,216 INFO L290 TraceCheckUtils]: 108: Hoare triple {38114#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {38114#false} is VALID [2022-04-28 15:18:44,216 INFO L290 TraceCheckUtils]: 109: Hoare triple {38114#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {38114#false} is VALID [2022-04-28 15:18:44,216 INFO L290 TraceCheckUtils]: 110: Hoare triple {38114#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {38114#false} is VALID [2022-04-28 15:18:44,216 INFO L290 TraceCheckUtils]: 111: Hoare triple {38114#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {38114#false} is VALID [2022-04-28 15:18:44,216 INFO L290 TraceCheckUtils]: 112: Hoare triple {38114#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {38114#false} is VALID [2022-04-28 15:18:44,216 INFO L290 TraceCheckUtils]: 113: Hoare triple {38114#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {38114#false} is VALID [2022-04-28 15:18:44,216 INFO L290 TraceCheckUtils]: 114: Hoare triple {38114#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {38114#false} is VALID [2022-04-28 15:18:44,217 INFO L290 TraceCheckUtils]: 115: Hoare triple {38114#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {38114#false} is VALID [2022-04-28 15:18:44,217 INFO L290 TraceCheckUtils]: 116: Hoare triple {38114#false} assume 8672 == #t~mem79;havoc #t~mem79; {38114#false} is VALID [2022-04-28 15:18:44,217 INFO L290 TraceCheckUtils]: 117: Hoare triple {38114#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {38114#false} is VALID [2022-04-28 15:18:44,217 INFO L290 TraceCheckUtils]: 118: Hoare triple {38114#false} assume 3 == ~blastFlag~0; {38114#false} is VALID [2022-04-28 15:18:44,217 INFO L290 TraceCheckUtils]: 119: Hoare triple {38114#false} assume !false; {38114#false} is VALID [2022-04-28 15:18:44,217 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 15:18:44,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:18:44,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18647052] [2022-04-28 15:18:44,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18647052] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:18:44,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:18:44,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:18:44,218 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:18:44,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [702895091] [2022-04-28 15:18:44,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [702895091] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:18:44,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:18:44,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:18:44,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037344783] [2022-04-28 15:18:44,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:18:44,219 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 120 [2022-04-28 15:18:44,219 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:18:44,220 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:44,306 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:18:44,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:18:44,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:18:44,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:18:44,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:18:44,307 INFO L87 Difference]: Start difference. First operand 323 states and 508 transitions. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:46,332 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:18:47,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:47,461 INFO L93 Difference]: Finished difference Result 738 states and 1162 transitions. [2022-04-28 15:18:47,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:18:47,462 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 120 [2022-04-28 15:18:47,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:18:47,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:47,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 558 transitions. [2022-04-28 15:18:47,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:47,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 558 transitions. [2022-04-28 15:18:47,466 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 558 transitions. [2022-04-28 15:18:47,834 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 558 edges. 558 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:18:47,845 INFO L225 Difference]: With dead ends: 738 [2022-04-28 15:18:47,845 INFO L226 Difference]: Without dead ends: 441 [2022-04-28 15:18:47,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:18:47,846 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 116 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 50 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 15:18:47,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 340 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 464 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 15:18:47,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2022-04-28 15:18:47,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 355. [2022-04-28 15:18:47,861 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:18:47,862 INFO L82 GeneralOperation]: Start isEquivalent. First operand 441 states. Second operand has 355 states, 350 states have (on average 1.5914285714285714) internal successors, (557), 350 states have internal predecessors, (557), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:47,862 INFO L74 IsIncluded]: Start isIncluded. First operand 441 states. Second operand has 355 states, 350 states have (on average 1.5914285714285714) internal successors, (557), 350 states have internal predecessors, (557), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:47,863 INFO L87 Difference]: Start difference. First operand 441 states. Second operand has 355 states, 350 states have (on average 1.5914285714285714) internal successors, (557), 350 states have internal predecessors, (557), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:47,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:47,873 INFO L93 Difference]: Finished difference Result 441 states and 681 transitions. [2022-04-28 15:18:47,873 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 681 transitions. [2022-04-28 15:18:47,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:18:47,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:18:47,874 INFO L74 IsIncluded]: Start isIncluded. First operand has 355 states, 350 states have (on average 1.5914285714285714) internal successors, (557), 350 states have internal predecessors, (557), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 441 states. [2022-04-28 15:18:47,875 INFO L87 Difference]: Start difference. First operand has 355 states, 350 states have (on average 1.5914285714285714) internal successors, (557), 350 states have internal predecessors, (557), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 441 states. [2022-04-28 15:18:47,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:47,885 INFO L93 Difference]: Finished difference Result 441 states and 681 transitions. [2022-04-28 15:18:47,885 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 681 transitions. [2022-04-28 15:18:47,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:18:47,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:18:47,886 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:18:47,886 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:18:47,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 350 states have (on average 1.5914285714285714) internal successors, (557), 350 states have internal predecessors, (557), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:47,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 561 transitions. [2022-04-28 15:18:47,895 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 561 transitions. Word has length 120 [2022-04-28 15:18:47,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:18:47,896 INFO L495 AbstractCegarLoop]: Abstraction has 355 states and 561 transitions. [2022-04-28 15:18:47,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:47,896 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 355 states and 561 transitions. [2022-04-28 15:18:48,418 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 561 edges. 561 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:18:48,418 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 561 transitions. [2022-04-28 15:18:48,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-04-28 15:18:48,419 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:18:48,419 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:18:48,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-28 15:18:48,419 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:18:48,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:18:48,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1893583649, now seen corresponding path program 1 times [2022-04-28 15:18:48,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:18:48,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1689351799] [2022-04-28 15:18:48,498 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:18:48,498 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:18:48,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1893583649, now seen corresponding path program 2 times [2022-04-28 15:18:48,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:18:48,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142432204] [2022-04-28 15:18:48,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:18:48,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:18:48,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:18:48,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:18:48,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:18:48,646 INFO L290 TraceCheckUtils]: 0: Hoare triple {41200#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {41193#true} is VALID [2022-04-28 15:18:48,647 INFO L290 TraceCheckUtils]: 1: Hoare triple {41193#true} assume true; {41193#true} is VALID [2022-04-28 15:18:48,647 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41193#true} {41193#true} #662#return; {41193#true} is VALID [2022-04-28 15:18:48,648 INFO L272 TraceCheckUtils]: 0: Hoare triple {41193#true} call ULTIMATE.init(); {41200#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:18:48,648 INFO L290 TraceCheckUtils]: 1: Hoare triple {41200#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {41193#true} is VALID [2022-04-28 15:18:48,648 INFO L290 TraceCheckUtils]: 2: Hoare triple {41193#true} assume true; {41193#true} is VALID [2022-04-28 15:18:48,648 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41193#true} {41193#true} #662#return; {41193#true} is VALID [2022-04-28 15:18:48,648 INFO L272 TraceCheckUtils]: 4: Hoare triple {41193#true} call #t~ret161 := main(); {41193#true} is VALID [2022-04-28 15:18:48,648 INFO L290 TraceCheckUtils]: 5: Hoare triple {41193#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~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);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; {41193#true} is VALID [2022-04-28 15:18:48,648 INFO L290 TraceCheckUtils]: 6: Hoare triple {41193#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {41193#true} is VALID [2022-04-28 15:18:48,649 INFO L272 TraceCheckUtils]: 7: Hoare triple {41193#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {41193#true} is VALID [2022-04-28 15:18:48,649 INFO L290 TraceCheckUtils]: 8: Hoare triple {41193#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;~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); {41193#true} is VALID [2022-04-28 15:18:48,649 INFO L290 TraceCheckUtils]: 9: Hoare triple {41193#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; {41193#true} is VALID [2022-04-28 15:18:48,649 INFO L290 TraceCheckUtils]: 10: Hoare triple {41193#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; {41193#true} is VALID [2022-04-28 15:18:48,649 INFO L290 TraceCheckUtils]: 11: Hoare triple {41193#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {41193#true} is VALID [2022-04-28 15:18:48,649 INFO L290 TraceCheckUtils]: 12: Hoare triple {41193#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {41193#true} is VALID [2022-04-28 15:18:48,649 INFO L290 TraceCheckUtils]: 13: Hoare triple {41193#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {41193#true} is VALID [2022-04-28 15:18:48,649 INFO L290 TraceCheckUtils]: 14: Hoare triple {41193#true} assume !false; {41193#true} is VALID [2022-04-28 15:18:48,649 INFO L290 TraceCheckUtils]: 15: Hoare triple {41193#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); {41193#true} is VALID [2022-04-28 15:18:48,649 INFO L290 TraceCheckUtils]: 16: Hoare triple {41193#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {41193#true} is VALID [2022-04-28 15:18:48,649 INFO L290 TraceCheckUtils]: 17: Hoare triple {41193#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {41193#true} is VALID [2022-04-28 15:18:48,650 INFO L290 TraceCheckUtils]: 18: Hoare triple {41193#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {41193#true} is VALID [2022-04-28 15:18:48,650 INFO L290 TraceCheckUtils]: 19: Hoare triple {41193#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {41193#true} is VALID [2022-04-28 15:18:48,650 INFO L290 TraceCheckUtils]: 20: Hoare triple {41193#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {41193#true} is VALID [2022-04-28 15:18:48,650 INFO L290 TraceCheckUtils]: 21: Hoare triple {41193#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {41193#true} is VALID [2022-04-28 15:18:48,650 INFO L290 TraceCheckUtils]: 22: Hoare triple {41193#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {41193#true} is VALID [2022-04-28 15:18:48,650 INFO L290 TraceCheckUtils]: 23: Hoare triple {41193#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {41193#true} is VALID [2022-04-28 15:18:48,650 INFO L290 TraceCheckUtils]: 24: Hoare triple {41193#true} assume 8464 == #t~mem55;havoc #t~mem55; {41193#true} is VALID [2022-04-28 15:18:48,650 INFO L290 TraceCheckUtils]: 25: Hoare triple {41193#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; {41193#true} is VALID [2022-04-28 15:18:48,650 INFO L290 TraceCheckUtils]: 26: Hoare triple {41193#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {41193#true} is VALID [2022-04-28 15:18:48,651 INFO L290 TraceCheckUtils]: 27: Hoare triple {41193#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); {41198#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:48,652 INFO L290 TraceCheckUtils]: 28: Hoare triple {41198#(= 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); {41198#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:48,652 INFO L290 TraceCheckUtils]: 29: Hoare triple {41198#(= 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; {41198#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:48,653 INFO L290 TraceCheckUtils]: 30: Hoare triple {41198#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {41198#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:48,653 INFO L290 TraceCheckUtils]: 31: Hoare triple {41198#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {41198#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:48,654 INFO L290 TraceCheckUtils]: 32: Hoare triple {41198#(= 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); {41199#(= |ssl3_accept_#t~mem47| 8496)} is VALID [2022-04-28 15:18:48,654 INFO L290 TraceCheckUtils]: 33: Hoare triple {41199#(= |ssl3_accept_#t~mem47| 8496)} assume 12292 == #t~mem47;havoc #t~mem47; {41194#false} is VALID [2022-04-28 15:18:48,654 INFO L290 TraceCheckUtils]: 34: Hoare triple {41194#false} call write~int(1, ~s.base, 60 + ~s.offset, 4); {41194#false} is VALID [2022-04-28 15:18:48,654 INFO L290 TraceCheckUtils]: 35: Hoare triple {41194#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {41194#false} is VALID [2022-04-28 15:18:48,654 INFO L290 TraceCheckUtils]: 36: Hoare triple {41194#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {41194#false} is VALID [2022-04-28 15:18:48,654 INFO L290 TraceCheckUtils]: 37: Hoare triple {41194#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {41194#false} is VALID [2022-04-28 15:18:48,654 INFO L290 TraceCheckUtils]: 38: Hoare triple {41194#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); {41194#false} is VALID [2022-04-28 15:18:48,655 INFO L290 TraceCheckUtils]: 39: Hoare triple {41194#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {41194#false} is VALID [2022-04-28 15:18:48,655 INFO L290 TraceCheckUtils]: 40: Hoare triple {41194#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); {41194#false} is VALID [2022-04-28 15:18:48,655 INFO L290 TraceCheckUtils]: 41: Hoare triple {41194#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); {41194#false} is VALID [2022-04-28 15:18:48,655 INFO L290 TraceCheckUtils]: 42: Hoare triple {41194#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); {41194#false} is VALID [2022-04-28 15:18:48,655 INFO L290 TraceCheckUtils]: 43: Hoare triple {41194#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {41194#false} is VALID [2022-04-28 15:18:48,655 INFO L290 TraceCheckUtils]: 44: Hoare triple {41194#false} ~skip~0 := 0; {41194#false} is VALID [2022-04-28 15:18:48,655 INFO L290 TraceCheckUtils]: 45: Hoare triple {41194#false} assume !false; {41194#false} is VALID [2022-04-28 15:18:48,655 INFO L290 TraceCheckUtils]: 46: Hoare triple {41194#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); {41194#false} is VALID [2022-04-28 15:18:48,655 INFO L290 TraceCheckUtils]: 47: Hoare triple {41194#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {41194#false} is VALID [2022-04-28 15:18:48,655 INFO L290 TraceCheckUtils]: 48: Hoare triple {41194#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {41194#false} is VALID [2022-04-28 15:18:48,656 INFO L290 TraceCheckUtils]: 49: Hoare triple {41194#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {41194#false} is VALID [2022-04-28 15:18:48,656 INFO L290 TraceCheckUtils]: 50: Hoare triple {41194#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {41194#false} is VALID [2022-04-28 15:18:48,656 INFO L290 TraceCheckUtils]: 51: Hoare triple {41194#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {41194#false} is VALID [2022-04-28 15:18:48,656 INFO L290 TraceCheckUtils]: 52: Hoare triple {41194#false} assume 8480 == #t~mem52;havoc #t~mem52; {41194#false} is VALID [2022-04-28 15:18:48,656 INFO L290 TraceCheckUtils]: 53: Hoare triple {41194#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; {41194#false} is VALID [2022-04-28 15:18:48,656 INFO L290 TraceCheckUtils]: 54: Hoare triple {41194#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); {41194#false} is VALID [2022-04-28 15:18:48,656 INFO L290 TraceCheckUtils]: 55: Hoare triple {41194#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); {41194#false} is VALID [2022-04-28 15:18:48,656 INFO L290 TraceCheckUtils]: 56: Hoare triple {41194#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {41194#false} is VALID [2022-04-28 15:18:48,656 INFO L290 TraceCheckUtils]: 57: Hoare triple {41194#false} ~skip~0 := 0; {41194#false} is VALID [2022-04-28 15:18:48,656 INFO L290 TraceCheckUtils]: 58: Hoare triple {41194#false} assume !false; {41194#false} is VALID [2022-04-28 15:18:48,656 INFO L290 TraceCheckUtils]: 59: Hoare triple {41194#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); {41194#false} is VALID [2022-04-28 15:18:48,657 INFO L290 TraceCheckUtils]: 60: Hoare triple {41194#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {41194#false} is VALID [2022-04-28 15:18:48,657 INFO L290 TraceCheckUtils]: 61: Hoare triple {41194#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {41194#false} is VALID [2022-04-28 15:18:48,657 INFO L290 TraceCheckUtils]: 62: Hoare triple {41194#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {41194#false} is VALID [2022-04-28 15:18:48,657 INFO L290 TraceCheckUtils]: 63: Hoare triple {41194#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {41194#false} is VALID [2022-04-28 15:18:48,657 INFO L290 TraceCheckUtils]: 64: Hoare triple {41194#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {41194#false} is VALID [2022-04-28 15:18:48,657 INFO L290 TraceCheckUtils]: 65: Hoare triple {41194#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {41194#false} is VALID [2022-04-28 15:18:48,657 INFO L290 TraceCheckUtils]: 66: Hoare triple {41194#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {41194#false} is VALID [2022-04-28 15:18:48,657 INFO L290 TraceCheckUtils]: 67: Hoare triple {41194#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {41194#false} is VALID [2022-04-28 15:18:48,657 INFO L290 TraceCheckUtils]: 68: Hoare triple {41194#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {41194#false} is VALID [2022-04-28 15:18:48,657 INFO L290 TraceCheckUtils]: 69: Hoare triple {41194#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {41194#false} is VALID [2022-04-28 15:18:48,658 INFO L290 TraceCheckUtils]: 70: Hoare triple {41194#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {41194#false} is VALID [2022-04-28 15:18:48,658 INFO L290 TraceCheckUtils]: 71: Hoare triple {41194#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {41194#false} is VALID [2022-04-28 15:18:48,658 INFO L290 TraceCheckUtils]: 72: Hoare triple {41194#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {41194#false} is VALID [2022-04-28 15:18:48,658 INFO L290 TraceCheckUtils]: 73: Hoare triple {41194#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {41194#false} is VALID [2022-04-28 15:18:48,658 INFO L290 TraceCheckUtils]: 74: Hoare triple {41194#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {41194#false} is VALID [2022-04-28 15:18:48,658 INFO L290 TraceCheckUtils]: 75: Hoare triple {41194#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {41194#false} is VALID [2022-04-28 15:18:48,658 INFO L290 TraceCheckUtils]: 76: Hoare triple {41194#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {41194#false} is VALID [2022-04-28 15:18:48,658 INFO L290 TraceCheckUtils]: 77: Hoare triple {41194#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {41194#false} is VALID [2022-04-28 15:18:48,658 INFO L290 TraceCheckUtils]: 78: Hoare triple {41194#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {41194#false} is VALID [2022-04-28 15:18:48,658 INFO L290 TraceCheckUtils]: 79: Hoare triple {41194#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {41194#false} is VALID [2022-04-28 15:18:48,658 INFO L290 TraceCheckUtils]: 80: Hoare triple {41194#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {41194#false} is VALID [2022-04-28 15:18:48,659 INFO L290 TraceCheckUtils]: 81: Hoare triple {41194#false} assume 8448 == #t~mem68;havoc #t~mem68; {41194#false} is VALID [2022-04-28 15:18:48,659 INFO L290 TraceCheckUtils]: 82: Hoare triple {41194#false} assume !(~num1~0 > 0); {41194#false} is VALID [2022-04-28 15:18:48,659 INFO L290 TraceCheckUtils]: 83: Hoare triple {41194#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; {41194#false} is VALID [2022-04-28 15:18:48,659 INFO L290 TraceCheckUtils]: 84: Hoare triple {41194#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); {41194#false} is VALID [2022-04-28 15:18:48,659 INFO L290 TraceCheckUtils]: 85: Hoare triple {41194#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {41194#false} is VALID [2022-04-28 15:18:48,659 INFO L290 TraceCheckUtils]: 86: Hoare triple {41194#false} ~skip~0 := 0; {41194#false} is VALID [2022-04-28 15:18:48,659 INFO L290 TraceCheckUtils]: 87: Hoare triple {41194#false} assume !false; {41194#false} is VALID [2022-04-28 15:18:48,659 INFO L290 TraceCheckUtils]: 88: Hoare triple {41194#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); {41194#false} is VALID [2022-04-28 15:18:48,659 INFO L290 TraceCheckUtils]: 89: Hoare triple {41194#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {41194#false} is VALID [2022-04-28 15:18:48,659 INFO L290 TraceCheckUtils]: 90: Hoare triple {41194#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {41194#false} is VALID [2022-04-28 15:18:48,659 INFO L290 TraceCheckUtils]: 91: Hoare triple {41194#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {41194#false} is VALID [2022-04-28 15:18:48,660 INFO L290 TraceCheckUtils]: 92: Hoare triple {41194#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {41194#false} is VALID [2022-04-28 15:18:48,660 INFO L290 TraceCheckUtils]: 93: Hoare triple {41194#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {41194#false} is VALID [2022-04-28 15:18:48,660 INFO L290 TraceCheckUtils]: 94: Hoare triple {41194#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {41194#false} is VALID [2022-04-28 15:18:48,660 INFO L290 TraceCheckUtils]: 95: Hoare triple {41194#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {41194#false} is VALID [2022-04-28 15:18:48,660 INFO L290 TraceCheckUtils]: 96: Hoare triple {41194#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {41194#false} is VALID [2022-04-28 15:18:48,660 INFO L290 TraceCheckUtils]: 97: Hoare triple {41194#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {41194#false} is VALID [2022-04-28 15:18:48,660 INFO L290 TraceCheckUtils]: 98: Hoare triple {41194#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {41194#false} is VALID [2022-04-28 15:18:48,660 INFO L290 TraceCheckUtils]: 99: Hoare triple {41194#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {41194#false} is VALID [2022-04-28 15:18:48,660 INFO L290 TraceCheckUtils]: 100: Hoare triple {41194#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {41194#false} is VALID [2022-04-28 15:18:48,660 INFO L290 TraceCheckUtils]: 101: Hoare triple {41194#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {41194#false} is VALID [2022-04-28 15:18:48,660 INFO L290 TraceCheckUtils]: 102: Hoare triple {41194#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {41194#false} is VALID [2022-04-28 15:18:48,661 INFO L290 TraceCheckUtils]: 103: Hoare triple {41194#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {41194#false} is VALID [2022-04-28 15:18:48,661 INFO L290 TraceCheckUtils]: 104: Hoare triple {41194#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {41194#false} is VALID [2022-04-28 15:18:48,661 INFO L290 TraceCheckUtils]: 105: Hoare triple {41194#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {41194#false} is VALID [2022-04-28 15:18:48,661 INFO L290 TraceCheckUtils]: 106: Hoare triple {41194#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {41194#false} is VALID [2022-04-28 15:18:48,661 INFO L290 TraceCheckUtils]: 107: Hoare triple {41194#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {41194#false} is VALID [2022-04-28 15:18:48,661 INFO L290 TraceCheckUtils]: 108: Hoare triple {41194#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {41194#false} is VALID [2022-04-28 15:18:48,661 INFO L290 TraceCheckUtils]: 109: Hoare triple {41194#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {41194#false} is VALID [2022-04-28 15:18:48,661 INFO L290 TraceCheckUtils]: 110: Hoare triple {41194#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {41194#false} is VALID [2022-04-28 15:18:48,661 INFO L290 TraceCheckUtils]: 111: Hoare triple {41194#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {41194#false} is VALID [2022-04-28 15:18:48,661 INFO L290 TraceCheckUtils]: 112: Hoare triple {41194#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {41194#false} is VALID [2022-04-28 15:18:48,661 INFO L290 TraceCheckUtils]: 113: Hoare triple {41194#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {41194#false} is VALID [2022-04-28 15:18:48,662 INFO L290 TraceCheckUtils]: 114: Hoare triple {41194#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {41194#false} is VALID [2022-04-28 15:18:48,662 INFO L290 TraceCheckUtils]: 115: Hoare triple {41194#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {41194#false} is VALID [2022-04-28 15:18:48,662 INFO L290 TraceCheckUtils]: 116: Hoare triple {41194#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {41194#false} is VALID [2022-04-28 15:18:48,662 INFO L290 TraceCheckUtils]: 117: Hoare triple {41194#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {41194#false} is VALID [2022-04-28 15:18:48,662 INFO L290 TraceCheckUtils]: 118: Hoare triple {41194#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {41194#false} is VALID [2022-04-28 15:18:48,662 INFO L290 TraceCheckUtils]: 119: Hoare triple {41194#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {41194#false} is VALID [2022-04-28 15:18:48,662 INFO L290 TraceCheckUtils]: 120: Hoare triple {41194#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {41194#false} is VALID [2022-04-28 15:18:48,662 INFO L290 TraceCheckUtils]: 121: Hoare triple {41194#false} assume 8672 == #t~mem79;havoc #t~mem79; {41194#false} is VALID [2022-04-28 15:18:48,662 INFO L290 TraceCheckUtils]: 122: Hoare triple {41194#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {41194#false} is VALID [2022-04-28 15:18:48,662 INFO L290 TraceCheckUtils]: 123: Hoare triple {41194#false} assume 3 == ~blastFlag~0; {41194#false} is VALID [2022-04-28 15:18:48,663 INFO L290 TraceCheckUtils]: 124: Hoare triple {41194#false} assume !false; {41194#false} is VALID [2022-04-28 15:18:48,663 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-04-28 15:18:48,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:18:48,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142432204] [2022-04-28 15:18:48,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142432204] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:18:48,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:18:48,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:18:48,664 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:18:48,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1689351799] [2022-04-28 15:18:48,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1689351799] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:18:48,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:18:48,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:18:48,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606441012] [2022-04-28 15:18:48,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:18:48,665 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 125 [2022-04-28 15:18:48,666 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:18:48,666 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:48,741 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:18:48,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:18:48,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:18:48,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:18:48,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:18:48,742 INFO L87 Difference]: Start difference. First operand 355 states and 561 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:50,767 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:18:51,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:51,689 INFO L93 Difference]: Finished difference Result 691 states and 1102 transitions. [2022-04-28 15:18:51,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:18:51,689 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 125 [2022-04-28 15:18:51,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:18:51,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:51,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 432 transitions. [2022-04-28 15:18:51,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:51,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 432 transitions. [2022-04-28 15:18:51,694 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 432 transitions. [2022-04-28 15:18:51,977 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 432 edges. 432 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:18:51,982 INFO L225 Difference]: With dead ends: 691 [2022-04-28 15:18:51,983 INFO L226 Difference]: Without dead ends: 362 [2022-04-28 15:18:51,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:18:51,984 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 30 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:18:51,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 495 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 361 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 15:18:51,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2022-04-28 15:18:52,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 355. [2022-04-28 15:18:52,000 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:18:52,001 INFO L82 GeneralOperation]: Start isEquivalent. First operand 362 states. Second operand has 355 states, 350 states have (on average 1.5885714285714285) internal successors, (556), 350 states have internal predecessors, (556), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:52,001 INFO L74 IsIncluded]: Start isIncluded. First operand 362 states. Second operand has 355 states, 350 states have (on average 1.5885714285714285) internal successors, (556), 350 states have internal predecessors, (556), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:52,002 INFO L87 Difference]: Start difference. First operand 362 states. Second operand has 355 states, 350 states have (on average 1.5885714285714285) internal successors, (556), 350 states have internal predecessors, (556), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:52,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:52,009 INFO L93 Difference]: Finished difference Result 362 states and 570 transitions. [2022-04-28 15:18:52,009 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 570 transitions. [2022-04-28 15:18:52,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:18:52,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:18:52,010 INFO L74 IsIncluded]: Start isIncluded. First operand has 355 states, 350 states have (on average 1.5885714285714285) internal successors, (556), 350 states have internal predecessors, (556), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 362 states. [2022-04-28 15:18:52,010 INFO L87 Difference]: Start difference. First operand has 355 states, 350 states have (on average 1.5885714285714285) internal successors, (556), 350 states have internal predecessors, (556), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 362 states. [2022-04-28 15:18:52,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:52,018 INFO L93 Difference]: Finished difference Result 362 states and 570 transitions. [2022-04-28 15:18:52,018 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 570 transitions. [2022-04-28 15:18:52,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:18:52,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:18:52,018 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:18:52,018 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:18:52,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 350 states have (on average 1.5885714285714285) internal successors, (556), 350 states have internal predecessors, (556), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:52,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 560 transitions. [2022-04-28 15:18:52,028 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 560 transitions. Word has length 125 [2022-04-28 15:18:52,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:18:52,028 INFO L495 AbstractCegarLoop]: Abstraction has 355 states and 560 transitions. [2022-04-28 15:18:52,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:52,028 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 355 states and 560 transitions. [2022-04-28 15:18:52,547 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 560 edges. 560 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:18:52,547 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 560 transitions. [2022-04-28 15:18:52,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-04-28 15:18:52,548 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:18:52,548 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:18:52,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-28 15:18:52,549 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:18:52,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:18:52,549 INFO L85 PathProgramCache]: Analyzing trace with hash 977330790, now seen corresponding path program 1 times [2022-04-28 15:18:52,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:18:52,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2006639517] [2022-04-28 15:18:52,642 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:18:52,642 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:18:52,642 INFO L85 PathProgramCache]: Analyzing trace with hash 977330790, now seen corresponding path program 2 times [2022-04-28 15:18:52,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:18:52,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360399252] [2022-04-28 15:18:52,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:18:52,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:18:53,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:18:53,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:18:53,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:18:53,206 INFO L290 TraceCheckUtils]: 0: Hoare triple {44030#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {44021#true} is VALID [2022-04-28 15:18:53,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {44021#true} assume true; {44021#true} is VALID [2022-04-28 15:18:53,206 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {44021#true} {44021#true} #662#return; {44021#true} is VALID [2022-04-28 15:18:53,207 INFO L272 TraceCheckUtils]: 0: Hoare triple {44021#true} call ULTIMATE.init(); {44030#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:18:53,208 INFO L290 TraceCheckUtils]: 1: Hoare triple {44030#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {44021#true} is VALID [2022-04-28 15:18:53,208 INFO L290 TraceCheckUtils]: 2: Hoare triple {44021#true} assume true; {44021#true} is VALID [2022-04-28 15:18:53,208 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44021#true} {44021#true} #662#return; {44021#true} is VALID [2022-04-28 15:18:53,210 INFO L272 TraceCheckUtils]: 4: Hoare triple {44021#true} call #t~ret161 := main(); {44021#true} is VALID [2022-04-28 15:18:53,210 INFO L290 TraceCheckUtils]: 5: Hoare triple {44021#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~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);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; {44021#true} is VALID [2022-04-28 15:18:53,211 INFO L290 TraceCheckUtils]: 6: Hoare triple {44021#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {44026#(and (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 204)) 0) (= 0 (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 204))))} is VALID [2022-04-28 15:18:53,212 INFO L272 TraceCheckUtils]: 7: Hoare triple {44026#(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); {44027#(and (= (select (select |#memory_$Pointer$.base| |ssl3_accept_#in~s.base|) (+ 204 |ssl3_accept_#in~s.offset|)) 0) (= (select (select |#memory_$Pointer$.offset| |ssl3_accept_#in~s.base|) (+ 204 |ssl3_accept_#in~s.offset|)) 0))} is VALID [2022-04-28 15:18:53,214 INFO L290 TraceCheckUtils]: 8: Hoare triple {44027#(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;~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); {44028#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} is VALID [2022-04-28 15:18:53,215 INFO L290 TraceCheckUtils]: 9: Hoare triple {44028#(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; {44028#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} is VALID [2022-04-28 15:18:53,216 INFO L290 TraceCheckUtils]: 10: Hoare triple {44028#(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; {44028#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} is VALID [2022-04-28 15:18:53,217 INFO L290 TraceCheckUtils]: 11: Hoare triple {44028#(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)))); {44028#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} is VALID [2022-04-28 15:18:53,217 INFO L290 TraceCheckUtils]: 12: Hoare triple {44028#(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); {44029#(and (= |ssl3_accept_#t~mem45.base| 0) (= |ssl3_accept_#t~mem45.offset| 0))} is VALID [2022-04-28 15:18:53,218 INFO L290 TraceCheckUtils]: 13: Hoare triple {44029#(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; {44022#false} is VALID [2022-04-28 15:18:53,218 INFO L290 TraceCheckUtils]: 14: Hoare triple {44022#false} assume !false; {44022#false} is VALID [2022-04-28 15:18:53,218 INFO L290 TraceCheckUtils]: 15: Hoare triple {44022#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); {44022#false} is VALID [2022-04-28 15:18:53,218 INFO L290 TraceCheckUtils]: 16: Hoare triple {44022#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,218 INFO L290 TraceCheckUtils]: 17: Hoare triple {44022#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,218 INFO L290 TraceCheckUtils]: 18: Hoare triple {44022#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,219 INFO L290 TraceCheckUtils]: 19: Hoare triple {44022#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,219 INFO L290 TraceCheckUtils]: 20: Hoare triple {44022#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,219 INFO L290 TraceCheckUtils]: 21: Hoare triple {44022#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,219 INFO L290 TraceCheckUtils]: 22: Hoare triple {44022#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,219 INFO L290 TraceCheckUtils]: 23: Hoare triple {44022#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,219 INFO L290 TraceCheckUtils]: 24: Hoare triple {44022#false} assume 8464 == #t~mem55;havoc #t~mem55; {44022#false} is VALID [2022-04-28 15:18:53,219 INFO L290 TraceCheckUtils]: 25: Hoare triple {44022#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; {44022#false} is VALID [2022-04-28 15:18:53,219 INFO L290 TraceCheckUtils]: 26: Hoare triple {44022#false} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {44022#false} is VALID [2022-04-28 15:18:53,219 INFO L290 TraceCheckUtils]: 27: Hoare triple {44022#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); {44022#false} is VALID [2022-04-28 15:18:53,219 INFO L290 TraceCheckUtils]: 28: Hoare triple {44022#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); {44022#false} is VALID [2022-04-28 15:18:53,220 INFO L290 TraceCheckUtils]: 29: Hoare triple {44022#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {44022#false} is VALID [2022-04-28 15:18:53,220 INFO L290 TraceCheckUtils]: 30: Hoare triple {44022#false} ~skip~0 := 0; {44022#false} is VALID [2022-04-28 15:18:53,220 INFO L290 TraceCheckUtils]: 31: Hoare triple {44022#false} assume !false; {44022#false} is VALID [2022-04-28 15:18:53,220 INFO L290 TraceCheckUtils]: 32: Hoare triple {44022#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); {44022#false} is VALID [2022-04-28 15:18:53,220 INFO L290 TraceCheckUtils]: 33: Hoare triple {44022#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,220 INFO L290 TraceCheckUtils]: 34: Hoare triple {44022#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,220 INFO L290 TraceCheckUtils]: 35: Hoare triple {44022#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,220 INFO L290 TraceCheckUtils]: 36: Hoare triple {44022#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,220 INFO L290 TraceCheckUtils]: 37: Hoare triple {44022#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,220 INFO L290 TraceCheckUtils]: 38: Hoare triple {44022#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,221 INFO L290 TraceCheckUtils]: 39: Hoare triple {44022#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,221 INFO L290 TraceCheckUtils]: 40: Hoare triple {44022#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,221 INFO L290 TraceCheckUtils]: 41: Hoare triple {44022#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,221 INFO L290 TraceCheckUtils]: 42: Hoare triple {44022#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,221 INFO L290 TraceCheckUtils]: 43: Hoare triple {44022#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,221 INFO L290 TraceCheckUtils]: 44: Hoare triple {44022#false} assume 8496 == #t~mem58;havoc #t~mem58; {44022#false} is VALID [2022-04-28 15:18:53,221 INFO L290 TraceCheckUtils]: 45: Hoare triple {44022#false} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {44022#false} is VALID [2022-04-28 15:18:53,221 INFO L290 TraceCheckUtils]: 46: Hoare triple {44022#false} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {44022#false} is VALID [2022-04-28 15:18:53,221 INFO L290 TraceCheckUtils]: 47: Hoare triple {44022#false} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,222 INFO L290 TraceCheckUtils]: 48: Hoare triple {44022#false} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,222 INFO L290 TraceCheckUtils]: 49: Hoare triple {44022#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,222 INFO L290 TraceCheckUtils]: 50: Hoare triple {44022#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); {44022#false} is VALID [2022-04-28 15:18:53,222 INFO L290 TraceCheckUtils]: 51: Hoare triple {44022#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {44022#false} is VALID [2022-04-28 15:18:53,222 INFO L290 TraceCheckUtils]: 52: Hoare triple {44022#false} ~skip~0 := 0; {44022#false} is VALID [2022-04-28 15:18:53,222 INFO L290 TraceCheckUtils]: 53: Hoare triple {44022#false} assume !false; {44022#false} is VALID [2022-04-28 15:18:53,222 INFO L290 TraceCheckUtils]: 54: Hoare triple {44022#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); {44022#false} is VALID [2022-04-28 15:18:53,222 INFO L290 TraceCheckUtils]: 55: Hoare triple {44022#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,222 INFO L290 TraceCheckUtils]: 56: Hoare triple {44022#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,222 INFO L290 TraceCheckUtils]: 57: Hoare triple {44022#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,223 INFO L290 TraceCheckUtils]: 58: Hoare triple {44022#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,223 INFO L290 TraceCheckUtils]: 59: Hoare triple {44022#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,223 INFO L290 TraceCheckUtils]: 60: Hoare triple {44022#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,223 INFO L290 TraceCheckUtils]: 61: Hoare triple {44022#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,223 INFO L290 TraceCheckUtils]: 62: Hoare triple {44022#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,223 INFO L290 TraceCheckUtils]: 63: Hoare triple {44022#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,223 INFO L290 TraceCheckUtils]: 64: Hoare triple {44022#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,223 INFO L290 TraceCheckUtils]: 65: Hoare triple {44022#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,223 INFO L290 TraceCheckUtils]: 66: Hoare triple {44022#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,223 INFO L290 TraceCheckUtils]: 67: Hoare triple {44022#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,224 INFO L290 TraceCheckUtils]: 68: Hoare triple {44022#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,224 INFO L290 TraceCheckUtils]: 69: Hoare triple {44022#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,224 INFO L290 TraceCheckUtils]: 70: Hoare triple {44022#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,224 INFO L290 TraceCheckUtils]: 71: Hoare triple {44022#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,224 INFO L290 TraceCheckUtils]: 72: Hoare triple {44022#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,224 INFO L290 TraceCheckUtils]: 73: Hoare triple {44022#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,224 INFO L290 TraceCheckUtils]: 74: Hoare triple {44022#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,224 INFO L290 TraceCheckUtils]: 75: Hoare triple {44022#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,224 INFO L290 TraceCheckUtils]: 76: Hoare triple {44022#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,224 INFO L290 TraceCheckUtils]: 77: Hoare triple {44022#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,225 INFO L290 TraceCheckUtils]: 78: Hoare triple {44022#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,225 INFO L290 TraceCheckUtils]: 79: Hoare triple {44022#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,225 INFO L290 TraceCheckUtils]: 80: Hoare triple {44022#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,225 INFO L290 TraceCheckUtils]: 81: Hoare triple {44022#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,225 INFO L290 TraceCheckUtils]: 82: Hoare triple {44022#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,225 INFO L290 TraceCheckUtils]: 83: Hoare triple {44022#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,225 INFO L290 TraceCheckUtils]: 84: Hoare triple {44022#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,225 INFO L290 TraceCheckUtils]: 85: Hoare triple {44022#false} assume 8656 == #t~mem77;havoc #t~mem77; {44022#false} is VALID [2022-04-28 15:18:53,225 INFO L290 TraceCheckUtils]: 86: Hoare triple {44022#false} call #t~mem140.base, #t~mem140.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem141.base, #t~mem141.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem142.base, #t~mem142.offset := read~$Pointer$(#t~mem141.base, 888 + #t~mem141.offset, 8);call write~$Pointer$(#t~mem142.base, #t~mem142.offset, #t~mem140.base, 192 + #t~mem140.offset, 8);havoc #t~mem140.base, #t~mem140.offset;havoc #t~mem141.base, #t~mem141.offset;havoc #t~mem142.base, #t~mem142.offset; {44022#false} is VALID [2022-04-28 15:18:53,225 INFO L290 TraceCheckUtils]: 87: Hoare triple {44022#false} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {44022#false} is VALID [2022-04-28 15:18:53,226 INFO L290 TraceCheckUtils]: 88: Hoare triple {44022#false} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {44022#false} is VALID [2022-04-28 15:18:53,226 INFO L290 TraceCheckUtils]: 89: Hoare triple {44022#false} assume !(~ret~0 <= 0);call write~int(8672, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,226 INFO L290 TraceCheckUtils]: 90: Hoare triple {44022#false} assume !(0 == ~tmp___10~0); {44022#false} is VALID [2022-04-28 15:18:53,226 INFO L290 TraceCheckUtils]: 91: Hoare triple {44022#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); {44022#false} is VALID [2022-04-28 15:18:53,226 INFO L290 TraceCheckUtils]: 92: Hoare triple {44022#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {44022#false} is VALID [2022-04-28 15:18:53,226 INFO L290 TraceCheckUtils]: 93: Hoare triple {44022#false} ~skip~0 := 0; {44022#false} is VALID [2022-04-28 15:18:53,226 INFO L290 TraceCheckUtils]: 94: Hoare triple {44022#false} assume !false; {44022#false} is VALID [2022-04-28 15:18:53,226 INFO L290 TraceCheckUtils]: 95: Hoare triple {44022#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); {44022#false} is VALID [2022-04-28 15:18:53,226 INFO L290 TraceCheckUtils]: 96: Hoare triple {44022#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,227 INFO L290 TraceCheckUtils]: 97: Hoare triple {44022#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,227 INFO L290 TraceCheckUtils]: 98: Hoare triple {44022#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,227 INFO L290 TraceCheckUtils]: 99: Hoare triple {44022#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,227 INFO L290 TraceCheckUtils]: 100: Hoare triple {44022#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,227 INFO L290 TraceCheckUtils]: 101: Hoare triple {44022#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,227 INFO L290 TraceCheckUtils]: 102: Hoare triple {44022#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,227 INFO L290 TraceCheckUtils]: 103: Hoare triple {44022#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,227 INFO L290 TraceCheckUtils]: 104: Hoare triple {44022#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,227 INFO L290 TraceCheckUtils]: 105: Hoare triple {44022#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,227 INFO L290 TraceCheckUtils]: 106: Hoare triple {44022#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,228 INFO L290 TraceCheckUtils]: 107: Hoare triple {44022#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,228 INFO L290 TraceCheckUtils]: 108: Hoare triple {44022#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,228 INFO L290 TraceCheckUtils]: 109: Hoare triple {44022#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,228 INFO L290 TraceCheckUtils]: 110: Hoare triple {44022#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,228 INFO L290 TraceCheckUtils]: 111: Hoare triple {44022#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,228 INFO L290 TraceCheckUtils]: 112: Hoare triple {44022#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,228 INFO L290 TraceCheckUtils]: 113: Hoare triple {44022#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,228 INFO L290 TraceCheckUtils]: 114: Hoare triple {44022#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,228 INFO L290 TraceCheckUtils]: 115: Hoare triple {44022#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,228 INFO L290 TraceCheckUtils]: 116: Hoare triple {44022#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,229 INFO L290 TraceCheckUtils]: 117: Hoare triple {44022#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,229 INFO L290 TraceCheckUtils]: 118: Hoare triple {44022#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,229 INFO L290 TraceCheckUtils]: 119: Hoare triple {44022#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,229 INFO L290 TraceCheckUtils]: 120: Hoare triple {44022#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,229 INFO L290 TraceCheckUtils]: 121: Hoare triple {44022#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,229 INFO L290 TraceCheckUtils]: 122: Hoare triple {44022#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,229 INFO L290 TraceCheckUtils]: 123: Hoare triple {44022#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,229 INFO L290 TraceCheckUtils]: 124: Hoare triple {44022#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,229 INFO L290 TraceCheckUtils]: 125: Hoare triple {44022#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,229 INFO L290 TraceCheckUtils]: 126: Hoare triple {44022#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,230 INFO L290 TraceCheckUtils]: 127: Hoare triple {44022#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {44022#false} is VALID [2022-04-28 15:18:53,230 INFO L290 TraceCheckUtils]: 128: Hoare triple {44022#false} assume 8672 == #t~mem79;havoc #t~mem79; {44022#false} is VALID [2022-04-28 15:18:53,230 INFO L290 TraceCheckUtils]: 129: Hoare triple {44022#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {44022#false} is VALID [2022-04-28 15:18:53,230 INFO L290 TraceCheckUtils]: 130: Hoare triple {44022#false} assume 3 == ~blastFlag~0; {44022#false} is VALID [2022-04-28 15:18:53,230 INFO L290 TraceCheckUtils]: 131: Hoare triple {44022#false} assume !false; {44022#false} is VALID [2022-04-28 15:18:53,230 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-04-28 15:18:53,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:18:53,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360399252] [2022-04-28 15:18:53,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360399252] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:18:53,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:18:53,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 15:18:53,231 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:18:53,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2006639517] [2022-04-28 15:18:53,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2006639517] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:18:53,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:18:53,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 15:18:53,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484575133] [2022-04-28 15:18:53,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:18:53,232 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 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 132 [2022-04-28 15:18:53,232 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:18:53,232 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:53,295 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:18:53,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 15:18:53,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:18:53,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 15:18:53,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-28 15:18:53,296 INFO L87 Difference]: Start difference. First operand 355 states and 560 transitions. Second operand has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:55,333 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:18:56,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:56,685 INFO L93 Difference]: Finished difference Result 703 states and 1112 transitions. [2022-04-28 15:18:56,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 15:18:56,685 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 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 132 [2022-04-28 15:18:56,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:18:56,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:56,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 402 transitions. [2022-04-28 15:18:56,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:56,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 402 transitions. [2022-04-28 15:18:56,688 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 402 transitions. [2022-04-28 15:18:56,944 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 402 edges. 402 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:18:56,950 INFO L225 Difference]: With dead ends: 703 [2022-04-28 15:18:56,950 INFO L226 Difference]: Without dead ends: 355 [2022-04-28 15:18:56,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-28 15:18:56,951 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 7 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:18:56,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 791 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 429 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 15:18:56,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2022-04-28 15:18:56,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 355. [2022-04-28 15:18:56,967 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:18:56,967 INFO L82 GeneralOperation]: Start isEquivalent. First operand 355 states. Second operand has 355 states, 350 states have (on average 1.5857142857142856) internal successors, (555), 350 states have internal predecessors, (555), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:56,968 INFO L74 IsIncluded]: Start isIncluded. First operand 355 states. Second operand has 355 states, 350 states have (on average 1.5857142857142856) internal successors, (555), 350 states have internal predecessors, (555), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:56,968 INFO L87 Difference]: Start difference. First operand 355 states. Second operand has 355 states, 350 states have (on average 1.5857142857142856) internal successors, (555), 350 states have internal predecessors, (555), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:56,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:56,973 INFO L93 Difference]: Finished difference Result 355 states and 559 transitions. [2022-04-28 15:18:56,973 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 559 transitions. [2022-04-28 15:18:56,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:18:56,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:18:56,974 INFO L74 IsIncluded]: Start isIncluded. First operand has 355 states, 350 states have (on average 1.5857142857142856) internal successors, (555), 350 states have internal predecessors, (555), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 355 states. [2022-04-28 15:18:56,975 INFO L87 Difference]: Start difference. First operand has 355 states, 350 states have (on average 1.5857142857142856) internal successors, (555), 350 states have internal predecessors, (555), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 355 states. [2022-04-28 15:18:56,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:56,982 INFO L93 Difference]: Finished difference Result 355 states and 559 transitions. [2022-04-28 15:18:56,982 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 559 transitions. [2022-04-28 15:18:56,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:18:56,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:18:56,982 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:18:56,982 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:18:56,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 350 states have (on average 1.5857142857142856) internal successors, (555), 350 states have internal predecessors, (555), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:56,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 559 transitions. [2022-04-28 15:18:56,992 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 559 transitions. Word has length 132 [2022-04-28 15:18:56,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:18:56,992 INFO L495 AbstractCegarLoop]: Abstraction has 355 states and 559 transitions. [2022-04-28 15:18:56,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:56,993 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 355 states and 559 transitions. [2022-04-28 15:18:57,446 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 559 edges. 559 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:18:57,446 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 559 transitions. [2022-04-28 15:18:57,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-04-28 15:18:57,447 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:18:57,447 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:18:57,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-28 15:18:57,447 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:18:57,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:18:57,448 INFO L85 PathProgramCache]: Analyzing trace with hash 547672484, now seen corresponding path program 1 times [2022-04-28 15:18:57,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:18:57,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [622453781] [2022-04-28 15:18:57,533 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:18:57,533 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:18:57,533 INFO L85 PathProgramCache]: Analyzing trace with hash 547672484, now seen corresponding path program 2 times [2022-04-28 15:18:57,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:18:57,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718317823] [2022-04-28 15:18:57,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:18:57,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:18:58,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 15:18:58,075 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 15:18:58,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 15:18:58,327 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 15:18:58,327 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-28 15:18:58,327 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-28 15:18:58,333 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 15:18:58,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-28 15:18:58,339 INFO L356 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] [2022-04-28 15:18:58,342 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 15:18:58,391 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 15:18:58,391 WARN L170 areAnnotationChecker]: SSLv3_server_methodENTRY has no Hoare annotation [2022-04-28 15:18:58,392 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-28 15:18:58,392 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 15:18:58,392 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 15:18:58,392 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-28 15:18:58,392 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyENTRY has no Hoare annotation [2022-04-28 15:18:58,392 WARN L170 areAnnotationChecker]: sslv3_base_methodENTRY has no Hoare annotation [2022-04-28 15:18:58,392 WARN L170 areAnnotationChecker]: #Ultimate.meminitENTRY has no Hoare annotation [2022-04-28 15:18:58,392 WARN L170 areAnnotationChecker]: ssl3_acceptENTRY has no Hoare annotation [2022-04-28 15:18:58,392 WARN L170 areAnnotationChecker]: ssl3_get_server_methodENTRY has no Hoare annotation [2022-04-28 15:18:58,392 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 15:18:58,392 WARN L170 areAnnotationChecker]: L1061 has no Hoare annotation [2022-04-28 15:18:58,392 WARN L170 areAnnotationChecker]: L1061 has no Hoare annotation [2022-04-28 15:18:58,392 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-28 15:18:58,392 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 15:18:58,392 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 15:18:58,392 WARN L170 areAnnotationChecker]: L1096 has no Hoare annotation [2022-04-28 15:18:58,392 WARN L170 areAnnotationChecker]: L1096 has no Hoare annotation [2022-04-28 15:18:58,392 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2022-04-28 15:18:58,393 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2022-04-28 15:18:58,393 WARN L170 areAnnotationChecker]: L1744 has no Hoare annotation [2022-04-28 15:18:58,393 WARN L170 areAnnotationChecker]: L1744 has no Hoare annotation [2022-04-28 15:18:58,393 WARN L170 areAnnotationChecker]: #Ultimate.meminitFINAL has no Hoare annotation [2022-04-28 15:18:58,393 WARN L170 areAnnotationChecker]: L1146 has no Hoare annotation [2022-04-28 15:18:58,393 WARN L170 areAnnotationChecker]: L1146 has no Hoare annotation [2022-04-28 15:18:58,393 WARN L170 areAnnotationChecker]: L1044 has no Hoare annotation [2022-04-28 15:18:58,393 WARN L170 areAnnotationChecker]: L1044 has no Hoare annotation [2022-04-28 15:18:58,393 WARN L170 areAnnotationChecker]: L1063 has no Hoare annotation [2022-04-28 15:18:58,393 WARN L170 areAnnotationChecker]: L1063 has no Hoare annotation [2022-04-28 15:18:58,393 WARN L170 areAnnotationChecker]: L1061-2 has no Hoare annotation [2022-04-28 15:18:58,393 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-28 15:18:58,393 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-28 15:18:58,393 WARN L170 areAnnotationChecker]: L1096-2 has no Hoare annotation [2022-04-28 15:18:58,393 WARN L170 areAnnotationChecker]: L1096-2 has no Hoare annotation [2022-04-28 15:18:58,393 WARN L170 areAnnotationChecker]: L-1-3 has no Hoare annotation [2022-04-28 15:18:58,393 WARN L170 areAnnotationChecker]: L-1-3 has no Hoare annotation [2022-04-28 15:18:58,393 WARN L170 areAnnotationChecker]: L1744-1 has no Hoare annotation [2022-04-28 15:18:58,393 WARN L170 areAnnotationChecker]: #Ultimate.meminitEXIT has no Hoare annotation [2022-04-28 15:18:58,394 WARN L170 areAnnotationChecker]: L1146-2 has no Hoare annotation [2022-04-28 15:18:58,394 WARN L170 areAnnotationChecker]: L1046 has no Hoare annotation [2022-04-28 15:18:58,394 WARN L170 areAnnotationChecker]: L1046 has no Hoare annotation [2022-04-28 15:18:58,394 WARN L170 areAnnotationChecker]: ssl3_get_server_methodFINAL has no Hoare annotation [2022-04-28 15:18:58,394 WARN L170 areAnnotationChecker]: L1063-1 has no Hoare annotation [2022-04-28 15:18:58,394 WARN L170 areAnnotationChecker]: SSLv3_server_methodFINAL has no Hoare annotation [2022-04-28 15:18:58,394 WARN L170 areAnnotationChecker]: L1106 has no Hoare annotation [2022-04-28 15:18:58,394 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyFINAL has no Hoare annotation [2022-04-28 15:18:58,394 WARN L170 areAnnotationChecker]: sslv3_base_methodFINAL has no Hoare annotation [2022-04-28 15:18:58,394 WARN L170 areAnnotationChecker]: L1152 has no Hoare annotation [2022-04-28 15:18:58,394 WARN L170 areAnnotationChecker]: L1152 has no Hoare annotation [2022-04-28 15:18:58,394 WARN L170 areAnnotationChecker]: L1046-1 has no Hoare annotation [2022-04-28 15:18:58,394 WARN L170 areAnnotationChecker]: L1065 has no Hoare annotation [2022-04-28 15:18:58,394 WARN L170 areAnnotationChecker]: L1065 has no Hoare annotation [2022-04-28 15:18:58,394 WARN L170 areAnnotationChecker]: SSLv3_server_methodEXIT has no Hoare annotation [2022-04-28 15:18:58,394 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-28 15:18:58,394 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyEXIT has no Hoare annotation [2022-04-28 15:18:58,394 WARN L170 areAnnotationChecker]: sslv3_base_methodEXIT has no Hoare annotation [2022-04-28 15:18:58,394 WARN L170 areAnnotationChecker]: L1153 has no Hoare annotation [2022-04-28 15:18:58,394 WARN L170 areAnnotationChecker]: L1153 has no Hoare annotation [2022-04-28 15:18:58,395 WARN L170 areAnnotationChecker]: L1152-1 has no Hoare annotation [2022-04-28 15:18:58,395 WARN L170 areAnnotationChecker]: L1065-1 has no Hoare annotation [2022-04-28 15:18:58,395 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-28 15:18:58,395 WARN L170 areAnnotationChecker]: L1161 has no Hoare annotation [2022-04-28 15:18:58,395 WARN L170 areAnnotationChecker]: L1161 has no Hoare annotation [2022-04-28 15:18:58,395 WARN L170 areAnnotationChecker]: ssl3_acceptFINAL has no Hoare annotation [2022-04-28 15:18:58,395 WARN L170 areAnnotationChecker]: L1167-2 has no Hoare annotation [2022-04-28 15:18:58,395 WARN L170 areAnnotationChecker]: L1167-2 has no Hoare annotation [2022-04-28 15:18:58,395 WARN L170 areAnnotationChecker]: L1167-2 has no Hoare annotation [2022-04-28 15:18:58,395 WARN L170 areAnnotationChecker]: ssl3_acceptEXIT has no Hoare annotation [2022-04-28 15:18:58,395 WARN L170 areAnnotationChecker]: L1724 has no Hoare annotation [2022-04-28 15:18:58,395 WARN L170 areAnnotationChecker]: L1168 has no Hoare annotation [2022-04-28 15:18:58,395 WARN L170 areAnnotationChecker]: L1728 has no Hoare annotation [2022-04-28 15:18:58,395 WARN L170 areAnnotationChecker]: L1728 has no Hoare annotation [2022-04-28 15:18:58,395 WARN L170 areAnnotationChecker]: L1170 has no Hoare annotation [2022-04-28 15:18:58,395 WARN L170 areAnnotationChecker]: L1170 has no Hoare annotation [2022-04-28 15:18:58,395 WARN L170 areAnnotationChecker]: L1728-2 has no Hoare annotation [2022-04-28 15:18:58,395 WARN L170 areAnnotationChecker]: L1171 has no Hoare annotation [2022-04-28 15:18:58,395 WARN L170 areAnnotationChecker]: L1173 has no Hoare annotation [2022-04-28 15:18:58,396 WARN L170 areAnnotationChecker]: L1173 has no Hoare annotation [2022-04-28 15:18:58,396 WARN L170 areAnnotationChecker]: L1280 has no Hoare annotation [2022-04-28 15:18:58,396 WARN L170 areAnnotationChecker]: L1176 has no Hoare annotation [2022-04-28 15:18:58,396 WARN L170 areAnnotationChecker]: L1176 has no Hoare annotation [2022-04-28 15:18:58,396 WARN L170 areAnnotationChecker]: L1285 has no Hoare annotation [2022-04-28 15:18:58,396 WARN L170 areAnnotationChecker]: L1285 has no Hoare annotation [2022-04-28 15:18:58,396 WARN L170 areAnnotationChecker]: L1179 has no Hoare annotation [2022-04-28 15:18:58,396 WARN L170 areAnnotationChecker]: L1179 has no Hoare annotation [2022-04-28 15:18:58,396 WARN L170 areAnnotationChecker]: L1285-2 has no Hoare annotation [2022-04-28 15:18:58,396 WARN L170 areAnnotationChecker]: L1182 has no Hoare annotation [2022-04-28 15:18:58,396 WARN L170 areAnnotationChecker]: L1182 has no Hoare annotation [2022-04-28 15:18:58,396 WARN L170 areAnnotationChecker]: L1290 has no Hoare annotation [2022-04-28 15:18:58,396 WARN L170 areAnnotationChecker]: L1290 has no Hoare annotation [2022-04-28 15:18:58,396 WARN L170 areAnnotationChecker]: L1185 has no Hoare annotation [2022-04-28 15:18:58,396 WARN L170 areAnnotationChecker]: L1185 has no Hoare annotation [2022-04-28 15:18:58,396 WARN L170 areAnnotationChecker]: L1296 has no Hoare annotation [2022-04-28 15:18:58,396 WARN L170 areAnnotationChecker]: L1296 has no Hoare annotation [2022-04-28 15:18:58,396 WARN L170 areAnnotationChecker]: L1189 has no Hoare annotation [2022-04-28 15:18:58,396 WARN L170 areAnnotationChecker]: L1188 has no Hoare annotation [2022-04-28 15:18:58,397 WARN L170 areAnnotationChecker]: L1188 has no Hoare annotation [2022-04-28 15:18:58,397 WARN L170 areAnnotationChecker]: L1298 has no Hoare annotation [2022-04-28 15:18:58,397 WARN L170 areAnnotationChecker]: L1298 has no Hoare annotation [2022-04-28 15:18:58,397 WARN L170 areAnnotationChecker]: L1296-2 has no Hoare annotation [2022-04-28 15:18:58,397 WARN L170 areAnnotationChecker]: L1296-2 has no Hoare annotation [2022-04-28 15:18:58,397 WARN L170 areAnnotationChecker]: L1339 has no Hoare annotation [2022-04-28 15:18:58,397 WARN L170 areAnnotationChecker]: L1339 has no Hoare annotation [2022-04-28 15:18:58,397 WARN L170 areAnnotationChecker]: L1191 has no Hoare annotation [2022-04-28 15:18:58,397 WARN L170 areAnnotationChecker]: L1191 has no Hoare annotation [2022-04-28 15:18:58,397 WARN L170 areAnnotationChecker]: L1304 has no Hoare annotation [2022-04-28 15:18:58,397 WARN L170 areAnnotationChecker]: L1304 has no Hoare annotation [2022-04-28 15:18:58,397 WARN L170 areAnnotationChecker]: L1321 has no Hoare annotation [2022-04-28 15:18:58,397 WARN L170 areAnnotationChecker]: L1321 has no Hoare annotation [2022-04-28 15:18:58,397 WARN L170 areAnnotationChecker]: L1655 has no Hoare annotation [2022-04-28 15:18:58,397 WARN L170 areAnnotationChecker]: L1192 has no Hoare annotation [2022-04-28 15:18:58,397 WARN L170 areAnnotationChecker]: L1194 has no Hoare annotation [2022-04-28 15:18:58,397 WARN L170 areAnnotationChecker]: L1194 has no Hoare annotation [2022-04-28 15:18:58,397 WARN L170 areAnnotationChecker]: L1322 has no Hoare annotation [2022-04-28 15:18:58,397 WARN L170 areAnnotationChecker]: L1322 has no Hoare annotation [2022-04-28 15:18:58,397 WARN L170 areAnnotationChecker]: L1693 has no Hoare annotation [2022-04-28 15:18:58,398 WARN L170 areAnnotationChecker]: L1693 has no Hoare annotation [2022-04-28 15:18:58,398 WARN L170 areAnnotationChecker]: L1201 has no Hoare annotation [2022-04-28 15:18:58,398 WARN L170 areAnnotationChecker]: L1197 has no Hoare annotation [2022-04-28 15:18:58,398 WARN L170 areAnnotationChecker]: L1197 has no Hoare annotation [2022-04-28 15:18:58,398 WARN L170 areAnnotationChecker]: L1694 has no Hoare annotation [2022-04-28 15:18:58,398 WARN L170 areAnnotationChecker]: L1694 has no Hoare annotation [2022-04-28 15:18:58,398 WARN L170 areAnnotationChecker]: L1693-1 has no Hoare annotation [2022-04-28 15:18:58,398 WARN L170 areAnnotationChecker]: L1356 has no Hoare annotation [2022-04-28 15:18:58,398 WARN L170 areAnnotationChecker]: L1356 has no Hoare annotation [2022-04-28 15:18:58,398 WARN L170 areAnnotationChecker]: L1200 has no Hoare annotation [2022-04-28 15:18:58,398 WARN L170 areAnnotationChecker]: L1200 has no Hoare annotation [2022-04-28 15:18:58,398 WARN L170 areAnnotationChecker]: L1695 has no Hoare annotation [2022-04-28 15:18:58,398 WARN L170 areAnnotationChecker]: L1695 has no Hoare annotation [2022-04-28 15:18:58,398 WARN L170 areAnnotationChecker]: L1356-2 has no Hoare annotation [2022-04-28 15:18:58,398 WARN L170 areAnnotationChecker]: L1356-2 has no Hoare annotation [2022-04-28 15:18:58,398 WARN L170 areAnnotationChecker]: L1203 has no Hoare annotation [2022-04-28 15:18:58,398 WARN L170 areAnnotationChecker]: L1203 has no Hoare annotation [2022-04-28 15:18:58,398 WARN L170 areAnnotationChecker]: L1697 has no Hoare annotation [2022-04-28 15:18:58,398 WARN L170 areAnnotationChecker]: L1697 has no Hoare annotation [2022-04-28 15:18:58,398 WARN L170 areAnnotationChecker]: L1695-2 has no Hoare annotation [2022-04-28 15:18:58,399 WARN L170 areAnnotationChecker]: L1695-2 has no Hoare annotation [2022-04-28 15:18:58,399 WARN L170 areAnnotationChecker]: L1207 has no Hoare annotation [2022-04-28 15:18:58,399 WARN L170 areAnnotationChecker]: L1206 has no Hoare annotation [2022-04-28 15:18:58,399 WARN L170 areAnnotationChecker]: L1206 has no Hoare annotation [2022-04-28 15:18:58,399 WARN L170 areAnnotationChecker]: L1706 has no Hoare annotation [2022-04-28 15:18:58,399 WARN L170 areAnnotationChecker]: L1706 has no Hoare annotation [2022-04-28 15:18:58,399 WARN L170 areAnnotationChecker]: L1373 has no Hoare annotation [2022-04-28 15:18:58,399 WARN L170 areAnnotationChecker]: L1373 has no Hoare annotation [2022-04-28 15:18:58,399 WARN L170 areAnnotationChecker]: L1209 has no Hoare annotation [2022-04-28 15:18:58,399 WARN L170 areAnnotationChecker]: L1209 has no Hoare annotation [2022-04-28 15:18:58,399 WARN L170 areAnnotationChecker]: L1373-2 has no Hoare annotation [2022-04-28 15:18:58,399 WARN L170 areAnnotationChecker]: L1373-2 has no Hoare annotation [2022-04-28 15:18:58,399 WARN L170 areAnnotationChecker]: L1213 has no Hoare annotation [2022-04-28 15:18:58,399 WARN L170 areAnnotationChecker]: L1212 has no Hoare annotation [2022-04-28 15:18:58,399 WARN L170 areAnnotationChecker]: L1212 has no Hoare annotation [2022-04-28 15:18:58,399 WARN L170 areAnnotationChecker]: L1383 has no Hoare annotation [2022-04-28 15:18:58,399 WARN L170 areAnnotationChecker]: L1383 has no Hoare annotation [2022-04-28 15:18:58,399 WARN L170 areAnnotationChecker]: L1392 has no Hoare annotation [2022-04-28 15:18:58,399 WARN L170 areAnnotationChecker]: L1392 has no Hoare annotation [2022-04-28 15:18:58,400 WARN L170 areAnnotationChecker]: L1215 has no Hoare annotation [2022-04-28 15:18:58,400 WARN L170 areAnnotationChecker]: L1215 has no Hoare annotation [2022-04-28 15:18:58,400 WARN L170 areAnnotationChecker]: L1383-2 has no Hoare annotation [2022-04-28 15:18:58,400 WARN L170 areAnnotationChecker]: L1392-2 has no Hoare annotation [2022-04-28 15:18:58,400 WARN L170 areAnnotationChecker]: L1396 has no Hoare annotation [2022-04-28 15:18:58,400 WARN L170 areAnnotationChecker]: L1396 has no Hoare annotation [2022-04-28 15:18:58,400 WARN L170 areAnnotationChecker]: L1219 has no Hoare annotation [2022-04-28 15:18:58,400 WARN L170 areAnnotationChecker]: L1218 has no Hoare annotation [2022-04-28 15:18:58,400 WARN L170 areAnnotationChecker]: L1218 has no Hoare annotation [2022-04-28 15:18:58,400 WARN L170 areAnnotationChecker]: L1408 has no Hoare annotation [2022-04-28 15:18:58,400 WARN L170 areAnnotationChecker]: L1408 has no Hoare annotation [2022-04-28 15:18:58,400 WARN L170 areAnnotationChecker]: L1221 has no Hoare annotation [2022-04-28 15:18:58,400 WARN L170 areAnnotationChecker]: L1221 has no Hoare annotation [2022-04-28 15:18:58,400 WARN L170 areAnnotationChecker]: L1408-2 has no Hoare annotation [2022-04-28 15:18:58,400 WARN L170 areAnnotationChecker]: L1225 has no Hoare annotation [2022-04-28 15:18:58,400 WARN L170 areAnnotationChecker]: L1224 has no Hoare annotation [2022-04-28 15:18:58,400 WARN L170 areAnnotationChecker]: L1224 has no Hoare annotation [2022-04-28 15:18:58,400 WARN L170 areAnnotationChecker]: L1413 has no Hoare annotation [2022-04-28 15:18:58,400 WARN L170 areAnnotationChecker]: L1413 has no Hoare annotation [2022-04-28 15:18:58,400 WARN L170 areAnnotationChecker]: L1454 has no Hoare annotation [2022-04-28 15:18:58,401 WARN L170 areAnnotationChecker]: L1454 has no Hoare annotation [2022-04-28 15:18:58,401 WARN L170 areAnnotationChecker]: L1227 has no Hoare annotation [2022-04-28 15:18:58,401 WARN L170 areAnnotationChecker]: L1227 has no Hoare annotation [2022-04-28 15:18:58,401 WARN L170 areAnnotationChecker]: L1430 has no Hoare annotation [2022-04-28 15:18:58,401 WARN L170 areAnnotationChecker]: L1416 has no Hoare annotation [2022-04-28 15:18:58,401 WARN L170 areAnnotationChecker]: L1416 has no Hoare annotation [2022-04-28 15:18:58,401 WARN L170 areAnnotationChecker]: L1455 has no Hoare annotation [2022-04-28 15:18:58,401 WARN L170 areAnnotationChecker]: L1455 has no Hoare annotation [2022-04-28 15:18:58,401 WARN L170 areAnnotationChecker]: L1231 has no Hoare annotation [2022-04-28 15:18:58,401 WARN L170 areAnnotationChecker]: L1230 has no Hoare annotation [2022-04-28 15:18:58,401 WARN L170 areAnnotationChecker]: L1230 has no Hoare annotation [2022-04-28 15:18:58,401 WARN L170 areAnnotationChecker]: L1432 has no Hoare annotation [2022-04-28 15:18:58,401 WARN L170 areAnnotationChecker]: L1432 has no Hoare annotation [2022-04-28 15:18:58,401 WARN L170 areAnnotationChecker]: L1419 has no Hoare annotation [2022-04-28 15:18:58,401 WARN L170 areAnnotationChecker]: L1419 has no Hoare annotation [2022-04-28 15:18:58,401 WARN L170 areAnnotationChecker]: L1456 has no Hoare annotation [2022-04-28 15:18:58,401 WARN L170 areAnnotationChecker]: L1456 has no Hoare annotation [2022-04-28 15:18:58,401 WARN L170 areAnnotationChecker]: L1464 has no Hoare annotation [2022-04-28 15:18:58,401 WARN L170 areAnnotationChecker]: L1496 has no Hoare annotation [2022-04-28 15:18:58,401 WARN L170 areAnnotationChecker]: L1496 has no Hoare annotation [2022-04-28 15:18:58,402 WARN L170 areAnnotationChecker]: L1233 has no Hoare annotation [2022-04-28 15:18:58,402 WARN L170 areAnnotationChecker]: L1233 has no Hoare annotation [2022-04-28 15:18:58,402 WARN L170 areAnnotationChecker]: L1419-1 has no Hoare annotation [2022-04-28 15:18:58,402 WARN L170 areAnnotationChecker]: L1420 has no Hoare annotation [2022-04-28 15:18:58,402 WARN L170 areAnnotationChecker]: L1420 has no Hoare annotation [2022-04-28 15:18:58,402 WARN L170 areAnnotationChecker]: L1465 has no Hoare annotation [2022-04-28 15:18:58,402 WARN L170 areAnnotationChecker]: L1465 has no Hoare annotation [2022-04-28 15:18:58,402 WARN L170 areAnnotationChecker]: L1234 has no Hoare annotation [2022-04-28 15:18:58,402 WARN L170 areAnnotationChecker]: L1234 has no Hoare annotation [2022-04-28 15:18:58,402 WARN L170 areAnnotationChecker]: L1236 has no Hoare annotation [2022-04-28 15:18:58,402 WARN L170 areAnnotationChecker]: L1236 has no Hoare annotation [2022-04-28 15:18:58,402 WARN L170 areAnnotationChecker]: L1423 has no Hoare annotation [2022-04-28 15:18:58,402 WARN L170 areAnnotationChecker]: L1423 has no Hoare annotation [2022-04-28 15:18:58,402 WARN L170 areAnnotationChecker]: L1466 has no Hoare annotation [2022-04-28 15:18:58,402 WARN L170 areAnnotationChecker]: L1466 has no Hoare annotation [2022-04-28 15:18:58,402 WARN L170 areAnnotationChecker]: L1474 has no Hoare annotation [2022-04-28 15:18:58,402 WARN L170 areAnnotationChecker]: L1509 has no Hoare annotation [2022-04-28 15:18:58,402 WARN L170 areAnnotationChecker]: L1509 has no Hoare annotation [2022-04-28 15:18:58,402 WARN L170 areAnnotationChecker]: L1506-1 has no Hoare annotation [2022-04-28 15:18:58,403 WARN L170 areAnnotationChecker]: L1240 has no Hoare annotation [2022-04-28 15:18:58,403 WARN L170 areAnnotationChecker]: L1239 has no Hoare annotation [2022-04-28 15:18:58,403 WARN L170 areAnnotationChecker]: L1239 has no Hoare annotation [2022-04-28 15:18:58,403 WARN L170 areAnnotationChecker]: L1424 has no Hoare annotation [2022-04-28 15:18:58,403 WARN L170 areAnnotationChecker]: L1424 has no Hoare annotation [2022-04-28 15:18:58,403 WARN L170 areAnnotationChecker]: L1477 has no Hoare annotation [2022-04-28 15:18:58,403 WARN L170 areAnnotationChecker]: L1477 has no Hoare annotation [2022-04-28 15:18:58,403 WARN L170 areAnnotationChecker]: L1524 has no Hoare annotation [2022-04-28 15:18:58,403 WARN L170 areAnnotationChecker]: L1524 has no Hoare annotation [2022-04-28 15:18:58,403 WARN L170 areAnnotationChecker]: L1242 has no Hoare annotation [2022-04-28 15:18:58,403 WARN L170 areAnnotationChecker]: L1242 has no Hoare annotation [2022-04-28 15:18:58,403 WARN L170 areAnnotationChecker]: L1424-2 has no Hoare annotation [2022-04-28 15:18:58,403 WARN L170 areAnnotationChecker]: L1424-2 has no Hoare annotation [2022-04-28 15:18:58,403 WARN L170 areAnnotationChecker]: L1529 has no Hoare annotation [2022-04-28 15:18:58,403 WARN L170 areAnnotationChecker]: L1529 has no Hoare annotation [2022-04-28 15:18:58,403 WARN L170 areAnnotationChecker]: L1246 has no Hoare annotation [2022-04-28 15:18:58,403 WARN L170 areAnnotationChecker]: L1245 has no Hoare annotation [2022-04-28 15:18:58,403 WARN L170 areAnnotationChecker]: L1245 has no Hoare annotation [2022-04-28 15:18:58,403 WARN L170 areAnnotationChecker]: L1533 has no Hoare annotation [2022-04-28 15:18:58,404 WARN L170 areAnnotationChecker]: L1533 has no Hoare annotation [2022-04-28 15:18:58,404 WARN L170 areAnnotationChecker]: L1545 has no Hoare annotation [2022-04-28 15:18:58,404 WARN L170 areAnnotationChecker]: L1545 has no Hoare annotation [2022-04-28 15:18:58,404 WARN L170 areAnnotationChecker]: L1248 has no Hoare annotation [2022-04-28 15:18:58,404 WARN L170 areAnnotationChecker]: L1248 has no Hoare annotation [2022-04-28 15:18:58,404 WARN L170 areAnnotationChecker]: L1252 has no Hoare annotation [2022-04-28 15:18:58,404 WARN L170 areAnnotationChecker]: L1251 has no Hoare annotation [2022-04-28 15:18:58,404 WARN L170 areAnnotationChecker]: L1251 has no Hoare annotation [2022-04-28 15:18:58,404 WARN L170 areAnnotationChecker]: L1556 has no Hoare annotation [2022-04-28 15:18:58,404 WARN L170 areAnnotationChecker]: L1556 has no Hoare annotation [2022-04-28 15:18:58,404 WARN L170 areAnnotationChecker]: L1254 has no Hoare annotation [2022-04-28 15:18:58,404 WARN L170 areAnnotationChecker]: L1254 has no Hoare annotation [2022-04-28 15:18:58,404 WARN L170 areAnnotationChecker]: L1258 has no Hoare annotation [2022-04-28 15:18:58,405 WARN L170 areAnnotationChecker]: L1257 has no Hoare annotation [2022-04-28 15:18:58,405 WARN L170 areAnnotationChecker]: L1257 has no Hoare annotation [2022-04-28 15:18:58,405 WARN L170 areAnnotationChecker]: L1567 has no Hoare annotation [2022-04-28 15:18:58,405 WARN L170 areAnnotationChecker]: L1567 has no Hoare annotation [2022-04-28 15:18:58,405 WARN L170 areAnnotationChecker]: L1260 has no Hoare annotation [2022-04-28 15:18:58,405 WARN L170 areAnnotationChecker]: L1260 has no Hoare annotation [2022-04-28 15:18:58,405 WARN L170 areAnnotationChecker]: L1567-2 has no Hoare annotation [2022-04-28 15:18:58,405 WARN L170 areAnnotationChecker]: L1567-2 has no Hoare annotation [2022-04-28 15:18:58,406 WARN L170 areAnnotationChecker]: L1264 has no Hoare annotation [2022-04-28 15:18:58,406 WARN L170 areAnnotationChecker]: L1263 has no Hoare annotation [2022-04-28 15:18:58,406 WARN L170 areAnnotationChecker]: L1263 has no Hoare annotation [2022-04-28 15:18:58,406 WARN L170 areAnnotationChecker]: L1577 has no Hoare annotation [2022-04-28 15:18:58,406 WARN L170 areAnnotationChecker]: L1577 has no Hoare annotation [2022-04-28 15:18:58,406 WARN L170 areAnnotationChecker]: L1587 has no Hoare annotation [2022-04-28 15:18:58,406 WARN L170 areAnnotationChecker]: L1587 has no Hoare annotation [2022-04-28 15:18:58,406 WARN L170 areAnnotationChecker]: L1266 has no Hoare annotation [2022-04-28 15:18:58,406 WARN L170 areAnnotationChecker]: L1266 has no Hoare annotation [2022-04-28 15:18:58,406 WARN L170 areAnnotationChecker]: L1577-2 has no Hoare annotation [2022-04-28 15:18:58,406 WARN L170 areAnnotationChecker]: L1594 has no Hoare annotation [2022-04-28 15:18:58,407 WARN L170 areAnnotationChecker]: L1594 has no Hoare annotation [2022-04-28 15:18:58,407 WARN L170 areAnnotationChecker]: L1270 has no Hoare annotation [2022-04-28 15:18:58,407 WARN L170 areAnnotationChecker]: L1269 has no Hoare annotation [2022-04-28 15:18:58,407 WARN L170 areAnnotationChecker]: L1269 has no Hoare annotation [2022-04-28 15:18:58,407 WARN L170 areAnnotationChecker]: L1594-2 has no Hoare annotation [2022-04-28 15:18:58,407 WARN L170 areAnnotationChecker]: L1594-2 has no Hoare annotation [2022-04-28 15:18:58,407 WARN L170 areAnnotationChecker]: L1616 has no Hoare annotation [2022-04-28 15:18:58,407 WARN L170 areAnnotationChecker]: L1616 has no Hoare annotation [2022-04-28 15:18:58,407 WARN L170 areAnnotationChecker]: L1272 has no Hoare annotation [2022-04-28 15:18:58,407 WARN L170 areAnnotationChecker]: L1272 has no Hoare annotation [2022-04-28 15:18:58,407 WARN L170 areAnnotationChecker]: L1606 has no Hoare annotation [2022-04-28 15:18:58,407 WARN L170 areAnnotationChecker]: L1606 has no Hoare annotation [2022-04-28 15:18:58,407 WARN L170 areAnnotationChecker]: L1617 has no Hoare annotation [2022-04-28 15:18:58,407 WARN L170 areAnnotationChecker]: L1617 has no Hoare annotation [2022-04-28 15:18:58,407 WARN L170 areAnnotationChecker]: L1621 has no Hoare annotation [2022-04-28 15:18:58,407 WARN L170 areAnnotationChecker]: L1621 has no Hoare annotation [2022-04-28 15:18:58,407 WARN L170 areAnnotationChecker]: L1273 has no Hoare annotation [2022-04-28 15:18:58,407 WARN L170 areAnnotationChecker]: L1276 has no Hoare annotation [2022-04-28 15:18:58,407 WARN L170 areAnnotationChecker]: L1627 has no Hoare annotation [2022-04-28 15:18:58,408 WARN L170 areAnnotationChecker]: L1627 has no Hoare annotation [2022-04-28 15:18:58,408 WARN L170 areAnnotationChecker]: L1637 has no Hoare annotation [2022-04-28 15:18:58,408 WARN L170 areAnnotationChecker]: L1637 has no Hoare annotation [2022-04-28 15:18:58,408 WARN L170 areAnnotationChecker]: L1627-2 has no Hoare annotation [2022-04-28 15:18:58,408 WARN L170 areAnnotationChecker]: L1641 has no Hoare annotation [2022-04-28 15:18:58,408 WARN L170 areAnnotationChecker]: L1641 has no Hoare annotation [2022-04-28 15:18:58,408 WARN L170 areAnnotationChecker]: L1637-1 has no Hoare annotation [2022-04-28 15:18:58,408 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-28 15:18:58,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 03:18:58 BoogieIcfgContainer [2022-04-28 15:18:58,412 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 15:18:58,413 INFO L158 Benchmark]: Toolchain (without parser) took 132825.60ms. Allocated memory was 184.5MB in the beginning and 317.7MB in the end (delta: 133.2MB). Free memory was 127.6MB in the beginning and 153.1MB in the end (delta: -25.5MB). Peak memory consumption was 108.5MB. Max. memory is 8.0GB. [2022-04-28 15:18:58,413 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 184.5MB. Free memory is still 146.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 15:18:58,415 INFO L158 Benchmark]: CACSL2BoogieTranslator took 661.02ms. Allocated memory was 184.5MB in the beginning and 264.2MB in the end (delta: 79.7MB). Free memory was 127.4MB in the beginning and 212.1MB in the end (delta: -84.8MB). Peak memory consumption was 10.8MB. Max. memory is 8.0GB. [2022-04-28 15:18:58,415 INFO L158 Benchmark]: Boogie Preprocessor took 153.55ms. Allocated memory is still 264.2MB. Free memory was 212.1MB in the beginning and 202.3MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 15:18:58,415 INFO L158 Benchmark]: RCFGBuilder took 2677.94ms. Allocated memory is still 264.2MB. Free memory was 202.0MB in the beginning and 172.6MB in the end (delta: 29.5MB). Peak memory consumption was 40.6MB. Max. memory is 8.0GB. [2022-04-28 15:18:58,416 INFO L158 Benchmark]: TraceAbstraction took 129325.00ms. Allocated memory was 264.2MB in the beginning and 317.7MB in the end (delta: 53.5MB). Free memory was 172.0MB in the beginning and 153.1MB in the end (delta: 19.0MB). Peak memory consumption was 72.4MB. Max. memory is 8.0GB. [2022-04-28 15:18:58,422 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.16ms. Allocated memory is still 184.5MB. Free memory is still 146.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 661.02ms. Allocated memory was 184.5MB in the beginning and 264.2MB in the end (delta: 79.7MB). Free memory was 127.4MB in the beginning and 212.1MB in the end (delta: -84.8MB). Peak memory consumption was 10.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 153.55ms. Allocated memory is still 264.2MB. Free memory was 212.1MB in the beginning and 202.3MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * RCFGBuilder took 2677.94ms. Allocated memory is still 264.2MB. Free memory was 202.0MB in the beginning and 172.6MB in the end (delta: 29.5MB). Peak memory consumption was 40.6MB. Max. memory is 8.0GB. * TraceAbstraction took 129325.00ms. Allocated memory was 264.2MB in the beginning and 317.7MB in the end (delta: 53.5MB). Free memory was 172.0MB in the beginning and 153.1MB in the end (delta: 19.0MB). Peak memory consumption was 72.4MB. 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: 1734]: 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 1152. 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)) [L1086] s->state = 8464 [L1088] s->info_callback = (void (*) ()) __VERIFIER_nondet_ulong() [L1089] s->options = __VERIFIER_nondet_ulong() [L1090] s->verify_mode = __VERIFIER_nondet_int() [L1091] EXPR s->session [L1091] (s->session)->peer = (struct x509_st*) __VERIFIER_nondet_ulong() [L1092] EXPR s->s3 [L1092] (s->s3)->tmp.cert_request = __VERIFIER_nondet_int() [L1093] EXPR s->s3 [L1093] (s->s3)->tmp.new_cipher = malloc(sizeof(struct ssl_cipher_st)) [L1094] EXPR s->s3 [L1094] EXPR (s->s3)->tmp.new_cipher [L1094] ((s->s3)->tmp.new_cipher)->algorithms = __VERIFIER_nondet_ulong() [L1095] EXPR s->s3 [L1095] EXPR (s->s3)->tmp.new_cipher [L1095] ((s->s3)->tmp.new_cipher)->algo_strength = __VERIFIER_nondet_ulong() [L1096] COND FALSE !(__VERIFIER_nondet_int()) [L1102] s->cert = malloc(sizeof(struct cert_st)) [L1103] EXPR s->cert [L1103] (s->cert)->pkeys[0].privatekey = (struct evp_pkey_st*) __VERIFIER_nondet_ulong() [L1106] CALL ssl3_accept(s) [L1112] BUF_MEM *buf ; [L1113] unsigned long l ; [L1114] unsigned long Time ; [L1115] unsigned long tmp ; [L1116] void (*cb)() ; [L1117] long num1 ; [L1118] int ret ; [L1119] int new_state ; [L1120] int state ; [L1121] int skip ; [L1122] int got_new_session ; [L1123] int tmp___1 = __VERIFIER_nondet_int() ; [L1124] int tmp___2 = __VERIFIER_nondet_int() ; [L1125] int tmp___3 = __VERIFIER_nondet_int() ; [L1126] int tmp___4 = __VERIFIER_nondet_int() ; [L1127] int tmp___5 = __VERIFIER_nondet_int() ; [L1128] int tmp___6 = __VERIFIER_nondet_int() ; [L1129] int tmp___7 ; [L1130] long tmp___8 = __VERIFIER_nondet_long() ; [L1131] int tmp___9 = __VERIFIER_nondet_int() ; [L1132] int tmp___10 = __VERIFIER_nondet_int() ; [L1133] int blastFlag ; [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 [L1693] EXPR s->s3 [L1693] EXPR (s->s3)->tmp.reuse_message [L1693] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1722] 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 TRUE s->hit [L1384] s->state = 8656 [L1388] s->init_num = 0 [L1693] EXPR s->s3 [L1693] EXPR (s->s3)->tmp.reuse_message [L1693] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1722] 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 FALSE !(s->state == 8544) [L1224] EXPR s->state [L1224] COND FALSE !(s->state == 8545) [L1227] EXPR s->state [L1227] COND FALSE !(s->state == 8560) [L1230] EXPR s->state [L1230] COND FALSE !(s->state == 8561) [L1233] EXPR s->state [L1233] COND FALSE !(s->state == 8448) [L1236] EXPR s->state [L1236] COND FALSE !(s->state == 8576) [L1239] EXPR s->state [L1239] COND FALSE !(s->state == 8577) [L1242] EXPR s->state [L1242] COND FALSE !(s->state == 8592) [L1245] EXPR s->state [L1245] COND FALSE !(s->state == 8593) [L1248] EXPR s->state [L1248] COND FALSE !(s->state == 8608) [L1251] EXPR s->state [L1251] COND FALSE !(s->state == 8609) [L1254] EXPR s->state [L1254] COND FALSE !(s->state == 8640) [L1257] EXPR s->state [L1257] COND FALSE !(s->state == 8641) [L1260] EXPR s->state [L1260] COND TRUE s->state == 8656 [L1586] EXPR s->session [L1586] EXPR s->s3 [L1586] EXPR (s->s3)->tmp.new_cipher [L1586] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1587] COND FALSE !(! tmp___9) [L1593] ret = __VERIFIER_nondet_int() [L1594] COND TRUE blastFlag == 2 [L1595] blastFlag = 3 [L1599] COND FALSE !(ret <= 0) [L1604] s->state = 8672 [L1605] s->init_num = 0 [L1606] COND FALSE !(! tmp___10) [L1693] EXPR s->s3 [L1693] EXPR (s->s3)->tmp.reuse_message [L1693] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1722] 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 FALSE !(s->state == 8544) [L1224] EXPR s->state [L1224] COND FALSE !(s->state == 8545) [L1227] EXPR s->state [L1227] COND FALSE !(s->state == 8560) [L1230] EXPR s->state [L1230] COND FALSE !(s->state == 8561) [L1233] EXPR s->state [L1233] COND FALSE !(s->state == 8448) [L1236] EXPR s->state [L1236] COND FALSE !(s->state == 8576) [L1239] EXPR s->state [L1239] COND FALSE !(s->state == 8577) [L1242] EXPR s->state [L1242] COND FALSE !(s->state == 8592) [L1245] EXPR s->state [L1245] COND FALSE !(s->state == 8593) [L1248] EXPR s->state [L1248] COND FALSE !(s->state == 8608) [L1251] EXPR s->state [L1251] COND FALSE !(s->state == 8609) [L1254] EXPR s->state [L1254] COND FALSE !(s->state == 8640) [L1257] EXPR s->state [L1257] COND FALSE !(s->state == 8641) [L1260] EXPR s->state [L1260] COND FALSE !(s->state == 8656) [L1263] EXPR s->state [L1263] COND FALSE !(s->state == 8657) [L1266] EXPR s->state [L1266] COND TRUE s->state == 8672 [L1615] ret = __VERIFIER_nondet_int() [L1616] COND TRUE blastFlag == 3 [L1734] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 184 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 129.2s, OverallIterations: 26, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 112.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 32 mSolverCounterUnknown, 1275 SdHoareTripleChecker+Valid, 78.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1275 mSDsluCounter, 11453 SdHoareTripleChecker+Invalid, 78.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7201 mSDsCounter, 532 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9963 IncrementalHoareTripleChecker+Invalid, 10527 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 532 mSolverCounterUnsat, 4252 mSDtfsCounter, 9963 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 196 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=355occurred in iteration=23, InterpolantAutomatonStates: 129, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 25 MinimizatonAttempts, 874 StatesRemovedByMinimization, 23 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-28 15:18:58,463 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...