/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.02.i.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 15:15:57,000 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 15:15:57,002 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 15:15:57,033 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 15:15:57,033 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 15:15:57,034 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 15:15:57,035 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 15:15:57,036 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 15:15:57,036 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 15:15:57,037 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 15:15:57,037 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 15:15:57,038 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 15:15:57,038 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 15:15:57,039 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 15:15:57,040 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 15:15:57,040 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 15:15:57,041 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 15:15:57,041 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 15:15:57,042 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 15:15:57,043 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 15:15:57,044 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 15:15:57,045 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 15:15:57,046 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 15:15:57,047 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 15:15:57,048 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 15:15:57,049 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 15:15:57,049 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 15:15:57,050 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 15:15:57,050 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 15:15:57,050 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 15:15:57,051 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 15:15:57,051 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 15:15:57,051 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 15:15:57,052 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 15:15:57,052 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 15:15:57,053 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 15:15:57,053 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 15:15:57,053 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 15:15:57,054 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 15:15:57,054 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 15:15:57,054 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 15:15:57,059 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 15:15:57,060 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:15:57,065 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 15:15:57,065 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 15:15:57,066 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 15:15:57,066 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 15:15:57,066 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 15:15:57,067 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 15:15:57,067 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 15:15:57,067 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 15:15:57,067 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 15:15:57,067 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 15:15:57,067 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 15:15:57,067 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 15:15:57,067 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 15:15:57,068 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 15:15:57,068 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 15:15:57,068 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 15:15:57,068 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 15:15:57,068 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 15:15:57,068 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 15:15:57,068 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 15:15:57,069 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 15:15:57,069 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 15:15:57,069 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:15:57,250 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 15:15:57,269 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 15:15:57,271 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 15:15:57,272 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 15:15:57,272 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 15:15:57,273 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_srvr.blast.02.i.cil-1.c [2022-04-28 15:15:57,318 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e4dd2e94/01ae7d84f5a2478cb9829c7025c0e14d/FLAG389f0277c [2022-04-28 15:15:57,728 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 15:15:57,728 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.02.i.cil-1.c [2022-04-28 15:15:57,748 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e4dd2e94/01ae7d84f5a2478cb9829c7025c0e14d/FLAG389f0277c [2022-04-28 15:15:58,047 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e4dd2e94/01ae7d84f5a2478cb9829c7025c0e14d [2022-04-28 15:15:58,049 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 15:15:58,051 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 15:15:58,053 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 15:15:58,053 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 15:15:58,057 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 15:15:58,058 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:15:58" (1/1) ... [2022-04-28 15:15:58,059 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2368a3df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:15:58, skipping insertion in model container [2022-04-28 15:15:58,059 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:15:58" (1/1) ... [2022-04-28 15:15:58,064 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 15:15:58,143 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 15:15:58,484 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.02.i.cil-1.c[72502,72515] [2022-04-28 15:15:58,499 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 15:15:58,520 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 15:15:58,687 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.02.i.cil-1.c[72502,72515] [2022-04-28 15:15:58,690 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 15:15:58,714 INFO L208 MainTranslator]: Completed translation [2022-04-28 15:15:58,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:15:58 WrapperNode [2022-04-28 15:15:58,715 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 15:15:58,716 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 15:15:58,716 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 15:15:58,716 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 15:15:58,726 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:15:58" (1/1) ... [2022-04-28 15:15:58,727 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:15:58" (1/1) ... [2022-04-28 15:15:58,761 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:15:58" (1/1) ... [2022-04-28 15:15:58,762 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:15:58" (1/1) ... [2022-04-28 15:15:58,835 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:15:58" (1/1) ... [2022-04-28 15:15:58,851 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:15:58" (1/1) ... [2022-04-28 15:15:58,855 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:15:58" (1/1) ... [2022-04-28 15:15:58,860 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 15:15:58,861 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 15:15:58,861 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 15:15:58,862 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 15:15:58,863 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:15:58" (1/1) ... [2022-04-28 15:15:58,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 15:15:58,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 15:15:58,898 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:15:58,948 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:15:58,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 15:15:58,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 15:15:58,980 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 15:15:58,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2022-04-28 15:15:58,980 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2022-04-28 15:15:58,981 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 15:15:58,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2022-04-28 15:15:58,981 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-28 15:15:58,982 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-28 15:15:58,982 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-28 15:15:58,982 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 15:15:58,983 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 15:15:58,983 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 15:15:58,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 15:15:58,984 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-28 15:15:58,984 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-28 15:15:58,985 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 15:15:58,985 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-28 15:15:58,985 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-28 15:15:58,986 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-28 15:15:58,986 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2022-04-28 15:15:58,986 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-28 15:15:58,986 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2022-04-28 15:15:58,986 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2022-04-28 15:15:58,986 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-28 15:15:58,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-28 15:15:58,986 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 15:15:58,986 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-28 15:15:58,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 15:15:58,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-28 15:15:58,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 15:15:58,987 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-28 15:15:58,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-28 15:15:58,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 15:15:58,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 15:15:58,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 15:15:58,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-28 15:15:58,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-28 15:15:58,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-28 15:15:58,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-28 15:15:58,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 15:15:59,129 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 15:15:59,131 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 15:16:01,570 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 15:16:02,042 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2022-04-28 15:16:02,043 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2022-04-28 15:16:02,057 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 15:16:02,064 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 15:16:02,064 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 15:16:02,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:16:02 BoogieIcfgContainer [2022-04-28 15:16:02,066 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 15:16:02,067 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 15:16:02,067 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 15:16:02,070 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 15:16:02,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 03:15:58" (1/3) ... [2022-04-28 15:16:02,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1461a679 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:16:02, skipping insertion in model container [2022-04-28 15:16:02,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:15:58" (2/3) ... [2022-04-28 15:16:02,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1461a679 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:16:02, skipping insertion in model container [2022-04-28 15:16:02,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:16:02" (3/3) ... [2022-04-28 15:16:02,072 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.02.i.cil-1.c [2022-04-28 15:16:02,083 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 15:16:02,083 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 15:16:02,117 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 15:16:02,123 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@5d1cb944, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4705ce5b [2022-04-28 15:16:02,123 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 15:16:02,131 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:02,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-28 15:16:02,139 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:16:02,140 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:02,140 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:16:02,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:16:02,144 INFO L85 PathProgramCache]: Analyzing trace with hash -2027838722, now seen corresponding path program 1 times [2022-04-28 15:16:02,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:02,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [838175296] [2022-04-28 15:16:02,159 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:16:02,159 INFO L85 PathProgramCache]: Analyzing trace with hash -2027838722, now seen corresponding path program 2 times [2022-04-28 15:16:02,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:16:02,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398600626] [2022-04-28 15:16:02,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:16:02,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:16:02,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:02,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:16:02,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:02,721 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(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$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:02,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {156#true} assume true; {156#true} is VALID [2022-04-28 15:16:02,722 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {156#true} {156#true} #661#return; {156#true} is VALID [2022-04-28 15:16:02,724 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:02,724 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(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$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:02,724 INFO L290 TraceCheckUtils]: 2: Hoare triple {156#true} assume true; {156#true} is VALID [2022-04-28 15:16:02,724 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {156#true} {156#true} #661#return; {156#true} is VALID [2022-04-28 15:16:02,724 INFO L272 TraceCheckUtils]: 4: Hoare triple {156#true} call #t~ret161 := main(); {156#true} is VALID [2022-04-28 15:16:02,726 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:02,726 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:02,726 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:02,732 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:02,734 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:02,735 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:02,735 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:02,736 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:02,737 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:02,737 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:02,738 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:02,739 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:02,740 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:02,740 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:02,742 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:02,743 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:02,743 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:02,744 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:02,745 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:02,745 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:02,746 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:02,746 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:02,746 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:02,747 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:02,747 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:02,747 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:02,747 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:02,748 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:02,748 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:02,748 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:02,749 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:02,749 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:02,749 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:02,749 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:02,750 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:02,750 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:02,750 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:02,751 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:02,751 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:02,752 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:02,752 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:02,752 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:02,755 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:02,755 INFO L290 TraceCheckUtils]: 48: Hoare triple {157#false} assume 8672 == #t~mem79;havoc #t~mem79; {157#false} is VALID [2022-04-28 15:16:02,755 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:02,755 INFO L290 TraceCheckUtils]: 50: Hoare triple {157#false} assume 3 == ~blastFlag~0; {157#false} is VALID [2022-04-28 15:16:02,756 INFO L290 TraceCheckUtils]: 51: Hoare triple {157#false} assume !false; {157#false} is VALID [2022-04-28 15:16:02,757 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:02,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:16:02,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398600626] [2022-04-28 15:16:02,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398600626] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:02,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:02,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:16:02,769 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:16:02,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [838175296] [2022-04-28 15:16:02,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [838175296] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:02,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:02,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:16:02,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122911911] [2022-04-28 15:16:02,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:16:02,778 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:02,780 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:16:02,782 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:02,837 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:02,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:16:02,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:02,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:16:02,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:16:02,859 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:04,898 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:06,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:06,318 INFO L93 Difference]: Finished difference Result 324 states and 540 transitions. [2022-04-28 15:16:06,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:16:06,319 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:06,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:16:06,320 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:06,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 540 transitions. [2022-04-28 15:16:06,337 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:06,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 540 transitions. [2022-04-28 15:16:06,343 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 540 transitions. [2022-04-28 15:16:06,743 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:06,752 INFO L225 Difference]: With dead ends: 324 [2022-04-28 15:16:06,753 INFO L226 Difference]: Without dead ends: 165 [2022-04-28 15:16:06,754 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:06,756 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:06,757 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:06,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-04-28 15:16:06,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 148. [2022-04-28 15:16:06,781 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:16:06,783 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:06,783 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:06,784 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:06,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:06,790 INFO L93 Difference]: Finished difference Result 165 states and 245 transitions. [2022-04-28 15:16:06,790 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 245 transitions. [2022-04-28 15:16:06,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:06,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:06,795 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:06,796 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:06,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:06,805 INFO L93 Difference]: Finished difference Result 165 states and 245 transitions. [2022-04-28 15:16:06,805 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 245 transitions. [2022-04-28 15:16:06,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:06,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:06,810 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:16:06,810 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:16:06,810 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:06,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 224 transitions. [2022-04-28 15:16:06,815 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 224 transitions. Word has length 52 [2022-04-28 15:16:06,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:16:06,815 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 224 transitions. [2022-04-28 15:16:06,815 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:06,816 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 148 states and 224 transitions. [2022-04-28 15:16:06,976 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:06,976 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 224 transitions. [2022-04-28 15:16:06,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-28 15:16:06,978 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:16:06,978 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:06,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 15:16:06,979 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:16:06,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:16:06,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1075038228, now seen corresponding path program 1 times [2022-04-28 15:16:06,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:06,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1229940046] [2022-04-28 15:16:06,999 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:16:06,999 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:16:06,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1075038228, now seen corresponding path program 2 times [2022-04-28 15:16:06,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:16:06,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632266757] [2022-04-28 15:16:06,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:16:06,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:16:07,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:07,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:16:07,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:07,184 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(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$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:07,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {1442#true} assume true; {1442#true} is VALID [2022-04-28 15:16:07,184 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1442#true} {1442#true} #661#return; {1442#true} is VALID [2022-04-28 15:16:07,185 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:07,185 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(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$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:07,185 INFO L290 TraceCheckUtils]: 2: Hoare triple {1442#true} assume true; {1442#true} is VALID [2022-04-28 15:16:07,185 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1442#true} {1442#true} #661#return; {1442#true} is VALID [2022-04-28 15:16:07,185 INFO L272 TraceCheckUtils]: 4: Hoare triple {1442#true} call #t~ret161 := main(); {1442#true} is VALID [2022-04-28 15:16:07,185 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:07,186 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:07,186 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:07,190 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:07,190 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:07,191 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:07,192 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:07,192 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:07,192 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:07,193 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:07,193 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:07,194 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:07,194 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:07,194 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:07,195 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:07,195 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:07,196 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:07,196 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:07,196 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:07,196 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:07,196 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:07,196 INFO L290 TraceCheckUtils]: 26: Hoare triple {1443#false} ~skip~0 := 0; {1443#false} is VALID [2022-04-28 15:16:07,196 INFO L290 TraceCheckUtils]: 27: Hoare triple {1443#false} assume !false; {1443#false} is VALID [2022-04-28 15:16:07,197 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:07,197 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:07,197 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:07,197 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:07,197 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:07,197 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:07,197 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:07,197 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:07,198 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:07,198 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:07,198 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:07,198 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:07,198 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:07,198 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:07,198 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:07,198 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:07,198 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:07,199 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:07,199 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:07,199 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:07,199 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:07,199 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:07,199 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:07,199 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:07,199 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:07,200 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:07,200 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:07,200 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:07,200 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:07,200 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:07,200 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:07,200 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:07,200 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:07,201 INFO L290 TraceCheckUtils]: 61: Hoare triple {1443#false} assume 8672 == #t~mem79;havoc #t~mem79; {1443#false} is VALID [2022-04-28 15:16:07,201 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:07,201 INFO L290 TraceCheckUtils]: 63: Hoare triple {1443#false} assume 3 == ~blastFlag~0; {1443#false} is VALID [2022-04-28 15:16:07,201 INFO L290 TraceCheckUtils]: 64: Hoare triple {1443#false} assume !false; {1443#false} is VALID [2022-04-28 15:16:07,201 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:07,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:16:07,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632266757] [2022-04-28 15:16:07,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632266757] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:07,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:07,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:16:07,202 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:16:07,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1229940046] [2022-04-28 15:16:07,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1229940046] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:07,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:07,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:16:07,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133498667] [2022-04-28 15:16:07,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:16:07,203 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:07,203 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:16:07,204 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:07,245 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:07,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:16:07,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:07,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:16:07,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:16:07,246 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:09,266 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:10,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:10,255 INFO L93 Difference]: Finished difference Result 287 states and 431 transitions. [2022-04-28 15:16:10,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:16:10,255 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:10,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:16:10,255 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:10,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 431 transitions. [2022-04-28 15:16:10,259 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:10,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 431 transitions. [2022-04-28 15:16:10,262 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 431 transitions. [2022-04-28 15:16:10,545 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:10,549 INFO L225 Difference]: With dead ends: 287 [2022-04-28 15:16:10,549 INFO L226 Difference]: Without dead ends: 165 [2022-04-28 15:16:10,550 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:10,550 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 24 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s 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:10,551 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:10,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-04-28 15:16:10,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 148. [2022-04-28 15:16:10,562 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:16:10,563 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:10,564 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:10,564 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:10,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:10,568 INFO L93 Difference]: Finished difference Result 165 states and 244 transitions. [2022-04-28 15:16:10,569 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 244 transitions. [2022-04-28 15:16:10,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:10,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:10,569 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:10,570 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:10,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:10,574 INFO L93 Difference]: Finished difference Result 165 states and 244 transitions. [2022-04-28 15:16:10,574 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 244 transitions. [2022-04-28 15:16:10,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:10,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:10,574 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:16:10,574 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:16:10,575 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:10,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 223 transitions. [2022-04-28 15:16:10,579 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 223 transitions. Word has length 65 [2022-04-28 15:16:10,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:16:10,580 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 223 transitions. [2022-04-28 15:16:10,580 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:10,580 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 148 states and 223 transitions. [2022-04-28 15:16:10,741 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:10,741 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 223 transitions. [2022-04-28 15:16:10,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-28 15:16:10,742 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:16:10,742 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:10,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 15:16:10,743 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:16:10,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:16:10,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1045469476, now seen corresponding path program 1 times [2022-04-28 15:16:10,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:10,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1221918574] [2022-04-28 15:16:10,765 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:16:10,765 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:16:10,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1045469476, now seen corresponding path program 2 times [2022-04-28 15:16:10,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:16:10,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14421811] [2022-04-28 15:16:10,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:16:10,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:16:10,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:10,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:16:10,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:10,906 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(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$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:10,906 INFO L290 TraceCheckUtils]: 1: Hoare triple {2654#true} assume true; {2654#true} is VALID [2022-04-28 15:16:10,907 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2654#true} {2654#true} #661#return; {2654#true} is VALID [2022-04-28 15:16:10,909 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:10,909 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(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$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:10,910 INFO L290 TraceCheckUtils]: 2: Hoare triple {2654#true} assume true; {2654#true} is VALID [2022-04-28 15:16:10,910 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2654#true} {2654#true} #661#return; {2654#true} is VALID [2022-04-28 15:16:10,910 INFO L272 TraceCheckUtils]: 4: Hoare triple {2654#true} call #t~ret161 := main(); {2654#true} is VALID [2022-04-28 15:16:10,910 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:10,910 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:10,910 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:10,921 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:10,921 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:10,922 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:10,923 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:10,923 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:10,923 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:10,924 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:10,925 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:10,925 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:10,925 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:10,925 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:10,925 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:10,925 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:10,926 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:10,926 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:10,926 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:10,926 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:10,926 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:10,926 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:10,926 INFO L290 TraceCheckUtils]: 27: Hoare triple {2655#false} ~skip~0 := 0; {2655#false} is VALID [2022-04-28 15:16:10,926 INFO L290 TraceCheckUtils]: 28: Hoare triple {2655#false} assume !false; {2655#false} is VALID [2022-04-28 15:16:10,927 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:10,927 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:10,927 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:10,927 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:10,927 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:10,927 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:10,927 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:10,927 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:10,927 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:10,928 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:10,928 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:10,928 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:10,928 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:10,928 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:10,928 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:10,928 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:10,928 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:10,928 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:10,928 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:10,929 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:10,929 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:10,929 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:10,929 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:10,929 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:10,929 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:10,929 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:10,929 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:10,929 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:10,930 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:10,930 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:10,930 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:10,930 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:10,930 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:10,930 INFO L290 TraceCheckUtils]: 62: Hoare triple {2655#false} assume 8672 == #t~mem79;havoc #t~mem79; {2655#false} is VALID [2022-04-28 15:16:10,930 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:10,930 INFO L290 TraceCheckUtils]: 64: Hoare triple {2655#false} assume 3 == ~blastFlag~0; {2655#false} is VALID [2022-04-28 15:16:10,930 INFO L290 TraceCheckUtils]: 65: Hoare triple {2655#false} assume !false; {2655#false} is VALID [2022-04-28 15:16:10,931 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:10,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:16:10,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14421811] [2022-04-28 15:16:10,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14421811] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:10,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:10,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:16:10,932 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:16:10,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1221918574] [2022-04-28 15:16:10,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1221918574] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:10,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:10,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:16:10,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880611710] [2022-04-28 15:16:10,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:16:10,932 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:10,933 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:16:10,933 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:10,977 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:10,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:16:10,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:10,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:16:10,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:16:10,978 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:16:12,999 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:13,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:13,943 INFO L93 Difference]: Finished difference Result 286 states and 429 transitions. [2022-04-28 15:16:13,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:16:13,943 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:13,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:16:13,944 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:16:13,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 429 transitions. [2022-04-28 15:16:13,947 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:16:13,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 429 transitions. [2022-04-28 15:16:13,949 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 429 transitions. [2022-04-28 15:16:14,205 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:16:14,207 INFO L225 Difference]: With dead ends: 286 [2022-04-28 15:16:14,208 INFO L226 Difference]: Without dead ends: 164 [2022-04-28 15:16:14,208 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:14,209 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 28 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:16:14,209 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.3s Time] [2022-04-28 15:16:14,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-04-28 15:16:14,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 148. [2022-04-28 15:16:14,215 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:16:14,219 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:16:14,220 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:16:14,220 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:16:14,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:14,224 INFO L93 Difference]: Finished difference Result 164 states and 242 transitions. [2022-04-28 15:16:14,224 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 242 transitions. [2022-04-28 15:16:14,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:14,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:14,225 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:16:14,225 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:16:14,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:14,228 INFO L93 Difference]: Finished difference Result 164 states and 242 transitions. [2022-04-28 15:16:14,228 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 242 transitions. [2022-04-28 15:16:14,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:14,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:14,229 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:16:14,229 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:16:14,229 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:16:14,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 222 transitions. [2022-04-28 15:16:14,233 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 222 transitions. Word has length 66 [2022-04-28 15:16:14,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:16:14,233 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 222 transitions. [2022-04-28 15:16:14,233 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:16:14,234 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 148 states and 222 transitions. [2022-04-28 15:16:14,381 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:16:14,381 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 222 transitions. [2022-04-28 15:16:14,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-28 15:16:14,382 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:16:14,382 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:16:14,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 15:16:14,382 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:16:14,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:16:14,383 INFO L85 PathProgramCache]: Analyzing trace with hash -207458704, now seen corresponding path program 1 times [2022-04-28 15:16:14,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:14,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [201626059] [2022-04-28 15:16:14,402 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 15:16:14,402 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:16:14,402 INFO L85 PathProgramCache]: Analyzing trace with hash -207458704, now seen corresponding path program 2 times [2022-04-28 15:16:14,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:16:14,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992463519] [2022-04-28 15:16:14,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:16:14,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:16:14,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:14,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:16:14,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:14,521 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(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$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:16:14,521 INFO L290 TraceCheckUtils]: 1: Hoare triple {3862#true} assume true; {3862#true} is VALID [2022-04-28 15:16:14,521 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3862#true} {3862#true} #661#return; {3862#true} is VALID [2022-04-28 15:16:14,522 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:16:14,522 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(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$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:16:14,522 INFO L290 TraceCheckUtils]: 2: Hoare triple {3862#true} assume true; {3862#true} is VALID [2022-04-28 15:16:14,522 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3862#true} {3862#true} #661#return; {3862#true} is VALID [2022-04-28 15:16:14,522 INFO L272 TraceCheckUtils]: 4: Hoare triple {3862#true} call #t~ret161 := main(); {3862#true} is VALID [2022-04-28 15:16:14,523 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:16:14,523 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:16:14,525 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:16:14,527 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:16:14,527 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:16:14,528 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:16:14,529 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:16:14,529 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:16:14,529 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:16:14,530 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:16:14,530 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:16:14,530 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:16:14,531 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:16:14,531 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:16:14,531 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:16:14,531 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:16:14,531 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:16:14,531 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:16:14,531 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:16:14,532 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:16:14,532 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:16:14,532 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:16:14,532 INFO L290 TraceCheckUtils]: 27: Hoare triple {3863#false} ~skip~0 := 0; {3863#false} is VALID [2022-04-28 15:16:14,532 INFO L290 TraceCheckUtils]: 28: Hoare triple {3863#false} assume !false; {3863#false} is VALID [2022-04-28 15:16:14,532 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:16:14,532 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:16:14,532 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:16:14,532 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:16:14,532 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:16:14,533 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:16:14,533 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:16:14,533 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:16:14,533 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:16:14,533 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:16:14,533 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:16:14,533 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:16:14,533 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:16:14,534 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:16:14,534 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:16:14,534 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:16:14,534 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:16:14,534 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:16:14,534 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:16:14,534 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:16:14,534 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:16:14,534 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:16:14,534 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:16:14,535 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:16:14,535 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:16:14,537 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:16:14,538 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:16:14,538 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:16:14,538 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:16:14,539 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:16:14,539 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:16:14,539 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:16:14,539 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:16:14,539 INFO L290 TraceCheckUtils]: 62: Hoare triple {3863#false} assume 8672 == #t~mem79;havoc #t~mem79; {3863#false} is VALID [2022-04-28 15:16:14,539 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:16:14,539 INFO L290 TraceCheckUtils]: 64: Hoare triple {3863#false} assume 3 == ~blastFlag~0; {3863#false} is VALID [2022-04-28 15:16:14,539 INFO L290 TraceCheckUtils]: 65: Hoare triple {3863#false} assume !false; {3863#false} is VALID [2022-04-28 15:16:14,540 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:16:14,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:16:14,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992463519] [2022-04-28 15:16:14,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992463519] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:14,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:14,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:16:14,540 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:16:14,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [201626059] [2022-04-28 15:16:14,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [201626059] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:14,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:14,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:16:14,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629554653] [2022-04-28 15:16:14,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:16:14,541 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:14,541 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:16:14,541 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:14,584 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:14,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:16:14,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:14,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:16:14,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:16:14,585 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:16:16,609 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:17,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:17,451 INFO L93 Difference]: Finished difference Result 286 states and 428 transitions. [2022-04-28 15:16:17,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:16:17,452 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:17,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:16:17,452 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:16:17,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 428 transitions. [2022-04-28 15:16:17,455 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:16:17,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 428 transitions. [2022-04-28 15:16:17,458 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 428 transitions. [2022-04-28 15:16:17,759 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:16:17,761 INFO L225 Difference]: With dead ends: 286 [2022-04-28 15:16:17,761 INFO L226 Difference]: Without dead ends: 164 [2022-04-28 15:16:17,762 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:17,762 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 26 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:16:17,762 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.3s Time] [2022-04-28 15:16:17,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-04-28 15:16:17,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 148. [2022-04-28 15:16:17,773 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:16:17,774 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:16:17,774 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:16:17,775 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:16:17,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:17,785 INFO L93 Difference]: Finished difference Result 164 states and 241 transitions. [2022-04-28 15:16:17,785 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 241 transitions. [2022-04-28 15:16:17,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:17,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:17,786 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:16:17,787 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:16:17,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:17,790 INFO L93 Difference]: Finished difference Result 164 states and 241 transitions. [2022-04-28 15:16:17,790 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 241 transitions. [2022-04-28 15:16:17,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:17,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:17,790 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:16:17,790 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:16:17,790 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:16:17,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 221 transitions. [2022-04-28 15:16:17,793 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 221 transitions. Word has length 66 [2022-04-28 15:16:17,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:16:17,793 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 221 transitions. [2022-04-28 15:16:17,793 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:16:17,793 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 148 states and 221 transitions. [2022-04-28 15:16:17,942 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:16:17,943 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 221 transitions. [2022-04-28 15:16:17,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-28 15:16:17,944 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:16:17,944 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:16:17,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 15:16:17,944 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:16:17,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:16:17,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1867256871, now seen corresponding path program 1 times [2022-04-28 15:16:17,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:17,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [578019745] [2022-04-28 15:16:17,963 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:16:17,963 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:16:17,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1867256871, now seen corresponding path program 2 times [2022-04-28 15:16:17,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:16:17,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928826760] [2022-04-28 15:16:17,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:16:17,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:16:18,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:18,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:16:18,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:18,096 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(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$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:16:18,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {5070#true} assume true; {5070#true} is VALID [2022-04-28 15:16:18,096 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5070#true} {5070#true} #661#return; {5070#true} is VALID [2022-04-28 15:16:18,097 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:16:18,097 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(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$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:16:18,097 INFO L290 TraceCheckUtils]: 2: Hoare triple {5070#true} assume true; {5070#true} is VALID [2022-04-28 15:16:18,097 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5070#true} {5070#true} #661#return; {5070#true} is VALID [2022-04-28 15:16:18,097 INFO L272 TraceCheckUtils]: 4: Hoare triple {5070#true} call #t~ret161 := main(); {5070#true} is VALID [2022-04-28 15:16:18,097 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:16:18,097 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:16:18,098 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:16:18,099 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:16:18,100 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:16:18,100 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:16:18,101 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:16:18,101 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:16:18,101 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:16:18,103 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:16:18,103 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:16:18,104 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:16:18,104 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:16:18,104 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:16:18,105 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:16:18,105 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:16:18,106 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:16:18,106 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:16:18,106 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:16:18,106 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:16:18,106 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:16:18,106 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:16:18,106 INFO L290 TraceCheckUtils]: 27: Hoare triple {5071#false} ~skip~0 := 0; {5071#false} is VALID [2022-04-28 15:16:18,106 INFO L290 TraceCheckUtils]: 28: Hoare triple {5071#false} assume !false; {5071#false} is VALID [2022-04-28 15:16:18,106 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:16:18,107 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:16:18,107 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:16:18,107 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:16:18,107 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:16:18,107 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:16:18,107 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:16:18,107 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:16:18,107 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:16:18,107 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:16:18,107 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:16:18,107 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:16:18,108 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:16:18,108 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:16:18,108 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:16:18,109 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:16:18,109 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:16:18,109 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:16:18,109 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:16:18,109 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:16:18,109 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:16:18,109 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:16:18,109 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:16:18,109 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:16:18,109 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:16:18,109 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:16:18,109 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:16:18,109 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:16:18,110 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:16:18,110 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:16:18,110 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:16:18,110 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:16:18,110 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:16:18,110 INFO L290 TraceCheckUtils]: 62: Hoare triple {5071#false} assume 8672 == #t~mem79;havoc #t~mem79; {5071#false} is VALID [2022-04-28 15:16:18,110 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:16:18,110 INFO L290 TraceCheckUtils]: 64: Hoare triple {5071#false} assume 3 == ~blastFlag~0; {5071#false} is VALID [2022-04-28 15:16:18,110 INFO L290 TraceCheckUtils]: 65: Hoare triple {5071#false} assume !false; {5071#false} is VALID [2022-04-28 15:16:18,111 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:16:18,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:16:18,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928826760] [2022-04-28 15:16:18,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928826760] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:18,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:18,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:16:18,112 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:16:18,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [578019745] [2022-04-28 15:16:18,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [578019745] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:18,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:18,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:16:18,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990183019] [2022-04-28 15:16:18,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:16:18,114 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:18,115 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:16:18,115 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:18,164 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:18,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:16:18,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:18,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:16:18,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:16:18,166 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:16:20,187 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:21,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:21,035 INFO L93 Difference]: Finished difference Result 284 states and 425 transitions. [2022-04-28 15:16:21,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:16:21,035 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:21,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:16:21,035 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:16:21,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 425 transitions. [2022-04-28 15:16:21,038 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:16:21,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 425 transitions. [2022-04-28 15:16:21,040 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 425 transitions. [2022-04-28 15:16:21,302 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:16:21,304 INFO L225 Difference]: With dead ends: 284 [2022-04-28 15:16:21,304 INFO L226 Difference]: Without dead ends: 162 [2022-04-28 15:16:21,305 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:21,305 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 20 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:16:21,305 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.3s Time] [2022-04-28 15:16:21,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-04-28 15:16:21,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 148. [2022-04-28 15:16:21,310 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:16:21,310 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:16:21,310 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:16:21,311 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:16:21,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:21,313 INFO L93 Difference]: Finished difference Result 162 states and 238 transitions. [2022-04-28 15:16:21,313 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 238 transitions. [2022-04-28 15:16:21,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:21,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:21,314 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:16:21,314 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:16:21,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:21,316 INFO L93 Difference]: Finished difference Result 162 states and 238 transitions. [2022-04-28 15:16:21,316 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 238 transitions. [2022-04-28 15:16:21,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:21,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:21,316 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:16:21,316 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:16:21,317 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:16:21,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 220 transitions. [2022-04-28 15:16:21,319 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 220 transitions. Word has length 66 [2022-04-28 15:16:21,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:16:21,319 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 220 transitions. [2022-04-28 15:16:21,319 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:16:21,319 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 148 states and 220 transitions. [2022-04-28 15:16:21,462 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:16:21,463 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 220 transitions. [2022-04-28 15:16:21,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-28 15:16:21,463 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:16:21,463 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:16:21,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 15:16:21,463 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:16:21,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:16:21,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1927058904, now seen corresponding path program 1 times [2022-04-28 15:16:21,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:21,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [459708451] [2022-04-28 15:16:21,483 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:16:21,483 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:16:21,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1927058904, now seen corresponding path program 2 times [2022-04-28 15:16:21,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:16:21,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699841955] [2022-04-28 15:16:21,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:16:21,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:16:21,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:21,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:16:21,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:21,599 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(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$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:16:21,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {6270#true} assume true; {6270#true} is VALID [2022-04-28 15:16:21,599 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6270#true} {6270#true} #661#return; {6270#true} is VALID [2022-04-28 15:16:21,600 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:16:21,600 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(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$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:16:21,601 INFO L290 TraceCheckUtils]: 2: Hoare triple {6270#true} assume true; {6270#true} is VALID [2022-04-28 15:16:21,601 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6270#true} {6270#true} #661#return; {6270#true} is VALID [2022-04-28 15:16:21,601 INFO L272 TraceCheckUtils]: 4: Hoare triple {6270#true} call #t~ret161 := main(); {6270#true} is VALID [2022-04-28 15:16:21,601 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:16:21,601 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:16:21,601 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:16:21,603 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:16:21,604 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:16:21,605 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:16:21,609 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:16:21,610 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:16:21,610 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:16:21,610 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:16:21,611 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:16:21,611 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:16:21,612 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:16:21,612 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:16:21,612 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:16:21,613 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:16:21,613 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:16:21,613 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:16:21,614 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:16:21,614 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:16:21,614 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:16:21,614 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:16:21,614 INFO L290 TraceCheckUtils]: 27: Hoare triple {6271#false} ~skip~0 := 0; {6271#false} is VALID [2022-04-28 15:16:21,614 INFO L290 TraceCheckUtils]: 28: Hoare triple {6271#false} assume !false; {6271#false} is VALID [2022-04-28 15:16:21,614 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:16:21,614 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:16:21,614 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:16:21,614 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:16:21,615 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:16:21,615 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:16:21,615 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:16:21,615 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:16:21,615 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:16:21,615 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:16:21,615 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:16:21,615 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:16:21,615 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:16:21,615 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:16:21,617 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:16:21,618 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:16:21,618 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:16:21,618 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:16:21,619 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:16:21,619 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:16:21,619 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:16:21,620 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:16:21,620 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:16:21,620 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:16:21,620 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:16:21,620 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:16:21,621 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:16:21,621 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:16:21,621 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:16:21,621 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:16:21,621 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:16:21,621 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:16:21,621 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:16:21,621 INFO L290 TraceCheckUtils]: 62: Hoare triple {6271#false} assume 8672 == #t~mem79;havoc #t~mem79; {6271#false} is VALID [2022-04-28 15:16:21,621 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:16:21,621 INFO L290 TraceCheckUtils]: 64: Hoare triple {6271#false} assume 3 == ~blastFlag~0; {6271#false} is VALID [2022-04-28 15:16:21,622 INFO L290 TraceCheckUtils]: 65: Hoare triple {6271#false} assume !false; {6271#false} is VALID [2022-04-28 15:16:21,623 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:16:21,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:16:21,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699841955] [2022-04-28 15:16:21,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699841955] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:21,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:21,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:16:21,624 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:16:21,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [459708451] [2022-04-28 15:16:21,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [459708451] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:21,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:21,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:16:21,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657551926] [2022-04-28 15:16:21,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:16:21,625 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:21,625 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:16:21,625 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:21,684 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:21,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:16:21,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:21,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:16:21,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:16:21,686 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:16:23,710 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:24,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:24,650 INFO L93 Difference]: Finished difference Result 283 states and 423 transitions. [2022-04-28 15:16:24,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:16:24,650 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:24,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:16:24,650 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:16:24,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 423 transitions. [2022-04-28 15:16:24,653 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:16:24,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 423 transitions. [2022-04-28 15:16:24,655 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 423 transitions. [2022-04-28 15:16:24,931 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:16:24,938 INFO L225 Difference]: With dead ends: 283 [2022-04-28 15:16:24,938 INFO L226 Difference]: Without dead ends: 161 [2022-04-28 15:16:24,939 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:24,939 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:16:24,940 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:16:24,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-04-28 15:16:24,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 148. [2022-04-28 15:16:24,946 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:16:24,947 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:16:24,947 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:16:24,948 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:16:24,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:24,950 INFO L93 Difference]: Finished difference Result 161 states and 236 transitions. [2022-04-28 15:16:24,950 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 236 transitions. [2022-04-28 15:16:24,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:24,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:24,951 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:16:24,952 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:16:24,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:24,954 INFO L93 Difference]: Finished difference Result 161 states and 236 transitions. [2022-04-28 15:16:24,955 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 236 transitions. [2022-04-28 15:16:24,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:24,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:24,955 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:16:24,955 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:16:24,956 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:16:24,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 219 transitions. [2022-04-28 15:16:24,958 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 219 transitions. Word has length 66 [2022-04-28 15:16:24,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:16:24,958 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 219 transitions. [2022-04-28 15:16:24,959 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:16:24,959 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 148 states and 219 transitions. [2022-04-28 15:16:25,105 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:16:25,105 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 219 transitions. [2022-04-28 15:16:25,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-28 15:16:25,106 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:16:25,106 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:16:25,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 15:16:25,106 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:16:25,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:16:25,107 INFO L85 PathProgramCache]: Analyzing trace with hash 527212629, now seen corresponding path program 1 times [2022-04-28 15:16:25,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:25,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2026707698] [2022-04-28 15:16:25,125 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 15:16:25,125 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:16:25,125 INFO L85 PathProgramCache]: Analyzing trace with hash 527212629, now seen corresponding path program 2 times [2022-04-28 15:16:25,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:16:25,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664700939] [2022-04-28 15:16:25,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:16:25,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:16:25,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:25,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:16:25,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:25,262 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(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$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:16:25,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {7466#true} assume true; {7466#true} is VALID [2022-04-28 15:16:25,262 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7466#true} {7466#true} #661#return; {7466#true} is VALID [2022-04-28 15:16:25,263 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:16:25,263 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(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$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:16:25,263 INFO L290 TraceCheckUtils]: 2: Hoare triple {7466#true} assume true; {7466#true} is VALID [2022-04-28 15:16:25,263 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7466#true} {7466#true} #661#return; {7466#true} is VALID [2022-04-28 15:16:25,263 INFO L272 TraceCheckUtils]: 4: Hoare triple {7466#true} call #t~ret161 := main(); {7466#true} is VALID [2022-04-28 15:16:25,263 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:16:25,263 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:16:25,263 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:16:25,265 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:16:25,266 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:16:25,266 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:16:25,267 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:16:25,267 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:16:25,268 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:16:25,268 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:16:25,269 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:16:25,269 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:16:25,269 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:16:25,270 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:16:25,270 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:16:25,270 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:16:25,270 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:16:25,270 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:16:25,270 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:16:25,270 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:16:25,270 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:16:25,270 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:16:25,270 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:16:25,271 INFO L290 TraceCheckUtils]: 28: Hoare triple {7467#false} ~skip~0 := 0; {7467#false} is VALID [2022-04-28 15:16:25,271 INFO L290 TraceCheckUtils]: 29: Hoare triple {7467#false} assume !false; {7467#false} is VALID [2022-04-28 15:16:25,271 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:16:25,271 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:16:25,271 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:16:25,271 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:16:25,271 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:16:25,271 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:16:25,271 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:16:25,271 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:16:25,271 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:16:25,271 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:16:25,272 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:16:25,272 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:16:25,272 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:16:25,272 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:16:25,272 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:16:25,272 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:16:25,272 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:16:25,272 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:16:25,272 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:16:25,272 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:16:25,272 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:16:25,272 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:16:25,272 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:16:25,272 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:16:25,273 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:16:25,273 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:16:25,273 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:16:25,273 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:16:25,273 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:16:25,273 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:16:25,273 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:16:25,273 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:16:25,273 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:16:25,273 INFO L290 TraceCheckUtils]: 63: Hoare triple {7467#false} assume 8672 == #t~mem79;havoc #t~mem79; {7467#false} is VALID [2022-04-28 15:16:25,273 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:16:25,273 INFO L290 TraceCheckUtils]: 65: Hoare triple {7467#false} assume 3 == ~blastFlag~0; {7467#false} is VALID [2022-04-28 15:16:25,273 INFO L290 TraceCheckUtils]: 66: Hoare triple {7467#false} assume !false; {7467#false} is VALID [2022-04-28 15:16:25,274 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:16:25,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:16:25,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664700939] [2022-04-28 15:16:25,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664700939] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:25,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:25,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:16:25,274 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:16:25,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2026707698] [2022-04-28 15:16:25,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2026707698] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:25,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:25,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:16:25,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976526518] [2022-04-28 15:16:25,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:16:25,276 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:16:25,276 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:16:25,276 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:16:25,328 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:16:25,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:16:25,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:25,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:16:25,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:16:25,329 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:16:27,350 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:28,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:28,183 INFO L93 Difference]: Finished difference Result 283 states and 422 transitions. [2022-04-28 15:16:28,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:16:28,183 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:16:28,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:16:28,184 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:16:28,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 422 transitions. [2022-04-28 15:16:28,186 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:16:28,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 422 transitions. [2022-04-28 15:16:28,188 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 422 transitions. [2022-04-28 15:16:28,479 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:16:28,481 INFO L225 Difference]: With dead ends: 283 [2022-04-28 15:16:28,481 INFO L226 Difference]: Without dead ends: 161 [2022-04-28 15:16:28,481 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:28,482 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:16:28,482 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:16:28,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-04-28 15:16:28,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 148. [2022-04-28 15:16:28,486 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:16:28,487 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:16:28,487 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:16:28,487 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:16:28,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:28,489 INFO L93 Difference]: Finished difference Result 161 states and 235 transitions. [2022-04-28 15:16:28,489 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 235 transitions. [2022-04-28 15:16:28,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:28,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:28,490 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:16:28,490 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:16:28,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:28,492 INFO L93 Difference]: Finished difference Result 161 states and 235 transitions. [2022-04-28 15:16:28,492 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 235 transitions. [2022-04-28 15:16:28,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:28,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:28,493 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:16:28,493 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:16:28,493 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:16:28,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 218 transitions. [2022-04-28 15:16:28,495 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 218 transitions. Word has length 67 [2022-04-28 15:16:28,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:16:28,495 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 218 transitions. [2022-04-28 15:16:28,495 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:16:28,495 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 148 states and 218 transitions. [2022-04-28 15:16:28,673 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:16:28,673 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 218 transitions. [2022-04-28 15:16:28,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-28 15:16:28,674 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:16:28,674 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:16:28,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-28 15:16:28,674 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:16:28,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:16:28,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1788390677, now seen corresponding path program 1 times [2022-04-28 15:16:28,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:28,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [673764320] [2022-04-28 15:16:28,693 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 15:16:28,693 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:16:28,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1788390677, now seen corresponding path program 2 times [2022-04-28 15:16:28,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:16:28,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036547483] [2022-04-28 15:16:28,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:16:28,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:16:28,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:28,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:16:28,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:28,789 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(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$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:16:28,789 INFO L290 TraceCheckUtils]: 1: Hoare triple {8662#true} assume true; {8662#true} is VALID [2022-04-28 15:16:28,789 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8662#true} {8662#true} #661#return; {8662#true} is VALID [2022-04-28 15:16:28,790 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:16:28,790 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(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$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:16:28,790 INFO L290 TraceCheckUtils]: 2: Hoare triple {8662#true} assume true; {8662#true} is VALID [2022-04-28 15:16:28,790 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8662#true} {8662#true} #661#return; {8662#true} is VALID [2022-04-28 15:16:28,790 INFO L272 TraceCheckUtils]: 4: Hoare triple {8662#true} call #t~ret161 := main(); {8662#true} is VALID [2022-04-28 15:16:28,790 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:16:28,791 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:16:28,791 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:16:28,792 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:16:28,793 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:16:28,793 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:16:28,794 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:16:28,794 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:16:28,794 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:16:28,795 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:16:28,795 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:16:28,796 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:16:28,796 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:16:28,796 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:16:28,797 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:16:28,797 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:16:28,797 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:16:28,797 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:16:28,797 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:16:28,797 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:16:28,797 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:16:28,797 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:16:28,797 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:16:28,797 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:16:28,797 INFO L290 TraceCheckUtils]: 29: Hoare triple {8663#false} ~skip~0 := 0; {8663#false} is VALID [2022-04-28 15:16:28,797 INFO L290 TraceCheckUtils]: 30: Hoare triple {8663#false} assume !false; {8663#false} is VALID [2022-04-28 15:16:28,797 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:16:28,798 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:16:28,798 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:16:28,798 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:16:28,798 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:16:28,798 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:16:28,798 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:16:28,798 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:16:28,798 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:16:28,798 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:16:28,798 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:16:28,798 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:16:28,798 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:16:28,798 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:16:28,798 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:16:28,799 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:16:28,799 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:16:28,799 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:16:28,799 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:16:28,799 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:16:28,799 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:16:28,799 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:16:28,799 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:16:28,799 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:16:28,799 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:16:28,799 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:16:28,799 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:16:28,799 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:16:28,800 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:16:28,800 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:16:28,800 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:16:28,800 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:16:28,800 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:16:28,800 INFO L290 TraceCheckUtils]: 64: Hoare triple {8663#false} assume 8672 == #t~mem79;havoc #t~mem79; {8663#false} is VALID [2022-04-28 15:16:28,800 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:16:28,800 INFO L290 TraceCheckUtils]: 66: Hoare triple {8663#false} assume 3 == ~blastFlag~0; {8663#false} is VALID [2022-04-28 15:16:28,800 INFO L290 TraceCheckUtils]: 67: Hoare triple {8663#false} assume !false; {8663#false} is VALID [2022-04-28 15:16:28,800 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:16:28,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:16:28,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036547483] [2022-04-28 15:16:28,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036547483] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:28,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:28,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:16:28,801 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:16:28,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [673764320] [2022-04-28 15:16:28,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [673764320] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:28,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:28,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:16:28,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553077775] [2022-04-28 15:16:28,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:16:28,802 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:16:28,802 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:16:28,802 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:16:28,851 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:16:28,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:16:28,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:28,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:16:28,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:16:28,852 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:16:30,871 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:31,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:31,704 INFO L93 Difference]: Finished difference Result 283 states and 421 transitions. [2022-04-28 15:16:31,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:16:31,705 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:16:31,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:16:31,705 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:16:31,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 421 transitions. [2022-04-28 15:16:31,707 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:16:31,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 421 transitions. [2022-04-28 15:16:31,709 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 421 transitions. [2022-04-28 15:16:32,025 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:16:32,027 INFO L225 Difference]: With dead ends: 283 [2022-04-28 15:16:32,027 INFO L226 Difference]: Without dead ends: 161 [2022-04-28 15:16:32,027 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:32,028 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 20 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:16:32,028 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.3s Time] [2022-04-28 15:16:32,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-04-28 15:16:32,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 148. [2022-04-28 15:16:32,032 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:16:32,032 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:16:32,038 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:16:32,038 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:16:32,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:32,041 INFO L93 Difference]: Finished difference Result 161 states and 234 transitions. [2022-04-28 15:16:32,041 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 234 transitions. [2022-04-28 15:16:32,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:32,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:32,041 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:16:32,041 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:16:32,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:32,043 INFO L93 Difference]: Finished difference Result 161 states and 234 transitions. [2022-04-28 15:16:32,043 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 234 transitions. [2022-04-28 15:16:32,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:32,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:32,044 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:16:32,044 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:16:32,044 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:16:32,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 217 transitions. [2022-04-28 15:16:32,046 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 217 transitions. Word has length 68 [2022-04-28 15:16:32,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:16:32,046 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 217 transitions. [2022-04-28 15:16:32,046 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:16:32,046 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 148 states and 217 transitions. [2022-04-28 15:16:32,186 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:16:32,186 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 217 transitions. [2022-04-28 15:16:32,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-28 15:16:32,187 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:16:32,187 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:16:32,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-28 15:16:32,187 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:16:32,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:16:32,187 INFO L85 PathProgramCache]: Analyzing trace with hash -2103559590, now seen corresponding path program 1 times [2022-04-28 15:16:32,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:32,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1988876565] [2022-04-28 15:16:32,209 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 15:16:32,209 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:16:32,209 INFO L85 PathProgramCache]: Analyzing trace with hash -2103559590, now seen corresponding path program 2 times [2022-04-28 15:16:32,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:16:32,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609783122] [2022-04-28 15:16:32,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:16:32,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:16:32,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:32,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:16:32,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:32,322 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(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$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:16:32,322 INFO L290 TraceCheckUtils]: 1: Hoare triple {9858#true} assume true; {9858#true} is VALID [2022-04-28 15:16:32,322 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9858#true} {9858#true} #661#return; {9858#true} is VALID [2022-04-28 15:16:32,323 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:16:32,323 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(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$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:16:32,323 INFO L290 TraceCheckUtils]: 2: Hoare triple {9858#true} assume true; {9858#true} is VALID [2022-04-28 15:16:32,323 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9858#true} {9858#true} #661#return; {9858#true} is VALID [2022-04-28 15:16:32,323 INFO L272 TraceCheckUtils]: 4: Hoare triple {9858#true} call #t~ret161 := main(); {9858#true} is VALID [2022-04-28 15:16:32,323 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:16:32,323 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:16:32,323 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:16:32,325 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:16:32,325 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:16:32,326 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:16:32,326 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:16:32,327 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:16:32,327 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:16:32,327 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:16:32,328 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:16:32,328 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:16:32,328 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:16:32,329 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:16:32,329 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:16:32,329 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:16:32,330 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:16:32,330 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:16:32,330 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:16:32,330 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:16:32,330 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:16:32,330 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:16:32,330 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:16:32,330 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:16:32,330 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:16:32,330 INFO L290 TraceCheckUtils]: 30: Hoare triple {9859#false} ~skip~0 := 0; {9859#false} is VALID [2022-04-28 15:16:32,330 INFO L290 TraceCheckUtils]: 31: Hoare triple {9859#false} assume !false; {9859#false} is VALID [2022-04-28 15:16:32,330 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:16:32,331 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:16:32,331 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:16:32,331 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:16:32,331 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:16:32,331 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:16:32,331 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:16:32,331 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:16:32,331 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:16:32,331 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:16:32,331 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:16:32,331 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:16:32,331 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:16:32,331 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:16:32,332 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:16:32,332 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:16:32,332 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:16:32,332 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:16:32,332 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:16:32,332 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:16:32,332 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:16:32,332 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:16:32,332 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:16:32,332 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:16:32,332 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:16:32,332 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:16:32,332 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:16:32,333 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:16:32,333 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:16:32,333 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:16:32,333 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:16:32,333 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:16:32,333 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:16:32,333 INFO L290 TraceCheckUtils]: 65: Hoare triple {9859#false} assume 8672 == #t~mem79;havoc #t~mem79; {9859#false} is VALID [2022-04-28 15:16:32,333 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:16:32,333 INFO L290 TraceCheckUtils]: 67: Hoare triple {9859#false} assume 3 == ~blastFlag~0; {9859#false} is VALID [2022-04-28 15:16:32,333 INFO L290 TraceCheckUtils]: 68: Hoare triple {9859#false} assume !false; {9859#false} is VALID [2022-04-28 15:16:32,334 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:16:32,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:16:32,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609783122] [2022-04-28 15:16:32,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609783122] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:32,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:32,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:16:32,334 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:16:32,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1988876565] [2022-04-28 15:16:32,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1988876565] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:32,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:32,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:16:32,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640444255] [2022-04-28 15:16:32,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:16:32,335 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:16:32,335 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:16:32,335 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:16:32,386 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:16:32,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:16:32,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:32,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:16:32,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:16:32,387 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:16:34,406 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:35,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:35,271 INFO L93 Difference]: Finished difference Result 273 states and 407 transitions. [2022-04-28 15:16:35,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:16:35,272 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:16:35,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:16:35,272 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:16:35,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 407 transitions. [2022-04-28 15:16:35,274 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:16:35,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 407 transitions. [2022-04-28 15:16:35,276 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 407 transitions. [2022-04-28 15:16:35,577 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:16:35,578 INFO L225 Difference]: With dead ends: 273 [2022-04-28 15:16:35,579 INFO L226 Difference]: Without dead ends: 151 [2022-04-28 15:16:35,579 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:35,579 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 11 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:16:35,580 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.3s Time] [2022-04-28 15:16:35,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-04-28 15:16:35,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 148. [2022-04-28 15:16:35,583 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:16:35,583 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:16:35,583 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:16:35,584 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:16:35,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:35,585 INFO L93 Difference]: Finished difference Result 151 states and 220 transitions. [2022-04-28 15:16:35,585 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 220 transitions. [2022-04-28 15:16:35,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:35,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:35,586 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:16:35,586 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:16:35,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:35,588 INFO L93 Difference]: Finished difference Result 151 states and 220 transitions. [2022-04-28 15:16:35,588 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 220 transitions. [2022-04-28 15:16:35,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:35,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:35,588 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:16:35,588 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:16:35,589 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:16:35,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 216 transitions. [2022-04-28 15:16:35,591 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 216 transitions. Word has length 69 [2022-04-28 15:16:35,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:16:35,591 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 216 transitions. [2022-04-28 15:16:35,591 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:16:35,591 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 148 states and 216 transitions. [2022-04-28 15:16:35,746 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:16:35,747 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 216 transitions. [2022-04-28 15:16:35,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-28 15:16:35,747 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:16:35,747 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:16:35,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-28 15:16:35,748 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:16:35,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:16:35,748 INFO L85 PathProgramCache]: Analyzing trace with hash 890818627, now seen corresponding path program 1 times [2022-04-28 15:16:35,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:35,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2120915147] [2022-04-28 15:16:35,764 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:16:35,764 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:16:35,765 INFO L85 PathProgramCache]: Analyzing trace with hash 890818627, now seen corresponding path program 2 times [2022-04-28 15:16:35,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:16:35,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934340912] [2022-04-28 15:16:35,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:16:35,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:16:35,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:35,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:16:35,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:35,886 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(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$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:16:35,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {11014#true} assume true; {11014#true} is VALID [2022-04-28 15:16:35,886 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11014#true} {11014#true} #661#return; {11014#true} is VALID [2022-04-28 15:16:35,887 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:16:35,887 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(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$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:16:35,887 INFO L290 TraceCheckUtils]: 2: Hoare triple {11014#true} assume true; {11014#true} is VALID [2022-04-28 15:16:35,887 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11014#true} {11014#true} #661#return; {11014#true} is VALID [2022-04-28 15:16:35,887 INFO L272 TraceCheckUtils]: 4: Hoare triple {11014#true} call #t~ret161 := main(); {11014#true} is VALID [2022-04-28 15:16:35,887 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:16:35,887 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:16:35,887 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:16:35,887 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:16:35,888 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:16:35,888 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:16:35,888 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:16:35,888 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:16:35,888 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:16:35,888 INFO L290 TraceCheckUtils]: 14: Hoare triple {11014#true} assume !false; {11014#true} is VALID [2022-04-28 15:16:35,888 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:16:35,888 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:16:35,888 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:16:35,888 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:16:35,888 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:16:35,888 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:16:35,888 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:16:35,888 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:16:35,889 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:16:35,889 INFO L290 TraceCheckUtils]: 24: Hoare triple {11014#true} assume 8464 == #t~mem55;havoc #t~mem55; {11014#true} is VALID [2022-04-28 15:16:35,889 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:16:35,889 INFO L290 TraceCheckUtils]: 26: Hoare triple {11014#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {11014#true} is VALID [2022-04-28 15:16:35,890 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:16:35,890 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:16:35,891 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:16:35,891 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:16:35,891 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:16:35,892 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:16:35,892 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:16:35,892 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:16:35,893 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:16:35,893 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:16:35,893 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:16:35,894 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:16:35,894 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:16:35,894 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:16:35,895 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:16:35,895 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:16:35,895 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:16:35,896 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:16:35,896 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:16:35,897 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:16:35,897 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:16:35,897 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:16:35,898 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:16:35,898 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:16:35,898 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:16:35,899 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:16:35,899 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:16:35,899 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:16:35,900 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:16:35,900 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:16:35,900 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:16:35,901 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:16:35,901 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:16:35,901 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:16:35,902 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:16:35,902 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:16:35,903 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:16:35,903 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:16:35,903 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:16:35,903 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:16:35,903 INFO L290 TraceCheckUtils]: 67: Hoare triple {11015#false} assume 3 == ~blastFlag~0; {11015#false} is VALID [2022-04-28 15:16:35,903 INFO L290 TraceCheckUtils]: 68: Hoare triple {11015#false} assume !false; {11015#false} is VALID [2022-04-28 15:16:35,904 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:16:35,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:16:35,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934340912] [2022-04-28 15:16:35,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934340912] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:35,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:35,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:16:35,904 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:16:35,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2120915147] [2022-04-28 15:16:35,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2120915147] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:35,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:35,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:16:35,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561535399] [2022-04-28 15:16:35,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:16:35,905 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:16:35,905 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:16:35,905 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:16:35,958 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:16:35,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:16:35,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:35,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:16:35,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:16:35,959 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:16:37,979 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:39,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:39,135 INFO L93 Difference]: Finished difference Result 384 states and 578 transitions. [2022-04-28 15:16:39,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:16:39,136 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:16:39,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:16:39,136 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:16:39,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 567 transitions. [2022-04-28 15:16:39,141 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:16:39,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 567 transitions. [2022-04-28 15:16:39,146 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 567 transitions. [2022-04-28 15:16:39,552 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:16:39,556 INFO L225 Difference]: With dead ends: 384 [2022-04-28 15:16:39,556 INFO L226 Difference]: Without dead ends: 262 [2022-04-28 15:16:39,557 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:16:39,557 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:16:39,557 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:16:39,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-04-28 15:16:39,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 191. [2022-04-28 15:16:39,562 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:16:39,562 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:16:39,563 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:16:39,565 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:16:39,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:39,600 INFO L93 Difference]: Finished difference Result 262 states and 391 transitions. [2022-04-28 15:16:39,600 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 391 transitions. [2022-04-28 15:16:39,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:39,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:39,602 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:16:39,602 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:16:39,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:39,607 INFO L93 Difference]: Finished difference Result 262 states and 391 transitions. [2022-04-28 15:16:39,607 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 391 transitions. [2022-04-28 15:16:39,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:39,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:39,607 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:16:39,607 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:16:39,608 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:16:39,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 296 transitions. [2022-04-28 15:16:39,610 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 296 transitions. Word has length 69 [2022-04-28 15:16:39,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:16:39,610 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 296 transitions. [2022-04-28 15:16:39,611 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:16:39,611 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 191 states and 296 transitions. [2022-04-28 15:16:39,804 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:16:39,804 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 296 transitions. [2022-04-28 15:16:39,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-04-28 15:16:39,805 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:16:39,805 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:16:39,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-28 15:16:39,805 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:16:39,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:16:39,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1838419001, now seen corresponding path program 1 times [2022-04-28 15:16:39,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:39,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1799195722] [2022-04-28 15:16:39,836 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:16:39,837 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:16:39,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1838419001, now seen corresponding path program 2 times [2022-04-28 15:16:39,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:16:39,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203008617] [2022-04-28 15:16:39,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:16:39,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:16:39,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:39,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:16:39,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:39,963 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(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$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:16:39,963 INFO L290 TraceCheckUtils]: 1: Hoare triple {12700#true} assume true; {12700#true} is VALID [2022-04-28 15:16:39,963 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12700#true} {12700#true} #661#return; {12700#true} is VALID [2022-04-28 15:16:39,963 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:16:39,964 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(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$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:16:39,964 INFO L290 TraceCheckUtils]: 2: Hoare triple {12700#true} assume true; {12700#true} is VALID [2022-04-28 15:16:39,964 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12700#true} {12700#true} #661#return; {12700#true} is VALID [2022-04-28 15:16:39,964 INFO L272 TraceCheckUtils]: 4: Hoare triple {12700#true} call #t~ret161 := main(); {12700#true} is VALID [2022-04-28 15:16:39,964 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:16:39,964 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:16:39,964 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:16:39,964 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:16:39,964 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:16:39,965 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:16:39,965 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:16:39,965 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:16:39,965 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:16:39,965 INFO L290 TraceCheckUtils]: 14: Hoare triple {12700#true} assume !false; {12700#true} is VALID [2022-04-28 15:16:39,965 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:16:39,965 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:16:39,965 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:16:39,965 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:16:39,965 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:16:39,976 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:16:39,977 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:16:39,977 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:16:39,977 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:16:39,977 INFO L290 TraceCheckUtils]: 24: Hoare triple {12700#true} assume 8464 == #t~mem55;havoc #t~mem55; {12700#true} is VALID [2022-04-28 15:16:39,977 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:16:39,977 INFO L290 TraceCheckUtils]: 26: Hoare triple {12700#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {12700#true} is VALID [2022-04-28 15:16:39,988 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:16:39,988 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:16:39,988 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:16:39,989 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:16:39,989 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:16:39,989 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:16:39,990 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:16:39,990 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:16:39,990 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:16:39,991 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:16:39,991 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:16:39,991 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:16:39,992 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:16:39,992 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:16:39,992 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:16:39,993 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:16:39,993 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:16:39,993 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:16:39,993 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:16:39,993 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:16:39,994 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:16:39,994 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:16:39,994 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:16:39,994 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:16:39,994 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:16:39,994 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:16:39,994 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:16:39,994 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:16:39,994 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:16:39,994 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:16:39,994 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:16:39,994 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:16:39,994 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:16:39,994 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:16:39,995 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:16:39,995 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:16:39,995 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:16:39,995 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:16:39,995 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:16:39,995 INFO L290 TraceCheckUtils]: 66: Hoare triple {12701#false} assume 8673 == #t~mem80;havoc #t~mem80; {12701#false} is VALID [2022-04-28 15:16:39,995 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:16:39,995 INFO L290 TraceCheckUtils]: 68: Hoare triple {12701#false} assume 3 == ~blastFlag~0; {12701#false} is VALID [2022-04-28 15:16:39,995 INFO L290 TraceCheckUtils]: 69: Hoare triple {12701#false} assume !false; {12701#false} is VALID [2022-04-28 15:16:39,996 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:16:39,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:16:39,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203008617] [2022-04-28 15:16:39,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203008617] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:39,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:39,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:16:39,996 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:16:39,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1799195722] [2022-04-28 15:16:39,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1799195722] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:39,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:39,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:16:39,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875612996] [2022-04-28 15:16:39,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:16:39,997 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:16:39,997 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:16:39,997 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:16:40,045 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:16:40,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:16:40,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:40,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:16:40,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:16:40,046 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:16:42,067 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:43,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:43,011 INFO L93 Difference]: Finished difference Result 400 states and 630 transitions. [2022-04-28 15:16:43,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:16:43,012 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:16:43,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:16:43,012 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:16:43,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 459 transitions. [2022-04-28 15:16:43,015 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:16:43,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 459 transitions. [2022-04-28 15:16:43,016 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 459 transitions. [2022-04-28 15:16:43,321 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 459 edges. 459 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:16:43,325 INFO L225 Difference]: With dead ends: 400 [2022-04-28 15:16:43,325 INFO L226 Difference]: Without dead ends: 235 [2022-04-28 15:16:43,325 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:16:43,326 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 36 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 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.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:16:43,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 473 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 384 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 15:16:43,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-04-28 15:16:43,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 213. [2022-04-28 15:16:43,332 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:16:43,332 INFO L82 GeneralOperation]: Start isEquivalent. First operand 235 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:16:43,333 INFO L74 IsIncluded]: Start isIncluded. First operand 235 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:16:43,333 INFO L87 Difference]: Start difference. First operand 235 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:16:43,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:43,336 INFO L93 Difference]: Finished difference Result 235 states and 363 transitions. [2022-04-28 15:16:43,336 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 363 transitions. [2022-04-28 15:16:43,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:43,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:43,337 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 235 states. [2022-04-28 15:16:43,337 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 235 states. [2022-04-28 15:16:43,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:43,341 INFO L93 Difference]: Finished difference Result 235 states and 363 transitions. [2022-04-28 15:16:43,341 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 363 transitions. [2022-04-28 15:16:43,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:43,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:43,341 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:16:43,341 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:16:43,342 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:16:43,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 334 transitions. [2022-04-28 15:16:43,345 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 334 transitions. Word has length 70 [2022-04-28 15:16:43,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:16:43,345 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 334 transitions. [2022-04-28 15:16:43,345 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:16:43,345 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 213 states and 334 transitions. [2022-04-28 15:16:43,574 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:16:43,574 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 334 transitions. [2022-04-28 15:16:43,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-04-28 15:16:43,575 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:16:43,575 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:16:43,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-28 15:16:43,575 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:16:43,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:16:43,575 INFO L85 PathProgramCache]: Analyzing trace with hash 2025171509, now seen corresponding path program 1 times [2022-04-28 15:16:43,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:43,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [528457287] [2022-04-28 15:16:43,615 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:16:43,616 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:16:43,616 INFO L85 PathProgramCache]: Analyzing trace with hash 2025171509, now seen corresponding path program 2 times [2022-04-28 15:16:43,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:16:43,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283164801] [2022-04-28 15:16:43,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:16:43,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:16:43,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:43,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:16:43,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:43,734 INFO L290 TraceCheckUtils]: 0: Hoare triple {14415#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {14408#true} is VALID [2022-04-28 15:16:43,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {14408#true} assume true; {14408#true} is VALID [2022-04-28 15:16:43,734 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14408#true} {14408#true} #661#return; {14408#true} is VALID [2022-04-28 15:16:43,735 INFO L272 TraceCheckUtils]: 0: Hoare triple {14408#true} call ULTIMATE.init(); {14415#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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:43,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {14415#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {14408#true} is VALID [2022-04-28 15:16:43,735 INFO L290 TraceCheckUtils]: 2: Hoare triple {14408#true} assume true; {14408#true} is VALID [2022-04-28 15:16:43,735 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14408#true} {14408#true} #661#return; {14408#true} is VALID [2022-04-28 15:16:43,736 INFO L272 TraceCheckUtils]: 4: Hoare triple {14408#true} call #t~ret161 := main(); {14408#true} is VALID [2022-04-28 15:16:43,736 INFO L290 TraceCheckUtils]: 5: Hoare triple {14408#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; {14408#true} is VALID [2022-04-28 15:16:43,736 INFO L290 TraceCheckUtils]: 6: Hoare triple {14408#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {14408#true} is VALID [2022-04-28 15:16:43,736 INFO L272 TraceCheckUtils]: 7: Hoare triple {14408#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {14408#true} is VALID [2022-04-28 15:16:43,736 INFO L290 TraceCheckUtils]: 8: Hoare triple {14408#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); {14408#true} is VALID [2022-04-28 15:16:43,736 INFO L290 TraceCheckUtils]: 9: Hoare triple {14408#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; {14408#true} is VALID [2022-04-28 15:16:43,736 INFO L290 TraceCheckUtils]: 10: Hoare triple {14408#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; {14408#true} is VALID [2022-04-28 15:16:43,736 INFO L290 TraceCheckUtils]: 11: Hoare triple {14408#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {14408#true} is VALID [2022-04-28 15:16:43,736 INFO L290 TraceCheckUtils]: 12: Hoare triple {14408#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {14408#true} is VALID [2022-04-28 15:16:43,736 INFO L290 TraceCheckUtils]: 13: Hoare triple {14408#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {14408#true} is VALID [2022-04-28 15:16:43,736 INFO L290 TraceCheckUtils]: 14: Hoare triple {14408#true} assume !false; {14408#true} is VALID [2022-04-28 15:16:43,736 INFO L290 TraceCheckUtils]: 15: Hoare triple {14408#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); {14408#true} is VALID [2022-04-28 15:16:43,736 INFO L290 TraceCheckUtils]: 16: Hoare triple {14408#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {14408#true} is VALID [2022-04-28 15:16:43,737 INFO L290 TraceCheckUtils]: 17: Hoare triple {14408#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {14408#true} is VALID [2022-04-28 15:16:43,737 INFO L290 TraceCheckUtils]: 18: Hoare triple {14408#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {14408#true} is VALID [2022-04-28 15:16:43,737 INFO L290 TraceCheckUtils]: 19: Hoare triple {14408#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {14408#true} is VALID [2022-04-28 15:16:43,737 INFO L290 TraceCheckUtils]: 20: Hoare triple {14408#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {14408#true} is VALID [2022-04-28 15:16:43,737 INFO L290 TraceCheckUtils]: 21: Hoare triple {14408#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {14408#true} is VALID [2022-04-28 15:16:43,737 INFO L290 TraceCheckUtils]: 22: Hoare triple {14408#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {14408#true} is VALID [2022-04-28 15:16:43,737 INFO L290 TraceCheckUtils]: 23: Hoare triple {14408#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {14408#true} is VALID [2022-04-28 15:16:43,737 INFO L290 TraceCheckUtils]: 24: Hoare triple {14408#true} assume 8464 == #t~mem55;havoc #t~mem55; {14408#true} is VALID [2022-04-28 15:16:43,737 INFO L290 TraceCheckUtils]: 25: Hoare triple {14408#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; {14408#true} is VALID [2022-04-28 15:16:43,737 INFO L290 TraceCheckUtils]: 26: Hoare triple {14408#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {14408#true} is VALID [2022-04-28 15:16:43,738 INFO L290 TraceCheckUtils]: 27: Hoare triple {14408#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); {14413#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:43,738 INFO L290 TraceCheckUtils]: 28: Hoare triple {14413#(= 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); {14413#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:43,739 INFO L290 TraceCheckUtils]: 29: Hoare triple {14413#(= 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; {14413#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:43,739 INFO L290 TraceCheckUtils]: 30: Hoare triple {14413#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {14413#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:43,739 INFO L290 TraceCheckUtils]: 31: Hoare triple {14413#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {14413#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:43,740 INFO L290 TraceCheckUtils]: 32: Hoare triple {14413#(= 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); {14413#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:43,740 INFO L290 TraceCheckUtils]: 33: Hoare triple {14413#(= 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); {14413#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:43,740 INFO L290 TraceCheckUtils]: 34: Hoare triple {14413#(= 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); {14413#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:43,741 INFO L290 TraceCheckUtils]: 35: Hoare triple {14413#(= 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); {14413#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:43,741 INFO L290 TraceCheckUtils]: 36: Hoare triple {14413#(= 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); {14413#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:43,742 INFO L290 TraceCheckUtils]: 37: Hoare triple {14413#(= 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); {14414#(= |ssl3_accept_#t~mem52| 8496)} is VALID [2022-04-28 15:16:43,742 INFO L290 TraceCheckUtils]: 38: Hoare triple {14414#(= |ssl3_accept_#t~mem52| 8496)} assume 8480 == #t~mem52;havoc #t~mem52; {14409#false} is VALID [2022-04-28 15:16:43,742 INFO L290 TraceCheckUtils]: 39: Hoare triple {14409#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; {14409#false} is VALID [2022-04-28 15:16:43,742 INFO L290 TraceCheckUtils]: 40: Hoare triple {14409#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); {14409#false} is VALID [2022-04-28 15:16:43,742 INFO L290 TraceCheckUtils]: 41: Hoare triple {14409#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); {14409#false} is VALID [2022-04-28 15:16:43,742 INFO L290 TraceCheckUtils]: 42: Hoare triple {14409#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {14409#false} is VALID [2022-04-28 15:16:43,742 INFO L290 TraceCheckUtils]: 43: Hoare triple {14409#false} ~skip~0 := 0; {14409#false} is VALID [2022-04-28 15:16:43,742 INFO L290 TraceCheckUtils]: 44: Hoare triple {14409#false} assume !false; {14409#false} is VALID [2022-04-28 15:16:43,742 INFO L290 TraceCheckUtils]: 45: Hoare triple {14409#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); {14409#false} is VALID [2022-04-28 15:16:43,742 INFO L290 TraceCheckUtils]: 46: Hoare triple {14409#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {14409#false} is VALID [2022-04-28 15:16:43,742 INFO L290 TraceCheckUtils]: 47: Hoare triple {14409#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {14409#false} is VALID [2022-04-28 15:16:43,743 INFO L290 TraceCheckUtils]: 48: Hoare triple {14409#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {14409#false} is VALID [2022-04-28 15:16:43,743 INFO L290 TraceCheckUtils]: 49: Hoare triple {14409#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {14409#false} is VALID [2022-04-28 15:16:43,743 INFO L290 TraceCheckUtils]: 50: Hoare triple {14409#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {14409#false} is VALID [2022-04-28 15:16:43,743 INFO L290 TraceCheckUtils]: 51: Hoare triple {14409#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {14409#false} is VALID [2022-04-28 15:16:43,743 INFO L290 TraceCheckUtils]: 52: Hoare triple {14409#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {14409#false} is VALID [2022-04-28 15:16:43,749 INFO L290 TraceCheckUtils]: 53: Hoare triple {14409#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {14409#false} is VALID [2022-04-28 15:16:43,750 INFO L290 TraceCheckUtils]: 54: Hoare triple {14409#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {14409#false} is VALID [2022-04-28 15:16:43,750 INFO L290 TraceCheckUtils]: 55: Hoare triple {14409#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {14409#false} is VALID [2022-04-28 15:16:43,750 INFO L290 TraceCheckUtils]: 56: Hoare triple {14409#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {14409#false} is VALID [2022-04-28 15:16:43,750 INFO L290 TraceCheckUtils]: 57: Hoare triple {14409#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {14409#false} is VALID [2022-04-28 15:16:43,750 INFO L290 TraceCheckUtils]: 58: Hoare triple {14409#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {14409#false} is VALID [2022-04-28 15:16:43,750 INFO L290 TraceCheckUtils]: 59: Hoare triple {14409#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {14409#false} is VALID [2022-04-28 15:16:43,750 INFO L290 TraceCheckUtils]: 60: Hoare triple {14409#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {14409#false} is VALID [2022-04-28 15:16:43,750 INFO L290 TraceCheckUtils]: 61: Hoare triple {14409#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {14409#false} is VALID [2022-04-28 15:16:43,751 INFO L290 TraceCheckUtils]: 62: Hoare triple {14409#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {14409#false} is VALID [2022-04-28 15:16:43,751 INFO L290 TraceCheckUtils]: 63: Hoare triple {14409#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {14409#false} is VALID [2022-04-28 15:16:43,751 INFO L290 TraceCheckUtils]: 64: Hoare triple {14409#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {14409#false} is VALID [2022-04-28 15:16:43,751 INFO L290 TraceCheckUtils]: 65: Hoare triple {14409#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {14409#false} is VALID [2022-04-28 15:16:43,751 INFO L290 TraceCheckUtils]: 66: Hoare triple {14409#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {14409#false} is VALID [2022-04-28 15:16:43,751 INFO L290 TraceCheckUtils]: 67: Hoare triple {14409#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {14409#false} is VALID [2022-04-28 15:16:43,751 INFO L290 TraceCheckUtils]: 68: Hoare triple {14409#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {14409#false} is VALID [2022-04-28 15:16:43,751 INFO L290 TraceCheckUtils]: 69: Hoare triple {14409#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {14409#false} is VALID [2022-04-28 15:16:43,751 INFO L290 TraceCheckUtils]: 70: Hoare triple {14409#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {14409#false} is VALID [2022-04-28 15:16:43,751 INFO L290 TraceCheckUtils]: 71: Hoare triple {14409#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {14409#false} is VALID [2022-04-28 15:16:43,752 INFO L290 TraceCheckUtils]: 72: Hoare triple {14409#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {14409#false} is VALID [2022-04-28 15:16:43,752 INFO L290 TraceCheckUtils]: 73: Hoare triple {14409#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {14409#false} is VALID [2022-04-28 15:16:43,752 INFO L290 TraceCheckUtils]: 74: Hoare triple {14409#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {14409#false} is VALID [2022-04-28 15:16:43,752 INFO L290 TraceCheckUtils]: 75: Hoare triple {14409#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {14409#false} is VALID [2022-04-28 15:16:43,752 INFO L290 TraceCheckUtils]: 76: Hoare triple {14409#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {14409#false} is VALID [2022-04-28 15:16:43,752 INFO L290 TraceCheckUtils]: 77: Hoare triple {14409#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {14409#false} is VALID [2022-04-28 15:16:43,752 INFO L290 TraceCheckUtils]: 78: Hoare triple {14409#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 72 + ~s.offset, 4); {14409#false} is VALID [2022-04-28 15:16:43,752 INFO L290 TraceCheckUtils]: 79: Hoare triple {14409#false} assume 8673 == #t~mem80;havoc #t~mem80; {14409#false} is VALID [2022-04-28 15:16:43,752 INFO L290 TraceCheckUtils]: 80: Hoare triple {14409#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {14409#false} is VALID [2022-04-28 15:16:43,752 INFO L290 TraceCheckUtils]: 81: Hoare triple {14409#false} assume 3 == ~blastFlag~0; {14409#false} is VALID [2022-04-28 15:16:43,753 INFO L290 TraceCheckUtils]: 82: Hoare triple {14409#false} assume !false; {14409#false} is VALID [2022-04-28 15:16:43,753 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:16:43,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:16:43,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283164801] [2022-04-28 15:16:43,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283164801] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:43,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:43,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:16:43,754 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:16:43,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [528457287] [2022-04-28 15:16:43,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [528457287] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:43,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:43,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:16:43,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945032366] [2022-04-28 15:16:43,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:16:43,755 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:16:43,755 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:16:43,755 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:16:43,835 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:16:43,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:16:43,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:43,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:16:43,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:16:43,836 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:16:45,856 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:16:46,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:46,794 INFO L93 Difference]: Finished difference Result 422 states and 667 transitions. [2022-04-28 15:16:46,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:16:46,795 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:16:46,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:16:46,795 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:16:46,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 458 transitions. [2022-04-28 15:16:46,797 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:16:46,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 458 transitions. [2022-04-28 15:16:46,799 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 458 transitions. [2022-04-28 15:16:47,093 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 458 edges. 458 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:16:47,096 INFO L225 Difference]: With dead ends: 422 [2022-04-28 15:16:47,096 INFO L226 Difference]: Without dead ends: 235 [2022-04-28 15:16:47,097 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:16:47,097 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 41 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 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.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:16:47,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 473 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 383 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 15:16:47,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-04-28 15:16:47,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 213. [2022-04-28 15:16:47,104 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:16:47,105 INFO L82 GeneralOperation]: Start isEquivalent. First operand 235 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:16:47,105 INFO L74 IsIncluded]: Start isIncluded. First operand 235 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:16:47,105 INFO L87 Difference]: Start difference. First operand 235 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:16:47,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:47,108 INFO L93 Difference]: Finished difference Result 235 states and 362 transitions. [2022-04-28 15:16:47,108 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 362 transitions. [2022-04-28 15:16:47,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:47,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:47,109 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 235 states. [2022-04-28 15:16:47,110 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 235 states. [2022-04-28 15:16:47,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:47,113 INFO L93 Difference]: Finished difference Result 235 states and 362 transitions. [2022-04-28 15:16:47,113 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 362 transitions. [2022-04-28 15:16:47,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:47,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:47,114 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:16:47,114 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:16:47,114 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:16:47,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 333 transitions. [2022-04-28 15:16:47,130 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 333 transitions. Word has length 83 [2022-04-28 15:16:47,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:16:47,130 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 333 transitions. [2022-04-28 15:16:47,130 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:16:47,130 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 213 states and 333 transitions. [2022-04-28 15:16:47,349 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:16:47,349 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 333 transitions. [2022-04-28 15:16:47,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-28 15:16:47,349 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:16:47,349 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:16:47,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-28 15:16:47,350 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:16:47,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:16:47,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1454749477, now seen corresponding path program 1 times [2022-04-28 15:16:47,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:47,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1999578554] [2022-04-28 15:16:47,384 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:16:47,385 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:16:47,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1454749477, now seen corresponding path program 2 times [2022-04-28 15:16:47,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:16:47,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185765576] [2022-04-28 15:16:47,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:16:47,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:16:47,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:47,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:16:47,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:47,496 INFO L290 TraceCheckUtils]: 0: Hoare triple {16167#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {16160#true} is VALID [2022-04-28 15:16:47,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {16160#true} assume true; {16160#true} is VALID [2022-04-28 15:16:47,496 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16160#true} {16160#true} #661#return; {16160#true} is VALID [2022-04-28 15:16:47,497 INFO L272 TraceCheckUtils]: 0: Hoare triple {16160#true} call ULTIMATE.init(); {16167#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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:47,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {16167#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {16160#true} is VALID [2022-04-28 15:16:47,497 INFO L290 TraceCheckUtils]: 2: Hoare triple {16160#true} assume true; {16160#true} is VALID [2022-04-28 15:16:47,497 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16160#true} {16160#true} #661#return; {16160#true} is VALID [2022-04-28 15:16:47,497 INFO L272 TraceCheckUtils]: 4: Hoare triple {16160#true} call #t~ret161 := main(); {16160#true} is VALID [2022-04-28 15:16:47,498 INFO L290 TraceCheckUtils]: 5: Hoare triple {16160#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; {16160#true} is VALID [2022-04-28 15:16:47,498 INFO L290 TraceCheckUtils]: 6: Hoare triple {16160#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {16160#true} is VALID [2022-04-28 15:16:47,498 INFO L272 TraceCheckUtils]: 7: Hoare triple {16160#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {16160#true} is VALID [2022-04-28 15:16:47,498 INFO L290 TraceCheckUtils]: 8: Hoare triple {16160#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); {16160#true} is VALID [2022-04-28 15:16:47,498 INFO L290 TraceCheckUtils]: 9: Hoare triple {16160#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; {16160#true} is VALID [2022-04-28 15:16:47,498 INFO L290 TraceCheckUtils]: 10: Hoare triple {16160#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; {16160#true} is VALID [2022-04-28 15:16:47,498 INFO L290 TraceCheckUtils]: 11: Hoare triple {16160#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {16160#true} is VALID [2022-04-28 15:16:47,498 INFO L290 TraceCheckUtils]: 12: Hoare triple {16160#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {16160#true} is VALID [2022-04-28 15:16:47,498 INFO L290 TraceCheckUtils]: 13: Hoare triple {16160#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {16160#true} is VALID [2022-04-28 15:16:47,498 INFO L290 TraceCheckUtils]: 14: Hoare triple {16160#true} assume !false; {16160#true} is VALID [2022-04-28 15:16:47,498 INFO L290 TraceCheckUtils]: 15: Hoare triple {16160#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); {16160#true} is VALID [2022-04-28 15:16:47,499 INFO L290 TraceCheckUtils]: 16: Hoare triple {16160#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {16160#true} is VALID [2022-04-28 15:16:47,499 INFO L290 TraceCheckUtils]: 17: Hoare triple {16160#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {16160#true} is VALID [2022-04-28 15:16:47,499 INFO L290 TraceCheckUtils]: 18: Hoare triple {16160#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {16160#true} is VALID [2022-04-28 15:16:47,499 INFO L290 TraceCheckUtils]: 19: Hoare triple {16160#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {16160#true} is VALID [2022-04-28 15:16:47,499 INFO L290 TraceCheckUtils]: 20: Hoare triple {16160#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {16160#true} is VALID [2022-04-28 15:16:47,499 INFO L290 TraceCheckUtils]: 21: Hoare triple {16160#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {16160#true} is VALID [2022-04-28 15:16:47,499 INFO L290 TraceCheckUtils]: 22: Hoare triple {16160#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {16160#true} is VALID [2022-04-28 15:16:47,499 INFO L290 TraceCheckUtils]: 23: Hoare triple {16160#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {16160#true} is VALID [2022-04-28 15:16:47,499 INFO L290 TraceCheckUtils]: 24: Hoare triple {16160#true} assume 8464 == #t~mem55;havoc #t~mem55; {16160#true} is VALID [2022-04-28 15:16:47,499 INFO L290 TraceCheckUtils]: 25: Hoare triple {16160#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; {16160#true} is VALID [2022-04-28 15:16:47,499 INFO L290 TraceCheckUtils]: 26: Hoare triple {16160#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {16160#true} is VALID [2022-04-28 15:16:47,500 INFO L290 TraceCheckUtils]: 27: Hoare triple {16160#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); {16160#true} is VALID [2022-04-28 15:16:47,500 INFO L290 TraceCheckUtils]: 28: Hoare triple {16160#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); {16160#true} is VALID [2022-04-28 15:16:47,500 INFO L290 TraceCheckUtils]: 29: Hoare triple {16160#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {16160#true} is VALID [2022-04-28 15:16:47,500 INFO L290 TraceCheckUtils]: 30: Hoare triple {16160#true} ~skip~0 := 0; {16160#true} is VALID [2022-04-28 15:16:47,500 INFO L290 TraceCheckUtils]: 31: Hoare triple {16160#true} assume !false; {16160#true} is VALID [2022-04-28 15:16:47,500 INFO L290 TraceCheckUtils]: 32: Hoare triple {16160#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); {16160#true} is VALID [2022-04-28 15:16:47,500 INFO L290 TraceCheckUtils]: 33: Hoare triple {16160#true} assume 12292 == #t~mem47;havoc #t~mem47; {16160#true} is VALID [2022-04-28 15:16:47,500 INFO L290 TraceCheckUtils]: 34: Hoare triple {16160#true} call write~int(1, ~s.base, 60 + ~s.offset, 4); {16160#true} is VALID [2022-04-28 15:16:47,500 INFO L290 TraceCheckUtils]: 35: Hoare triple {16160#true} call write~int(1, ~s.base, 56 + ~s.offset, 4); {16160#true} is VALID [2022-04-28 15:16:47,500 INFO L290 TraceCheckUtils]: 36: Hoare triple {16160#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {16160#true} is VALID [2022-04-28 15:16:47,500 INFO L290 TraceCheckUtils]: 37: Hoare triple {16160#true} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {16160#true} is VALID [2022-04-28 15:16:47,501 INFO L290 TraceCheckUtils]: 38: Hoare triple {16160#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); {16160#true} is VALID [2022-04-28 15:16:47,501 INFO L290 TraceCheckUtils]: 39: Hoare triple {16160#true} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {16160#true} is VALID [2022-04-28 15:16:47,501 INFO L290 TraceCheckUtils]: 40: Hoare triple {16160#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); {16160#true} is VALID [2022-04-28 15:16:47,502 INFO L290 TraceCheckUtils]: 41: Hoare triple {16160#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); {16165#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:16:47,503 INFO L290 TraceCheckUtils]: 42: Hoare triple {16165#(= (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); {16165#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:16:47,503 INFO L290 TraceCheckUtils]: 43: Hoare triple {16165#(= (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; {16165#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:16:47,503 INFO L290 TraceCheckUtils]: 44: Hoare triple {16165#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} ~skip~0 := 0; {16165#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:16:47,504 INFO L290 TraceCheckUtils]: 45: Hoare triple {16165#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} assume !false; {16165#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:16:47,504 INFO L290 TraceCheckUtils]: 46: Hoare triple {16165#(= (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); {16165#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:16:47,505 INFO L290 TraceCheckUtils]: 47: Hoare triple {16165#(= (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); {16165#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:16:47,505 INFO L290 TraceCheckUtils]: 48: Hoare triple {16165#(= (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); {16165#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:16:47,505 INFO L290 TraceCheckUtils]: 49: Hoare triple {16165#(= (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); {16165#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:16:47,506 INFO L290 TraceCheckUtils]: 50: Hoare triple {16165#(= (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); {16165#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:16:47,506 INFO L290 TraceCheckUtils]: 51: Hoare triple {16165#(= (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); {16166#(= |ssl3_accept_#t~mem52| 8480)} is VALID [2022-04-28 15:16:47,507 INFO L290 TraceCheckUtils]: 52: Hoare triple {16166#(= |ssl3_accept_#t~mem52| 8480)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {16161#false} is VALID [2022-04-28 15:16:47,507 INFO L290 TraceCheckUtils]: 53: Hoare triple {16161#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {16161#false} is VALID [2022-04-28 15:16:47,507 INFO L290 TraceCheckUtils]: 54: Hoare triple {16161#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {16161#false} is VALID [2022-04-28 15:16:47,507 INFO L290 TraceCheckUtils]: 55: Hoare triple {16161#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {16161#false} is VALID [2022-04-28 15:16:47,507 INFO L290 TraceCheckUtils]: 56: Hoare triple {16161#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {16161#false} is VALID [2022-04-28 15:16:47,507 INFO L290 TraceCheckUtils]: 57: Hoare triple {16161#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {16161#false} is VALID [2022-04-28 15:16:47,507 INFO L290 TraceCheckUtils]: 58: Hoare triple {16161#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {16161#false} is VALID [2022-04-28 15:16:47,507 INFO L290 TraceCheckUtils]: 59: Hoare triple {16161#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {16161#false} is VALID [2022-04-28 15:16:47,507 INFO L290 TraceCheckUtils]: 60: Hoare triple {16161#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {16161#false} is VALID [2022-04-28 15:16:47,508 INFO L290 TraceCheckUtils]: 61: Hoare triple {16161#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {16161#false} is VALID [2022-04-28 15:16:47,508 INFO L290 TraceCheckUtils]: 62: Hoare triple {16161#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {16161#false} is VALID [2022-04-28 15:16:47,508 INFO L290 TraceCheckUtils]: 63: Hoare triple {16161#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {16161#false} is VALID [2022-04-28 15:16:47,508 INFO L290 TraceCheckUtils]: 64: Hoare triple {16161#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {16161#false} is VALID [2022-04-28 15:16:47,508 INFO L290 TraceCheckUtils]: 65: Hoare triple {16161#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {16161#false} is VALID [2022-04-28 15:16:47,508 INFO L290 TraceCheckUtils]: 66: Hoare triple {16161#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {16161#false} is VALID [2022-04-28 15:16:47,508 INFO L290 TraceCheckUtils]: 67: Hoare triple {16161#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {16161#false} is VALID [2022-04-28 15:16:47,508 INFO L290 TraceCheckUtils]: 68: Hoare triple {16161#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {16161#false} is VALID [2022-04-28 15:16:47,508 INFO L290 TraceCheckUtils]: 69: Hoare triple {16161#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {16161#false} is VALID [2022-04-28 15:16:47,508 INFO L290 TraceCheckUtils]: 70: Hoare triple {16161#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {16161#false} is VALID [2022-04-28 15:16:47,508 INFO L290 TraceCheckUtils]: 71: Hoare triple {16161#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {16161#false} is VALID [2022-04-28 15:16:47,509 INFO L290 TraceCheckUtils]: 72: Hoare triple {16161#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {16161#false} is VALID [2022-04-28 15:16:47,509 INFO L290 TraceCheckUtils]: 73: Hoare triple {16161#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {16161#false} is VALID [2022-04-28 15:16:47,509 INFO L290 TraceCheckUtils]: 74: Hoare triple {16161#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {16161#false} is VALID [2022-04-28 15:16:47,509 INFO L290 TraceCheckUtils]: 75: Hoare triple {16161#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {16161#false} is VALID [2022-04-28 15:16:47,509 INFO L290 TraceCheckUtils]: 76: Hoare triple {16161#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {16161#false} is VALID [2022-04-28 15:16:47,509 INFO L290 TraceCheckUtils]: 77: Hoare triple {16161#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {16161#false} is VALID [2022-04-28 15:16:47,509 INFO L290 TraceCheckUtils]: 78: Hoare triple {16161#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {16161#false} is VALID [2022-04-28 15:16:47,509 INFO L290 TraceCheckUtils]: 79: Hoare triple {16161#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 72 + ~s.offset, 4); {16161#false} is VALID [2022-04-28 15:16:47,509 INFO L290 TraceCheckUtils]: 80: Hoare triple {16161#false} assume 8673 == #t~mem80;havoc #t~mem80; {16161#false} is VALID [2022-04-28 15:16:47,509 INFO L290 TraceCheckUtils]: 81: Hoare triple {16161#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {16161#false} is VALID [2022-04-28 15:16:47,510 INFO L290 TraceCheckUtils]: 82: Hoare triple {16161#false} assume 3 == ~blastFlag~0; {16161#false} is VALID [2022-04-28 15:16:47,510 INFO L290 TraceCheckUtils]: 83: Hoare triple {16161#false} assume !false; {16161#false} is VALID [2022-04-28 15:16:47,510 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:16:47,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:16:47,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185765576] [2022-04-28 15:16:47,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185765576] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:47,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:47,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:16:47,511 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:16:47,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1999578554] [2022-04-28 15:16:47,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1999578554] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:47,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:47,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:16:47,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698885768] [2022-04-28 15:16:47,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:16:47,512 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:16:47,512 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:16:47,512 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:16:47,578 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:16:47,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:16:47,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:47,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:16:47,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:16:47,579 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:16:49,598 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:50,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:50,603 INFO L93 Difference]: Finished difference Result 429 states and 679 transitions. [2022-04-28 15:16:50,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:16:50,603 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:16:50,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:16:50,603 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:16:50,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 434 transitions. [2022-04-28 15:16:50,605 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:16:50,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 434 transitions. [2022-04-28 15:16:50,607 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 434 transitions. [2022-04-28 15:16:50,883 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:16:50,886 INFO L225 Difference]: With dead ends: 429 [2022-04-28 15:16:50,886 INFO L226 Difference]: Without dead ends: 242 [2022-04-28 15:16:50,887 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:16:50,887 INFO L413 NwaCegarLoop]: 222 mSDtfsCounter, 22 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:16:50,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 548 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 388 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 15:16:50,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-04-28 15:16:50,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 229. [2022-04-28 15:16:50,893 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:16:50,893 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:16:50,894 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:16:50,894 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:16:50,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:50,898 INFO L93 Difference]: Finished difference Result 242 states and 375 transitions. [2022-04-28 15:16:50,898 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 375 transitions. [2022-04-28 15:16:50,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:50,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:50,898 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:16:50,899 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:16:50,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:50,902 INFO L93 Difference]: Finished difference Result 242 states and 375 transitions. [2022-04-28 15:16:50,902 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 375 transitions. [2022-04-28 15:16:50,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:50,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:50,902 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:16:50,902 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:16:50,903 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:16:50,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 359 transitions. [2022-04-28 15:16:50,906 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 359 transitions. Word has length 84 [2022-04-28 15:16:50,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:16:50,906 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 359 transitions. [2022-04-28 15:16:50,907 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:16:50,907 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 229 states and 359 transitions. [2022-04-28 15:16:51,144 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:16:51,144 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 359 transitions. [2022-04-28 15:16:51,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-28 15:16:51,145 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:16:51,145 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:16:51,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-28 15:16:51,145 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:16:51,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:16:51,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1354545936, now seen corresponding path program 1 times [2022-04-28 15:16:51,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:51,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1852922581] [2022-04-28 15:16:51,198 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:16:51,199 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:16:51,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1354545936, now seen corresponding path program 2 times [2022-04-28 15:16:51,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:16:51,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416649488] [2022-04-28 15:16:51,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:16:51,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:16:51,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:51,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:16:51,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:51,313 INFO L290 TraceCheckUtils]: 0: Hoare triple {17979#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {17972#true} is VALID [2022-04-28 15:16:51,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {17972#true} assume true; {17972#true} is VALID [2022-04-28 15:16:51,313 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17972#true} {17972#true} #661#return; {17972#true} is VALID [2022-04-28 15:16:51,314 INFO L272 TraceCheckUtils]: 0: Hoare triple {17972#true} call ULTIMATE.init(); {17979#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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:51,314 INFO L290 TraceCheckUtils]: 1: Hoare triple {17979#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {17972#true} is VALID [2022-04-28 15:16:51,314 INFO L290 TraceCheckUtils]: 2: Hoare triple {17972#true} assume true; {17972#true} is VALID [2022-04-28 15:16:51,314 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17972#true} {17972#true} #661#return; {17972#true} is VALID [2022-04-28 15:16:51,315 INFO L272 TraceCheckUtils]: 4: Hoare triple {17972#true} call #t~ret161 := main(); {17972#true} is VALID [2022-04-28 15:16:51,315 INFO L290 TraceCheckUtils]: 5: Hoare triple {17972#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; {17972#true} is VALID [2022-04-28 15:16:51,315 INFO L290 TraceCheckUtils]: 6: Hoare triple {17972#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {17972#true} is VALID [2022-04-28 15:16:51,315 INFO L272 TraceCheckUtils]: 7: Hoare triple {17972#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {17972#true} is VALID [2022-04-28 15:16:51,315 INFO L290 TraceCheckUtils]: 8: Hoare triple {17972#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); {17972#true} is VALID [2022-04-28 15:16:51,315 INFO L290 TraceCheckUtils]: 9: Hoare triple {17972#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; {17972#true} is VALID [2022-04-28 15:16:51,315 INFO L290 TraceCheckUtils]: 10: Hoare triple {17972#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; {17972#true} is VALID [2022-04-28 15:16:51,315 INFO L290 TraceCheckUtils]: 11: Hoare triple {17972#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {17972#true} is VALID [2022-04-28 15:16:51,315 INFO L290 TraceCheckUtils]: 12: Hoare triple {17972#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {17972#true} is VALID [2022-04-28 15:16:51,315 INFO L290 TraceCheckUtils]: 13: Hoare triple {17972#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {17972#true} is VALID [2022-04-28 15:16:51,315 INFO L290 TraceCheckUtils]: 14: Hoare triple {17972#true} assume !false; {17972#true} is VALID [2022-04-28 15:16:51,315 INFO L290 TraceCheckUtils]: 15: Hoare triple {17972#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); {17972#true} is VALID [2022-04-28 15:16:51,315 INFO L290 TraceCheckUtils]: 16: Hoare triple {17972#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {17972#true} is VALID [2022-04-28 15:16:51,315 INFO L290 TraceCheckUtils]: 17: Hoare triple {17972#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {17972#true} is VALID [2022-04-28 15:16:51,316 INFO L290 TraceCheckUtils]: 18: Hoare triple {17972#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {17972#true} is VALID [2022-04-28 15:16:51,316 INFO L290 TraceCheckUtils]: 19: Hoare triple {17972#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {17972#true} is VALID [2022-04-28 15:16:51,316 INFO L290 TraceCheckUtils]: 20: Hoare triple {17972#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {17972#true} is VALID [2022-04-28 15:16:51,316 INFO L290 TraceCheckUtils]: 21: Hoare triple {17972#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {17972#true} is VALID [2022-04-28 15:16:51,316 INFO L290 TraceCheckUtils]: 22: Hoare triple {17972#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {17972#true} is VALID [2022-04-28 15:16:51,316 INFO L290 TraceCheckUtils]: 23: Hoare triple {17972#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {17972#true} is VALID [2022-04-28 15:16:51,316 INFO L290 TraceCheckUtils]: 24: Hoare triple {17972#true} assume 8464 == #t~mem55;havoc #t~mem55; {17972#true} is VALID [2022-04-28 15:16:51,316 INFO L290 TraceCheckUtils]: 25: Hoare triple {17972#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; {17972#true} is VALID [2022-04-28 15:16:51,316 INFO L290 TraceCheckUtils]: 26: Hoare triple {17972#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {17972#true} is VALID [2022-04-28 15:16:51,317 INFO L290 TraceCheckUtils]: 27: Hoare triple {17972#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); {17977#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:51,317 INFO L290 TraceCheckUtils]: 28: Hoare triple {17977#(= 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); {17977#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:51,318 INFO L290 TraceCheckUtils]: 29: Hoare triple {17977#(= 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; {17977#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:51,318 INFO L290 TraceCheckUtils]: 30: Hoare triple {17977#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {17977#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:51,318 INFO L290 TraceCheckUtils]: 31: Hoare triple {17977#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {17977#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:51,319 INFO L290 TraceCheckUtils]: 32: Hoare triple {17977#(= 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); {17977#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:51,319 INFO L290 TraceCheckUtils]: 33: Hoare triple {17977#(= 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); {17977#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:51,319 INFO L290 TraceCheckUtils]: 34: Hoare triple {17977#(= 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); {17977#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:51,320 INFO L290 TraceCheckUtils]: 35: Hoare triple {17977#(= 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); {17977#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:51,320 INFO L290 TraceCheckUtils]: 36: Hoare triple {17977#(= 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); {17977#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:51,320 INFO L290 TraceCheckUtils]: 37: Hoare triple {17977#(= 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); {17977#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:51,321 INFO L290 TraceCheckUtils]: 38: Hoare triple {17977#(= 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); {17978#(= |ssl3_accept_#t~mem53| 8496)} is VALID [2022-04-28 15:16:51,321 INFO L290 TraceCheckUtils]: 39: Hoare triple {17978#(= |ssl3_accept_#t~mem53| 8496)} assume 8481 == #t~mem53;havoc #t~mem53; {17973#false} is VALID [2022-04-28 15:16:51,321 INFO L290 TraceCheckUtils]: 40: Hoare triple {17973#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; {17973#false} is VALID [2022-04-28 15:16:51,321 INFO L290 TraceCheckUtils]: 41: Hoare triple {17973#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); {17973#false} is VALID [2022-04-28 15:16:51,321 INFO L290 TraceCheckUtils]: 42: Hoare triple {17973#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); {17973#false} is VALID [2022-04-28 15:16:51,321 INFO L290 TraceCheckUtils]: 43: Hoare triple {17973#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {17973#false} is VALID [2022-04-28 15:16:51,322 INFO L290 TraceCheckUtils]: 44: Hoare triple {17973#false} ~skip~0 := 0; {17973#false} is VALID [2022-04-28 15:16:51,322 INFO L290 TraceCheckUtils]: 45: Hoare triple {17973#false} assume !false; {17973#false} is VALID [2022-04-28 15:16:51,322 INFO L290 TraceCheckUtils]: 46: Hoare triple {17973#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); {17973#false} is VALID [2022-04-28 15:16:51,322 INFO L290 TraceCheckUtils]: 47: Hoare triple {17973#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {17973#false} is VALID [2022-04-28 15:16:51,322 INFO L290 TraceCheckUtils]: 48: Hoare triple {17973#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {17973#false} is VALID [2022-04-28 15:16:51,322 INFO L290 TraceCheckUtils]: 49: Hoare triple {17973#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {17973#false} is VALID [2022-04-28 15:16:51,322 INFO L290 TraceCheckUtils]: 50: Hoare triple {17973#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {17973#false} is VALID [2022-04-28 15:16:51,322 INFO L290 TraceCheckUtils]: 51: Hoare triple {17973#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {17973#false} is VALID [2022-04-28 15:16:51,322 INFO L290 TraceCheckUtils]: 52: Hoare triple {17973#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {17973#false} is VALID [2022-04-28 15:16:51,322 INFO L290 TraceCheckUtils]: 53: Hoare triple {17973#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {17973#false} is VALID [2022-04-28 15:16:51,322 INFO L290 TraceCheckUtils]: 54: Hoare triple {17973#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {17973#false} is VALID [2022-04-28 15:16:51,322 INFO L290 TraceCheckUtils]: 55: Hoare triple {17973#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {17973#false} is VALID [2022-04-28 15:16:51,322 INFO L290 TraceCheckUtils]: 56: Hoare triple {17973#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {17973#false} is VALID [2022-04-28 15:16:51,322 INFO L290 TraceCheckUtils]: 57: Hoare triple {17973#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {17973#false} is VALID [2022-04-28 15:16:51,323 INFO L290 TraceCheckUtils]: 58: Hoare triple {17973#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {17973#false} is VALID [2022-04-28 15:16:51,323 INFO L290 TraceCheckUtils]: 59: Hoare triple {17973#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {17973#false} is VALID [2022-04-28 15:16:51,323 INFO L290 TraceCheckUtils]: 60: Hoare triple {17973#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {17973#false} is VALID [2022-04-28 15:16:51,323 INFO L290 TraceCheckUtils]: 61: Hoare triple {17973#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {17973#false} is VALID [2022-04-28 15:16:51,323 INFO L290 TraceCheckUtils]: 62: Hoare triple {17973#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {17973#false} is VALID [2022-04-28 15:16:51,323 INFO L290 TraceCheckUtils]: 63: Hoare triple {17973#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {17973#false} is VALID [2022-04-28 15:16:51,323 INFO L290 TraceCheckUtils]: 64: Hoare triple {17973#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {17973#false} is VALID [2022-04-28 15:16:51,323 INFO L290 TraceCheckUtils]: 65: Hoare triple {17973#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {17973#false} is VALID [2022-04-28 15:16:51,323 INFO L290 TraceCheckUtils]: 66: Hoare triple {17973#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {17973#false} is VALID [2022-04-28 15:16:51,323 INFO L290 TraceCheckUtils]: 67: Hoare triple {17973#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {17973#false} is VALID [2022-04-28 15:16:51,323 INFO L290 TraceCheckUtils]: 68: Hoare triple {17973#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {17973#false} is VALID [2022-04-28 15:16:51,323 INFO L290 TraceCheckUtils]: 69: Hoare triple {17973#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {17973#false} is VALID [2022-04-28 15:16:51,323 INFO L290 TraceCheckUtils]: 70: Hoare triple {17973#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {17973#false} is VALID [2022-04-28 15:16:51,324 INFO L290 TraceCheckUtils]: 71: Hoare triple {17973#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {17973#false} is VALID [2022-04-28 15:16:51,324 INFO L290 TraceCheckUtils]: 72: Hoare triple {17973#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {17973#false} is VALID [2022-04-28 15:16:51,324 INFO L290 TraceCheckUtils]: 73: Hoare triple {17973#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {17973#false} is VALID [2022-04-28 15:16:51,324 INFO L290 TraceCheckUtils]: 74: Hoare triple {17973#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {17973#false} is VALID [2022-04-28 15:16:51,324 INFO L290 TraceCheckUtils]: 75: Hoare triple {17973#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {17973#false} is VALID [2022-04-28 15:16:51,324 INFO L290 TraceCheckUtils]: 76: Hoare triple {17973#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {17973#false} is VALID [2022-04-28 15:16:51,324 INFO L290 TraceCheckUtils]: 77: Hoare triple {17973#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {17973#false} is VALID [2022-04-28 15:16:51,324 INFO L290 TraceCheckUtils]: 78: Hoare triple {17973#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {17973#false} is VALID [2022-04-28 15:16:51,324 INFO L290 TraceCheckUtils]: 79: Hoare triple {17973#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 72 + ~s.offset, 4); {17973#false} is VALID [2022-04-28 15:16:51,324 INFO L290 TraceCheckUtils]: 80: Hoare triple {17973#false} assume 8673 == #t~mem80;havoc #t~mem80; {17973#false} is VALID [2022-04-28 15:16:51,324 INFO L290 TraceCheckUtils]: 81: Hoare triple {17973#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {17973#false} is VALID [2022-04-28 15:16:51,324 INFO L290 TraceCheckUtils]: 82: Hoare triple {17973#false} assume 3 == ~blastFlag~0; {17973#false} is VALID [2022-04-28 15:16:51,324 INFO L290 TraceCheckUtils]: 83: Hoare triple {17973#false} assume !false; {17973#false} is VALID [2022-04-28 15:16:51,325 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:16:51,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:16:51,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416649488] [2022-04-28 15:16:51,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416649488] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:51,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:51,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:16:51,325 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:16:51,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1852922581] [2022-04-28 15:16:51,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1852922581] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:51,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:51,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:16:51,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061231884] [2022-04-28 15:16:51,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:16:51,326 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:16:51,326 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:16:51,326 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:16:51,384 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:16:51,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:16:51,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:51,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:16:51,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:16:51,385 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:16:53,405 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:54,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:54,386 INFO L93 Difference]: Finished difference Result 452 states and 715 transitions. [2022-04-28 15:16:54,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:16:54,387 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:16:54,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:16:54,387 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:16:54,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 455 transitions. [2022-04-28 15:16:54,389 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:16:54,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 455 transitions. [2022-04-28 15:16:54,391 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 455 transitions. [2022-04-28 15:16:54,725 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:16:54,729 INFO L225 Difference]: With dead ends: 452 [2022-04-28 15:16:54,729 INFO L226 Difference]: Without dead ends: 249 [2022-04-28 15:16:54,729 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:16:54,730 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 39 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 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.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:16:54,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 477 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 379 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 15:16:54,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-04-28 15:16:54,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 229. [2022-04-28 15:16:54,735 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:16:54,736 INFO L82 GeneralOperation]: Start isEquivalent. First operand 249 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:16:54,736 INFO L74 IsIncluded]: Start isIncluded. First operand 249 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:16:54,736 INFO L87 Difference]: Start difference. First operand 249 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:16:54,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:54,740 INFO L93 Difference]: Finished difference Result 249 states and 385 transitions. [2022-04-28 15:16:54,740 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 385 transitions. [2022-04-28 15:16:54,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:54,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:54,741 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 249 states. [2022-04-28 15:16:54,741 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 249 states. [2022-04-28 15:16:54,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:54,744 INFO L93 Difference]: Finished difference Result 249 states and 385 transitions. [2022-04-28 15:16:54,744 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 385 transitions. [2022-04-28 15:16:54,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:54,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:54,745 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:16:54,745 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:16:54,745 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:16:54,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 358 transitions. [2022-04-28 15:16:54,749 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 358 transitions. Word has length 84 [2022-04-28 15:16:54,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:16:54,749 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 358 transitions. [2022-04-28 15:16:54,750 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:16:54,750 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 229 states and 358 transitions. [2022-04-28 15:16:55,010 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:16:55,010 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 358 transitions. [2022-04-28 15:16:55,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-28 15:16:55,011 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:16:55,011 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:16:55,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-28 15:16:55,011 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:16:55,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:16:55,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1280749327, now seen corresponding path program 1 times [2022-04-28 15:16:55,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:55,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1274293559] [2022-04-28 15:16:55,039 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:16:55,039 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:16:55,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1280749327, now seen corresponding path program 2 times [2022-04-28 15:16:55,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:16:55,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395231164] [2022-04-28 15:16:55,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:16:55,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:16:55,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:55,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:16:55,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:55,150 INFO L290 TraceCheckUtils]: 0: Hoare triple {19851#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {19844#true} is VALID [2022-04-28 15:16:55,150 INFO L290 TraceCheckUtils]: 1: Hoare triple {19844#true} assume true; {19844#true} is VALID [2022-04-28 15:16:55,150 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19844#true} {19844#true} #661#return; {19844#true} is VALID [2022-04-28 15:16:55,151 INFO L272 TraceCheckUtils]: 0: Hoare triple {19844#true} call ULTIMATE.init(); {19851#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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:55,151 INFO L290 TraceCheckUtils]: 1: Hoare triple {19851#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {19844#true} is VALID [2022-04-28 15:16:55,151 INFO L290 TraceCheckUtils]: 2: Hoare triple {19844#true} assume true; {19844#true} is VALID [2022-04-28 15:16:55,151 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19844#true} {19844#true} #661#return; {19844#true} is VALID [2022-04-28 15:16:55,151 INFO L272 TraceCheckUtils]: 4: Hoare triple {19844#true} call #t~ret161 := main(); {19844#true} is VALID [2022-04-28 15:16:55,152 INFO L290 TraceCheckUtils]: 5: Hoare triple {19844#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; {19844#true} is VALID [2022-04-28 15:16:55,152 INFO L290 TraceCheckUtils]: 6: Hoare triple {19844#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {19844#true} is VALID [2022-04-28 15:16:55,152 INFO L272 TraceCheckUtils]: 7: Hoare triple {19844#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {19844#true} is VALID [2022-04-28 15:16:55,152 INFO L290 TraceCheckUtils]: 8: Hoare triple {19844#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); {19844#true} is VALID [2022-04-28 15:16:55,152 INFO L290 TraceCheckUtils]: 9: Hoare triple {19844#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; {19844#true} is VALID [2022-04-28 15:16:55,152 INFO L290 TraceCheckUtils]: 10: Hoare triple {19844#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; {19844#true} is VALID [2022-04-28 15:16:55,152 INFO L290 TraceCheckUtils]: 11: Hoare triple {19844#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {19844#true} is VALID [2022-04-28 15:16:55,152 INFO L290 TraceCheckUtils]: 12: Hoare triple {19844#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {19844#true} is VALID [2022-04-28 15:16:55,152 INFO L290 TraceCheckUtils]: 13: Hoare triple {19844#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {19844#true} is VALID [2022-04-28 15:16:55,152 INFO L290 TraceCheckUtils]: 14: Hoare triple {19844#true} assume !false; {19844#true} is VALID [2022-04-28 15:16:55,152 INFO L290 TraceCheckUtils]: 15: Hoare triple {19844#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); {19844#true} is VALID [2022-04-28 15:16:55,152 INFO L290 TraceCheckUtils]: 16: Hoare triple {19844#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {19844#true} is VALID [2022-04-28 15:16:55,152 INFO L290 TraceCheckUtils]: 17: Hoare triple {19844#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {19844#true} is VALID [2022-04-28 15:16:55,152 INFO L290 TraceCheckUtils]: 18: Hoare triple {19844#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {19844#true} is VALID [2022-04-28 15:16:55,153 INFO L290 TraceCheckUtils]: 19: Hoare triple {19844#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {19844#true} is VALID [2022-04-28 15:16:55,153 INFO L290 TraceCheckUtils]: 20: Hoare triple {19844#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {19844#true} is VALID [2022-04-28 15:16:55,153 INFO L290 TraceCheckUtils]: 21: Hoare triple {19844#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {19844#true} is VALID [2022-04-28 15:16:55,153 INFO L290 TraceCheckUtils]: 22: Hoare triple {19844#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {19844#true} is VALID [2022-04-28 15:16:55,153 INFO L290 TraceCheckUtils]: 23: Hoare triple {19844#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {19844#true} is VALID [2022-04-28 15:16:55,153 INFO L290 TraceCheckUtils]: 24: Hoare triple {19844#true} assume 8464 == #t~mem55;havoc #t~mem55; {19844#true} is VALID [2022-04-28 15:16:55,153 INFO L290 TraceCheckUtils]: 25: Hoare triple {19844#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; {19844#true} is VALID [2022-04-28 15:16:55,153 INFO L290 TraceCheckUtils]: 26: Hoare triple {19844#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {19844#true} is VALID [2022-04-28 15:16:55,154 INFO L290 TraceCheckUtils]: 27: Hoare triple {19844#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); {19849#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:55,154 INFO L290 TraceCheckUtils]: 28: Hoare triple {19849#(= 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); {19849#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:55,155 INFO L290 TraceCheckUtils]: 29: Hoare triple {19849#(= 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; {19849#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:55,155 INFO L290 TraceCheckUtils]: 30: Hoare triple {19849#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {19849#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:55,155 INFO L290 TraceCheckUtils]: 31: Hoare triple {19849#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {19849#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:55,156 INFO L290 TraceCheckUtils]: 32: Hoare triple {19849#(= 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); {19849#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:55,156 INFO L290 TraceCheckUtils]: 33: Hoare triple {19849#(= 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); {19849#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:55,156 INFO L290 TraceCheckUtils]: 34: Hoare triple {19849#(= 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); {19849#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:55,157 INFO L290 TraceCheckUtils]: 35: Hoare triple {19849#(= 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); {19849#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:55,157 INFO L290 TraceCheckUtils]: 36: Hoare triple {19849#(= 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); {19849#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:55,157 INFO L290 TraceCheckUtils]: 37: Hoare triple {19849#(= 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); {19849#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:55,158 INFO L290 TraceCheckUtils]: 38: Hoare triple {19849#(= 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); {19849#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:55,158 INFO L290 TraceCheckUtils]: 39: Hoare triple {19849#(= 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); {19850#(= |ssl3_accept_#t~mem54| 8496)} is VALID [2022-04-28 15:16:55,158 INFO L290 TraceCheckUtils]: 40: Hoare triple {19850#(= |ssl3_accept_#t~mem54| 8496)} assume 8482 == #t~mem54;havoc #t~mem54; {19845#false} is VALID [2022-04-28 15:16:55,159 INFO L290 TraceCheckUtils]: 41: Hoare triple {19845#false} call write~int(3, ~s.base, 72 + ~s.offset, 4); {19845#false} is VALID [2022-04-28 15:16:55,159 INFO L290 TraceCheckUtils]: 42: Hoare triple {19845#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); {19845#false} is VALID [2022-04-28 15:16:55,159 INFO L290 TraceCheckUtils]: 43: Hoare triple {19845#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {19845#false} is VALID [2022-04-28 15:16:55,159 INFO L290 TraceCheckUtils]: 44: Hoare triple {19845#false} ~skip~0 := 0; {19845#false} is VALID [2022-04-28 15:16:55,159 INFO L290 TraceCheckUtils]: 45: Hoare triple {19845#false} assume !false; {19845#false} is VALID [2022-04-28 15:16:55,159 INFO L290 TraceCheckUtils]: 46: Hoare triple {19845#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); {19845#false} is VALID [2022-04-28 15:16:55,159 INFO L290 TraceCheckUtils]: 47: Hoare triple {19845#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {19845#false} is VALID [2022-04-28 15:16:55,159 INFO L290 TraceCheckUtils]: 48: Hoare triple {19845#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {19845#false} is VALID [2022-04-28 15:16:55,159 INFO L290 TraceCheckUtils]: 49: Hoare triple {19845#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {19845#false} is VALID [2022-04-28 15:16:55,159 INFO L290 TraceCheckUtils]: 50: Hoare triple {19845#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {19845#false} is VALID [2022-04-28 15:16:55,159 INFO L290 TraceCheckUtils]: 51: Hoare triple {19845#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {19845#false} is VALID [2022-04-28 15:16:55,159 INFO L290 TraceCheckUtils]: 52: Hoare triple {19845#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {19845#false} is VALID [2022-04-28 15:16:55,159 INFO L290 TraceCheckUtils]: 53: Hoare triple {19845#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {19845#false} is VALID [2022-04-28 15:16:55,159 INFO L290 TraceCheckUtils]: 54: Hoare triple {19845#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {19845#false} is VALID [2022-04-28 15:16:55,160 INFO L290 TraceCheckUtils]: 55: Hoare triple {19845#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {19845#false} is VALID [2022-04-28 15:16:55,160 INFO L290 TraceCheckUtils]: 56: Hoare triple {19845#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {19845#false} is VALID [2022-04-28 15:16:55,160 INFO L290 TraceCheckUtils]: 57: Hoare triple {19845#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {19845#false} is VALID [2022-04-28 15:16:55,160 INFO L290 TraceCheckUtils]: 58: Hoare triple {19845#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {19845#false} is VALID [2022-04-28 15:16:55,160 INFO L290 TraceCheckUtils]: 59: Hoare triple {19845#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {19845#false} is VALID [2022-04-28 15:16:55,160 INFO L290 TraceCheckUtils]: 60: Hoare triple {19845#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {19845#false} is VALID [2022-04-28 15:16:55,160 INFO L290 TraceCheckUtils]: 61: Hoare triple {19845#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {19845#false} is VALID [2022-04-28 15:16:55,160 INFO L290 TraceCheckUtils]: 62: Hoare triple {19845#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {19845#false} is VALID [2022-04-28 15:16:55,160 INFO L290 TraceCheckUtils]: 63: Hoare triple {19845#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {19845#false} is VALID [2022-04-28 15:16:55,160 INFO L290 TraceCheckUtils]: 64: Hoare triple {19845#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {19845#false} is VALID [2022-04-28 15:16:55,160 INFO L290 TraceCheckUtils]: 65: Hoare triple {19845#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {19845#false} is VALID [2022-04-28 15:16:55,160 INFO L290 TraceCheckUtils]: 66: Hoare triple {19845#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {19845#false} is VALID [2022-04-28 15:16:55,160 INFO L290 TraceCheckUtils]: 67: Hoare triple {19845#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {19845#false} is VALID [2022-04-28 15:16:55,161 INFO L290 TraceCheckUtils]: 68: Hoare triple {19845#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {19845#false} is VALID [2022-04-28 15:16:55,161 INFO L290 TraceCheckUtils]: 69: Hoare triple {19845#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {19845#false} is VALID [2022-04-28 15:16:55,161 INFO L290 TraceCheckUtils]: 70: Hoare triple {19845#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {19845#false} is VALID [2022-04-28 15:16:55,161 INFO L290 TraceCheckUtils]: 71: Hoare triple {19845#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {19845#false} is VALID [2022-04-28 15:16:55,161 INFO L290 TraceCheckUtils]: 72: Hoare triple {19845#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {19845#false} is VALID [2022-04-28 15:16:55,161 INFO L290 TraceCheckUtils]: 73: Hoare triple {19845#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {19845#false} is VALID [2022-04-28 15:16:55,161 INFO L290 TraceCheckUtils]: 74: Hoare triple {19845#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {19845#false} is VALID [2022-04-28 15:16:55,161 INFO L290 TraceCheckUtils]: 75: Hoare triple {19845#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {19845#false} is VALID [2022-04-28 15:16:55,161 INFO L290 TraceCheckUtils]: 76: Hoare triple {19845#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {19845#false} is VALID [2022-04-28 15:16:55,161 INFO L290 TraceCheckUtils]: 77: Hoare triple {19845#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {19845#false} is VALID [2022-04-28 15:16:55,161 INFO L290 TraceCheckUtils]: 78: Hoare triple {19845#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {19845#false} is VALID [2022-04-28 15:16:55,161 INFO L290 TraceCheckUtils]: 79: Hoare triple {19845#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 72 + ~s.offset, 4); {19845#false} is VALID [2022-04-28 15:16:55,161 INFO L290 TraceCheckUtils]: 80: Hoare triple {19845#false} assume 8673 == #t~mem80;havoc #t~mem80; {19845#false} is VALID [2022-04-28 15:16:55,161 INFO L290 TraceCheckUtils]: 81: Hoare triple {19845#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {19845#false} is VALID [2022-04-28 15:16:55,162 INFO L290 TraceCheckUtils]: 82: Hoare triple {19845#false} assume 3 == ~blastFlag~0; {19845#false} is VALID [2022-04-28 15:16:55,162 INFO L290 TraceCheckUtils]: 83: Hoare triple {19845#false} assume !false; {19845#false} is VALID [2022-04-28 15:16:55,162 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:16:55,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:16:55,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395231164] [2022-04-28 15:16:55,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395231164] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:55,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:55,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:16:55,162 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:16:55,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1274293559] [2022-04-28 15:16:55,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1274293559] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:55,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:55,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:16:55,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320284473] [2022-04-28 15:16:55,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:16:55,163 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:16:55,163 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:16:55,163 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:16:55,222 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:16:55,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:16:55,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:55,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:16:55,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:16:55,223 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:16:57,245 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,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:58,154 INFO L93 Difference]: Finished difference Result 451 states and 712 transitions. [2022-04-28 15:16:58,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:16:58,154 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:16:58,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:16:58,154 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:16:58,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 453 transitions. [2022-04-28 15:16:58,156 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:16:58,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 453 transitions. [2022-04-28 15:16:58,158 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 453 transitions. [2022-04-28 15:16:58,451 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:16:58,455 INFO L225 Difference]: With dead ends: 451 [2022-04-28 15:16:58,455 INFO L226 Difference]: Without dead ends: 248 [2022-04-28 15:16:58,455 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:16:58,456 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 37 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 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:16:58,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 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:16:58,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-04-28 15:16:58,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 229. [2022-04-28 15:16:58,461 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:16:58,462 INFO L82 GeneralOperation]: Start isEquivalent. First operand 248 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:16:58,462 INFO L74 IsIncluded]: Start isIncluded. First operand 248 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:16:58,462 INFO L87 Difference]: Start difference. First operand 248 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:16:58,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:58,465 INFO L93 Difference]: Finished difference Result 248 states and 383 transitions. [2022-04-28 15:16:58,465 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 383 transitions. [2022-04-28 15:16:58,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:58,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:58,466 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 248 states. [2022-04-28 15:16:58,466 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 248 states. [2022-04-28 15:16:58,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:58,469 INFO L93 Difference]: Finished difference Result 248 states and 383 transitions. [2022-04-28 15:16:58,469 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 383 transitions. [2022-04-28 15:16:58,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:58,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:58,470 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:16:58,470 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:16:58,470 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:16:58,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 357 transitions. [2022-04-28 15:16:58,473 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 357 transitions. Word has length 84 [2022-04-28 15:16:58,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:16:58,474 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 357 transitions. [2022-04-28 15:16:58,474 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:16:58,474 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 229 states and 357 transitions. [2022-04-28 15:16:58,760 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:16:58,760 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 357 transitions. [2022-04-28 15:16:58,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-28 15:16:58,761 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:16:58,761 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:16:58,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-28 15:16:58,761 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:16:58,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:16:58,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1669457340, now seen corresponding path program 1 times [2022-04-28 15:16:58,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:58,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1953428561] [2022-04-28 15:16:58,792 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:16:58,793 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:16:58,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1669457340, now seen corresponding path program 2 times [2022-04-28 15:16:58,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:16:58,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724434081] [2022-04-28 15:16:58,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:16:58,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:16:58,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:58,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:16:58,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:58,934 INFO L290 TraceCheckUtils]: 0: Hoare triple {21720#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {21712#true} is VALID [2022-04-28 15:16:58,934 INFO L290 TraceCheckUtils]: 1: Hoare triple {21712#true} assume true; {21712#true} is VALID [2022-04-28 15:16:58,934 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21712#true} {21712#true} #661#return; {21712#true} is VALID [2022-04-28 15:16:58,935 INFO L272 TraceCheckUtils]: 0: Hoare triple {21712#true} call ULTIMATE.init(); {21720#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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,935 INFO L290 TraceCheckUtils]: 1: Hoare triple {21720#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {21712#true} is VALID [2022-04-28 15:16:58,935 INFO L290 TraceCheckUtils]: 2: Hoare triple {21712#true} assume true; {21712#true} is VALID [2022-04-28 15:16:58,935 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21712#true} {21712#true} #661#return; {21712#true} is VALID [2022-04-28 15:16:58,935 INFO L272 TraceCheckUtils]: 4: Hoare triple {21712#true} call #t~ret161 := main(); {21712#true} is VALID [2022-04-28 15:16:58,935 INFO L290 TraceCheckUtils]: 5: Hoare triple {21712#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; {21712#true} is VALID [2022-04-28 15:16:58,935 INFO L290 TraceCheckUtils]: 6: Hoare triple {21712#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {21712#true} is VALID [2022-04-28 15:16:58,935 INFO L272 TraceCheckUtils]: 7: Hoare triple {21712#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {21712#true} is VALID [2022-04-28 15:16:58,935 INFO L290 TraceCheckUtils]: 8: Hoare triple {21712#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); {21712#true} is VALID [2022-04-28 15:16:58,935 INFO L290 TraceCheckUtils]: 9: Hoare triple {21712#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; {21712#true} is VALID [2022-04-28 15:16:58,935 INFO L290 TraceCheckUtils]: 10: Hoare triple {21712#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; {21712#true} is VALID [2022-04-28 15:16:58,935 INFO L290 TraceCheckUtils]: 11: Hoare triple {21712#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {21712#true} is VALID [2022-04-28 15:16:58,936 INFO L290 TraceCheckUtils]: 12: Hoare triple {21712#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {21712#true} is VALID [2022-04-28 15:16:58,936 INFO L290 TraceCheckUtils]: 13: Hoare triple {21712#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {21712#true} is VALID [2022-04-28 15:16:58,936 INFO L290 TraceCheckUtils]: 14: Hoare triple {21712#true} assume !false; {21712#true} is VALID [2022-04-28 15:16:58,936 INFO L290 TraceCheckUtils]: 15: Hoare triple {21712#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); {21712#true} is VALID [2022-04-28 15:16:58,936 INFO L290 TraceCheckUtils]: 16: Hoare triple {21712#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {21712#true} is VALID [2022-04-28 15:16:58,936 INFO L290 TraceCheckUtils]: 17: Hoare triple {21712#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {21712#true} is VALID [2022-04-28 15:16:58,936 INFO L290 TraceCheckUtils]: 18: Hoare triple {21712#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {21712#true} is VALID [2022-04-28 15:16:58,936 INFO L290 TraceCheckUtils]: 19: Hoare triple {21712#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {21712#true} is VALID [2022-04-28 15:16:58,936 INFO L290 TraceCheckUtils]: 20: Hoare triple {21712#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {21712#true} is VALID [2022-04-28 15:16:58,936 INFO L290 TraceCheckUtils]: 21: Hoare triple {21712#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {21712#true} is VALID [2022-04-28 15:16:58,936 INFO L290 TraceCheckUtils]: 22: Hoare triple {21712#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {21712#true} is VALID [2022-04-28 15:16:58,936 INFO L290 TraceCheckUtils]: 23: Hoare triple {21712#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {21712#true} is VALID [2022-04-28 15:16:58,936 INFO L290 TraceCheckUtils]: 24: Hoare triple {21712#true} assume 8464 == #t~mem55;havoc #t~mem55; {21712#true} is VALID [2022-04-28 15:16:58,936 INFO L290 TraceCheckUtils]: 25: Hoare triple {21712#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; {21712#true} is VALID [2022-04-28 15:16:58,937 INFO L290 TraceCheckUtils]: 26: Hoare triple {21712#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {21712#true} is VALID [2022-04-28 15:16:58,937 INFO L290 TraceCheckUtils]: 27: Hoare triple {21712#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); {21712#true} is VALID [2022-04-28 15:16:58,937 INFO L290 TraceCheckUtils]: 28: Hoare triple {21712#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); {21712#true} is VALID [2022-04-28 15:16:58,937 INFO L290 TraceCheckUtils]: 29: Hoare triple {21712#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {21712#true} is VALID [2022-04-28 15:16:58,937 INFO L290 TraceCheckUtils]: 30: Hoare triple {21712#true} ~skip~0 := 0; {21712#true} is VALID [2022-04-28 15:16:58,937 INFO L290 TraceCheckUtils]: 31: Hoare triple {21712#true} assume !false; {21712#true} is VALID [2022-04-28 15:16:58,937 INFO L290 TraceCheckUtils]: 32: Hoare triple {21712#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); {21717#(= |ssl3_accept_#t~mem47| (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:58,938 INFO L290 TraceCheckUtils]: 33: Hoare triple {21717#(= |ssl3_accept_#t~mem47| (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 12292 == #t~mem47;havoc #t~mem47; {21718#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:58,938 INFO L290 TraceCheckUtils]: 34: Hoare triple {21718#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call write~int(1, ~s.base, 60 + ~s.offset, 4); {21718#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:58,939 INFO L290 TraceCheckUtils]: 35: Hoare triple {21718#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call write~int(1, ~s.base, 56 + ~s.offset, 4); {21718#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:58,939 INFO L290 TraceCheckUtils]: 36: Hoare triple {21718#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {21718#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:58,939 INFO L290 TraceCheckUtils]: 37: Hoare triple {21718#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {21718#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:58,940 INFO L290 TraceCheckUtils]: 38: Hoare triple {21718#(= 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); {21718#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:58,940 INFO L290 TraceCheckUtils]: 39: Hoare triple {21718#(= 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; {21718#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:58,941 INFO L290 TraceCheckUtils]: 40: Hoare triple {21718#(= 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); {21719#(= 12292 |ssl3_accept_#t~mem85|)} is VALID [2022-04-28 15:16:58,941 INFO L290 TraceCheckUtils]: 41: Hoare triple {21719#(= 12292 |ssl3_accept_#t~mem85|)} assume 12292 != #t~mem85;havoc #t~mem85; {21713#false} is VALID [2022-04-28 15:16:58,941 INFO L290 TraceCheckUtils]: 42: Hoare triple {21713#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; {21713#false} is VALID [2022-04-28 15:16:58,941 INFO L290 TraceCheckUtils]: 43: Hoare triple {21713#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); {21713#false} is VALID [2022-04-28 15:16:58,942 INFO L290 TraceCheckUtils]: 44: Hoare triple {21713#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {21713#false} is VALID [2022-04-28 15:16:58,942 INFO L290 TraceCheckUtils]: 45: Hoare triple {21713#false} ~skip~0 := 0; {21713#false} is VALID [2022-04-28 15:16:58,942 INFO L290 TraceCheckUtils]: 46: Hoare triple {21713#false} assume !false; {21713#false} is VALID [2022-04-28 15:16:58,942 INFO L290 TraceCheckUtils]: 47: Hoare triple {21713#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); {21713#false} is VALID [2022-04-28 15:16:58,942 INFO L290 TraceCheckUtils]: 48: Hoare triple {21713#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {21713#false} is VALID [2022-04-28 15:16:58,942 INFO L290 TraceCheckUtils]: 49: Hoare triple {21713#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {21713#false} is VALID [2022-04-28 15:16:58,942 INFO L290 TraceCheckUtils]: 50: Hoare triple {21713#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {21713#false} is VALID [2022-04-28 15:16:58,942 INFO L290 TraceCheckUtils]: 51: Hoare triple {21713#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {21713#false} is VALID [2022-04-28 15:16:58,942 INFO L290 TraceCheckUtils]: 52: Hoare triple {21713#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {21713#false} is VALID [2022-04-28 15:16:58,942 INFO L290 TraceCheckUtils]: 53: Hoare triple {21713#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {21713#false} is VALID [2022-04-28 15:16:58,942 INFO L290 TraceCheckUtils]: 54: Hoare triple {21713#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {21713#false} is VALID [2022-04-28 15:16:58,942 INFO L290 TraceCheckUtils]: 55: Hoare triple {21713#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {21713#false} is VALID [2022-04-28 15:16:58,943 INFO L290 TraceCheckUtils]: 56: Hoare triple {21713#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {21713#false} is VALID [2022-04-28 15:16:58,943 INFO L290 TraceCheckUtils]: 57: Hoare triple {21713#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {21713#false} is VALID [2022-04-28 15:16:58,943 INFO L290 TraceCheckUtils]: 58: Hoare triple {21713#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {21713#false} is VALID [2022-04-28 15:16:58,943 INFO L290 TraceCheckUtils]: 59: Hoare triple {21713#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {21713#false} is VALID [2022-04-28 15:16:58,943 INFO L290 TraceCheckUtils]: 60: Hoare triple {21713#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {21713#false} is VALID [2022-04-28 15:16:58,943 INFO L290 TraceCheckUtils]: 61: Hoare triple {21713#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {21713#false} is VALID [2022-04-28 15:16:58,943 INFO L290 TraceCheckUtils]: 62: Hoare triple {21713#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {21713#false} is VALID [2022-04-28 15:16:58,943 INFO L290 TraceCheckUtils]: 63: Hoare triple {21713#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {21713#false} is VALID [2022-04-28 15:16:58,943 INFO L290 TraceCheckUtils]: 64: Hoare triple {21713#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {21713#false} is VALID [2022-04-28 15:16:58,943 INFO L290 TraceCheckUtils]: 65: Hoare triple {21713#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {21713#false} is VALID [2022-04-28 15:16:58,943 INFO L290 TraceCheckUtils]: 66: Hoare triple {21713#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {21713#false} is VALID [2022-04-28 15:16:58,943 INFO L290 TraceCheckUtils]: 67: Hoare triple {21713#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {21713#false} is VALID [2022-04-28 15:16:58,943 INFO L290 TraceCheckUtils]: 68: Hoare triple {21713#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {21713#false} is VALID [2022-04-28 15:16:58,943 INFO L290 TraceCheckUtils]: 69: Hoare triple {21713#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {21713#false} is VALID [2022-04-28 15:16:58,944 INFO L290 TraceCheckUtils]: 70: Hoare triple {21713#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {21713#false} is VALID [2022-04-28 15:16:58,944 INFO L290 TraceCheckUtils]: 71: Hoare triple {21713#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {21713#false} is VALID [2022-04-28 15:16:58,944 INFO L290 TraceCheckUtils]: 72: Hoare triple {21713#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {21713#false} is VALID [2022-04-28 15:16:58,944 INFO L290 TraceCheckUtils]: 73: Hoare triple {21713#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {21713#false} is VALID [2022-04-28 15:16:58,944 INFO L290 TraceCheckUtils]: 74: Hoare triple {21713#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {21713#false} is VALID [2022-04-28 15:16:58,944 INFO L290 TraceCheckUtils]: 75: Hoare triple {21713#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {21713#false} is VALID [2022-04-28 15:16:58,944 INFO L290 TraceCheckUtils]: 76: Hoare triple {21713#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {21713#false} is VALID [2022-04-28 15:16:58,944 INFO L290 TraceCheckUtils]: 77: Hoare triple {21713#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {21713#false} is VALID [2022-04-28 15:16:58,944 INFO L290 TraceCheckUtils]: 78: Hoare triple {21713#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {21713#false} is VALID [2022-04-28 15:16:58,944 INFO L290 TraceCheckUtils]: 79: Hoare triple {21713#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {21713#false} is VALID [2022-04-28 15:16:58,944 INFO L290 TraceCheckUtils]: 80: Hoare triple {21713#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 72 + ~s.offset, 4); {21713#false} is VALID [2022-04-28 15:16:58,944 INFO L290 TraceCheckUtils]: 81: Hoare triple {21713#false} assume 8673 == #t~mem80;havoc #t~mem80; {21713#false} is VALID [2022-04-28 15:16:58,944 INFO L290 TraceCheckUtils]: 82: Hoare triple {21713#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {21713#false} is VALID [2022-04-28 15:16:58,945 INFO L290 TraceCheckUtils]: 83: Hoare triple {21713#false} assume 3 == ~blastFlag~0; {21713#false} is VALID [2022-04-28 15:16:58,945 INFO L290 TraceCheckUtils]: 84: Hoare triple {21713#false} assume !false; {21713#false} is VALID [2022-04-28 15:16:58,945 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:16:58,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:16:58,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724434081] [2022-04-28 15:16:58,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724434081] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:58,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:58,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 15:16:58,947 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:16:58,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1953428561] [2022-04-28 15:16:58,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1953428561] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:58,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:58,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 15:16:58,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206693695] [2022-04-28 15:16:58,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:16:58,947 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:16:58,948 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:16:58,948 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:16:59,013 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:16:59,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 15:16:59,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:59,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 15:16:59,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:16:59,014 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:17:01,045 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:02,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:02,032 INFO L93 Difference]: Finished difference Result 441 states and 696 transitions. [2022-04-28 15:17:02,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 15:17:02,032 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:02,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:17:02,033 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:17:02,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 403 transitions. [2022-04-28 15:17:02,034 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:17:02,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 403 transitions. [2022-04-28 15:17:02,036 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 403 transitions. [2022-04-28 15:17:02,291 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:17:02,294 INFO L225 Difference]: With dead ends: 441 [2022-04-28 15:17:02,294 INFO L226 Difference]: Without dead ends: 238 [2022-04-28 15:17:02,294 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:17:02,295 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 3 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:17:02,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 593 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 421 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 15:17:02,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-04-28 15:17:02,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2022-04-28 15:17:02,300 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:17:02,300 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:17:02,301 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:17:02,301 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:17:02,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:02,304 INFO L93 Difference]: Finished difference Result 238 states and 368 transitions. [2022-04-28 15:17:02,304 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 368 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 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:17:02,305 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:17:02,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:02,307 INFO L93 Difference]: Finished difference Result 238 states and 368 transitions. [2022-04-28 15:17:02,307 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 368 transitions. [2022-04-28 15:17:02,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:02,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:02,308 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:17:02,308 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:17:02,308 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:17:02,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 368 transitions. [2022-04-28 15:17:02,311 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 368 transitions. Word has length 85 [2022-04-28 15:17:02,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:17:02,311 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 368 transitions. [2022-04-28 15:17:02,311 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:17:02,311 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 238 states and 368 transitions. [2022-04-28 15:17:02,552 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:17:02,552 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 368 transitions. [2022-04-28 15:17:02,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-28 15:17:02,553 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:17:02,553 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:17:02,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-28 15:17:02,553 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:17:02,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:17:02,554 INFO L85 PathProgramCache]: Analyzing trace with hash 500010200, now seen corresponding path program 1 times [2022-04-28 15:17:02,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:02,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [981240639] [2022-04-28 15:17:02,580 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:17:02,580 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:17:02,581 INFO L85 PathProgramCache]: Analyzing trace with hash 500010200, now seen corresponding path program 2 times [2022-04-28 15:17:02,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:17:02,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274836579] [2022-04-28 15:17:02,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:17:02,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:17:02,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:02,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:17:02,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:02,683 INFO L290 TraceCheckUtils]: 0: Hoare triple {23566#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {23559#true} is VALID [2022-04-28 15:17:02,683 INFO L290 TraceCheckUtils]: 1: Hoare triple {23559#true} assume true; {23559#true} is VALID [2022-04-28 15:17:02,683 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23559#true} {23559#true} #661#return; {23559#true} is VALID [2022-04-28 15:17:02,684 INFO L272 TraceCheckUtils]: 0: Hoare triple {23559#true} call ULTIMATE.init(); {23566#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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,684 INFO L290 TraceCheckUtils]: 1: Hoare triple {23566#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {23559#true} is VALID [2022-04-28 15:17:02,684 INFO L290 TraceCheckUtils]: 2: Hoare triple {23559#true} assume true; {23559#true} is VALID [2022-04-28 15:17:02,684 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23559#true} {23559#true} #661#return; {23559#true} is VALID [2022-04-28 15:17:02,684 INFO L272 TraceCheckUtils]: 4: Hoare triple {23559#true} call #t~ret161 := main(); {23559#true} is VALID [2022-04-28 15:17:02,684 INFO L290 TraceCheckUtils]: 5: Hoare triple {23559#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; {23559#true} is VALID [2022-04-28 15:17:02,684 INFO L290 TraceCheckUtils]: 6: Hoare triple {23559#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {23559#true} is VALID [2022-04-28 15:17:02,684 INFO L272 TraceCheckUtils]: 7: Hoare triple {23559#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {23559#true} is VALID [2022-04-28 15:17:02,685 INFO L290 TraceCheckUtils]: 8: Hoare triple {23559#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); {23559#true} is VALID [2022-04-28 15:17:02,685 INFO L290 TraceCheckUtils]: 9: Hoare triple {23559#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; {23559#true} is VALID [2022-04-28 15:17:02,685 INFO L290 TraceCheckUtils]: 10: Hoare triple {23559#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; {23559#true} is VALID [2022-04-28 15:17:02,685 INFO L290 TraceCheckUtils]: 11: Hoare triple {23559#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {23559#true} is VALID [2022-04-28 15:17:02,685 INFO L290 TraceCheckUtils]: 12: Hoare triple {23559#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {23559#true} is VALID [2022-04-28 15:17:02,685 INFO L290 TraceCheckUtils]: 13: Hoare triple {23559#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {23559#true} is VALID [2022-04-28 15:17:02,685 INFO L290 TraceCheckUtils]: 14: Hoare triple {23559#true} assume !false; {23559#true} is VALID [2022-04-28 15:17:02,685 INFO L290 TraceCheckUtils]: 15: Hoare triple {23559#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); {23559#true} is VALID [2022-04-28 15:17:02,685 INFO L290 TraceCheckUtils]: 16: Hoare triple {23559#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {23559#true} is VALID [2022-04-28 15:17:02,685 INFO L290 TraceCheckUtils]: 17: Hoare triple {23559#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {23559#true} is VALID [2022-04-28 15:17:02,685 INFO L290 TraceCheckUtils]: 18: Hoare triple {23559#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {23559#true} is VALID [2022-04-28 15:17:02,685 INFO L290 TraceCheckUtils]: 19: Hoare triple {23559#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {23559#true} is VALID [2022-04-28 15:17:02,685 INFO L290 TraceCheckUtils]: 20: Hoare triple {23559#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {23559#true} is VALID [2022-04-28 15:17:02,686 INFO L290 TraceCheckUtils]: 21: Hoare triple {23559#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {23559#true} is VALID [2022-04-28 15:17:02,686 INFO L290 TraceCheckUtils]: 22: Hoare triple {23559#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {23559#true} is VALID [2022-04-28 15:17:02,686 INFO L290 TraceCheckUtils]: 23: Hoare triple {23559#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {23559#true} is VALID [2022-04-28 15:17:02,686 INFO L290 TraceCheckUtils]: 24: Hoare triple {23559#true} assume 8464 == #t~mem55;havoc #t~mem55; {23559#true} is VALID [2022-04-28 15:17:02,686 INFO L290 TraceCheckUtils]: 25: Hoare triple {23559#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; {23559#true} is VALID [2022-04-28 15:17:02,686 INFO L290 TraceCheckUtils]: 26: Hoare triple {23559#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {23559#true} is VALID [2022-04-28 15:17:02,695 INFO L290 TraceCheckUtils]: 27: Hoare triple {23559#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); {23564#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-28 15:17:02,695 INFO L290 TraceCheckUtils]: 28: Hoare triple {23564#(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); {23564#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-28 15:17:02,696 INFO L290 TraceCheckUtils]: 29: Hoare triple {23564#(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; {23564#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-28 15:17:02,696 INFO L290 TraceCheckUtils]: 30: Hoare triple {23564#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} ~skip~0 := 0; {23564#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-28 15:17:02,696 INFO L290 TraceCheckUtils]: 31: Hoare triple {23564#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} assume !false; {23564#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-28 15:17:02,697 INFO L290 TraceCheckUtils]: 32: Hoare triple {23564#(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); {23564#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-28 15:17:02,697 INFO L290 TraceCheckUtils]: 33: Hoare triple {23564#(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); {23565#(not (= |ssl3_accept_#t~mem48| 16384))} is VALID [2022-04-28 15:17:02,697 INFO L290 TraceCheckUtils]: 34: Hoare triple {23565#(not (= |ssl3_accept_#t~mem48| 16384))} assume 16384 == #t~mem48;havoc #t~mem48; {23560#false} is VALID [2022-04-28 15:17:02,697 INFO L290 TraceCheckUtils]: 35: Hoare triple {23560#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {23560#false} is VALID [2022-04-28 15:17:02,697 INFO L290 TraceCheckUtils]: 36: Hoare triple {23560#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {23560#false} is VALID [2022-04-28 15:17:02,697 INFO L290 TraceCheckUtils]: 37: Hoare triple {23560#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {23560#false} is VALID [2022-04-28 15:17:02,697 INFO L290 TraceCheckUtils]: 38: Hoare triple {23560#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); {23560#false} is VALID [2022-04-28 15:17:02,698 INFO L290 TraceCheckUtils]: 39: Hoare triple {23560#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {23560#false} is VALID [2022-04-28 15:17:02,698 INFO L290 TraceCheckUtils]: 40: Hoare triple {23560#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); {23560#false} is VALID [2022-04-28 15:17:02,698 INFO L290 TraceCheckUtils]: 41: Hoare triple {23560#false} assume 12292 != #t~mem85;havoc #t~mem85; {23560#false} is VALID [2022-04-28 15:17:02,698 INFO L290 TraceCheckUtils]: 42: Hoare triple {23560#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; {23560#false} is VALID [2022-04-28 15:17:02,698 INFO L290 TraceCheckUtils]: 43: Hoare triple {23560#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); {23560#false} is VALID [2022-04-28 15:17:02,698 INFO L290 TraceCheckUtils]: 44: Hoare triple {23560#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {23560#false} is VALID [2022-04-28 15:17:02,698 INFO L290 TraceCheckUtils]: 45: Hoare triple {23560#false} ~skip~0 := 0; {23560#false} is VALID [2022-04-28 15:17:02,698 INFO L290 TraceCheckUtils]: 46: Hoare triple {23560#false} assume !false; {23560#false} is VALID [2022-04-28 15:17:02,698 INFO L290 TraceCheckUtils]: 47: Hoare triple {23560#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); {23560#false} is VALID [2022-04-28 15:17:02,698 INFO L290 TraceCheckUtils]: 48: Hoare triple {23560#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {23560#false} is VALID [2022-04-28 15:17:02,698 INFO L290 TraceCheckUtils]: 49: Hoare triple {23560#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {23560#false} is VALID [2022-04-28 15:17:02,698 INFO L290 TraceCheckUtils]: 50: Hoare triple {23560#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {23560#false} is VALID [2022-04-28 15:17:02,698 INFO L290 TraceCheckUtils]: 51: Hoare triple {23560#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {23560#false} is VALID [2022-04-28 15:17:02,698 INFO L290 TraceCheckUtils]: 52: Hoare triple {23560#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {23560#false} is VALID [2022-04-28 15:17:02,699 INFO L290 TraceCheckUtils]: 53: Hoare triple {23560#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {23560#false} is VALID [2022-04-28 15:17:02,699 INFO L290 TraceCheckUtils]: 54: Hoare triple {23560#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {23560#false} is VALID [2022-04-28 15:17:02,699 INFO L290 TraceCheckUtils]: 55: Hoare triple {23560#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {23560#false} is VALID [2022-04-28 15:17:02,699 INFO L290 TraceCheckUtils]: 56: Hoare triple {23560#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {23560#false} is VALID [2022-04-28 15:17:02,699 INFO L290 TraceCheckUtils]: 57: Hoare triple {23560#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {23560#false} is VALID [2022-04-28 15:17:02,699 INFO L290 TraceCheckUtils]: 58: Hoare triple {23560#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {23560#false} is VALID [2022-04-28 15:17:02,699 INFO L290 TraceCheckUtils]: 59: Hoare triple {23560#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {23560#false} is VALID [2022-04-28 15:17:02,699 INFO L290 TraceCheckUtils]: 60: Hoare triple {23560#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {23560#false} is VALID [2022-04-28 15:17:02,699 INFO L290 TraceCheckUtils]: 61: Hoare triple {23560#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {23560#false} is VALID [2022-04-28 15:17:02,699 INFO L290 TraceCheckUtils]: 62: Hoare triple {23560#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {23560#false} is VALID [2022-04-28 15:17:02,699 INFO L290 TraceCheckUtils]: 63: Hoare triple {23560#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {23560#false} is VALID [2022-04-28 15:17:02,699 INFO L290 TraceCheckUtils]: 64: Hoare triple {23560#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {23560#false} is VALID [2022-04-28 15:17:02,699 INFO L290 TraceCheckUtils]: 65: Hoare triple {23560#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {23560#false} is VALID [2022-04-28 15:17:02,700 INFO L290 TraceCheckUtils]: 66: Hoare triple {23560#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {23560#false} is VALID [2022-04-28 15:17:02,700 INFO L290 TraceCheckUtils]: 67: Hoare triple {23560#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {23560#false} is VALID [2022-04-28 15:17:02,700 INFO L290 TraceCheckUtils]: 68: Hoare triple {23560#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {23560#false} is VALID [2022-04-28 15:17:02,700 INFO L290 TraceCheckUtils]: 69: Hoare triple {23560#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {23560#false} is VALID [2022-04-28 15:17:02,700 INFO L290 TraceCheckUtils]: 70: Hoare triple {23560#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {23560#false} is VALID [2022-04-28 15:17:02,700 INFO L290 TraceCheckUtils]: 71: Hoare triple {23560#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {23560#false} is VALID [2022-04-28 15:17:02,700 INFO L290 TraceCheckUtils]: 72: Hoare triple {23560#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {23560#false} is VALID [2022-04-28 15:17:02,700 INFO L290 TraceCheckUtils]: 73: Hoare triple {23560#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {23560#false} is VALID [2022-04-28 15:17:02,700 INFO L290 TraceCheckUtils]: 74: Hoare triple {23560#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {23560#false} is VALID [2022-04-28 15:17:02,700 INFO L290 TraceCheckUtils]: 75: Hoare triple {23560#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {23560#false} is VALID [2022-04-28 15:17:02,700 INFO L290 TraceCheckUtils]: 76: Hoare triple {23560#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {23560#false} is VALID [2022-04-28 15:17:02,700 INFO L290 TraceCheckUtils]: 77: Hoare triple {23560#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {23560#false} is VALID [2022-04-28 15:17:02,700 INFO L290 TraceCheckUtils]: 78: Hoare triple {23560#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {23560#false} is VALID [2022-04-28 15:17:02,700 INFO L290 TraceCheckUtils]: 79: Hoare triple {23560#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {23560#false} is VALID [2022-04-28 15:17:02,701 INFO L290 TraceCheckUtils]: 80: Hoare triple {23560#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 72 + ~s.offset, 4); {23560#false} is VALID [2022-04-28 15:17:02,701 INFO L290 TraceCheckUtils]: 81: Hoare triple {23560#false} assume 8673 == #t~mem80;havoc #t~mem80; {23560#false} is VALID [2022-04-28 15:17:02,701 INFO L290 TraceCheckUtils]: 82: Hoare triple {23560#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {23560#false} is VALID [2022-04-28 15:17:02,701 INFO L290 TraceCheckUtils]: 83: Hoare triple {23560#false} assume 3 == ~blastFlag~0; {23560#false} is VALID [2022-04-28 15:17:02,701 INFO L290 TraceCheckUtils]: 84: Hoare triple {23560#false} assume !false; {23560#false} is VALID [2022-04-28 15:17:02,701 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:17:02,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:17:02,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274836579] [2022-04-28 15:17:02,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274836579] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:02,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:02,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:02,702 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:17:02,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [981240639] [2022-04-28 15:17:02,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [981240639] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:02,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:02,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:02,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325616241] [2022-04-28 15:17:02,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:17:02,702 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:17:02,702 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:17:02,703 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:17:02,752 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:17:02,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:17:02,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:02,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:17:02,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:17:02,753 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:17:06,351 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:17:08,357 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:10,378 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:12,402 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:13,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:13,514 INFO L93 Difference]: Finished difference Result 573 states and 893 transitions. [2022-04-28 15:17:13,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:17:13,515 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:17:13,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:17:13,515 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:17:13,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 567 transitions. [2022-04-28 15:17:13,517 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:17:13,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 567 transitions. [2022-04-28 15:17:13,519 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 567 transitions. [2022-04-28 15:17:13,894 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:13,909 INFO L225 Difference]: With dead ends: 573 [2022-04-28 15:17:13,910 INFO L226 Difference]: Without dead ends: 361 [2022-04-28 15:17:13,910 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:13,910 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 142 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 64 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:17:13,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 314 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 465 Invalid, 3 Unknown, 0 Unchecked, 8.0s Time] [2022-04-28 15:17:13,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2022-04-28 15:17:13,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 250. [2022-04-28 15:17:13,926 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:17:13,926 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:17:13,926 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:17:13,927 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:17:13,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:13,934 INFO L93 Difference]: Finished difference Result 361 states and 551 transitions. [2022-04-28 15:17:13,934 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 551 transitions. [2022-04-28 15:17:13,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:13,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:13,935 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:17:13,935 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:17:13,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:13,940 INFO L93 Difference]: Finished difference Result 361 states and 551 transitions. [2022-04-28 15:17:13,940 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 551 transitions. [2022-04-28 15:17:13,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:13,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:13,941 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:17:13,941 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:17:13,941 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:17:13,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 383 transitions. [2022-04-28 15:17:13,945 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 383 transitions. Word has length 85 [2022-04-28 15:17:13,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:17:13,945 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 383 transitions. [2022-04-28 15:17:13,945 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:17:13,945 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 383 transitions. [2022-04-28 15:17:14,213 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:17:14,214 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 383 transitions. [2022-04-28 15:17:14,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-28 15:17:14,214 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:17:14,214 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:17:14,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-28 15:17:14,214 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:17:14,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:17:14,215 INFO L85 PathProgramCache]: Analyzing trace with hash -989381741, now seen corresponding path program 1 times [2022-04-28 15:17:14,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:14,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1533225037] [2022-04-28 15:17:14,246 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:17:14,246 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:17:14,246 INFO L85 PathProgramCache]: Analyzing trace with hash -989381741, now seen corresponding path program 2 times [2022-04-28 15:17:14,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:17:14,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831927643] [2022-04-28 15:17:14,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:17:14,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:17:14,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:14,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:17:14,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:14,345 INFO L290 TraceCheckUtils]: 0: Hoare triple {25946#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {25939#true} is VALID [2022-04-28 15:17:14,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {25939#true} assume true; {25939#true} is VALID [2022-04-28 15:17:14,345 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25939#true} {25939#true} #661#return; {25939#true} is VALID [2022-04-28 15:17:14,345 INFO L272 TraceCheckUtils]: 0: Hoare triple {25939#true} call ULTIMATE.init(); {25946#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {25946#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {25939#true} is VALID [2022-04-28 15:17:14,346 INFO L290 TraceCheckUtils]: 2: Hoare triple {25939#true} assume true; {25939#true} is VALID [2022-04-28 15:17:14,346 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25939#true} {25939#true} #661#return; {25939#true} is VALID [2022-04-28 15:17:14,346 INFO L272 TraceCheckUtils]: 4: Hoare triple {25939#true} call #t~ret161 := main(); {25939#true} is VALID [2022-04-28 15:17:14,346 INFO L290 TraceCheckUtils]: 5: Hoare triple {25939#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; {25939#true} is VALID [2022-04-28 15:17:14,346 INFO L290 TraceCheckUtils]: 6: Hoare triple {25939#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {25939#true} is VALID [2022-04-28 15:17:14,346 INFO L272 TraceCheckUtils]: 7: Hoare triple {25939#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {25939#true} is VALID [2022-04-28 15:17:14,346 INFO L290 TraceCheckUtils]: 8: Hoare triple {25939#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); {25939#true} is VALID [2022-04-28 15:17:14,346 INFO L290 TraceCheckUtils]: 9: Hoare triple {25939#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; {25939#true} is VALID [2022-04-28 15:17:14,346 INFO L290 TraceCheckUtils]: 10: Hoare triple {25939#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; {25939#true} is VALID [2022-04-28 15:17:14,346 INFO L290 TraceCheckUtils]: 11: Hoare triple {25939#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {25939#true} is VALID [2022-04-28 15:17:14,346 INFO L290 TraceCheckUtils]: 12: Hoare triple {25939#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {25939#true} is VALID [2022-04-28 15:17:14,347 INFO L290 TraceCheckUtils]: 13: Hoare triple {25939#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {25939#true} is VALID [2022-04-28 15:17:14,347 INFO L290 TraceCheckUtils]: 14: Hoare triple {25939#true} assume !false; {25939#true} is VALID [2022-04-28 15:17:14,347 INFO L290 TraceCheckUtils]: 15: Hoare triple {25939#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); {25939#true} is VALID [2022-04-28 15:17:14,347 INFO L290 TraceCheckUtils]: 16: Hoare triple {25939#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {25939#true} is VALID [2022-04-28 15:17:14,347 INFO L290 TraceCheckUtils]: 17: Hoare triple {25939#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {25939#true} is VALID [2022-04-28 15:17:14,347 INFO L290 TraceCheckUtils]: 18: Hoare triple {25939#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {25939#true} is VALID [2022-04-28 15:17:14,347 INFO L290 TraceCheckUtils]: 19: Hoare triple {25939#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {25939#true} is VALID [2022-04-28 15:17:14,347 INFO L290 TraceCheckUtils]: 20: Hoare triple {25939#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {25939#true} is VALID [2022-04-28 15:17:14,347 INFO L290 TraceCheckUtils]: 21: Hoare triple {25939#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {25939#true} is VALID [2022-04-28 15:17:14,347 INFO L290 TraceCheckUtils]: 22: Hoare triple {25939#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {25939#true} is VALID [2022-04-28 15:17:14,347 INFO L290 TraceCheckUtils]: 23: Hoare triple {25939#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {25939#true} is VALID [2022-04-28 15:17:14,347 INFO L290 TraceCheckUtils]: 24: Hoare triple {25939#true} assume 8464 == #t~mem55;havoc #t~mem55; {25939#true} is VALID [2022-04-28 15:17:14,347 INFO L290 TraceCheckUtils]: 25: Hoare triple {25939#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; {25939#true} is VALID [2022-04-28 15:17:14,348 INFO L290 TraceCheckUtils]: 26: Hoare triple {25939#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {25939#true} is VALID [2022-04-28 15:17:14,348 INFO L290 TraceCheckUtils]: 27: Hoare triple {25939#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); {25944#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:14,349 INFO L290 TraceCheckUtils]: 28: Hoare triple {25944#(= 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); {25944#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:14,349 INFO L290 TraceCheckUtils]: 29: Hoare triple {25944#(= 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; {25944#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:14,349 INFO L290 TraceCheckUtils]: 30: Hoare triple {25944#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {25944#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:14,350 INFO L290 TraceCheckUtils]: 31: Hoare triple {25944#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {25944#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:14,350 INFO L290 TraceCheckUtils]: 32: Hoare triple {25944#(= 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); {25944#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:14,350 INFO L290 TraceCheckUtils]: 33: Hoare triple {25944#(= 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); {25944#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:14,351 INFO L290 TraceCheckUtils]: 34: Hoare triple {25944#(= 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); {25945#(= |ssl3_accept_#t~mem49| 8496)} is VALID [2022-04-28 15:17:14,351 INFO L290 TraceCheckUtils]: 35: Hoare triple {25945#(= |ssl3_accept_#t~mem49| 8496)} assume 8192 == #t~mem49;havoc #t~mem49; {25940#false} is VALID [2022-04-28 15:17:14,351 INFO L290 TraceCheckUtils]: 36: Hoare triple {25940#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {25940#false} is VALID [2022-04-28 15:17:14,351 INFO L290 TraceCheckUtils]: 37: Hoare triple {25940#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {25940#false} is VALID [2022-04-28 15:17:14,351 INFO L290 TraceCheckUtils]: 38: Hoare triple {25940#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {25940#false} is VALID [2022-04-28 15:17:14,351 INFO L290 TraceCheckUtils]: 39: Hoare triple {25940#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); {25940#false} is VALID [2022-04-28 15:17:14,351 INFO L290 TraceCheckUtils]: 40: Hoare triple {25940#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {25940#false} is VALID [2022-04-28 15:17:14,351 INFO L290 TraceCheckUtils]: 41: Hoare triple {25940#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); {25940#false} is VALID [2022-04-28 15:17:14,351 INFO L290 TraceCheckUtils]: 42: Hoare triple {25940#false} assume 12292 != #t~mem85;havoc #t~mem85; {25940#false} is VALID [2022-04-28 15:17:14,351 INFO L290 TraceCheckUtils]: 43: Hoare triple {25940#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; {25940#false} is VALID [2022-04-28 15:17:14,352 INFO L290 TraceCheckUtils]: 44: Hoare triple {25940#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); {25940#false} is VALID [2022-04-28 15:17:14,352 INFO L290 TraceCheckUtils]: 45: Hoare triple {25940#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {25940#false} is VALID [2022-04-28 15:17:14,352 INFO L290 TraceCheckUtils]: 46: Hoare triple {25940#false} ~skip~0 := 0; {25940#false} is VALID [2022-04-28 15:17:14,352 INFO L290 TraceCheckUtils]: 47: Hoare triple {25940#false} assume !false; {25940#false} is VALID [2022-04-28 15:17:14,352 INFO L290 TraceCheckUtils]: 48: Hoare triple {25940#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); {25940#false} is VALID [2022-04-28 15:17:14,352 INFO L290 TraceCheckUtils]: 49: Hoare triple {25940#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {25940#false} is VALID [2022-04-28 15:17:14,352 INFO L290 TraceCheckUtils]: 50: Hoare triple {25940#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {25940#false} is VALID [2022-04-28 15:17:14,352 INFO L290 TraceCheckUtils]: 51: Hoare triple {25940#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {25940#false} is VALID [2022-04-28 15:17:14,352 INFO L290 TraceCheckUtils]: 52: Hoare triple {25940#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {25940#false} is VALID [2022-04-28 15:17:14,352 INFO L290 TraceCheckUtils]: 53: Hoare triple {25940#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {25940#false} is VALID [2022-04-28 15:17:14,352 INFO L290 TraceCheckUtils]: 54: Hoare triple {25940#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {25940#false} is VALID [2022-04-28 15:17:14,352 INFO L290 TraceCheckUtils]: 55: Hoare triple {25940#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {25940#false} is VALID [2022-04-28 15:17:14,352 INFO L290 TraceCheckUtils]: 56: Hoare triple {25940#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {25940#false} is VALID [2022-04-28 15:17:14,352 INFO L290 TraceCheckUtils]: 57: Hoare triple {25940#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {25940#false} is VALID [2022-04-28 15:17:14,353 INFO L290 TraceCheckUtils]: 58: Hoare triple {25940#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {25940#false} is VALID [2022-04-28 15:17:14,353 INFO L290 TraceCheckUtils]: 59: Hoare triple {25940#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {25940#false} is VALID [2022-04-28 15:17:14,353 INFO L290 TraceCheckUtils]: 60: Hoare triple {25940#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {25940#false} is VALID [2022-04-28 15:17:14,353 INFO L290 TraceCheckUtils]: 61: Hoare triple {25940#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {25940#false} is VALID [2022-04-28 15:17:14,353 INFO L290 TraceCheckUtils]: 62: Hoare triple {25940#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {25940#false} is VALID [2022-04-28 15:17:14,353 INFO L290 TraceCheckUtils]: 63: Hoare triple {25940#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {25940#false} is VALID [2022-04-28 15:17:14,353 INFO L290 TraceCheckUtils]: 64: Hoare triple {25940#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {25940#false} is VALID [2022-04-28 15:17:14,353 INFO L290 TraceCheckUtils]: 65: Hoare triple {25940#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {25940#false} is VALID [2022-04-28 15:17:14,353 INFO L290 TraceCheckUtils]: 66: Hoare triple {25940#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {25940#false} is VALID [2022-04-28 15:17:14,353 INFO L290 TraceCheckUtils]: 67: Hoare triple {25940#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {25940#false} is VALID [2022-04-28 15:17:14,353 INFO L290 TraceCheckUtils]: 68: Hoare triple {25940#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {25940#false} is VALID [2022-04-28 15:17:14,353 INFO L290 TraceCheckUtils]: 69: Hoare triple {25940#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {25940#false} is VALID [2022-04-28 15:17:14,353 INFO L290 TraceCheckUtils]: 70: Hoare triple {25940#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {25940#false} is VALID [2022-04-28 15:17:14,353 INFO L290 TraceCheckUtils]: 71: Hoare triple {25940#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {25940#false} is VALID [2022-04-28 15:17:14,354 INFO L290 TraceCheckUtils]: 72: Hoare triple {25940#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {25940#false} is VALID [2022-04-28 15:17:14,354 INFO L290 TraceCheckUtils]: 73: Hoare triple {25940#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {25940#false} is VALID [2022-04-28 15:17:14,354 INFO L290 TraceCheckUtils]: 74: Hoare triple {25940#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {25940#false} is VALID [2022-04-28 15:17:14,354 INFO L290 TraceCheckUtils]: 75: Hoare triple {25940#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {25940#false} is VALID [2022-04-28 15:17:14,354 INFO L290 TraceCheckUtils]: 76: Hoare triple {25940#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {25940#false} is VALID [2022-04-28 15:17:14,354 INFO L290 TraceCheckUtils]: 77: Hoare triple {25940#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {25940#false} is VALID [2022-04-28 15:17:14,354 INFO L290 TraceCheckUtils]: 78: Hoare triple {25940#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {25940#false} is VALID [2022-04-28 15:17:14,354 INFO L290 TraceCheckUtils]: 79: Hoare triple {25940#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {25940#false} is VALID [2022-04-28 15:17:14,354 INFO L290 TraceCheckUtils]: 80: Hoare triple {25940#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {25940#false} is VALID [2022-04-28 15:17:14,354 INFO L290 TraceCheckUtils]: 81: Hoare triple {25940#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 72 + ~s.offset, 4); {25940#false} is VALID [2022-04-28 15:17:14,354 INFO L290 TraceCheckUtils]: 82: Hoare triple {25940#false} assume 8673 == #t~mem80;havoc #t~mem80; {25940#false} is VALID [2022-04-28 15:17:14,354 INFO L290 TraceCheckUtils]: 83: Hoare triple {25940#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {25940#false} is VALID [2022-04-28 15:17:14,354 INFO L290 TraceCheckUtils]: 84: Hoare triple {25940#false} assume 3 == ~blastFlag~0; {25940#false} is VALID [2022-04-28 15:17:14,354 INFO L290 TraceCheckUtils]: 85: Hoare triple {25940#false} assume !false; {25940#false} is VALID [2022-04-28 15:17:14,355 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:17:14,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:17:14,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831927643] [2022-04-28 15:17:14,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831927643] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:14,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:14,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:14,355 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:17:14,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1533225037] [2022-04-28 15:17:14,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1533225037] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:14,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:14,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:14,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480856836] [2022-04-28 15:17:14,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:17:14,356 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:17:14,356 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:17:14,356 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:17:14,492 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:17:14,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:17:14,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:14,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:17:14,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:17:14,493 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:17:16,511 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,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:17,400 INFO L93 Difference]: Finished difference Result 502 states and 773 transitions. [2022-04-28 15:17:17,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:17:17,400 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:17:17,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:17:17,400 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:17:17,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 451 transitions. [2022-04-28 15:17:17,402 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:17:17,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 451 transitions. [2022-04-28 15:17:17,404 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 451 transitions. [2022-04-28 15:17:17,696 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:17,701 INFO L225 Difference]: With dead ends: 502 [2022-04-28 15:17:17,701 INFO L226 Difference]: Without dead ends: 278 [2022-04-28 15:17:17,702 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:17,702 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 40 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 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:17,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 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:17,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2022-04-28 15:17:17,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 250. [2022-04-28 15:17:17,710 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:17:17,711 INFO L82 GeneralOperation]: Start isEquivalent. First operand 278 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:17:17,711 INFO L74 IsIncluded]: Start isIncluded. First operand 278 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:17:17,712 INFO L87 Difference]: Start difference. First operand 278 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:17:17,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:17,716 INFO L93 Difference]: Finished difference Result 278 states and 419 transitions. [2022-04-28 15:17:17,716 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 419 transitions. [2022-04-28 15:17:17,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:17,717 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:17,717 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 278 states. [2022-04-28 15:17:17,717 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 278 states. [2022-04-28 15:17:17,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:17,721 INFO L93 Difference]: Finished difference Result 278 states and 419 transitions. [2022-04-28 15:17:17,721 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 419 transitions. [2022-04-28 15:17:17,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:17,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:17,721 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:17:17,721 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:17:17,722 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:17:17,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 382 transitions. [2022-04-28 15:17:17,725 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 382 transitions. Word has length 86 [2022-04-28 15:17:17,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:17:17,725 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 382 transitions. [2022-04-28 15:17:17,725 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:17:17,725 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 382 transitions. [2022-04-28 15:17:17,994 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:17:17,995 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 382 transitions. [2022-04-28 15:17:17,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-28 15:17:17,995 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:17:17,995 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:17:17,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-28 15:17:17,996 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:17:17,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:17:17,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1455094013, now seen corresponding path program 1 times [2022-04-28 15:17:17,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:17,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1593394094] [2022-04-28 15:17:18,050 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:17:18,051 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:17:18,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1455094013, now seen corresponding path program 2 times [2022-04-28 15:17:18,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:17:18,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537834810] [2022-04-28 15:17:18,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:17:18,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:17:18,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:18,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:17:18,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:18,172 INFO L290 TraceCheckUtils]: 0: Hoare triple {28018#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {28011#true} is VALID [2022-04-28 15:17:18,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {28011#true} assume true; {28011#true} is VALID [2022-04-28 15:17:18,173 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28011#true} {28011#true} #661#return; {28011#true} is VALID [2022-04-28 15:17:18,174 INFO L272 TraceCheckUtils]: 0: Hoare triple {28011#true} call ULTIMATE.init(); {28018#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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,174 INFO L290 TraceCheckUtils]: 1: Hoare triple {28018#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {28011#true} is VALID [2022-04-28 15:17:18,174 INFO L290 TraceCheckUtils]: 2: Hoare triple {28011#true} assume true; {28011#true} is VALID [2022-04-28 15:17:18,174 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28011#true} {28011#true} #661#return; {28011#true} is VALID [2022-04-28 15:17:18,174 INFO L272 TraceCheckUtils]: 4: Hoare triple {28011#true} call #t~ret161 := main(); {28011#true} is VALID [2022-04-28 15:17:18,174 INFO L290 TraceCheckUtils]: 5: Hoare triple {28011#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; {28011#true} is VALID [2022-04-28 15:17:18,174 INFO L290 TraceCheckUtils]: 6: Hoare triple {28011#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {28011#true} is VALID [2022-04-28 15:17:18,174 INFO L272 TraceCheckUtils]: 7: Hoare triple {28011#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {28011#true} is VALID [2022-04-28 15:17:18,174 INFO L290 TraceCheckUtils]: 8: Hoare triple {28011#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); {28011#true} is VALID [2022-04-28 15:17:18,175 INFO L290 TraceCheckUtils]: 9: Hoare triple {28011#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; {28011#true} is VALID [2022-04-28 15:17:18,175 INFO L290 TraceCheckUtils]: 10: Hoare triple {28011#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; {28011#true} is VALID [2022-04-28 15:17:18,175 INFO L290 TraceCheckUtils]: 11: Hoare triple {28011#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {28011#true} is VALID [2022-04-28 15:17:18,175 INFO L290 TraceCheckUtils]: 12: Hoare triple {28011#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {28011#true} is VALID [2022-04-28 15:17:18,175 INFO L290 TraceCheckUtils]: 13: Hoare triple {28011#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {28011#true} is VALID [2022-04-28 15:17:18,175 INFO L290 TraceCheckUtils]: 14: Hoare triple {28011#true} assume !false; {28011#true} is VALID [2022-04-28 15:17:18,175 INFO L290 TraceCheckUtils]: 15: Hoare triple {28011#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); {28011#true} is VALID [2022-04-28 15:17:18,175 INFO L290 TraceCheckUtils]: 16: Hoare triple {28011#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {28011#true} is VALID [2022-04-28 15:17:18,175 INFO L290 TraceCheckUtils]: 17: Hoare triple {28011#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {28011#true} is VALID [2022-04-28 15:17:18,175 INFO L290 TraceCheckUtils]: 18: Hoare triple {28011#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {28011#true} is VALID [2022-04-28 15:17:18,175 INFO L290 TraceCheckUtils]: 19: Hoare triple {28011#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {28011#true} is VALID [2022-04-28 15:17:18,175 INFO L290 TraceCheckUtils]: 20: Hoare triple {28011#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {28011#true} is VALID [2022-04-28 15:17:18,176 INFO L290 TraceCheckUtils]: 21: Hoare triple {28011#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {28011#true} is VALID [2022-04-28 15:17:18,176 INFO L290 TraceCheckUtils]: 22: Hoare triple {28011#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {28011#true} is VALID [2022-04-28 15:17:18,176 INFO L290 TraceCheckUtils]: 23: Hoare triple {28011#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {28011#true} is VALID [2022-04-28 15:17:18,176 INFO L290 TraceCheckUtils]: 24: Hoare triple {28011#true} assume 8464 == #t~mem55;havoc #t~mem55; {28011#true} is VALID [2022-04-28 15:17:18,176 INFO L290 TraceCheckUtils]: 25: Hoare triple {28011#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; {28011#true} is VALID [2022-04-28 15:17:18,176 INFO L290 TraceCheckUtils]: 26: Hoare triple {28011#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {28011#true} is VALID [2022-04-28 15:17:18,177 INFO L290 TraceCheckUtils]: 27: Hoare triple {28011#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); {28016#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:18,177 INFO L290 TraceCheckUtils]: 28: Hoare triple {28016#(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); {28016#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:18,177 INFO L290 TraceCheckUtils]: 29: Hoare triple {28016#(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; {28016#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:18,178 INFO L290 TraceCheckUtils]: 30: Hoare triple {28016#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} ~skip~0 := 0; {28016#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:18,178 INFO L290 TraceCheckUtils]: 31: Hoare triple {28016#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {28016#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:18,178 INFO L290 TraceCheckUtils]: 32: Hoare triple {28016#(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); {28016#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:18,179 INFO L290 TraceCheckUtils]: 33: Hoare triple {28016#(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); {28016#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:18,179 INFO L290 TraceCheckUtils]: 34: Hoare triple {28016#(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); {28016#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:18,179 INFO L290 TraceCheckUtils]: 35: Hoare triple {28016#(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); {28017#(not (= 24576 |ssl3_accept_#t~mem50|))} is VALID [2022-04-28 15:17:18,180 INFO L290 TraceCheckUtils]: 36: Hoare triple {28017#(not (= 24576 |ssl3_accept_#t~mem50|))} assume 24576 == #t~mem50;havoc #t~mem50; {28012#false} is VALID [2022-04-28 15:17:18,180 INFO L290 TraceCheckUtils]: 37: Hoare triple {28012#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {28012#false} is VALID [2022-04-28 15:17:18,180 INFO L290 TraceCheckUtils]: 38: Hoare triple {28012#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {28012#false} is VALID [2022-04-28 15:17:18,180 INFO L290 TraceCheckUtils]: 39: Hoare triple {28012#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {28012#false} is VALID [2022-04-28 15:17:18,180 INFO L290 TraceCheckUtils]: 40: Hoare triple {28012#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); {28012#false} is VALID [2022-04-28 15:17:18,180 INFO L290 TraceCheckUtils]: 41: Hoare triple {28012#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {28012#false} is VALID [2022-04-28 15:17:18,180 INFO L290 TraceCheckUtils]: 42: Hoare triple {28012#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); {28012#false} is VALID [2022-04-28 15:17:18,180 INFO L290 TraceCheckUtils]: 43: Hoare triple {28012#false} assume 12292 != #t~mem85;havoc #t~mem85; {28012#false} is VALID [2022-04-28 15:17:18,180 INFO L290 TraceCheckUtils]: 44: Hoare triple {28012#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; {28012#false} is VALID [2022-04-28 15:17:18,180 INFO L290 TraceCheckUtils]: 45: Hoare triple {28012#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); {28012#false} is VALID [2022-04-28 15:17:18,180 INFO L290 TraceCheckUtils]: 46: Hoare triple {28012#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {28012#false} is VALID [2022-04-28 15:17:18,180 INFO L290 TraceCheckUtils]: 47: Hoare triple {28012#false} ~skip~0 := 0; {28012#false} is VALID [2022-04-28 15:17:18,181 INFO L290 TraceCheckUtils]: 48: Hoare triple {28012#false} assume !false; {28012#false} is VALID [2022-04-28 15:17:18,181 INFO L290 TraceCheckUtils]: 49: Hoare triple {28012#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); {28012#false} is VALID [2022-04-28 15:17:18,181 INFO L290 TraceCheckUtils]: 50: Hoare triple {28012#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {28012#false} is VALID [2022-04-28 15:17:18,181 INFO L290 TraceCheckUtils]: 51: Hoare triple {28012#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {28012#false} is VALID [2022-04-28 15:17:18,181 INFO L290 TraceCheckUtils]: 52: Hoare triple {28012#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {28012#false} is VALID [2022-04-28 15:17:18,181 INFO L290 TraceCheckUtils]: 53: Hoare triple {28012#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {28012#false} is VALID [2022-04-28 15:17:18,181 INFO L290 TraceCheckUtils]: 54: Hoare triple {28012#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {28012#false} is VALID [2022-04-28 15:17:18,181 INFO L290 TraceCheckUtils]: 55: Hoare triple {28012#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {28012#false} is VALID [2022-04-28 15:17:18,181 INFO L290 TraceCheckUtils]: 56: Hoare triple {28012#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {28012#false} is VALID [2022-04-28 15:17:18,181 INFO L290 TraceCheckUtils]: 57: Hoare triple {28012#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {28012#false} is VALID [2022-04-28 15:17:18,181 INFO L290 TraceCheckUtils]: 58: Hoare triple {28012#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {28012#false} is VALID [2022-04-28 15:17:18,181 INFO L290 TraceCheckUtils]: 59: Hoare triple {28012#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {28012#false} is VALID [2022-04-28 15:17:18,181 INFO L290 TraceCheckUtils]: 60: Hoare triple {28012#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {28012#false} is VALID [2022-04-28 15:17:18,182 INFO L290 TraceCheckUtils]: 61: Hoare triple {28012#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {28012#false} is VALID [2022-04-28 15:17:18,182 INFO L290 TraceCheckUtils]: 62: Hoare triple {28012#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {28012#false} is VALID [2022-04-28 15:17:18,182 INFO L290 TraceCheckUtils]: 63: Hoare triple {28012#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {28012#false} is VALID [2022-04-28 15:17:18,182 INFO L290 TraceCheckUtils]: 64: Hoare triple {28012#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {28012#false} is VALID [2022-04-28 15:17:18,182 INFO L290 TraceCheckUtils]: 65: Hoare triple {28012#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {28012#false} is VALID [2022-04-28 15:17:18,182 INFO L290 TraceCheckUtils]: 66: Hoare triple {28012#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {28012#false} is VALID [2022-04-28 15:17:18,182 INFO L290 TraceCheckUtils]: 67: Hoare triple {28012#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {28012#false} is VALID [2022-04-28 15:17:18,182 INFO L290 TraceCheckUtils]: 68: Hoare triple {28012#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {28012#false} is VALID [2022-04-28 15:17:18,182 INFO L290 TraceCheckUtils]: 69: Hoare triple {28012#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {28012#false} is VALID [2022-04-28 15:17:18,182 INFO L290 TraceCheckUtils]: 70: Hoare triple {28012#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {28012#false} is VALID [2022-04-28 15:17:18,182 INFO L290 TraceCheckUtils]: 71: Hoare triple {28012#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {28012#false} is VALID [2022-04-28 15:17:18,182 INFO L290 TraceCheckUtils]: 72: Hoare triple {28012#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {28012#false} is VALID [2022-04-28 15:17:18,182 INFO L290 TraceCheckUtils]: 73: Hoare triple {28012#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {28012#false} is VALID [2022-04-28 15:17:18,182 INFO L290 TraceCheckUtils]: 74: Hoare triple {28012#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {28012#false} is VALID [2022-04-28 15:17:18,183 INFO L290 TraceCheckUtils]: 75: Hoare triple {28012#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {28012#false} is VALID [2022-04-28 15:17:18,183 INFO L290 TraceCheckUtils]: 76: Hoare triple {28012#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {28012#false} is VALID [2022-04-28 15:17:18,183 INFO L290 TraceCheckUtils]: 77: Hoare triple {28012#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {28012#false} is VALID [2022-04-28 15:17:18,183 INFO L290 TraceCheckUtils]: 78: Hoare triple {28012#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {28012#false} is VALID [2022-04-28 15:17:18,183 INFO L290 TraceCheckUtils]: 79: Hoare triple {28012#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {28012#false} is VALID [2022-04-28 15:17:18,183 INFO L290 TraceCheckUtils]: 80: Hoare triple {28012#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {28012#false} is VALID [2022-04-28 15:17:18,183 INFO L290 TraceCheckUtils]: 81: Hoare triple {28012#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {28012#false} is VALID [2022-04-28 15:17:18,183 INFO L290 TraceCheckUtils]: 82: Hoare triple {28012#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 72 + ~s.offset, 4); {28012#false} is VALID [2022-04-28 15:17:18,183 INFO L290 TraceCheckUtils]: 83: Hoare triple {28012#false} assume 8673 == #t~mem80;havoc #t~mem80; {28012#false} is VALID [2022-04-28 15:17:18,183 INFO L290 TraceCheckUtils]: 84: Hoare triple {28012#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {28012#false} is VALID [2022-04-28 15:17:18,183 INFO L290 TraceCheckUtils]: 85: Hoare triple {28012#false} assume 3 == ~blastFlag~0; {28012#false} is VALID [2022-04-28 15:17:18,183 INFO L290 TraceCheckUtils]: 86: Hoare triple {28012#false} assume !false; {28012#false} is VALID [2022-04-28 15:17:18,184 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:17:18,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:17:18,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537834810] [2022-04-28 15:17:18,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537834810] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:18,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:18,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:18,185 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:17:18,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1593394094] [2022-04-28 15:17:18,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1593394094] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:18,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:18,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:18,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240880999] [2022-04-28 15:17:18,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:17:18,185 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:17:18,186 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:17:18,186 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:17:18,243 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:17:18,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:17:18,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:18,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:17:18,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:17:18,244 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:17:20,266 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:21,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:21,386 INFO L93 Difference]: Finished difference Result 585 states and 902 transitions. [2022-04-28 15:17:21,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:17:21,387 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:17:21,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:17:21,387 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:17:21,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 566 transitions. [2022-04-28 15:17:21,389 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:17:21,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 566 transitions. [2022-04-28 15:17:21,392 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 566 transitions. [2022-04-28 15:17:21,753 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:17:21,759 INFO L225 Difference]: With dead ends: 585 [2022-04-28 15:17:21,759 INFO L226 Difference]: Without dead ends: 361 [2022-04-28 15:17:21,760 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:21,760 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:17:21,760 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:17:21,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2022-04-28 15:17:21,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 252. [2022-04-28 15:17:21,767 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:17:21,768 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:17:21,768 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:17:21,768 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:17:21,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:21,773 INFO L93 Difference]: Finished difference Result 361 states and 546 transitions. [2022-04-28 15:17:21,773 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 546 transitions. [2022-04-28 15:17:21,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:21,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:21,774 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:17:21,774 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:17:21,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:21,779 INFO L93 Difference]: Finished difference Result 361 states and 546 transitions. [2022-04-28 15:17:21,779 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 546 transitions. [2022-04-28 15:17:21,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:21,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:21,780 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:17:21,780 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:17:21,780 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:17:21,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 382 transitions. [2022-04-28 15:17:21,784 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 382 transitions. Word has length 87 [2022-04-28 15:17:21,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:17:21,784 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 382 transitions. [2022-04-28 15:17:21,784 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:17:21,784 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 252 states and 382 transitions. [2022-04-28 15:17:22,053 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:17:22,054 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 382 transitions. [2022-04-28 15:17:22,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-04-28 15:17:22,054 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:17:22,054 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:17:22,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-28 15:17:22,055 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:17:22,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:17:22,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1295416728, now seen corresponding path program 1 times [2022-04-28 15:17:22,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:22,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [552069610] [2022-04-28 15:17:22,086 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:17:22,086 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:17:22,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1295416728, now seen corresponding path program 2 times [2022-04-28 15:17:22,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:17:22,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094047313] [2022-04-28 15:17:22,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:17:22,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:17:22,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:22,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:17:22,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:22,200 INFO L290 TraceCheckUtils]: 0: Hoare triple {30426#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {30419#true} is VALID [2022-04-28 15:17:22,201 INFO L290 TraceCheckUtils]: 1: Hoare triple {30419#true} assume true; {30419#true} is VALID [2022-04-28 15:17:22,201 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30419#true} {30419#true} #661#return; {30419#true} is VALID [2022-04-28 15:17:22,201 INFO L272 TraceCheckUtils]: 0: Hoare triple {30419#true} call ULTIMATE.init(); {30426#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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:22,201 INFO L290 TraceCheckUtils]: 1: Hoare triple {30426#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {30419#true} is VALID [2022-04-28 15:17:22,201 INFO L290 TraceCheckUtils]: 2: Hoare triple {30419#true} assume true; {30419#true} is VALID [2022-04-28 15:17:22,202 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30419#true} {30419#true} #661#return; {30419#true} is VALID [2022-04-28 15:17:22,202 INFO L272 TraceCheckUtils]: 4: Hoare triple {30419#true} call #t~ret161 := main(); {30419#true} is VALID [2022-04-28 15:17:22,202 INFO L290 TraceCheckUtils]: 5: Hoare triple {30419#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; {30419#true} is VALID [2022-04-28 15:17:22,202 INFO L290 TraceCheckUtils]: 6: Hoare triple {30419#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {30419#true} is VALID [2022-04-28 15:17:22,202 INFO L272 TraceCheckUtils]: 7: Hoare triple {30419#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {30419#true} is VALID [2022-04-28 15:17:22,202 INFO L290 TraceCheckUtils]: 8: Hoare triple {30419#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); {30419#true} is VALID [2022-04-28 15:17:22,202 INFO L290 TraceCheckUtils]: 9: Hoare triple {30419#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; {30419#true} is VALID [2022-04-28 15:17:22,202 INFO L290 TraceCheckUtils]: 10: Hoare triple {30419#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; {30419#true} is VALID [2022-04-28 15:17:22,202 INFO L290 TraceCheckUtils]: 11: Hoare triple {30419#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {30419#true} is VALID [2022-04-28 15:17:22,202 INFO L290 TraceCheckUtils]: 12: Hoare triple {30419#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {30419#true} is VALID [2022-04-28 15:17:22,202 INFO L290 TraceCheckUtils]: 13: Hoare triple {30419#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {30419#true} is VALID [2022-04-28 15:17:22,202 INFO L290 TraceCheckUtils]: 14: Hoare triple {30419#true} assume !false; {30419#true} is VALID [2022-04-28 15:17:22,202 INFO L290 TraceCheckUtils]: 15: Hoare triple {30419#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); {30419#true} is VALID [2022-04-28 15:17:22,202 INFO L290 TraceCheckUtils]: 16: Hoare triple {30419#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {30419#true} is VALID [2022-04-28 15:17:22,203 INFO L290 TraceCheckUtils]: 17: Hoare triple {30419#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {30419#true} is VALID [2022-04-28 15:17:22,203 INFO L290 TraceCheckUtils]: 18: Hoare triple {30419#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {30419#true} is VALID [2022-04-28 15:17:22,203 INFO L290 TraceCheckUtils]: 19: Hoare triple {30419#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {30419#true} is VALID [2022-04-28 15:17:22,203 INFO L290 TraceCheckUtils]: 20: Hoare triple {30419#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {30419#true} is VALID [2022-04-28 15:17:22,203 INFO L290 TraceCheckUtils]: 21: Hoare triple {30419#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {30419#true} is VALID [2022-04-28 15:17:22,203 INFO L290 TraceCheckUtils]: 22: Hoare triple {30419#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {30419#true} is VALID [2022-04-28 15:17:22,203 INFO L290 TraceCheckUtils]: 23: Hoare triple {30419#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {30419#true} is VALID [2022-04-28 15:17:22,203 INFO L290 TraceCheckUtils]: 24: Hoare triple {30419#true} assume 8464 == #t~mem55;havoc #t~mem55; {30419#true} is VALID [2022-04-28 15:17:22,203 INFO L290 TraceCheckUtils]: 25: Hoare triple {30419#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; {30419#true} is VALID [2022-04-28 15:17:22,203 INFO L290 TraceCheckUtils]: 26: Hoare triple {30419#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {30419#true} is VALID [2022-04-28 15:17:22,204 INFO L290 TraceCheckUtils]: 27: Hoare triple {30419#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); {30424#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:22,204 INFO L290 TraceCheckUtils]: 28: Hoare triple {30424#(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); {30424#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:22,205 INFO L290 TraceCheckUtils]: 29: Hoare triple {30424#(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; {30424#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:22,205 INFO L290 TraceCheckUtils]: 30: Hoare triple {30424#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} ~skip~0 := 0; {30424#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:22,205 INFO L290 TraceCheckUtils]: 31: Hoare triple {30424#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {30424#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:22,206 INFO L290 TraceCheckUtils]: 32: Hoare triple {30424#(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); {30424#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:22,206 INFO L290 TraceCheckUtils]: 33: Hoare triple {30424#(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); {30424#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:22,206 INFO L290 TraceCheckUtils]: 34: Hoare triple {30424#(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); {30424#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:22,207 INFO L290 TraceCheckUtils]: 35: Hoare triple {30424#(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); {30424#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:22,207 INFO L290 TraceCheckUtils]: 36: Hoare triple {30424#(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); {30425#(not (= |ssl3_accept_#t~mem51| 8195))} is VALID [2022-04-28 15:17:22,207 INFO L290 TraceCheckUtils]: 37: Hoare triple {30425#(not (= |ssl3_accept_#t~mem51| 8195))} assume 8195 == #t~mem51;havoc #t~mem51; {30420#false} is VALID [2022-04-28 15:17:22,207 INFO L290 TraceCheckUtils]: 38: Hoare triple {30420#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {30420#false} is VALID [2022-04-28 15:17:22,207 INFO L290 TraceCheckUtils]: 39: Hoare triple {30420#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {30420#false} is VALID [2022-04-28 15:17:22,207 INFO L290 TraceCheckUtils]: 40: Hoare triple {30420#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {30420#false} is VALID [2022-04-28 15:17:22,208 INFO L290 TraceCheckUtils]: 41: Hoare triple {30420#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); {30420#false} is VALID [2022-04-28 15:17:22,208 INFO L290 TraceCheckUtils]: 42: Hoare triple {30420#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {30420#false} is VALID [2022-04-28 15:17:22,208 INFO L290 TraceCheckUtils]: 43: Hoare triple {30420#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); {30420#false} is VALID [2022-04-28 15:17:22,208 INFO L290 TraceCheckUtils]: 44: Hoare triple {30420#false} assume 12292 != #t~mem85;havoc #t~mem85; {30420#false} is VALID [2022-04-28 15:17:22,208 INFO L290 TraceCheckUtils]: 45: Hoare triple {30420#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; {30420#false} is VALID [2022-04-28 15:17:22,208 INFO L290 TraceCheckUtils]: 46: Hoare triple {30420#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); {30420#false} is VALID [2022-04-28 15:17:22,208 INFO L290 TraceCheckUtils]: 47: Hoare triple {30420#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {30420#false} is VALID [2022-04-28 15:17:22,208 INFO L290 TraceCheckUtils]: 48: Hoare triple {30420#false} ~skip~0 := 0; {30420#false} is VALID [2022-04-28 15:17:22,208 INFO L290 TraceCheckUtils]: 49: Hoare triple {30420#false} assume !false; {30420#false} is VALID [2022-04-28 15:17:22,208 INFO L290 TraceCheckUtils]: 50: Hoare triple {30420#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); {30420#false} is VALID [2022-04-28 15:17:22,208 INFO L290 TraceCheckUtils]: 51: Hoare triple {30420#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {30420#false} is VALID [2022-04-28 15:17:22,208 INFO L290 TraceCheckUtils]: 52: Hoare triple {30420#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {30420#false} is VALID [2022-04-28 15:17:22,208 INFO L290 TraceCheckUtils]: 53: Hoare triple {30420#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {30420#false} is VALID [2022-04-28 15:17:22,208 INFO L290 TraceCheckUtils]: 54: Hoare triple {30420#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {30420#false} is VALID [2022-04-28 15:17:22,209 INFO L290 TraceCheckUtils]: 55: Hoare triple {30420#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {30420#false} is VALID [2022-04-28 15:17:22,209 INFO L290 TraceCheckUtils]: 56: Hoare triple {30420#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {30420#false} is VALID [2022-04-28 15:17:22,209 INFO L290 TraceCheckUtils]: 57: Hoare triple {30420#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {30420#false} is VALID [2022-04-28 15:17:22,209 INFO L290 TraceCheckUtils]: 58: Hoare triple {30420#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {30420#false} is VALID [2022-04-28 15:17:22,209 INFO L290 TraceCheckUtils]: 59: Hoare triple {30420#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {30420#false} is VALID [2022-04-28 15:17:22,209 INFO L290 TraceCheckUtils]: 60: Hoare triple {30420#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {30420#false} is VALID [2022-04-28 15:17:22,209 INFO L290 TraceCheckUtils]: 61: Hoare triple {30420#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {30420#false} is VALID [2022-04-28 15:17:22,209 INFO L290 TraceCheckUtils]: 62: Hoare triple {30420#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {30420#false} is VALID [2022-04-28 15:17:22,209 INFO L290 TraceCheckUtils]: 63: Hoare triple {30420#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {30420#false} is VALID [2022-04-28 15:17:22,209 INFO L290 TraceCheckUtils]: 64: Hoare triple {30420#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {30420#false} is VALID [2022-04-28 15:17:22,209 INFO L290 TraceCheckUtils]: 65: Hoare triple {30420#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {30420#false} is VALID [2022-04-28 15:17:22,209 INFO L290 TraceCheckUtils]: 66: Hoare triple {30420#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {30420#false} is VALID [2022-04-28 15:17:22,209 INFO L290 TraceCheckUtils]: 67: Hoare triple {30420#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {30420#false} is VALID [2022-04-28 15:17:22,209 INFO L290 TraceCheckUtils]: 68: Hoare triple {30420#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {30420#false} is VALID [2022-04-28 15:17:22,210 INFO L290 TraceCheckUtils]: 69: Hoare triple {30420#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {30420#false} is VALID [2022-04-28 15:17:22,210 INFO L290 TraceCheckUtils]: 70: Hoare triple {30420#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {30420#false} is VALID [2022-04-28 15:17:22,210 INFO L290 TraceCheckUtils]: 71: Hoare triple {30420#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {30420#false} is VALID [2022-04-28 15:17:22,210 INFO L290 TraceCheckUtils]: 72: Hoare triple {30420#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {30420#false} is VALID [2022-04-28 15:17:22,210 INFO L290 TraceCheckUtils]: 73: Hoare triple {30420#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {30420#false} is VALID [2022-04-28 15:17:22,210 INFO L290 TraceCheckUtils]: 74: Hoare triple {30420#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {30420#false} is VALID [2022-04-28 15:17:22,210 INFO L290 TraceCheckUtils]: 75: Hoare triple {30420#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {30420#false} is VALID [2022-04-28 15:17:22,210 INFO L290 TraceCheckUtils]: 76: Hoare triple {30420#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {30420#false} is VALID [2022-04-28 15:17:22,210 INFO L290 TraceCheckUtils]: 77: Hoare triple {30420#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {30420#false} is VALID [2022-04-28 15:17:22,210 INFO L290 TraceCheckUtils]: 78: Hoare triple {30420#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {30420#false} is VALID [2022-04-28 15:17:22,210 INFO L290 TraceCheckUtils]: 79: Hoare triple {30420#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {30420#false} is VALID [2022-04-28 15:17:22,210 INFO L290 TraceCheckUtils]: 80: Hoare triple {30420#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {30420#false} is VALID [2022-04-28 15:17:22,210 INFO L290 TraceCheckUtils]: 81: Hoare triple {30420#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {30420#false} is VALID [2022-04-28 15:17:22,210 INFO L290 TraceCheckUtils]: 82: Hoare triple {30420#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {30420#false} is VALID [2022-04-28 15:17:22,211 INFO L290 TraceCheckUtils]: 83: Hoare triple {30420#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 72 + ~s.offset, 4); {30420#false} is VALID [2022-04-28 15:17:22,211 INFO L290 TraceCheckUtils]: 84: Hoare triple {30420#false} assume 8673 == #t~mem80;havoc #t~mem80; {30420#false} is VALID [2022-04-28 15:17:22,211 INFO L290 TraceCheckUtils]: 85: Hoare triple {30420#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {30420#false} is VALID [2022-04-28 15:17:22,211 INFO L290 TraceCheckUtils]: 86: Hoare triple {30420#false} assume 3 == ~blastFlag~0; {30420#false} is VALID [2022-04-28 15:17:22,211 INFO L290 TraceCheckUtils]: 87: Hoare triple {30420#false} assume !false; {30420#false} is VALID [2022-04-28 15:17:22,211 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:17:22,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:17:22,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094047313] [2022-04-28 15:17:22,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094047313] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:22,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:22,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:22,212 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:17:22,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [552069610] [2022-04-28 15:17:22,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [552069610] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:22,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:22,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:22,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680429175] [2022-04-28 15:17:22,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:17:22,212 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:17:22,213 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:17:22,213 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:17:22,268 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:17:22,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:17:22,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:22,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:17:22,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:17:22,271 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:17:24,292 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:25,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:25,430 INFO L93 Difference]: Finished difference Result 587 states and 898 transitions. [2022-04-28 15:17:25,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:17:25,431 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:17:25,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:17:25,431 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:17:25,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 565 transitions. [2022-04-28 15:17:25,433 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:17:25,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 565 transitions. [2022-04-28 15:17:25,435 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 565 transitions. [2022-04-28 15:17:25,798 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:17:25,804 INFO L225 Difference]: With dead ends: 587 [2022-04-28 15:17:25,804 INFO L226 Difference]: Without dead ends: 361 [2022-04-28 15:17:25,805 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:25,805 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:17:25,805 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:17:25,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2022-04-28 15:17:25,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 253. [2022-04-28 15:17:25,812 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:17:25,812 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:17:25,813 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:17:25,813 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:17:25,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:25,817 INFO L93 Difference]: Finished difference Result 361 states and 542 transitions. [2022-04-28 15:17:25,817 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 542 transitions. [2022-04-28 15:17:25,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:25,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:25,818 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:17:25,818 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:17:25,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:25,823 INFO L93 Difference]: Finished difference Result 361 states and 542 transitions. [2022-04-28 15:17:25,823 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 542 transitions. [2022-04-28 15:17:25,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:25,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:25,823 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:17:25,824 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:17:25,824 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:17:25,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 380 transitions. [2022-04-28 15:17:25,827 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 380 transitions. Word has length 88 [2022-04-28 15:17:25,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:17:25,827 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 380 transitions. [2022-04-28 15:17:25,827 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:17:25,827 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 253 states and 380 transitions. [2022-04-28 15:17:26,085 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:17:26,085 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 380 transitions. [2022-04-28 15:17:26,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-04-28 15:17:26,094 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:17:26,094 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:17:26,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-28 15:17:26,094 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:17:26,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:17:26,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1325248613, now seen corresponding path program 1 times [2022-04-28 15:17:26,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:26,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1006632346] [2022-04-28 15:17:26,134 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:17:26,134 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:17:26,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1325248613, now seen corresponding path program 2 times [2022-04-28 15:17:26,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:17:26,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376653360] [2022-04-28 15:17:26,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:17:26,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:17:26,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:26,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:17:26,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:26,268 INFO L290 TraceCheckUtils]: 0: Hoare triple {32840#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {32833#true} is VALID [2022-04-28 15:17:26,268 INFO L290 TraceCheckUtils]: 1: Hoare triple {32833#true} assume true; {32833#true} is VALID [2022-04-28 15:17:26,268 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32833#true} {32833#true} #661#return; {32833#true} is VALID [2022-04-28 15:17:26,269 INFO L272 TraceCheckUtils]: 0: Hoare triple {32833#true} call ULTIMATE.init(); {32840#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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:26,269 INFO L290 TraceCheckUtils]: 1: Hoare triple {32840#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {32833#true} is VALID [2022-04-28 15:17:26,269 INFO L290 TraceCheckUtils]: 2: Hoare triple {32833#true} assume true; {32833#true} is VALID [2022-04-28 15:17:26,269 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32833#true} {32833#true} #661#return; {32833#true} is VALID [2022-04-28 15:17:26,269 INFO L272 TraceCheckUtils]: 4: Hoare triple {32833#true} call #t~ret161 := main(); {32833#true} is VALID [2022-04-28 15:17:26,269 INFO L290 TraceCheckUtils]: 5: Hoare triple {32833#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; {32833#true} is VALID [2022-04-28 15:17:26,270 INFO L290 TraceCheckUtils]: 6: Hoare triple {32833#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {32833#true} is VALID [2022-04-28 15:17:26,270 INFO L272 TraceCheckUtils]: 7: Hoare triple {32833#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {32833#true} is VALID [2022-04-28 15:17:26,270 INFO L290 TraceCheckUtils]: 8: Hoare triple {32833#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); {32833#true} is VALID [2022-04-28 15:17:26,270 INFO L290 TraceCheckUtils]: 9: Hoare triple {32833#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; {32833#true} is VALID [2022-04-28 15:17:26,270 INFO L290 TraceCheckUtils]: 10: Hoare triple {32833#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; {32833#true} is VALID [2022-04-28 15:17:26,270 INFO L290 TraceCheckUtils]: 11: Hoare triple {32833#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {32833#true} is VALID [2022-04-28 15:17:26,270 INFO L290 TraceCheckUtils]: 12: Hoare triple {32833#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {32833#true} is VALID [2022-04-28 15:17:26,270 INFO L290 TraceCheckUtils]: 13: Hoare triple {32833#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {32833#true} is VALID [2022-04-28 15:17:26,270 INFO L290 TraceCheckUtils]: 14: Hoare triple {32833#true} assume !false; {32833#true} is VALID [2022-04-28 15:17:26,270 INFO L290 TraceCheckUtils]: 15: Hoare triple {32833#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); {32833#true} is VALID [2022-04-28 15:17:26,270 INFO L290 TraceCheckUtils]: 16: Hoare triple {32833#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {32833#true} is VALID [2022-04-28 15:17:26,270 INFO L290 TraceCheckUtils]: 17: Hoare triple {32833#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {32833#true} is VALID [2022-04-28 15:17:26,270 INFO L290 TraceCheckUtils]: 18: Hoare triple {32833#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {32833#true} is VALID [2022-04-28 15:17:26,270 INFO L290 TraceCheckUtils]: 19: Hoare triple {32833#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {32833#true} is VALID [2022-04-28 15:17:26,271 INFO L290 TraceCheckUtils]: 20: Hoare triple {32833#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {32833#true} is VALID [2022-04-28 15:17:26,271 INFO L290 TraceCheckUtils]: 21: Hoare triple {32833#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {32833#true} is VALID [2022-04-28 15:17:26,271 INFO L290 TraceCheckUtils]: 22: Hoare triple {32833#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {32833#true} is VALID [2022-04-28 15:17:26,271 INFO L290 TraceCheckUtils]: 23: Hoare triple {32833#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {32833#true} is VALID [2022-04-28 15:17:26,271 INFO L290 TraceCheckUtils]: 24: Hoare triple {32833#true} assume 8464 == #t~mem55;havoc #t~mem55; {32833#true} is VALID [2022-04-28 15:17:26,271 INFO L290 TraceCheckUtils]: 25: Hoare triple {32833#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; {32833#true} is VALID [2022-04-28 15:17:26,271 INFO L290 TraceCheckUtils]: 26: Hoare triple {32833#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {32833#true} is VALID [2022-04-28 15:17:26,271 INFO L290 TraceCheckUtils]: 27: Hoare triple {32833#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); {32833#true} is VALID [2022-04-28 15:17:26,271 INFO L290 TraceCheckUtils]: 28: Hoare triple {32833#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); {32833#true} is VALID [2022-04-28 15:17:26,271 INFO L290 TraceCheckUtils]: 29: Hoare triple {32833#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {32833#true} is VALID [2022-04-28 15:17:26,271 INFO L290 TraceCheckUtils]: 30: Hoare triple {32833#true} ~skip~0 := 0; {32833#true} is VALID [2022-04-28 15:17:26,271 INFO L290 TraceCheckUtils]: 31: Hoare triple {32833#true} assume !false; {32833#true} is VALID [2022-04-28 15:17:26,271 INFO L290 TraceCheckUtils]: 32: Hoare triple {32833#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); {32833#true} is VALID [2022-04-28 15:17:26,271 INFO L290 TraceCheckUtils]: 33: Hoare triple {32833#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {32833#true} is VALID [2022-04-28 15:17:26,272 INFO L290 TraceCheckUtils]: 34: Hoare triple {32833#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {32833#true} is VALID [2022-04-28 15:17:26,272 INFO L290 TraceCheckUtils]: 35: Hoare triple {32833#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {32833#true} is VALID [2022-04-28 15:17:26,272 INFO L290 TraceCheckUtils]: 36: Hoare triple {32833#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {32833#true} is VALID [2022-04-28 15:17:26,272 INFO L290 TraceCheckUtils]: 37: Hoare triple {32833#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {32833#true} is VALID [2022-04-28 15:17:26,272 INFO L290 TraceCheckUtils]: 38: Hoare triple {32833#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {32833#true} is VALID [2022-04-28 15:17:26,272 INFO L290 TraceCheckUtils]: 39: Hoare triple {32833#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {32833#true} is VALID [2022-04-28 15:17:26,272 INFO L290 TraceCheckUtils]: 40: Hoare triple {32833#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {32833#true} is VALID [2022-04-28 15:17:26,272 INFO L290 TraceCheckUtils]: 41: Hoare triple {32833#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {32833#true} is VALID [2022-04-28 15:17:26,272 INFO L290 TraceCheckUtils]: 42: Hoare triple {32833#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {32833#true} is VALID [2022-04-28 15:17:26,272 INFO L290 TraceCheckUtils]: 43: Hoare triple {32833#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {32833#true} is VALID [2022-04-28 15:17:26,272 INFO L290 TraceCheckUtils]: 44: Hoare triple {32833#true} assume 8496 == #t~mem58;havoc #t~mem58; {32833#true} is VALID [2022-04-28 15:17:26,272 INFO L290 TraceCheckUtils]: 45: Hoare triple {32833#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {32833#true} is VALID [2022-04-28 15:17:26,272 INFO L290 TraceCheckUtils]: 46: Hoare triple {32833#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {32833#true} is VALID [2022-04-28 15:17:26,272 INFO L290 TraceCheckUtils]: 47: Hoare triple {32833#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {32833#true} is VALID [2022-04-28 15:17:26,273 INFO L290 TraceCheckUtils]: 48: Hoare triple {32833#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:26,274 INFO L290 TraceCheckUtils]: 49: Hoare triple {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:26,274 INFO L290 TraceCheckUtils]: 50: Hoare triple {32838#(= 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); {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:26,274 INFO L290 TraceCheckUtils]: 51: Hoare triple {32838#(= 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; {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:26,275 INFO L290 TraceCheckUtils]: 52: Hoare triple {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:26,275 INFO L290 TraceCheckUtils]: 53: Hoare triple {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:26,275 INFO L290 TraceCheckUtils]: 54: Hoare triple {32838#(= 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); {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:26,276 INFO L290 TraceCheckUtils]: 55: Hoare triple {32838#(= 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); {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:26,276 INFO L290 TraceCheckUtils]: 56: Hoare triple {32838#(= 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); {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:26,276 INFO L290 TraceCheckUtils]: 57: Hoare triple {32838#(= 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); {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:26,277 INFO L290 TraceCheckUtils]: 58: Hoare triple {32838#(= 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); {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:26,277 INFO L290 TraceCheckUtils]: 59: Hoare triple {32838#(= 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); {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:26,277 INFO L290 TraceCheckUtils]: 60: Hoare triple {32838#(= 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); {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:26,278 INFO L290 TraceCheckUtils]: 61: Hoare triple {32838#(= 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); {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:26,278 INFO L290 TraceCheckUtils]: 62: Hoare triple {32838#(= 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); {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:26,278 INFO L290 TraceCheckUtils]: 63: Hoare triple {32838#(= 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); {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:26,278 INFO L290 TraceCheckUtils]: 64: Hoare triple {32838#(= 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); {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:26,279 INFO L290 TraceCheckUtils]: 65: Hoare triple {32838#(= 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); {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:26,279 INFO L290 TraceCheckUtils]: 66: Hoare triple {32838#(= 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); {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:26,279 INFO L290 TraceCheckUtils]: 67: Hoare triple {32838#(= 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); {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:26,280 INFO L290 TraceCheckUtils]: 68: Hoare triple {32838#(= 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); {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:26,280 INFO L290 TraceCheckUtils]: 69: Hoare triple {32838#(= 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); {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:26,280 INFO L290 TraceCheckUtils]: 70: Hoare triple {32838#(= 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); {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:26,281 INFO L290 TraceCheckUtils]: 71: Hoare triple {32838#(= 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); {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:26,281 INFO L290 TraceCheckUtils]: 72: Hoare triple {32838#(= 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); {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:26,281 INFO L290 TraceCheckUtils]: 73: Hoare triple {32838#(= 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); {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:26,282 INFO L290 TraceCheckUtils]: 74: Hoare triple {32838#(= 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); {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:26,282 INFO L290 TraceCheckUtils]: 75: Hoare triple {32838#(= 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); {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:26,282 INFO L290 TraceCheckUtils]: 76: Hoare triple {32838#(= 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); {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:26,283 INFO L290 TraceCheckUtils]: 77: Hoare triple {32838#(= 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); {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:26,283 INFO L290 TraceCheckUtils]: 78: Hoare triple {32838#(= 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); {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:26,283 INFO L290 TraceCheckUtils]: 79: Hoare triple {32838#(= 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); {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:26,284 INFO L290 TraceCheckUtils]: 80: Hoare triple {32838#(= 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); {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:26,284 INFO L290 TraceCheckUtils]: 81: Hoare triple {32838#(= 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); {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:26,284 INFO L290 TraceCheckUtils]: 82: Hoare triple {32838#(= 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); {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:26,285 INFO L290 TraceCheckUtils]: 83: Hoare triple {32838#(= 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); {32838#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:26,285 INFO L290 TraceCheckUtils]: 84: Hoare triple {32838#(= 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); {32839#(= |ssl3_accept_#t~mem77| 8656)} is VALID [2022-04-28 15:17:26,285 INFO L290 TraceCheckUtils]: 85: Hoare triple {32839#(= |ssl3_accept_#t~mem77| 8656)} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {32834#false} is VALID [2022-04-28 15:17:26,285 INFO L290 TraceCheckUtils]: 86: Hoare triple {32834#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {32834#false} is VALID [2022-04-28 15:17:26,285 INFO L290 TraceCheckUtils]: 87: Hoare triple {32834#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 72 + ~s.offset, 4); {32834#false} is VALID [2022-04-28 15:17:26,285 INFO L290 TraceCheckUtils]: 88: Hoare triple {32834#false} assume 8673 == #t~mem80;havoc #t~mem80; {32834#false} is VALID [2022-04-28 15:17:26,285 INFO L290 TraceCheckUtils]: 89: Hoare triple {32834#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {32834#false} is VALID [2022-04-28 15:17:26,285 INFO L290 TraceCheckUtils]: 90: Hoare triple {32834#false} assume 3 == ~blastFlag~0; {32834#false} is VALID [2022-04-28 15:17:26,286 INFO L290 TraceCheckUtils]: 91: Hoare triple {32834#false} assume !false; {32834#false} is VALID [2022-04-28 15:17:26,286 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:17:26,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:17:26,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376653360] [2022-04-28 15:17:26,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376653360] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:26,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:26,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:26,286 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:17:26,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1006632346] [2022-04-28 15:17:26,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1006632346] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:26,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:26,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:26,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214944141] [2022-04-28 15:17:26,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:17:26,287 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:17:26,287 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:17:26,287 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:26,343 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:26,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:17:26,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:26,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:17:26,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:17:26,344 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:17:28,365 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:29,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:29,688 INFO L93 Difference]: Finished difference Result 585 states and 887 transitions. [2022-04-28 15:17:29,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:17:29,688 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:17:29,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:17:29,688 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:29,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 537 transitions. [2022-04-28 15:17:29,690 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:29,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 537 transitions. [2022-04-28 15:17:29,692 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 537 transitions. [2022-04-28 15:17:30,017 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:17:30,023 INFO L225 Difference]: With dead ends: 585 [2022-04-28 15:17:30,023 INFO L226 Difference]: Without dead ends: 358 [2022-04-28 15:17:30,023 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:30,024 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 75 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 15:17:30,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 473 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 529 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 15:17:30,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2022-04-28 15:17:30,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 296. [2022-04-28 15:17:30,032 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:17:30,032 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:17:30,033 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:17:30,033 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:17:30,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:30,037 INFO L93 Difference]: Finished difference Result 358 states and 536 transitions. [2022-04-28 15:17:30,037 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 536 transitions. [2022-04-28 15:17:30,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:30,038 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:30,038 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:17:30,038 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:17:30,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:30,043 INFO L93 Difference]: Finished difference Result 358 states and 536 transitions. [2022-04-28 15:17:30,043 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 536 transitions. [2022-04-28 15:17:30,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:30,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:30,044 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:17:30,044 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:17:30,044 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:17:30,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 455 transitions. [2022-04-28 15:17:30,048 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 455 transitions. Word has length 92 [2022-04-28 15:17:30,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:17:30,048 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 455 transitions. [2022-04-28 15:17:30,049 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:30,049 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 296 states and 455 transitions. [2022-04-28 15:17:30,400 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:17:30,400 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 455 transitions. [2022-04-28 15:17:30,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-04-28 15:17:30,400 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:17:30,401 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:17:30,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-28 15:17:30,401 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:17:30,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:17:30,401 INFO L85 PathProgramCache]: Analyzing trace with hash -724139229, now seen corresponding path program 1 times [2022-04-28 15:17:30,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:30,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1883122574] [2022-04-28 15:17:30,436 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:17:30,437 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:17:30,437 INFO L85 PathProgramCache]: Analyzing trace with hash -724139229, now seen corresponding path program 2 times [2022-04-28 15:17:30,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:17:30,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634064787] [2022-04-28 15:17:30,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:17:30,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:17:30,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:30,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:17:30,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:30,561 INFO L290 TraceCheckUtils]: 0: Hoare triple {35330#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {35323#true} is VALID [2022-04-28 15:17:30,562 INFO L290 TraceCheckUtils]: 1: Hoare triple {35323#true} assume true; {35323#true} is VALID [2022-04-28 15:17:30,562 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35323#true} {35323#true} #661#return; {35323#true} is VALID [2022-04-28 15:17:30,562 INFO L272 TraceCheckUtils]: 0: Hoare triple {35323#true} call ULTIMATE.init(); {35330#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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,562 INFO L290 TraceCheckUtils]: 1: Hoare triple {35330#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {35323#true} is VALID [2022-04-28 15:17:30,562 INFO L290 TraceCheckUtils]: 2: Hoare triple {35323#true} assume true; {35323#true} is VALID [2022-04-28 15:17:30,562 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35323#true} {35323#true} #661#return; {35323#true} is VALID [2022-04-28 15:17:30,563 INFO L272 TraceCheckUtils]: 4: Hoare triple {35323#true} call #t~ret161 := main(); {35323#true} is VALID [2022-04-28 15:17:30,563 INFO L290 TraceCheckUtils]: 5: Hoare triple {35323#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; {35323#true} is VALID [2022-04-28 15:17:30,563 INFO L290 TraceCheckUtils]: 6: Hoare triple {35323#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {35323#true} is VALID [2022-04-28 15:17:30,563 INFO L272 TraceCheckUtils]: 7: Hoare triple {35323#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {35323#true} is VALID [2022-04-28 15:17:30,563 INFO L290 TraceCheckUtils]: 8: Hoare triple {35323#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); {35323#true} is VALID [2022-04-28 15:17:30,563 INFO L290 TraceCheckUtils]: 9: Hoare triple {35323#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; {35323#true} is VALID [2022-04-28 15:17:30,563 INFO L290 TraceCheckUtils]: 10: Hoare triple {35323#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; {35323#true} is VALID [2022-04-28 15:17:30,563 INFO L290 TraceCheckUtils]: 11: Hoare triple {35323#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {35323#true} is VALID [2022-04-28 15:17:30,563 INFO L290 TraceCheckUtils]: 12: Hoare triple {35323#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {35323#true} is VALID [2022-04-28 15:17:30,563 INFO L290 TraceCheckUtils]: 13: Hoare triple {35323#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {35323#true} is VALID [2022-04-28 15:17:30,563 INFO L290 TraceCheckUtils]: 14: Hoare triple {35323#true} assume !false; {35323#true} is VALID [2022-04-28 15:17:30,563 INFO L290 TraceCheckUtils]: 15: Hoare triple {35323#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); {35323#true} is VALID [2022-04-28 15:17:30,563 INFO L290 TraceCheckUtils]: 16: Hoare triple {35323#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {35323#true} is VALID [2022-04-28 15:17:30,564 INFO L290 TraceCheckUtils]: 17: Hoare triple {35323#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {35323#true} is VALID [2022-04-28 15:17:30,564 INFO L290 TraceCheckUtils]: 18: Hoare triple {35323#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {35323#true} is VALID [2022-04-28 15:17:30,564 INFO L290 TraceCheckUtils]: 19: Hoare triple {35323#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {35323#true} is VALID [2022-04-28 15:17:30,564 INFO L290 TraceCheckUtils]: 20: Hoare triple {35323#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {35323#true} is VALID [2022-04-28 15:17:30,564 INFO L290 TraceCheckUtils]: 21: Hoare triple {35323#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {35323#true} is VALID [2022-04-28 15:17:30,564 INFO L290 TraceCheckUtils]: 22: Hoare triple {35323#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {35323#true} is VALID [2022-04-28 15:17:30,564 INFO L290 TraceCheckUtils]: 23: Hoare triple {35323#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {35323#true} is VALID [2022-04-28 15:17:30,564 INFO L290 TraceCheckUtils]: 24: Hoare triple {35323#true} assume 8464 == #t~mem55;havoc #t~mem55; {35323#true} is VALID [2022-04-28 15:17:30,564 INFO L290 TraceCheckUtils]: 25: Hoare triple {35323#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; {35323#true} is VALID [2022-04-28 15:17:30,564 INFO L290 TraceCheckUtils]: 26: Hoare triple {35323#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {35323#true} is VALID [2022-04-28 15:17:30,564 INFO L290 TraceCheckUtils]: 27: Hoare triple {35323#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); {35323#true} is VALID [2022-04-28 15:17:30,564 INFO L290 TraceCheckUtils]: 28: Hoare triple {35323#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); {35323#true} is VALID [2022-04-28 15:17:30,564 INFO L290 TraceCheckUtils]: 29: Hoare triple {35323#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {35323#true} is VALID [2022-04-28 15:17:30,564 INFO L290 TraceCheckUtils]: 30: Hoare triple {35323#true} ~skip~0 := 0; {35323#true} is VALID [2022-04-28 15:17:30,565 INFO L290 TraceCheckUtils]: 31: Hoare triple {35323#true} assume !false; {35323#true} is VALID [2022-04-28 15:17:30,565 INFO L290 TraceCheckUtils]: 32: Hoare triple {35323#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); {35323#true} is VALID [2022-04-28 15:17:30,565 INFO L290 TraceCheckUtils]: 33: Hoare triple {35323#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {35323#true} is VALID [2022-04-28 15:17:30,565 INFO L290 TraceCheckUtils]: 34: Hoare triple {35323#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {35323#true} is VALID [2022-04-28 15:17:30,565 INFO L290 TraceCheckUtils]: 35: Hoare triple {35323#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {35323#true} is VALID [2022-04-28 15:17:30,565 INFO L290 TraceCheckUtils]: 36: Hoare triple {35323#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {35323#true} is VALID [2022-04-28 15:17:30,565 INFO L290 TraceCheckUtils]: 37: Hoare triple {35323#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {35323#true} is VALID [2022-04-28 15:17:30,565 INFO L290 TraceCheckUtils]: 38: Hoare triple {35323#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {35323#true} is VALID [2022-04-28 15:17:30,565 INFO L290 TraceCheckUtils]: 39: Hoare triple {35323#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {35323#true} is VALID [2022-04-28 15:17:30,565 INFO L290 TraceCheckUtils]: 40: Hoare triple {35323#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {35323#true} is VALID [2022-04-28 15:17:30,565 INFO L290 TraceCheckUtils]: 41: Hoare triple {35323#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {35323#true} is VALID [2022-04-28 15:17:30,565 INFO L290 TraceCheckUtils]: 42: Hoare triple {35323#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {35323#true} is VALID [2022-04-28 15:17:30,565 INFO L290 TraceCheckUtils]: 43: Hoare triple {35323#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {35323#true} is VALID [2022-04-28 15:17:30,565 INFO L290 TraceCheckUtils]: 44: Hoare triple {35323#true} assume 8496 == #t~mem58;havoc #t~mem58; {35323#true} is VALID [2022-04-28 15:17:30,565 INFO L290 TraceCheckUtils]: 45: Hoare triple {35323#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {35323#true} is VALID [2022-04-28 15:17:30,566 INFO L290 TraceCheckUtils]: 46: Hoare triple {35323#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {35323#true} is VALID [2022-04-28 15:17:30,566 INFO L290 TraceCheckUtils]: 47: Hoare triple {35323#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {35323#true} is VALID [2022-04-28 15:17:30,566 INFO L290 TraceCheckUtils]: 48: Hoare triple {35323#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 72 + ~s.offset, 4); {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:30,567 INFO L290 TraceCheckUtils]: 49: Hoare triple {35328#(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); {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:30,567 INFO L290 TraceCheckUtils]: 50: Hoare triple {35328#(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); {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:30,568 INFO L290 TraceCheckUtils]: 51: Hoare triple {35328#(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; {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:30,568 INFO L290 TraceCheckUtils]: 52: Hoare triple {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} ~skip~0 := 0; {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:30,568 INFO L290 TraceCheckUtils]: 53: Hoare triple {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:30,569 INFO L290 TraceCheckUtils]: 54: Hoare triple {35328#(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); {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:30,569 INFO L290 TraceCheckUtils]: 55: Hoare triple {35328#(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); {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:30,569 INFO L290 TraceCheckUtils]: 56: Hoare triple {35328#(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); {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:30,569 INFO L290 TraceCheckUtils]: 57: Hoare triple {35328#(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); {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:30,570 INFO L290 TraceCheckUtils]: 58: Hoare triple {35328#(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); {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:30,570 INFO L290 TraceCheckUtils]: 59: Hoare triple {35328#(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); {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:30,570 INFO L290 TraceCheckUtils]: 60: Hoare triple {35328#(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); {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:30,571 INFO L290 TraceCheckUtils]: 61: Hoare triple {35328#(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); {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:30,571 INFO L290 TraceCheckUtils]: 62: Hoare triple {35328#(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); {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:30,571 INFO L290 TraceCheckUtils]: 63: Hoare triple {35328#(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); {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:30,572 INFO L290 TraceCheckUtils]: 64: Hoare triple {35328#(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); {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:30,572 INFO L290 TraceCheckUtils]: 65: Hoare triple {35328#(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); {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:30,572 INFO L290 TraceCheckUtils]: 66: Hoare triple {35328#(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); {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:30,573 INFO L290 TraceCheckUtils]: 67: Hoare triple {35328#(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); {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:30,573 INFO L290 TraceCheckUtils]: 68: Hoare triple {35328#(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); {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:30,573 INFO L290 TraceCheckUtils]: 69: Hoare triple {35328#(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); {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:30,574 INFO L290 TraceCheckUtils]: 70: Hoare triple {35328#(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); {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:30,574 INFO L290 TraceCheckUtils]: 71: Hoare triple {35328#(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); {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:30,574 INFO L290 TraceCheckUtils]: 72: Hoare triple {35328#(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); {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:30,575 INFO L290 TraceCheckUtils]: 73: Hoare triple {35328#(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); {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:30,575 INFO L290 TraceCheckUtils]: 74: Hoare triple {35328#(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); {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:30,575 INFO L290 TraceCheckUtils]: 75: Hoare triple {35328#(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); {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:30,576 INFO L290 TraceCheckUtils]: 76: Hoare triple {35328#(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); {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:30,576 INFO L290 TraceCheckUtils]: 77: Hoare triple {35328#(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); {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:30,576 INFO L290 TraceCheckUtils]: 78: Hoare triple {35328#(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); {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:30,577 INFO L290 TraceCheckUtils]: 79: Hoare triple {35328#(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); {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:30,577 INFO L290 TraceCheckUtils]: 80: Hoare triple {35328#(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); {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:30,577 INFO L290 TraceCheckUtils]: 81: Hoare triple {35328#(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); {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:30,578 INFO L290 TraceCheckUtils]: 82: Hoare triple {35328#(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); {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:30,578 INFO L290 TraceCheckUtils]: 83: Hoare triple {35328#(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); {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:30,578 INFO L290 TraceCheckUtils]: 84: Hoare triple {35328#(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); {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:30,578 INFO L290 TraceCheckUtils]: 85: Hoare triple {35328#(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); {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:30,579 INFO L290 TraceCheckUtils]: 86: Hoare triple {35328#(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); {35328#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:30,579 INFO L290 TraceCheckUtils]: 87: Hoare triple {35328#(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); {35329#(not (= |ssl3_accept_#t~mem80| 8673))} is VALID [2022-04-28 15:17:30,579 INFO L290 TraceCheckUtils]: 88: Hoare triple {35329#(not (= |ssl3_accept_#t~mem80| 8673))} assume 8673 == #t~mem80;havoc #t~mem80; {35324#false} is VALID [2022-04-28 15:17:30,579 INFO L290 TraceCheckUtils]: 89: Hoare triple {35324#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {35324#false} is VALID [2022-04-28 15:17:30,580 INFO L290 TraceCheckUtils]: 90: Hoare triple {35324#false} assume 3 == ~blastFlag~0; {35324#false} is VALID [2022-04-28 15:17:30,580 INFO L290 TraceCheckUtils]: 91: Hoare triple {35324#false} assume !false; {35324#false} is VALID [2022-04-28 15:17:30,580 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:17:30,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:17:30,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634064787] [2022-04-28 15:17:30,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634064787] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:30,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:30,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:30,581 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:17:30,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1883122574] [2022-04-28 15:17:30,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1883122574] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:30,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:30,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:30,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119286066] [2022-04-28 15:17:30,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:17:30,582 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:17:30,582 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:17:30,582 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:30,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:17:30,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:17:30,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:30,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:17:30,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:17:30,646 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:17:34,564 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:17:36,569 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:38,597 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:17:40,629 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:17:41,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:41,712 INFO L93 Difference]: Finished difference Result 674 states and 1042 transitions. [2022-04-28 15:17:41,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:17:41,712 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:17:41,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:17:41,712 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:41,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 564 transitions. [2022-04-28 15:17:41,715 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:41,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 564 transitions. [2022-04-28 15:17:41,717 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 564 transitions. [2022-04-28 15:17:42,069 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:17:42,076 INFO L225 Difference]: With dead ends: 674 [2022-04-28 15:17:42,076 INFO L226 Difference]: Without dead ends: 402 [2022-04-28 15:17:42,077 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:42,077 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 108 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 61 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:17:42,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 324 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 470 Invalid, 3 Unknown, 0 Unchecked, 8.3s Time] [2022-04-28 15:17:42,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2022-04-28 15:17:42,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 323. [2022-04-28 15:17:42,087 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:17:42,088 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:17:42,088 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:17:42,089 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:17:42,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:42,095 INFO L93 Difference]: Finished difference Result 402 states and 613 transitions. [2022-04-28 15:17:42,095 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 613 transitions. [2022-04-28 15:17:42,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:42,095 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:42,096 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:17:42,096 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:17:42,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:42,103 INFO L93 Difference]: Finished difference Result 402 states and 613 transitions. [2022-04-28 15:17:42,103 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 613 transitions. [2022-04-28 15:17:42,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:42,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:42,104 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:17:42,104 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:17:42,104 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:17:42,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 508 transitions. [2022-04-28 15:17:42,109 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 508 transitions. Word has length 92 [2022-04-28 15:17:42,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:17:42,110 INFO L495 AbstractCegarLoop]: Abstraction has 323 states and 508 transitions. [2022-04-28 15:17:42,110 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:42,110 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 323 states and 508 transitions. [2022-04-28 15:17:42,513 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:17:42,513 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 508 transitions. [2022-04-28 15:17:42,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-04-28 15:17:42,514 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:17:42,514 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:17:42,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-28 15:17:42,514 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:17:42,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:17:42,515 INFO L85 PathProgramCache]: Analyzing trace with hash 2039657454, now seen corresponding path program 1 times [2022-04-28 15:17:42,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:42,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2041417173] [2022-04-28 15:17:42,577 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:17:42,578 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:17:42,578 INFO L85 PathProgramCache]: Analyzing trace with hash 2039657454, now seen corresponding path program 2 times [2022-04-28 15:17:42,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:17:42,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381880001] [2022-04-28 15:17:42,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:17:42,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:17:42,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:42,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:17:42,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:42,691 INFO L290 TraceCheckUtils]: 0: Hoare triple {38140#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {38133#true} is VALID [2022-04-28 15:17:42,692 INFO L290 TraceCheckUtils]: 1: Hoare triple {38133#true} assume true; {38133#true} is VALID [2022-04-28 15:17:42,692 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38133#true} {38133#true} #661#return; {38133#true} is VALID [2022-04-28 15:17:42,692 INFO L272 TraceCheckUtils]: 0: Hoare triple {38133#true} call ULTIMATE.init(); {38140#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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:42,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {38140#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {38133#true} is VALID [2022-04-28 15:17:42,693 INFO L290 TraceCheckUtils]: 2: Hoare triple {38133#true} assume true; {38133#true} is VALID [2022-04-28 15:17:42,693 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38133#true} {38133#true} #661#return; {38133#true} is VALID [2022-04-28 15:17:42,693 INFO L272 TraceCheckUtils]: 4: Hoare triple {38133#true} call #t~ret161 := main(); {38133#true} is VALID [2022-04-28 15:17:42,693 INFO L290 TraceCheckUtils]: 5: Hoare triple {38133#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; {38133#true} is VALID [2022-04-28 15:17:42,693 INFO L290 TraceCheckUtils]: 6: Hoare triple {38133#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {38133#true} is VALID [2022-04-28 15:17:42,693 INFO L272 TraceCheckUtils]: 7: Hoare triple {38133#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {38133#true} is VALID [2022-04-28 15:17:42,693 INFO L290 TraceCheckUtils]: 8: Hoare triple {38133#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); {38133#true} is VALID [2022-04-28 15:17:42,693 INFO L290 TraceCheckUtils]: 9: Hoare triple {38133#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; {38133#true} is VALID [2022-04-28 15:17:42,693 INFO L290 TraceCheckUtils]: 10: Hoare triple {38133#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; {38133#true} is VALID [2022-04-28 15:17:42,694 INFO L290 TraceCheckUtils]: 11: Hoare triple {38133#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {38133#true} is VALID [2022-04-28 15:17:42,694 INFO L290 TraceCheckUtils]: 12: Hoare triple {38133#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {38133#true} is VALID [2022-04-28 15:17:42,694 INFO L290 TraceCheckUtils]: 13: Hoare triple {38133#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {38133#true} is VALID [2022-04-28 15:17:42,694 INFO L290 TraceCheckUtils]: 14: Hoare triple {38133#true} assume !false; {38133#true} is VALID [2022-04-28 15:17:42,694 INFO L290 TraceCheckUtils]: 15: Hoare triple {38133#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); {38133#true} is VALID [2022-04-28 15:17:42,694 INFO L290 TraceCheckUtils]: 16: Hoare triple {38133#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {38133#true} is VALID [2022-04-28 15:17:42,694 INFO L290 TraceCheckUtils]: 17: Hoare triple {38133#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {38133#true} is VALID [2022-04-28 15:17:42,694 INFO L290 TraceCheckUtils]: 18: Hoare triple {38133#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {38133#true} is VALID [2022-04-28 15:17:42,694 INFO L290 TraceCheckUtils]: 19: Hoare triple {38133#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {38133#true} is VALID [2022-04-28 15:17:42,694 INFO L290 TraceCheckUtils]: 20: Hoare triple {38133#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {38133#true} is VALID [2022-04-28 15:17:42,695 INFO L290 TraceCheckUtils]: 21: Hoare triple {38133#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {38133#true} is VALID [2022-04-28 15:17:42,695 INFO L290 TraceCheckUtils]: 22: Hoare triple {38133#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {38133#true} is VALID [2022-04-28 15:17:42,695 INFO L290 TraceCheckUtils]: 23: Hoare triple {38133#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {38133#true} is VALID [2022-04-28 15:17:42,695 INFO L290 TraceCheckUtils]: 24: Hoare triple {38133#true} assume 8464 == #t~mem55;havoc #t~mem55; {38133#true} is VALID [2022-04-28 15:17:42,695 INFO L290 TraceCheckUtils]: 25: Hoare triple {38133#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; {38133#true} is VALID [2022-04-28 15:17:42,695 INFO L290 TraceCheckUtils]: 26: Hoare triple {38133#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {38133#true} is VALID [2022-04-28 15:17:42,695 INFO L290 TraceCheckUtils]: 27: Hoare triple {38133#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); {38133#true} is VALID [2022-04-28 15:17:42,695 INFO L290 TraceCheckUtils]: 28: Hoare triple {38133#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); {38133#true} is VALID [2022-04-28 15:17:42,695 INFO L290 TraceCheckUtils]: 29: Hoare triple {38133#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {38133#true} is VALID [2022-04-28 15:17:42,695 INFO L290 TraceCheckUtils]: 30: Hoare triple {38133#true} ~skip~0 := 0; {38133#true} is VALID [2022-04-28 15:17:42,696 INFO L290 TraceCheckUtils]: 31: Hoare triple {38133#true} assume !false; {38133#true} is VALID [2022-04-28 15:17:42,696 INFO L290 TraceCheckUtils]: 32: Hoare triple {38133#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); {38133#true} is VALID [2022-04-28 15:17:42,696 INFO L290 TraceCheckUtils]: 33: Hoare triple {38133#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {38133#true} is VALID [2022-04-28 15:17:42,696 INFO L290 TraceCheckUtils]: 34: Hoare triple {38133#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {38133#true} is VALID [2022-04-28 15:17:42,696 INFO L290 TraceCheckUtils]: 35: Hoare triple {38133#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {38133#true} is VALID [2022-04-28 15:17:42,696 INFO L290 TraceCheckUtils]: 36: Hoare triple {38133#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {38133#true} is VALID [2022-04-28 15:17:42,696 INFO L290 TraceCheckUtils]: 37: Hoare triple {38133#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {38133#true} is VALID [2022-04-28 15:17:42,696 INFO L290 TraceCheckUtils]: 38: Hoare triple {38133#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {38133#true} is VALID [2022-04-28 15:17:42,696 INFO L290 TraceCheckUtils]: 39: Hoare triple {38133#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {38133#true} is VALID [2022-04-28 15:17:42,696 INFO L290 TraceCheckUtils]: 40: Hoare triple {38133#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {38133#true} is VALID [2022-04-28 15:17:42,697 INFO L290 TraceCheckUtils]: 41: Hoare triple {38133#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {38133#true} is VALID [2022-04-28 15:17:42,697 INFO L290 TraceCheckUtils]: 42: Hoare triple {38133#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {38133#true} is VALID [2022-04-28 15:17:42,697 INFO L290 TraceCheckUtils]: 43: Hoare triple {38133#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {38133#true} is VALID [2022-04-28 15:17:42,697 INFO L290 TraceCheckUtils]: 44: Hoare triple {38133#true} assume 8496 == #t~mem58;havoc #t~mem58; {38133#true} is VALID [2022-04-28 15:17:42,697 INFO L290 TraceCheckUtils]: 45: Hoare triple {38133#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {38133#true} is VALID [2022-04-28 15:17:42,697 INFO L290 TraceCheckUtils]: 46: Hoare triple {38133#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {38133#true} is VALID [2022-04-28 15:17:42,697 INFO L290 TraceCheckUtils]: 47: Hoare triple {38133#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {38133#true} is VALID [2022-04-28 15:17:42,698 INFO L290 TraceCheckUtils]: 48: Hoare triple {38133#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:42,699 INFO L290 TraceCheckUtils]: 49: Hoare triple {38138#(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); {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:42,699 INFO L290 TraceCheckUtils]: 50: Hoare triple {38138#(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); {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:42,699 INFO L290 TraceCheckUtils]: 51: Hoare triple {38138#(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; {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:42,700 INFO L290 TraceCheckUtils]: 52: Hoare triple {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} ~skip~0 := 0; {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:42,700 INFO L290 TraceCheckUtils]: 53: Hoare triple {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:42,700 INFO L290 TraceCheckUtils]: 54: Hoare triple {38138#(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); {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:42,701 INFO L290 TraceCheckUtils]: 55: Hoare triple {38138#(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); {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:42,701 INFO L290 TraceCheckUtils]: 56: Hoare triple {38138#(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); {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:42,701 INFO L290 TraceCheckUtils]: 57: Hoare triple {38138#(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); {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:42,702 INFO L290 TraceCheckUtils]: 58: Hoare triple {38138#(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); {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:42,702 INFO L290 TraceCheckUtils]: 59: Hoare triple {38138#(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); {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:42,702 INFO L290 TraceCheckUtils]: 60: Hoare triple {38138#(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); {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:42,703 INFO L290 TraceCheckUtils]: 61: Hoare triple {38138#(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); {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:42,703 INFO L290 TraceCheckUtils]: 62: Hoare triple {38138#(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); {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:42,704 INFO L290 TraceCheckUtils]: 63: Hoare triple {38138#(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); {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:42,704 INFO L290 TraceCheckUtils]: 64: Hoare triple {38138#(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); {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:42,704 INFO L290 TraceCheckUtils]: 65: Hoare triple {38138#(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); {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:42,705 INFO L290 TraceCheckUtils]: 66: Hoare triple {38138#(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); {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:42,705 INFO L290 TraceCheckUtils]: 67: Hoare triple {38138#(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); {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:42,705 INFO L290 TraceCheckUtils]: 68: Hoare triple {38138#(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); {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:42,706 INFO L290 TraceCheckUtils]: 69: Hoare triple {38138#(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); {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:42,706 INFO L290 TraceCheckUtils]: 70: Hoare triple {38138#(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); {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:42,706 INFO L290 TraceCheckUtils]: 71: Hoare triple {38138#(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); {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:42,707 INFO L290 TraceCheckUtils]: 72: Hoare triple {38138#(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); {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:42,707 INFO L290 TraceCheckUtils]: 73: Hoare triple {38138#(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); {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:42,707 INFO L290 TraceCheckUtils]: 74: Hoare triple {38138#(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); {38138#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:42,708 INFO L290 TraceCheckUtils]: 75: Hoare triple {38138#(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); {38139#(not (= 8448 |ssl3_accept_#t~mem68|))} is VALID [2022-04-28 15:17:42,708 INFO L290 TraceCheckUtils]: 76: Hoare triple {38139#(not (= 8448 |ssl3_accept_#t~mem68|))} assume 8448 == #t~mem68;havoc #t~mem68; {38134#false} is VALID [2022-04-28 15:17:42,708 INFO L290 TraceCheckUtils]: 77: Hoare triple {38134#false} assume !(~num1~0 > 0); {38134#false} is VALID [2022-04-28 15:17:42,708 INFO L290 TraceCheckUtils]: 78: Hoare triple {38134#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; {38134#false} is VALID [2022-04-28 15:17:42,708 INFO L290 TraceCheckUtils]: 79: Hoare triple {38134#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); {38134#false} is VALID [2022-04-28 15:17:42,708 INFO L290 TraceCheckUtils]: 80: Hoare triple {38134#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {38134#false} is VALID [2022-04-28 15:17:42,708 INFO L290 TraceCheckUtils]: 81: Hoare triple {38134#false} ~skip~0 := 0; {38134#false} is VALID [2022-04-28 15:17:42,708 INFO L290 TraceCheckUtils]: 82: Hoare triple {38134#false} assume !false; {38134#false} is VALID [2022-04-28 15:17:42,708 INFO L290 TraceCheckUtils]: 83: Hoare triple {38134#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); {38134#false} is VALID [2022-04-28 15:17:42,708 INFO L290 TraceCheckUtils]: 84: Hoare triple {38134#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {38134#false} is VALID [2022-04-28 15:17:42,709 INFO L290 TraceCheckUtils]: 85: Hoare triple {38134#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {38134#false} is VALID [2022-04-28 15:17:42,709 INFO L290 TraceCheckUtils]: 86: Hoare triple {38134#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {38134#false} is VALID [2022-04-28 15:17:42,709 INFO L290 TraceCheckUtils]: 87: Hoare triple {38134#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {38134#false} is VALID [2022-04-28 15:17:42,709 INFO L290 TraceCheckUtils]: 88: Hoare triple {38134#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {38134#false} is VALID [2022-04-28 15:17:42,709 INFO L290 TraceCheckUtils]: 89: Hoare triple {38134#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {38134#false} is VALID [2022-04-28 15:17:42,709 INFO L290 TraceCheckUtils]: 90: Hoare triple {38134#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {38134#false} is VALID [2022-04-28 15:17:42,709 INFO L290 TraceCheckUtils]: 91: Hoare triple {38134#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {38134#false} is VALID [2022-04-28 15:17:42,709 INFO L290 TraceCheckUtils]: 92: Hoare triple {38134#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {38134#false} is VALID [2022-04-28 15:17:42,709 INFO L290 TraceCheckUtils]: 93: Hoare triple {38134#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {38134#false} is VALID [2022-04-28 15:17:42,709 INFO L290 TraceCheckUtils]: 94: Hoare triple {38134#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {38134#false} is VALID [2022-04-28 15:17:42,709 INFO L290 TraceCheckUtils]: 95: Hoare triple {38134#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {38134#false} is VALID [2022-04-28 15:17:42,709 INFO L290 TraceCheckUtils]: 96: Hoare triple {38134#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {38134#false} is VALID [2022-04-28 15:17:42,709 INFO L290 TraceCheckUtils]: 97: Hoare triple {38134#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {38134#false} is VALID [2022-04-28 15:17:42,710 INFO L290 TraceCheckUtils]: 98: Hoare triple {38134#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {38134#false} is VALID [2022-04-28 15:17:42,710 INFO L290 TraceCheckUtils]: 99: Hoare triple {38134#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {38134#false} is VALID [2022-04-28 15:17:42,710 INFO L290 TraceCheckUtils]: 100: Hoare triple {38134#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {38134#false} is VALID [2022-04-28 15:17:42,710 INFO L290 TraceCheckUtils]: 101: Hoare triple {38134#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {38134#false} is VALID [2022-04-28 15:17:42,710 INFO L290 TraceCheckUtils]: 102: Hoare triple {38134#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {38134#false} is VALID [2022-04-28 15:17:42,710 INFO L290 TraceCheckUtils]: 103: Hoare triple {38134#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {38134#false} is VALID [2022-04-28 15:17:42,710 INFO L290 TraceCheckUtils]: 104: Hoare triple {38134#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {38134#false} is VALID [2022-04-28 15:17:42,710 INFO L290 TraceCheckUtils]: 105: Hoare triple {38134#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {38134#false} is VALID [2022-04-28 15:17:42,710 INFO L290 TraceCheckUtils]: 106: Hoare triple {38134#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {38134#false} is VALID [2022-04-28 15:17:42,710 INFO L290 TraceCheckUtils]: 107: Hoare triple {38134#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {38134#false} is VALID [2022-04-28 15:17:42,710 INFO L290 TraceCheckUtils]: 108: Hoare triple {38134#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {38134#false} is VALID [2022-04-28 15:17:42,710 INFO L290 TraceCheckUtils]: 109: Hoare triple {38134#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {38134#false} is VALID [2022-04-28 15:17:42,710 INFO L290 TraceCheckUtils]: 110: Hoare triple {38134#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {38134#false} is VALID [2022-04-28 15:17:42,710 INFO L290 TraceCheckUtils]: 111: Hoare triple {38134#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {38134#false} is VALID [2022-04-28 15:17:42,711 INFO L290 TraceCheckUtils]: 112: Hoare triple {38134#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {38134#false} is VALID [2022-04-28 15:17:42,711 INFO L290 TraceCheckUtils]: 113: Hoare triple {38134#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {38134#false} is VALID [2022-04-28 15:17:42,711 INFO L290 TraceCheckUtils]: 114: Hoare triple {38134#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {38134#false} is VALID [2022-04-28 15:17:42,711 INFO L290 TraceCheckUtils]: 115: Hoare triple {38134#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {38134#false} is VALID [2022-04-28 15:17:42,711 INFO L290 TraceCheckUtils]: 116: Hoare triple {38134#false} assume 8672 == #t~mem79;havoc #t~mem79; {38134#false} is VALID [2022-04-28 15:17:42,711 INFO L290 TraceCheckUtils]: 117: Hoare triple {38134#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {38134#false} is VALID [2022-04-28 15:17:42,711 INFO L290 TraceCheckUtils]: 118: Hoare triple {38134#false} assume 3 == ~blastFlag~0; {38134#false} is VALID [2022-04-28 15:17:42,711 INFO L290 TraceCheckUtils]: 119: Hoare triple {38134#false} assume !false; {38134#false} is VALID [2022-04-28 15:17:42,711 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:17:42,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:17:42,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381880001] [2022-04-28 15:17:42,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381880001] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:42,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:42,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:42,713 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:17:42,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2041417173] [2022-04-28 15:17:42,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2041417173] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:42,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:42,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:42,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990098082] [2022-04-28 15:17:42,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:17:42,714 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:17:42,714 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:17:42,714 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:17:42,790 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:17:42,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:17:42,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:42,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:17:42,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:17:42,791 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:17:44,811 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,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:45,877 INFO L93 Difference]: Finished difference Result 738 states and 1162 transitions. [2022-04-28 15:17:45,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:17:45,877 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:17:45,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:17:45,878 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:17:45,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 558 transitions. [2022-04-28 15:17:45,880 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:17:45,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 558 transitions. [2022-04-28 15:17:45,882 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 558 transitions. [2022-04-28 15:17:46,226 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:17:46,234 INFO L225 Difference]: With dead ends: 738 [2022-04-28 15:17:46,234 INFO L226 Difference]: Without dead ends: 441 [2022-04-28 15:17:46,235 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:46,235 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 116 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 50 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:17:46,235 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.4s Time] [2022-04-28 15:17:46,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2022-04-28 15:17:46,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 355. [2022-04-28 15:17:46,246 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:17:46,247 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:17:46,247 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:17:46,247 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:17:46,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:46,254 INFO L93 Difference]: Finished difference Result 441 states and 681 transitions. [2022-04-28 15:17:46,254 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 681 transitions. [2022-04-28 15:17:46,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:46,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:46,255 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:17:46,255 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:17:46,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:46,262 INFO L93 Difference]: Finished difference Result 441 states and 681 transitions. [2022-04-28 15:17:46,262 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 681 transitions. [2022-04-28 15:17:46,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:46,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:46,263 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:17:46,263 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:17:46,263 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:17:46,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 561 transitions. [2022-04-28 15:17:46,269 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 561 transitions. Word has length 120 [2022-04-28 15:17:46,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:17:46,269 INFO L495 AbstractCegarLoop]: Abstraction has 355 states and 561 transitions. [2022-04-28 15:17:46,270 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:17:46,270 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 355 states and 561 transitions. [2022-04-28 15:17:46,688 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:17:46,689 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 561 transitions. [2022-04-28 15:17:46,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-04-28 15:17:46,689 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:17:46,689 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:17:46,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-28 15:17:46,690 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:17:46,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:17:46,690 INFO L85 PathProgramCache]: Analyzing trace with hash 276674396, now seen corresponding path program 1 times [2022-04-28 15:17:46,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:46,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [365471216] [2022-04-28 15:17:46,771 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:17:46,771 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:17:46,771 INFO L85 PathProgramCache]: Analyzing trace with hash 276674396, now seen corresponding path program 2 times [2022-04-28 15:17:46,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:17:46,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009435020] [2022-04-28 15:17:46,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:17:46,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:17:46,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:46,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:17:46,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:46,895 INFO L290 TraceCheckUtils]: 0: Hoare triple {41220#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {41213#true} is VALID [2022-04-28 15:17:46,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {41213#true} assume true; {41213#true} is VALID [2022-04-28 15:17:46,896 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41213#true} {41213#true} #661#return; {41213#true} is VALID [2022-04-28 15:17:46,896 INFO L272 TraceCheckUtils]: 0: Hoare triple {41213#true} call ULTIMATE.init(); {41220#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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:46,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {41220#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {41213#true} is VALID [2022-04-28 15:17:46,897 INFO L290 TraceCheckUtils]: 2: Hoare triple {41213#true} assume true; {41213#true} is VALID [2022-04-28 15:17:46,897 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41213#true} {41213#true} #661#return; {41213#true} is VALID [2022-04-28 15:17:46,897 INFO L272 TraceCheckUtils]: 4: Hoare triple {41213#true} call #t~ret161 := main(); {41213#true} is VALID [2022-04-28 15:17:46,897 INFO L290 TraceCheckUtils]: 5: Hoare triple {41213#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; {41213#true} is VALID [2022-04-28 15:17:46,897 INFO L290 TraceCheckUtils]: 6: Hoare triple {41213#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {41213#true} is VALID [2022-04-28 15:17:46,897 INFO L272 TraceCheckUtils]: 7: Hoare triple {41213#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {41213#true} is VALID [2022-04-28 15:17:46,897 INFO L290 TraceCheckUtils]: 8: Hoare triple {41213#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); {41213#true} is VALID [2022-04-28 15:17:46,897 INFO L290 TraceCheckUtils]: 9: Hoare triple {41213#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; {41213#true} is VALID [2022-04-28 15:17:46,897 INFO L290 TraceCheckUtils]: 10: Hoare triple {41213#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; {41213#true} is VALID [2022-04-28 15:17:46,897 INFO L290 TraceCheckUtils]: 11: Hoare triple {41213#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {41213#true} is VALID [2022-04-28 15:17:46,897 INFO L290 TraceCheckUtils]: 12: Hoare triple {41213#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {41213#true} is VALID [2022-04-28 15:17:46,897 INFO L290 TraceCheckUtils]: 13: Hoare triple {41213#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {41213#true} is VALID [2022-04-28 15:17:46,897 INFO L290 TraceCheckUtils]: 14: Hoare triple {41213#true} assume !false; {41213#true} is VALID [2022-04-28 15:17:46,898 INFO L290 TraceCheckUtils]: 15: Hoare triple {41213#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); {41213#true} is VALID [2022-04-28 15:17:46,898 INFO L290 TraceCheckUtils]: 16: Hoare triple {41213#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {41213#true} is VALID [2022-04-28 15:17:46,898 INFO L290 TraceCheckUtils]: 17: Hoare triple {41213#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {41213#true} is VALID [2022-04-28 15:17:46,898 INFO L290 TraceCheckUtils]: 18: Hoare triple {41213#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {41213#true} is VALID [2022-04-28 15:17:46,898 INFO L290 TraceCheckUtils]: 19: Hoare triple {41213#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {41213#true} is VALID [2022-04-28 15:17:46,898 INFO L290 TraceCheckUtils]: 20: Hoare triple {41213#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {41213#true} is VALID [2022-04-28 15:17:46,898 INFO L290 TraceCheckUtils]: 21: Hoare triple {41213#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {41213#true} is VALID [2022-04-28 15:17:46,898 INFO L290 TraceCheckUtils]: 22: Hoare triple {41213#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {41213#true} is VALID [2022-04-28 15:17:46,898 INFO L290 TraceCheckUtils]: 23: Hoare triple {41213#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {41213#true} is VALID [2022-04-28 15:17:46,898 INFO L290 TraceCheckUtils]: 24: Hoare triple {41213#true} assume 8464 == #t~mem55;havoc #t~mem55; {41213#true} is VALID [2022-04-28 15:17:46,898 INFO L290 TraceCheckUtils]: 25: Hoare triple {41213#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; {41213#true} is VALID [2022-04-28 15:17:46,898 INFO L290 TraceCheckUtils]: 26: Hoare triple {41213#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {41213#true} is VALID [2022-04-28 15:17:46,899 INFO L290 TraceCheckUtils]: 27: Hoare triple {41213#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); {41218#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:46,900 INFO L290 TraceCheckUtils]: 28: Hoare triple {41218#(= 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); {41218#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:46,900 INFO L290 TraceCheckUtils]: 29: Hoare triple {41218#(= 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; {41218#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:46,900 INFO L290 TraceCheckUtils]: 30: Hoare triple {41218#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {41218#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:46,901 INFO L290 TraceCheckUtils]: 31: Hoare triple {41218#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {41218#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:46,901 INFO L290 TraceCheckUtils]: 32: Hoare triple {41218#(= 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); {41219#(= |ssl3_accept_#t~mem47| 8496)} is VALID [2022-04-28 15:17:46,901 INFO L290 TraceCheckUtils]: 33: Hoare triple {41219#(= |ssl3_accept_#t~mem47| 8496)} assume 12292 == #t~mem47;havoc #t~mem47; {41214#false} is VALID [2022-04-28 15:17:46,901 INFO L290 TraceCheckUtils]: 34: Hoare triple {41214#false} call write~int(1, ~s.base, 60 + ~s.offset, 4); {41214#false} is VALID [2022-04-28 15:17:46,901 INFO L290 TraceCheckUtils]: 35: Hoare triple {41214#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {41214#false} is VALID [2022-04-28 15:17:46,901 INFO L290 TraceCheckUtils]: 36: Hoare triple {41214#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {41214#false} is VALID [2022-04-28 15:17:46,902 INFO L290 TraceCheckUtils]: 37: Hoare triple {41214#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {41214#false} is VALID [2022-04-28 15:17:46,902 INFO L290 TraceCheckUtils]: 38: Hoare triple {41214#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); {41214#false} is VALID [2022-04-28 15:17:46,902 INFO L290 TraceCheckUtils]: 39: Hoare triple {41214#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {41214#false} is VALID [2022-04-28 15:17:46,902 INFO L290 TraceCheckUtils]: 40: Hoare triple {41214#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); {41214#false} is VALID [2022-04-28 15:17:46,902 INFO L290 TraceCheckUtils]: 41: Hoare triple {41214#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); {41214#false} is VALID [2022-04-28 15:17:46,902 INFO L290 TraceCheckUtils]: 42: Hoare triple {41214#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); {41214#false} is VALID [2022-04-28 15:17:46,902 INFO L290 TraceCheckUtils]: 43: Hoare triple {41214#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {41214#false} is VALID [2022-04-28 15:17:46,902 INFO L290 TraceCheckUtils]: 44: Hoare triple {41214#false} ~skip~0 := 0; {41214#false} is VALID [2022-04-28 15:17:46,902 INFO L290 TraceCheckUtils]: 45: Hoare triple {41214#false} assume !false; {41214#false} is VALID [2022-04-28 15:17:46,902 INFO L290 TraceCheckUtils]: 46: Hoare triple {41214#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); {41214#false} is VALID [2022-04-28 15:17:46,902 INFO L290 TraceCheckUtils]: 47: Hoare triple {41214#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-28 15:17:46,902 INFO L290 TraceCheckUtils]: 48: Hoare triple {41214#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-28 15:17:46,902 INFO L290 TraceCheckUtils]: 49: Hoare triple {41214#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-28 15:17:46,902 INFO L290 TraceCheckUtils]: 50: Hoare triple {41214#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-28 15:17:46,902 INFO L290 TraceCheckUtils]: 51: Hoare triple {41214#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-28 15:17:46,903 INFO L290 TraceCheckUtils]: 52: Hoare triple {41214#false} assume 8480 == #t~mem52;havoc #t~mem52; {41214#false} is VALID [2022-04-28 15:17:46,903 INFO L290 TraceCheckUtils]: 53: Hoare triple {41214#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; {41214#false} is VALID [2022-04-28 15:17:46,903 INFO L290 TraceCheckUtils]: 54: Hoare triple {41214#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); {41214#false} is VALID [2022-04-28 15:17:46,903 INFO L290 TraceCheckUtils]: 55: Hoare triple {41214#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); {41214#false} is VALID [2022-04-28 15:17:46,903 INFO L290 TraceCheckUtils]: 56: Hoare triple {41214#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {41214#false} is VALID [2022-04-28 15:17:46,903 INFO L290 TraceCheckUtils]: 57: Hoare triple {41214#false} ~skip~0 := 0; {41214#false} is VALID [2022-04-28 15:17:46,903 INFO L290 TraceCheckUtils]: 58: Hoare triple {41214#false} assume !false; {41214#false} is VALID [2022-04-28 15:17:46,903 INFO L290 TraceCheckUtils]: 59: Hoare triple {41214#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); {41214#false} is VALID [2022-04-28 15:17:46,903 INFO L290 TraceCheckUtils]: 60: Hoare triple {41214#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-28 15:17:46,903 INFO L290 TraceCheckUtils]: 61: Hoare triple {41214#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-28 15:17:46,903 INFO L290 TraceCheckUtils]: 62: Hoare triple {41214#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-28 15:17:46,903 INFO L290 TraceCheckUtils]: 63: Hoare triple {41214#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-28 15:17:46,903 INFO L290 TraceCheckUtils]: 64: Hoare triple {41214#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-28 15:17:46,904 INFO L290 TraceCheckUtils]: 65: Hoare triple {41214#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-28 15:17:46,904 INFO L290 TraceCheckUtils]: 66: Hoare triple {41214#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-28 15:17:46,904 INFO L290 TraceCheckUtils]: 67: Hoare triple {41214#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-28 15:17:46,904 INFO L290 TraceCheckUtils]: 68: Hoare triple {41214#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-28 15:17:46,904 INFO L290 TraceCheckUtils]: 69: Hoare triple {41214#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-28 15:17:46,904 INFO L290 TraceCheckUtils]: 70: Hoare triple {41214#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-28 15:17:46,904 INFO L290 TraceCheckUtils]: 71: Hoare triple {41214#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-28 15:17:46,904 INFO L290 TraceCheckUtils]: 72: Hoare triple {41214#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-28 15:17:46,904 INFO L290 TraceCheckUtils]: 73: Hoare triple {41214#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-28 15:17:46,904 INFO L290 TraceCheckUtils]: 74: Hoare triple {41214#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-28 15:17:46,904 INFO L290 TraceCheckUtils]: 75: Hoare triple {41214#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-28 15:17:46,904 INFO L290 TraceCheckUtils]: 76: Hoare triple {41214#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-28 15:17:46,904 INFO L290 TraceCheckUtils]: 77: Hoare triple {41214#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-28 15:17:46,904 INFO L290 TraceCheckUtils]: 78: Hoare triple {41214#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-28 15:17:46,904 INFO L290 TraceCheckUtils]: 79: Hoare triple {41214#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-28 15:17:46,905 INFO L290 TraceCheckUtils]: 80: Hoare triple {41214#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-28 15:17:46,905 INFO L290 TraceCheckUtils]: 81: Hoare triple {41214#false} assume 8448 == #t~mem68;havoc #t~mem68; {41214#false} is VALID [2022-04-28 15:17:46,905 INFO L290 TraceCheckUtils]: 82: Hoare triple {41214#false} assume !(~num1~0 > 0); {41214#false} is VALID [2022-04-28 15:17:46,905 INFO L290 TraceCheckUtils]: 83: Hoare triple {41214#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; {41214#false} is VALID [2022-04-28 15:17:46,905 INFO L290 TraceCheckUtils]: 84: Hoare triple {41214#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); {41214#false} is VALID [2022-04-28 15:17:46,905 INFO L290 TraceCheckUtils]: 85: Hoare triple {41214#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {41214#false} is VALID [2022-04-28 15:17:46,905 INFO L290 TraceCheckUtils]: 86: Hoare triple {41214#false} ~skip~0 := 0; {41214#false} is VALID [2022-04-28 15:17:46,905 INFO L290 TraceCheckUtils]: 87: Hoare triple {41214#false} assume !false; {41214#false} is VALID [2022-04-28 15:17:46,905 INFO L290 TraceCheckUtils]: 88: Hoare triple {41214#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); {41214#false} is VALID [2022-04-28 15:17:46,905 INFO L290 TraceCheckUtils]: 89: Hoare triple {41214#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-28 15:17:46,905 INFO L290 TraceCheckUtils]: 90: Hoare triple {41214#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-28 15:17:46,905 INFO L290 TraceCheckUtils]: 91: Hoare triple {41214#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-28 15:17:46,905 INFO L290 TraceCheckUtils]: 92: Hoare triple {41214#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-28 15:17:46,905 INFO L290 TraceCheckUtils]: 93: Hoare triple {41214#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-28 15:17:46,906 INFO L290 TraceCheckUtils]: 94: Hoare triple {41214#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-28 15:17:46,906 INFO L290 TraceCheckUtils]: 95: Hoare triple {41214#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-28 15:17:46,906 INFO L290 TraceCheckUtils]: 96: Hoare triple {41214#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-28 15:17:46,906 INFO L290 TraceCheckUtils]: 97: Hoare triple {41214#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-28 15:17:46,906 INFO L290 TraceCheckUtils]: 98: Hoare triple {41214#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-28 15:17:46,906 INFO L290 TraceCheckUtils]: 99: Hoare triple {41214#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-28 15:17:46,906 INFO L290 TraceCheckUtils]: 100: Hoare triple {41214#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-28 15:17:46,906 INFO L290 TraceCheckUtils]: 101: Hoare triple {41214#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-28 15:17:46,906 INFO L290 TraceCheckUtils]: 102: Hoare triple {41214#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-28 15:17:46,906 INFO L290 TraceCheckUtils]: 103: Hoare triple {41214#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-28 15:17:46,906 INFO L290 TraceCheckUtils]: 104: Hoare triple {41214#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-28 15:17:46,906 INFO L290 TraceCheckUtils]: 105: Hoare triple {41214#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-28 15:17:46,906 INFO L290 TraceCheckUtils]: 106: Hoare triple {41214#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-28 15:17:46,906 INFO L290 TraceCheckUtils]: 107: Hoare triple {41214#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-28 15:17:46,907 INFO L290 TraceCheckUtils]: 108: Hoare triple {41214#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-28 15:17:46,907 INFO L290 TraceCheckUtils]: 109: Hoare triple {41214#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-28 15:17:46,907 INFO L290 TraceCheckUtils]: 110: Hoare triple {41214#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-28 15:17:46,907 INFO L290 TraceCheckUtils]: 111: Hoare triple {41214#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-28 15:17:46,907 INFO L290 TraceCheckUtils]: 112: Hoare triple {41214#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-28 15:17:46,907 INFO L290 TraceCheckUtils]: 113: Hoare triple {41214#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-28 15:17:46,907 INFO L290 TraceCheckUtils]: 114: Hoare triple {41214#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-28 15:17:46,907 INFO L290 TraceCheckUtils]: 115: Hoare triple {41214#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-28 15:17:46,907 INFO L290 TraceCheckUtils]: 116: Hoare triple {41214#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-28 15:17:46,907 INFO L290 TraceCheckUtils]: 117: Hoare triple {41214#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-28 15:17:46,907 INFO L290 TraceCheckUtils]: 118: Hoare triple {41214#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-28 15:17:46,907 INFO L290 TraceCheckUtils]: 119: Hoare triple {41214#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-28 15:17:46,907 INFO L290 TraceCheckUtils]: 120: Hoare triple {41214#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {41214#false} is VALID [2022-04-28 15:17:46,907 INFO L290 TraceCheckUtils]: 121: Hoare triple {41214#false} assume 8672 == #t~mem79;havoc #t~mem79; {41214#false} is VALID [2022-04-28 15:17:46,908 INFO L290 TraceCheckUtils]: 122: Hoare triple {41214#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {41214#false} is VALID [2022-04-28 15:17:46,908 INFO L290 TraceCheckUtils]: 123: Hoare triple {41214#false} assume 3 == ~blastFlag~0; {41214#false} is VALID [2022-04-28 15:17:46,908 INFO L290 TraceCheckUtils]: 124: Hoare triple {41214#false} assume !false; {41214#false} is VALID [2022-04-28 15:17:46,908 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:17:46,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:17:46,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009435020] [2022-04-28 15:17:46,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009435020] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:46,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:46,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:46,909 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:17:46,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [365471216] [2022-04-28 15:17:46,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [365471216] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:46,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:46,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:46,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528111941] [2022-04-28 15:17:46,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:17:46,910 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:17:46,910 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:17:46,910 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:17:46,975 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:17:46,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:17:46,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:46,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:17:46,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:17:46,976 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:17:48,999 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:49,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:49,861 INFO L93 Difference]: Finished difference Result 692 states and 1104 transitions. [2022-04-28 15:17:49,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:17:49,861 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:17:49,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:17:49,862 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:17:49,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 434 transitions. [2022-04-28 15:17:49,864 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:17:49,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 434 transitions. [2022-04-28 15:17:49,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 434 transitions. [2022-04-28 15:17:50,123 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:50,131 INFO L225 Difference]: With dead ends: 692 [2022-04-28 15:17:50,132 INFO L226 Difference]: Without dead ends: 363 [2022-04-28 15:17:50,132 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:50,133 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 32 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 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:17:50,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 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:17:50,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2022-04-28 15:17:50,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 355. [2022-04-28 15:17:50,145 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:17:50,146 INFO L82 GeneralOperation]: Start isEquivalent. First operand 363 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:17:50,146 INFO L74 IsIncluded]: Start isIncluded. First operand 363 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:17:50,146 INFO L87 Difference]: Start difference. First operand 363 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:17:50,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:50,151 INFO L93 Difference]: Finished difference Result 363 states and 572 transitions. [2022-04-28 15:17:50,151 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 572 transitions. [2022-04-28 15:17:50,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:50,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:50,152 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 363 states. [2022-04-28 15:17:50,153 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 363 states. [2022-04-28 15:17:50,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:50,157 INFO L93 Difference]: Finished difference Result 363 states and 572 transitions. [2022-04-28 15:17:50,157 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 572 transitions. [2022-04-28 15:17:50,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:50,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:50,158 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:17:50,158 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:17:50,158 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:17:50,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 560 transitions. [2022-04-28 15:17:50,164 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 560 transitions. Word has length 125 [2022-04-28 15:17:50,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:17:50,173 INFO L495 AbstractCegarLoop]: Abstraction has 355 states and 560 transitions. [2022-04-28 15:17:50,173 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:17:50,173 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 355 states and 560 transitions. [2022-04-28 15:17:50,636 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:17:50,636 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 560 transitions. [2022-04-28 15:17:50,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-04-28 15:17:50,637 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:17:50,637 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:17:50,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-28 15:17:50,637 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:17:50,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:17:50,638 INFO L85 PathProgramCache]: Analyzing trace with hash -489530676, now seen corresponding path program 1 times [2022-04-28 15:17:50,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:50,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [400886141] [2022-04-28 15:17:50,719 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:17:50,719 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:17:50,720 INFO L85 PathProgramCache]: Analyzing trace with hash -489530676, now seen corresponding path program 2 times [2022-04-28 15:17:50,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:17:50,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885564039] [2022-04-28 15:17:50,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:17:50,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:17:51,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:51,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:17:51,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:51,141 INFO L290 TraceCheckUtils]: 0: Hoare triple {44054#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {44045#true} is VALID [2022-04-28 15:17:51,141 INFO L290 TraceCheckUtils]: 1: Hoare triple {44045#true} assume true; {44045#true} is VALID [2022-04-28 15:17:51,141 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {44045#true} {44045#true} #661#return; {44045#true} is VALID [2022-04-28 15:17:51,142 INFO L272 TraceCheckUtils]: 0: Hoare triple {44045#true} call ULTIMATE.init(); {44054#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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:51,142 INFO L290 TraceCheckUtils]: 1: Hoare triple {44054#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {44045#true} is VALID [2022-04-28 15:17:51,142 INFO L290 TraceCheckUtils]: 2: Hoare triple {44045#true} assume true; {44045#true} is VALID [2022-04-28 15:17:51,142 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44045#true} {44045#true} #661#return; {44045#true} is VALID [2022-04-28 15:17:51,142 INFO L272 TraceCheckUtils]: 4: Hoare triple {44045#true} call #t~ret161 := main(); {44045#true} is VALID [2022-04-28 15:17:51,142 INFO L290 TraceCheckUtils]: 5: Hoare triple {44045#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; {44045#true} is VALID [2022-04-28 15:17:51,143 INFO L290 TraceCheckUtils]: 6: Hoare triple {44045#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {44050#(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:17:51,143 INFO L272 TraceCheckUtils]: 7: Hoare triple {44050#(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); {44051#(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:17:51,145 INFO L290 TraceCheckUtils]: 8: Hoare triple {44051#(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); {44052#(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:17:51,146 INFO L290 TraceCheckUtils]: 9: Hoare triple {44052#(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; {44052#(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:17:51,147 INFO L290 TraceCheckUtils]: 10: Hoare triple {44052#(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; {44052#(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:17:51,149 INFO L290 TraceCheckUtils]: 11: Hoare triple {44052#(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)))); {44052#(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:17:51,149 INFO L290 TraceCheckUtils]: 12: Hoare triple {44052#(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); {44053#(and (= |ssl3_accept_#t~mem45.base| 0) (= |ssl3_accept_#t~mem45.offset| 0))} is VALID [2022-04-28 15:17:51,149 INFO L290 TraceCheckUtils]: 13: Hoare triple {44053#(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; {44046#false} is VALID [2022-04-28 15:17:51,150 INFO L290 TraceCheckUtils]: 14: Hoare triple {44046#false} assume !false; {44046#false} is VALID [2022-04-28 15:17:51,150 INFO L290 TraceCheckUtils]: 15: Hoare triple {44046#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); {44046#false} is VALID [2022-04-28 15:17:51,150 INFO L290 TraceCheckUtils]: 16: Hoare triple {44046#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,150 INFO L290 TraceCheckUtils]: 17: Hoare triple {44046#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,150 INFO L290 TraceCheckUtils]: 18: Hoare triple {44046#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,150 INFO L290 TraceCheckUtils]: 19: Hoare triple {44046#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,150 INFO L290 TraceCheckUtils]: 20: Hoare triple {44046#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,150 INFO L290 TraceCheckUtils]: 21: Hoare triple {44046#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,150 INFO L290 TraceCheckUtils]: 22: Hoare triple {44046#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,150 INFO L290 TraceCheckUtils]: 23: Hoare triple {44046#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,150 INFO L290 TraceCheckUtils]: 24: Hoare triple {44046#false} assume 8464 == #t~mem55;havoc #t~mem55; {44046#false} is VALID [2022-04-28 15:17:51,150 INFO L290 TraceCheckUtils]: 25: Hoare triple {44046#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; {44046#false} is VALID [2022-04-28 15:17:51,150 INFO L290 TraceCheckUtils]: 26: Hoare triple {44046#false} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {44046#false} is VALID [2022-04-28 15:17:51,150 INFO L290 TraceCheckUtils]: 27: Hoare triple {44046#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); {44046#false} is VALID [2022-04-28 15:17:51,151 INFO L290 TraceCheckUtils]: 28: Hoare triple {44046#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); {44046#false} is VALID [2022-04-28 15:17:51,151 INFO L290 TraceCheckUtils]: 29: Hoare triple {44046#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {44046#false} is VALID [2022-04-28 15:17:51,151 INFO L290 TraceCheckUtils]: 30: Hoare triple {44046#false} ~skip~0 := 0; {44046#false} is VALID [2022-04-28 15:17:51,151 INFO L290 TraceCheckUtils]: 31: Hoare triple {44046#false} assume !false; {44046#false} is VALID [2022-04-28 15:17:51,151 INFO L290 TraceCheckUtils]: 32: Hoare triple {44046#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); {44046#false} is VALID [2022-04-28 15:17:51,151 INFO L290 TraceCheckUtils]: 33: Hoare triple {44046#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,151 INFO L290 TraceCheckUtils]: 34: Hoare triple {44046#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,151 INFO L290 TraceCheckUtils]: 35: Hoare triple {44046#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,151 INFO L290 TraceCheckUtils]: 36: Hoare triple {44046#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,151 INFO L290 TraceCheckUtils]: 37: Hoare triple {44046#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,151 INFO L290 TraceCheckUtils]: 38: Hoare triple {44046#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,151 INFO L290 TraceCheckUtils]: 39: Hoare triple {44046#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,151 INFO L290 TraceCheckUtils]: 40: Hoare triple {44046#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,152 INFO L290 TraceCheckUtils]: 41: Hoare triple {44046#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,152 INFO L290 TraceCheckUtils]: 42: Hoare triple {44046#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,152 INFO L290 TraceCheckUtils]: 43: Hoare triple {44046#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,152 INFO L290 TraceCheckUtils]: 44: Hoare triple {44046#false} assume 8496 == #t~mem58;havoc #t~mem58; {44046#false} is VALID [2022-04-28 15:17:51,152 INFO L290 TraceCheckUtils]: 45: Hoare triple {44046#false} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {44046#false} is VALID [2022-04-28 15:17:51,152 INFO L290 TraceCheckUtils]: 46: Hoare triple {44046#false} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {44046#false} is VALID [2022-04-28 15:17:51,152 INFO L290 TraceCheckUtils]: 47: Hoare triple {44046#false} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,152 INFO L290 TraceCheckUtils]: 48: Hoare triple {44046#false} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,152 INFO L290 TraceCheckUtils]: 49: Hoare triple {44046#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,152 INFO L290 TraceCheckUtils]: 50: Hoare triple {44046#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); {44046#false} is VALID [2022-04-28 15:17:51,152 INFO L290 TraceCheckUtils]: 51: Hoare triple {44046#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {44046#false} is VALID [2022-04-28 15:17:51,152 INFO L290 TraceCheckUtils]: 52: Hoare triple {44046#false} ~skip~0 := 0; {44046#false} is VALID [2022-04-28 15:17:51,152 INFO L290 TraceCheckUtils]: 53: Hoare triple {44046#false} assume !false; {44046#false} is VALID [2022-04-28 15:17:51,153 INFO L290 TraceCheckUtils]: 54: Hoare triple {44046#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); {44046#false} is VALID [2022-04-28 15:17:51,153 INFO L290 TraceCheckUtils]: 55: Hoare triple {44046#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,153 INFO L290 TraceCheckUtils]: 56: Hoare triple {44046#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,153 INFO L290 TraceCheckUtils]: 57: Hoare triple {44046#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,153 INFO L290 TraceCheckUtils]: 58: Hoare triple {44046#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,153 INFO L290 TraceCheckUtils]: 59: Hoare triple {44046#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,153 INFO L290 TraceCheckUtils]: 60: Hoare triple {44046#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,153 INFO L290 TraceCheckUtils]: 61: Hoare triple {44046#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,153 INFO L290 TraceCheckUtils]: 62: Hoare triple {44046#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,153 INFO L290 TraceCheckUtils]: 63: Hoare triple {44046#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,153 INFO L290 TraceCheckUtils]: 64: Hoare triple {44046#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,153 INFO L290 TraceCheckUtils]: 65: Hoare triple {44046#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,153 INFO L290 TraceCheckUtils]: 66: Hoare triple {44046#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,153 INFO L290 TraceCheckUtils]: 67: Hoare triple {44046#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,154 INFO L290 TraceCheckUtils]: 68: Hoare triple {44046#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,154 INFO L290 TraceCheckUtils]: 69: Hoare triple {44046#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,154 INFO L290 TraceCheckUtils]: 70: Hoare triple {44046#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,154 INFO L290 TraceCheckUtils]: 71: Hoare triple {44046#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,154 INFO L290 TraceCheckUtils]: 72: Hoare triple {44046#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,154 INFO L290 TraceCheckUtils]: 73: Hoare triple {44046#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,154 INFO L290 TraceCheckUtils]: 74: Hoare triple {44046#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,154 INFO L290 TraceCheckUtils]: 75: Hoare triple {44046#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,154 INFO L290 TraceCheckUtils]: 76: Hoare triple {44046#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,154 INFO L290 TraceCheckUtils]: 77: Hoare triple {44046#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,154 INFO L290 TraceCheckUtils]: 78: Hoare triple {44046#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,154 INFO L290 TraceCheckUtils]: 79: Hoare triple {44046#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,154 INFO L290 TraceCheckUtils]: 80: Hoare triple {44046#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,154 INFO L290 TraceCheckUtils]: 81: Hoare triple {44046#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,155 INFO L290 TraceCheckUtils]: 82: Hoare triple {44046#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,155 INFO L290 TraceCheckUtils]: 83: Hoare triple {44046#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,155 INFO L290 TraceCheckUtils]: 84: Hoare triple {44046#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,155 INFO L290 TraceCheckUtils]: 85: Hoare triple {44046#false} assume 8656 == #t~mem77;havoc #t~mem77; {44046#false} is VALID [2022-04-28 15:17:51,155 INFO L290 TraceCheckUtils]: 86: Hoare triple {44046#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; {44046#false} is VALID [2022-04-28 15:17:51,155 INFO L290 TraceCheckUtils]: 87: Hoare triple {44046#false} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {44046#false} is VALID [2022-04-28 15:17:51,155 INFO L290 TraceCheckUtils]: 88: Hoare triple {44046#false} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {44046#false} is VALID [2022-04-28 15:17:51,155 INFO L290 TraceCheckUtils]: 89: Hoare triple {44046#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); {44046#false} is VALID [2022-04-28 15:17:51,155 INFO L290 TraceCheckUtils]: 90: Hoare triple {44046#false} assume !(0 == ~tmp___10~0); {44046#false} is VALID [2022-04-28 15:17:51,155 INFO L290 TraceCheckUtils]: 91: Hoare triple {44046#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); {44046#false} is VALID [2022-04-28 15:17:51,155 INFO L290 TraceCheckUtils]: 92: Hoare triple {44046#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {44046#false} is VALID [2022-04-28 15:17:51,155 INFO L290 TraceCheckUtils]: 93: Hoare triple {44046#false} ~skip~0 := 0; {44046#false} is VALID [2022-04-28 15:17:51,155 INFO L290 TraceCheckUtils]: 94: Hoare triple {44046#false} assume !false; {44046#false} is VALID [2022-04-28 15:17:51,156 INFO L290 TraceCheckUtils]: 95: Hoare triple {44046#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); {44046#false} is VALID [2022-04-28 15:17:51,156 INFO L290 TraceCheckUtils]: 96: Hoare triple {44046#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,156 INFO L290 TraceCheckUtils]: 97: Hoare triple {44046#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,156 INFO L290 TraceCheckUtils]: 98: Hoare triple {44046#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,156 INFO L290 TraceCheckUtils]: 99: Hoare triple {44046#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,156 INFO L290 TraceCheckUtils]: 100: Hoare triple {44046#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,156 INFO L290 TraceCheckUtils]: 101: Hoare triple {44046#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,156 INFO L290 TraceCheckUtils]: 102: Hoare triple {44046#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,156 INFO L290 TraceCheckUtils]: 103: Hoare triple {44046#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,156 INFO L290 TraceCheckUtils]: 104: Hoare triple {44046#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,156 INFO L290 TraceCheckUtils]: 105: Hoare triple {44046#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,156 INFO L290 TraceCheckUtils]: 106: Hoare triple {44046#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,156 INFO L290 TraceCheckUtils]: 107: Hoare triple {44046#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,156 INFO L290 TraceCheckUtils]: 108: Hoare triple {44046#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,157 INFO L290 TraceCheckUtils]: 109: Hoare triple {44046#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,157 INFO L290 TraceCheckUtils]: 110: Hoare triple {44046#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,157 INFO L290 TraceCheckUtils]: 111: Hoare triple {44046#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,157 INFO L290 TraceCheckUtils]: 112: Hoare triple {44046#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,157 INFO L290 TraceCheckUtils]: 113: Hoare triple {44046#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,157 INFO L290 TraceCheckUtils]: 114: Hoare triple {44046#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,157 INFO L290 TraceCheckUtils]: 115: Hoare triple {44046#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,157 INFO L290 TraceCheckUtils]: 116: Hoare triple {44046#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,157 INFO L290 TraceCheckUtils]: 117: Hoare triple {44046#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,157 INFO L290 TraceCheckUtils]: 118: Hoare triple {44046#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,157 INFO L290 TraceCheckUtils]: 119: Hoare triple {44046#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,157 INFO L290 TraceCheckUtils]: 120: Hoare triple {44046#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,157 INFO L290 TraceCheckUtils]: 121: Hoare triple {44046#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,157 INFO L290 TraceCheckUtils]: 122: Hoare triple {44046#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,158 INFO L290 TraceCheckUtils]: 123: Hoare triple {44046#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,158 INFO L290 TraceCheckUtils]: 124: Hoare triple {44046#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,158 INFO L290 TraceCheckUtils]: 125: Hoare triple {44046#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,158 INFO L290 TraceCheckUtils]: 126: Hoare triple {44046#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,158 INFO L290 TraceCheckUtils]: 127: Hoare triple {44046#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {44046#false} is VALID [2022-04-28 15:17:51,158 INFO L290 TraceCheckUtils]: 128: Hoare triple {44046#false} assume 8672 == #t~mem79;havoc #t~mem79; {44046#false} is VALID [2022-04-28 15:17:51,158 INFO L290 TraceCheckUtils]: 129: Hoare triple {44046#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {44046#false} is VALID [2022-04-28 15:17:51,158 INFO L290 TraceCheckUtils]: 130: Hoare triple {44046#false} assume 3 == ~blastFlag~0; {44046#false} is VALID [2022-04-28 15:17:51,158 INFO L290 TraceCheckUtils]: 131: Hoare triple {44046#false} assume !false; {44046#false} is VALID [2022-04-28 15:17:51,158 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:17:51,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:17:51,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885564039] [2022-04-28 15:17:51,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885564039] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:51,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:51,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 15:17:51,159 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:17:51,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [400886141] [2022-04-28 15:17:51,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [400886141] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:51,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:51,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 15:17:51,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555561244] [2022-04-28 15:17:51,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:17:51,160 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:17:51,160 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:17:51,160 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:17:51,212 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:17:51,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 15:17:51,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:51,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 15:17:51,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-28 15:17:51,212 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:17:53,241 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:54,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:54,702 INFO L93 Difference]: Finished difference Result 703 states and 1112 transitions. [2022-04-28 15:17:54,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 15:17:54,703 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:17:54,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:17:54,703 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:17:54,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 402 transitions. [2022-04-28 15:17:54,705 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:17:54,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 402 transitions. [2022-04-28 15:17:54,707 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 402 transitions. [2022-04-28 15:17:54,974 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:17:54,982 INFO L225 Difference]: With dead ends: 703 [2022-04-28 15:17:54,982 INFO L226 Difference]: Without dead ends: 355 [2022-04-28 15:17:54,983 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:17:54,983 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 7 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s 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.5s IncrementalHoareTripleChecker+Time [2022-04-28 15:17:54,983 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.5s Time] [2022-04-28 15:17:54,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2022-04-28 15:17:54,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 355. [2022-04-28 15:17:54,994 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:17:54,995 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:17:54,995 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:17:54,995 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:17:55,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:55,000 INFO L93 Difference]: Finished difference Result 355 states and 559 transitions. [2022-04-28 15:17:55,000 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 559 transitions. [2022-04-28 15:17:55,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:55,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:55,001 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:17:55,001 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:17:55,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:55,006 INFO L93 Difference]: Finished difference Result 355 states and 559 transitions. [2022-04-28 15:17:55,006 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 559 transitions. [2022-04-28 15:17:55,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:55,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:55,007 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:17:55,007 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:17:55,007 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:17:55,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 559 transitions. [2022-04-28 15:17:55,014 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 559 transitions. Word has length 132 [2022-04-28 15:17:55,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:17:55,014 INFO L495 AbstractCegarLoop]: Abstraction has 355 states and 559 transitions. [2022-04-28 15:17:55,014 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:17:55,014 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 355 states and 559 transitions. [2022-04-28 15:17:55,412 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:17:55,412 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 559 transitions. [2022-04-28 15:17:55,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-04-28 15:17:55,413 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:17:55,413 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:17:55,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-28 15:17:55,413 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:17:55,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:17:55,413 INFO L85 PathProgramCache]: Analyzing trace with hash -919188982, now seen corresponding path program 1 times [2022-04-28 15:17:55,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:55,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [187775428] [2022-04-28 15:17:55,489 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:17:55,489 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:17:55,489 INFO L85 PathProgramCache]: Analyzing trace with hash -919188982, now seen corresponding path program 2 times [2022-04-28 15:17:55,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:17:55,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119641224] [2022-04-28 15:17:55,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:17:55,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:17:55,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 15:17:55,841 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 15:17:55,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 15:17:56,009 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 15:17:56,009 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-28 15:17:56,009 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-28 15:17:56,013 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 15:17:56,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-28 15:17:56,016 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:17:56,019 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 15:17:56,054 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 15:17:56,055 WARN L170 areAnnotationChecker]: SSLv3_server_methodENTRY has no Hoare annotation [2022-04-28 15:17:56,055 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-28 15:17:56,055 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 15:17:56,055 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 15:17:56,055 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-28 15:17:56,055 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyENTRY has no Hoare annotation [2022-04-28 15:17:56,055 WARN L170 areAnnotationChecker]: sslv3_base_methodENTRY has no Hoare annotation [2022-04-28 15:17:56,055 WARN L170 areAnnotationChecker]: #Ultimate.meminitENTRY has no Hoare annotation [2022-04-28 15:17:56,055 WARN L170 areAnnotationChecker]: ssl3_acceptENTRY has no Hoare annotation [2022-04-28 15:17:56,055 WARN L170 areAnnotationChecker]: ssl3_get_server_methodENTRY has no Hoare annotation [2022-04-28 15:17:56,055 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 15:17:56,055 WARN L170 areAnnotationChecker]: L1061 has no Hoare annotation [2022-04-28 15:17:56,055 WARN L170 areAnnotationChecker]: L1061 has no Hoare annotation [2022-04-28 15:17:56,055 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-28 15:17:56,055 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 15:17:56,055 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 15:17:56,055 WARN L170 areAnnotationChecker]: L1096 has no Hoare annotation [2022-04-28 15:17:56,055 WARN L170 areAnnotationChecker]: L1096 has no Hoare annotation [2022-04-28 15:17:56,055 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2022-04-28 15:17:56,055 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2022-04-28 15:17:56,055 WARN L170 areAnnotationChecker]: L1743 has no Hoare annotation [2022-04-28 15:17:56,055 WARN L170 areAnnotationChecker]: L1743 has no Hoare annotation [2022-04-28 15:17:56,055 WARN L170 areAnnotationChecker]: #Ultimate.meminitFINAL has no Hoare annotation [2022-04-28 15:17:56,055 WARN L170 areAnnotationChecker]: L1146 has no Hoare annotation [2022-04-28 15:17:56,055 WARN L170 areAnnotationChecker]: L1146 has no Hoare annotation [2022-04-28 15:17:56,056 WARN L170 areAnnotationChecker]: L1044 has no Hoare annotation [2022-04-28 15:17:56,056 WARN L170 areAnnotationChecker]: L1044 has no Hoare annotation [2022-04-28 15:17:56,056 WARN L170 areAnnotationChecker]: L1063 has no Hoare annotation [2022-04-28 15:17:56,056 WARN L170 areAnnotationChecker]: L1063 has no Hoare annotation [2022-04-28 15:17:56,056 WARN L170 areAnnotationChecker]: L1061-2 has no Hoare annotation [2022-04-28 15:17:56,056 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-28 15:17:56,056 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-28 15:17:56,056 WARN L170 areAnnotationChecker]: L1096-2 has no Hoare annotation [2022-04-28 15:17:56,056 WARN L170 areAnnotationChecker]: L1096-2 has no Hoare annotation [2022-04-28 15:17:56,056 WARN L170 areAnnotationChecker]: L-1-3 has no Hoare annotation [2022-04-28 15:17:56,056 WARN L170 areAnnotationChecker]: L-1-3 has no Hoare annotation [2022-04-28 15:17:56,056 WARN L170 areAnnotationChecker]: L1743-1 has no Hoare annotation [2022-04-28 15:17:56,056 WARN L170 areAnnotationChecker]: #Ultimate.meminitEXIT has no Hoare annotation [2022-04-28 15:17:56,056 WARN L170 areAnnotationChecker]: L1146-2 has no Hoare annotation [2022-04-28 15:17:56,056 WARN L170 areAnnotationChecker]: L1046 has no Hoare annotation [2022-04-28 15:17:56,056 WARN L170 areAnnotationChecker]: L1046 has no Hoare annotation [2022-04-28 15:17:56,056 WARN L170 areAnnotationChecker]: ssl3_get_server_methodFINAL has no Hoare annotation [2022-04-28 15:17:56,056 WARN L170 areAnnotationChecker]: L1063-1 has no Hoare annotation [2022-04-28 15:17:56,056 WARN L170 areAnnotationChecker]: SSLv3_server_methodFINAL has no Hoare annotation [2022-04-28 15:17:56,056 WARN L170 areAnnotationChecker]: L1106 has no Hoare annotation [2022-04-28 15:17:56,056 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyFINAL has no Hoare annotation [2022-04-28 15:17:56,056 WARN L170 areAnnotationChecker]: sslv3_base_methodFINAL has no Hoare annotation [2022-04-28 15:17:56,056 WARN L170 areAnnotationChecker]: L1152 has no Hoare annotation [2022-04-28 15:17:56,056 WARN L170 areAnnotationChecker]: L1152 has no Hoare annotation [2022-04-28 15:17:56,056 WARN L170 areAnnotationChecker]: L1046-1 has no Hoare annotation [2022-04-28 15:17:56,056 WARN L170 areAnnotationChecker]: L1065 has no Hoare annotation [2022-04-28 15:17:56,056 WARN L170 areAnnotationChecker]: L1065 has no Hoare annotation [2022-04-28 15:17:56,057 WARN L170 areAnnotationChecker]: SSLv3_server_methodEXIT has no Hoare annotation [2022-04-28 15:17:56,057 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-28 15:17:56,057 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyEXIT has no Hoare annotation [2022-04-28 15:17:56,057 WARN L170 areAnnotationChecker]: sslv3_base_methodEXIT has no Hoare annotation [2022-04-28 15:17:56,057 WARN L170 areAnnotationChecker]: L1153 has no Hoare annotation [2022-04-28 15:17:56,057 WARN L170 areAnnotationChecker]: L1153 has no Hoare annotation [2022-04-28 15:17:56,057 WARN L170 areAnnotationChecker]: L1152-1 has no Hoare annotation [2022-04-28 15:17:56,057 WARN L170 areAnnotationChecker]: L1065-1 has no Hoare annotation [2022-04-28 15:17:56,057 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-28 15:17:56,057 WARN L170 areAnnotationChecker]: L1161 has no Hoare annotation [2022-04-28 15:17:56,057 WARN L170 areAnnotationChecker]: L1161 has no Hoare annotation [2022-04-28 15:17:56,057 WARN L170 areAnnotationChecker]: ssl3_acceptFINAL has no Hoare annotation [2022-04-28 15:17:56,057 WARN L170 areAnnotationChecker]: L1167-2 has no Hoare annotation [2022-04-28 15:17:56,057 WARN L170 areAnnotationChecker]: L1167-2 has no Hoare annotation [2022-04-28 15:17:56,057 WARN L170 areAnnotationChecker]: L1167-2 has no Hoare annotation [2022-04-28 15:17:56,057 WARN L170 areAnnotationChecker]: ssl3_acceptEXIT has no Hoare annotation [2022-04-28 15:17:56,057 WARN L170 areAnnotationChecker]: L1723 has no Hoare annotation [2022-04-28 15:17:56,057 WARN L170 areAnnotationChecker]: L1168 has no Hoare annotation [2022-04-28 15:17:56,057 WARN L170 areAnnotationChecker]: L1727 has no Hoare annotation [2022-04-28 15:17:56,057 WARN L170 areAnnotationChecker]: L1727 has no Hoare annotation [2022-04-28 15:17:56,057 WARN L170 areAnnotationChecker]: L1170 has no Hoare annotation [2022-04-28 15:17:56,057 WARN L170 areAnnotationChecker]: L1170 has no Hoare annotation [2022-04-28 15:17:56,057 WARN L170 areAnnotationChecker]: L1727-2 has no Hoare annotation [2022-04-28 15:17:56,057 WARN L170 areAnnotationChecker]: L1171 has no Hoare annotation [2022-04-28 15:17:56,057 WARN L170 areAnnotationChecker]: L1173 has no Hoare annotation [2022-04-28 15:17:56,057 WARN L170 areAnnotationChecker]: L1173 has no Hoare annotation [2022-04-28 15:17:56,057 WARN L170 areAnnotationChecker]: L1280 has no Hoare annotation [2022-04-28 15:17:56,058 WARN L170 areAnnotationChecker]: L1176 has no Hoare annotation [2022-04-28 15:17:56,058 WARN L170 areAnnotationChecker]: L1176 has no Hoare annotation [2022-04-28 15:17:56,058 WARN L170 areAnnotationChecker]: L1285 has no Hoare annotation [2022-04-28 15:17:56,058 WARN L170 areAnnotationChecker]: L1285 has no Hoare annotation [2022-04-28 15:17:56,058 WARN L170 areAnnotationChecker]: L1179 has no Hoare annotation [2022-04-28 15:17:56,058 WARN L170 areAnnotationChecker]: L1179 has no Hoare annotation [2022-04-28 15:17:56,058 WARN L170 areAnnotationChecker]: L1285-2 has no Hoare annotation [2022-04-28 15:17:56,058 WARN L170 areAnnotationChecker]: L1182 has no Hoare annotation [2022-04-28 15:17:56,058 WARN L170 areAnnotationChecker]: L1182 has no Hoare annotation [2022-04-28 15:17:56,058 WARN L170 areAnnotationChecker]: L1290 has no Hoare annotation [2022-04-28 15:17:56,058 WARN L170 areAnnotationChecker]: L1290 has no Hoare annotation [2022-04-28 15:17:56,058 WARN L170 areAnnotationChecker]: L1185 has no Hoare annotation [2022-04-28 15:17:56,058 WARN L170 areAnnotationChecker]: L1185 has no Hoare annotation [2022-04-28 15:17:56,058 WARN L170 areAnnotationChecker]: L1296 has no Hoare annotation [2022-04-28 15:17:56,058 WARN L170 areAnnotationChecker]: L1296 has no Hoare annotation [2022-04-28 15:17:56,058 WARN L170 areAnnotationChecker]: L1189 has no Hoare annotation [2022-04-28 15:17:56,058 WARN L170 areAnnotationChecker]: L1188 has no Hoare annotation [2022-04-28 15:17:56,058 WARN L170 areAnnotationChecker]: L1188 has no Hoare annotation [2022-04-28 15:17:56,058 WARN L170 areAnnotationChecker]: L1298 has no Hoare annotation [2022-04-28 15:17:56,058 WARN L170 areAnnotationChecker]: L1298 has no Hoare annotation [2022-04-28 15:17:56,058 WARN L170 areAnnotationChecker]: L1296-2 has no Hoare annotation [2022-04-28 15:17:56,058 WARN L170 areAnnotationChecker]: L1296-2 has no Hoare annotation [2022-04-28 15:17:56,058 WARN L170 areAnnotationChecker]: L1339 has no Hoare annotation [2022-04-28 15:17:56,058 WARN L170 areAnnotationChecker]: L1339 has no Hoare annotation [2022-04-28 15:17:56,058 WARN L170 areAnnotationChecker]: L1191 has no Hoare annotation [2022-04-28 15:17:56,058 WARN L170 areAnnotationChecker]: L1191 has no Hoare annotation [2022-04-28 15:17:56,059 WARN L170 areAnnotationChecker]: L1304 has no Hoare annotation [2022-04-28 15:17:56,059 WARN L170 areAnnotationChecker]: L1304 has no Hoare annotation [2022-04-28 15:17:56,059 WARN L170 areAnnotationChecker]: L1321 has no Hoare annotation [2022-04-28 15:17:56,059 WARN L170 areAnnotationChecker]: L1321 has no Hoare annotation [2022-04-28 15:17:56,059 WARN L170 areAnnotationChecker]: L1654 has no Hoare annotation [2022-04-28 15:17:56,059 WARN L170 areAnnotationChecker]: L1192 has no Hoare annotation [2022-04-28 15:17:56,059 WARN L170 areAnnotationChecker]: L1194 has no Hoare annotation [2022-04-28 15:17:56,059 WARN L170 areAnnotationChecker]: L1194 has no Hoare annotation [2022-04-28 15:17:56,059 WARN L170 areAnnotationChecker]: L1322 has no Hoare annotation [2022-04-28 15:17:56,059 WARN L170 areAnnotationChecker]: L1322 has no Hoare annotation [2022-04-28 15:17:56,059 WARN L170 areAnnotationChecker]: L1692 has no Hoare annotation [2022-04-28 15:17:56,059 WARN L170 areAnnotationChecker]: L1692 has no Hoare annotation [2022-04-28 15:17:56,059 WARN L170 areAnnotationChecker]: L1201 has no Hoare annotation [2022-04-28 15:17:56,059 WARN L170 areAnnotationChecker]: L1197 has no Hoare annotation [2022-04-28 15:17:56,059 WARN L170 areAnnotationChecker]: L1197 has no Hoare annotation [2022-04-28 15:17:56,059 WARN L170 areAnnotationChecker]: L1693 has no Hoare annotation [2022-04-28 15:17:56,059 WARN L170 areAnnotationChecker]: L1693 has no Hoare annotation [2022-04-28 15:17:56,059 WARN L170 areAnnotationChecker]: L1692-1 has no Hoare annotation [2022-04-28 15:17:56,059 WARN L170 areAnnotationChecker]: L1356 has no Hoare annotation [2022-04-28 15:17:56,059 WARN L170 areAnnotationChecker]: L1356 has no Hoare annotation [2022-04-28 15:17:56,059 WARN L170 areAnnotationChecker]: L1200 has no Hoare annotation [2022-04-28 15:17:56,059 WARN L170 areAnnotationChecker]: L1200 has no Hoare annotation [2022-04-28 15:17:56,059 WARN L170 areAnnotationChecker]: L1694 has no Hoare annotation [2022-04-28 15:17:56,059 WARN L170 areAnnotationChecker]: L1694 has no Hoare annotation [2022-04-28 15:17:56,059 WARN L170 areAnnotationChecker]: L1356-2 has no Hoare annotation [2022-04-28 15:17:56,059 WARN L170 areAnnotationChecker]: L1356-2 has no Hoare annotation [2022-04-28 15:17:56,059 WARN L170 areAnnotationChecker]: L1203 has no Hoare annotation [2022-04-28 15:17:56,060 WARN L170 areAnnotationChecker]: L1203 has no Hoare annotation [2022-04-28 15:17:56,060 WARN L170 areAnnotationChecker]: L1696 has no Hoare annotation [2022-04-28 15:17:56,060 WARN L170 areAnnotationChecker]: L1696 has no Hoare annotation [2022-04-28 15:17:56,060 WARN L170 areAnnotationChecker]: L1694-2 has no Hoare annotation [2022-04-28 15:17:56,060 WARN L170 areAnnotationChecker]: L1694-2 has no Hoare annotation [2022-04-28 15:17:56,060 WARN L170 areAnnotationChecker]: L1207 has no Hoare annotation [2022-04-28 15:17:56,060 WARN L170 areAnnotationChecker]: L1206 has no Hoare annotation [2022-04-28 15:17:56,060 WARN L170 areAnnotationChecker]: L1206 has no Hoare annotation [2022-04-28 15:17:56,060 WARN L170 areAnnotationChecker]: L1705 has no Hoare annotation [2022-04-28 15:17:56,060 WARN L170 areAnnotationChecker]: L1705 has no Hoare annotation [2022-04-28 15:17:56,060 WARN L170 areAnnotationChecker]: L1373 has no Hoare annotation [2022-04-28 15:17:56,060 WARN L170 areAnnotationChecker]: L1373 has no Hoare annotation [2022-04-28 15:17:56,060 WARN L170 areAnnotationChecker]: L1209 has no Hoare annotation [2022-04-28 15:17:56,060 WARN L170 areAnnotationChecker]: L1209 has no Hoare annotation [2022-04-28 15:17:56,060 WARN L170 areAnnotationChecker]: L1376-2 has no Hoare annotation [2022-04-28 15:17:56,060 WARN L170 areAnnotationChecker]: L1376-2 has no Hoare annotation [2022-04-28 15:17:56,060 WARN L170 areAnnotationChecker]: L1376 has no Hoare annotation [2022-04-28 15:17:56,060 WARN L170 areAnnotationChecker]: L1376 has no Hoare annotation [2022-04-28 15:17:56,060 WARN L170 areAnnotationChecker]: L1213 has no Hoare annotation [2022-04-28 15:17:56,060 WARN L170 areAnnotationChecker]: L1212 has no Hoare annotation [2022-04-28 15:17:56,060 WARN L170 areAnnotationChecker]: L1212 has no Hoare annotation [2022-04-28 15:17:56,060 WARN L170 areAnnotationChecker]: L1387 has no Hoare annotation [2022-04-28 15:17:56,060 WARN L170 areAnnotationChecker]: L1387 has no Hoare annotation [2022-04-28 15:17:56,060 WARN L170 areAnnotationChecker]: L1396 has no Hoare annotation [2022-04-28 15:17:56,060 WARN L170 areAnnotationChecker]: L1396 has no Hoare annotation [2022-04-28 15:17:56,060 WARN L170 areAnnotationChecker]: L1215 has no Hoare annotation [2022-04-28 15:17:56,061 WARN L170 areAnnotationChecker]: L1215 has no Hoare annotation [2022-04-28 15:17:56,061 WARN L170 areAnnotationChecker]: L1387-2 has no Hoare annotation [2022-04-28 15:17:56,061 WARN L170 areAnnotationChecker]: L1396-2 has no Hoare annotation [2022-04-28 15:17:56,061 WARN L170 areAnnotationChecker]: L1400 has no Hoare annotation [2022-04-28 15:17:56,061 WARN L170 areAnnotationChecker]: L1400 has no Hoare annotation [2022-04-28 15:17:56,061 WARN L170 areAnnotationChecker]: L1219 has no Hoare annotation [2022-04-28 15:17:56,061 WARN L170 areAnnotationChecker]: L1218 has no Hoare annotation [2022-04-28 15:17:56,061 WARN L170 areAnnotationChecker]: L1218 has no Hoare annotation [2022-04-28 15:17:56,061 WARN L170 areAnnotationChecker]: L1412 has no Hoare annotation [2022-04-28 15:17:56,061 WARN L170 areAnnotationChecker]: L1412 has no Hoare annotation [2022-04-28 15:17:56,061 WARN L170 areAnnotationChecker]: L1221 has no Hoare annotation [2022-04-28 15:17:56,061 WARN L170 areAnnotationChecker]: L1221 has no Hoare annotation [2022-04-28 15:17:56,061 WARN L170 areAnnotationChecker]: L1412-2 has no Hoare annotation [2022-04-28 15:17:56,061 WARN L170 areAnnotationChecker]: L1225 has no Hoare annotation [2022-04-28 15:17:56,061 WARN L170 areAnnotationChecker]: L1224 has no Hoare annotation [2022-04-28 15:17:56,061 WARN L170 areAnnotationChecker]: L1224 has no Hoare annotation [2022-04-28 15:17:56,061 WARN L170 areAnnotationChecker]: L1417 has no Hoare annotation [2022-04-28 15:17:56,061 WARN L170 areAnnotationChecker]: L1417 has no Hoare annotation [2022-04-28 15:17:56,061 WARN L170 areAnnotationChecker]: L1458 has no Hoare annotation [2022-04-28 15:17:56,061 WARN L170 areAnnotationChecker]: L1458 has no Hoare annotation [2022-04-28 15:17:56,061 WARN L170 areAnnotationChecker]: L1227 has no Hoare annotation [2022-04-28 15:17:56,061 WARN L170 areAnnotationChecker]: L1227 has no Hoare annotation [2022-04-28 15:17:56,061 WARN L170 areAnnotationChecker]: L1434 has no Hoare annotation [2022-04-28 15:17:56,061 WARN L170 areAnnotationChecker]: L1420 has no Hoare annotation [2022-04-28 15:17:56,061 WARN L170 areAnnotationChecker]: L1420 has no Hoare annotation [2022-04-28 15:17:56,061 WARN L170 areAnnotationChecker]: L1459 has no Hoare annotation [2022-04-28 15:17:56,061 WARN L170 areAnnotationChecker]: L1459 has no Hoare annotation [2022-04-28 15:17:56,061 WARN L170 areAnnotationChecker]: L1231 has no Hoare annotation [2022-04-28 15:17:56,062 WARN L170 areAnnotationChecker]: L1230 has no Hoare annotation [2022-04-28 15:17:56,062 WARN L170 areAnnotationChecker]: L1230 has no Hoare annotation [2022-04-28 15:17:56,062 WARN L170 areAnnotationChecker]: L1436 has no Hoare annotation [2022-04-28 15:17:56,062 WARN L170 areAnnotationChecker]: L1436 has no Hoare annotation [2022-04-28 15:17:56,062 WARN L170 areAnnotationChecker]: L1423 has no Hoare annotation [2022-04-28 15:17:56,062 WARN L170 areAnnotationChecker]: L1423 has no Hoare annotation [2022-04-28 15:17:56,062 WARN L170 areAnnotationChecker]: L1460 has no Hoare annotation [2022-04-28 15:17:56,062 WARN L170 areAnnotationChecker]: L1460 has no Hoare annotation [2022-04-28 15:17:56,062 WARN L170 areAnnotationChecker]: L1468 has no Hoare annotation [2022-04-28 15:17:56,062 WARN L170 areAnnotationChecker]: L1500 has no Hoare annotation [2022-04-28 15:17:56,062 WARN L170 areAnnotationChecker]: L1500 has no Hoare annotation [2022-04-28 15:17:56,062 WARN L170 areAnnotationChecker]: L1233 has no Hoare annotation [2022-04-28 15:17:56,062 WARN L170 areAnnotationChecker]: L1233 has no Hoare annotation [2022-04-28 15:17:56,062 WARN L170 areAnnotationChecker]: L1423-1 has no Hoare annotation [2022-04-28 15:17:56,062 WARN L170 areAnnotationChecker]: L1424 has no Hoare annotation [2022-04-28 15:17:56,062 WARN L170 areAnnotationChecker]: L1424 has no Hoare annotation [2022-04-28 15:17:56,062 WARN L170 areAnnotationChecker]: L1469 has no Hoare annotation [2022-04-28 15:17:56,062 WARN L170 areAnnotationChecker]: L1469 has no Hoare annotation [2022-04-28 15:17:56,062 WARN L170 areAnnotationChecker]: L1234 has no Hoare annotation [2022-04-28 15:17:56,062 WARN L170 areAnnotationChecker]: L1234 has no Hoare annotation [2022-04-28 15:17:56,062 WARN L170 areAnnotationChecker]: L1236 has no Hoare annotation [2022-04-28 15:17:56,062 WARN L170 areAnnotationChecker]: L1236 has no Hoare annotation [2022-04-28 15:17:56,062 WARN L170 areAnnotationChecker]: L1427 has no Hoare annotation [2022-04-28 15:17:56,062 WARN L170 areAnnotationChecker]: L1427 has no Hoare annotation [2022-04-28 15:17:56,062 WARN L170 areAnnotationChecker]: L1470 has no Hoare annotation [2022-04-28 15:17:56,062 WARN L170 areAnnotationChecker]: L1470 has no Hoare annotation [2022-04-28 15:17:56,063 WARN L170 areAnnotationChecker]: L1478 has no Hoare annotation [2022-04-28 15:17:56,063 WARN L170 areAnnotationChecker]: L1513 has no Hoare annotation [2022-04-28 15:17:56,063 WARN L170 areAnnotationChecker]: L1513 has no Hoare annotation [2022-04-28 15:17:56,063 WARN L170 areAnnotationChecker]: L1510-1 has no Hoare annotation [2022-04-28 15:17:56,063 WARN L170 areAnnotationChecker]: L1240 has no Hoare annotation [2022-04-28 15:17:56,063 WARN L170 areAnnotationChecker]: L1239 has no Hoare annotation [2022-04-28 15:17:56,063 WARN L170 areAnnotationChecker]: L1239 has no Hoare annotation [2022-04-28 15:17:56,063 WARN L170 areAnnotationChecker]: L1428 has no Hoare annotation [2022-04-28 15:17:56,063 WARN L170 areAnnotationChecker]: L1428 has no Hoare annotation [2022-04-28 15:17:56,063 WARN L170 areAnnotationChecker]: L1481 has no Hoare annotation [2022-04-28 15:17:56,063 WARN L170 areAnnotationChecker]: L1481 has no Hoare annotation [2022-04-28 15:17:56,063 WARN L170 areAnnotationChecker]: L1528 has no Hoare annotation [2022-04-28 15:17:56,063 WARN L170 areAnnotationChecker]: L1528 has no Hoare annotation [2022-04-28 15:17:56,063 WARN L170 areAnnotationChecker]: L1242 has no Hoare annotation [2022-04-28 15:17:56,063 WARN L170 areAnnotationChecker]: L1242 has no Hoare annotation [2022-04-28 15:17:56,063 WARN L170 areAnnotationChecker]: L1428-2 has no Hoare annotation [2022-04-28 15:17:56,063 WARN L170 areAnnotationChecker]: L1428-2 has no Hoare annotation [2022-04-28 15:17:56,063 WARN L170 areAnnotationChecker]: L1533 has no Hoare annotation [2022-04-28 15:17:56,063 WARN L170 areAnnotationChecker]: L1533 has no Hoare annotation [2022-04-28 15:17:56,063 WARN L170 areAnnotationChecker]: L1246 has no Hoare annotation [2022-04-28 15:17:56,063 WARN L170 areAnnotationChecker]: L1245 has no Hoare annotation [2022-04-28 15:17:56,063 WARN L170 areAnnotationChecker]: L1245 has no Hoare annotation [2022-04-28 15:17:56,064 WARN L170 areAnnotationChecker]: L1537 has no Hoare annotation [2022-04-28 15:17:56,064 WARN L170 areAnnotationChecker]: L1537 has no Hoare annotation [2022-04-28 15:17:56,064 WARN L170 areAnnotationChecker]: L1549 has no Hoare annotation [2022-04-28 15:17:56,064 WARN L170 areAnnotationChecker]: L1549 has no Hoare annotation [2022-04-28 15:17:56,064 WARN L170 areAnnotationChecker]: L1248 has no Hoare annotation [2022-04-28 15:17:56,064 WARN L170 areAnnotationChecker]: L1248 has no Hoare annotation [2022-04-28 15:17:56,064 WARN L170 areAnnotationChecker]: L1252 has no Hoare annotation [2022-04-28 15:17:56,064 WARN L170 areAnnotationChecker]: L1251 has no Hoare annotation [2022-04-28 15:17:56,064 WARN L170 areAnnotationChecker]: L1251 has no Hoare annotation [2022-04-28 15:17:56,064 WARN L170 areAnnotationChecker]: L1560 has no Hoare annotation [2022-04-28 15:17:56,064 WARN L170 areAnnotationChecker]: L1560 has no Hoare annotation [2022-04-28 15:17:56,064 WARN L170 areAnnotationChecker]: L1254 has no Hoare annotation [2022-04-28 15:17:56,064 WARN L170 areAnnotationChecker]: L1254 has no Hoare annotation [2022-04-28 15:17:56,064 WARN L170 areAnnotationChecker]: L1258 has no Hoare annotation [2022-04-28 15:17:56,064 WARN L170 areAnnotationChecker]: L1257 has no Hoare annotation [2022-04-28 15:17:56,064 WARN L170 areAnnotationChecker]: L1257 has no Hoare annotation [2022-04-28 15:17:56,064 WARN L170 areAnnotationChecker]: L1571 has no Hoare annotation [2022-04-28 15:17:56,064 WARN L170 areAnnotationChecker]: L1571 has no Hoare annotation [2022-04-28 15:17:56,064 WARN L170 areAnnotationChecker]: L1260 has no Hoare annotation [2022-04-28 15:17:56,064 WARN L170 areAnnotationChecker]: L1260 has no Hoare annotation [2022-04-28 15:17:56,065 WARN L170 areAnnotationChecker]: L1576 has no Hoare annotation [2022-04-28 15:17:56,065 WARN L170 areAnnotationChecker]: L1576 has no Hoare annotation [2022-04-28 15:17:56,065 WARN L170 areAnnotationChecker]: L1264 has no Hoare annotation [2022-04-28 15:17:56,065 WARN L170 areAnnotationChecker]: L1263 has no Hoare annotation [2022-04-28 15:17:56,065 WARN L170 areAnnotationChecker]: L1263 has no Hoare annotation [2022-04-28 15:17:56,065 WARN L170 areAnnotationChecker]: L1576-2 has no Hoare annotation [2022-04-28 15:17:56,065 WARN L170 areAnnotationChecker]: L1586 has no Hoare annotation [2022-04-28 15:17:56,065 WARN L170 areAnnotationChecker]: L1586 has no Hoare annotation [2022-04-28 15:17:56,066 WARN L170 areAnnotationChecker]: L1266 has no Hoare annotation [2022-04-28 15:17:56,066 WARN L170 areAnnotationChecker]: L1266 has no Hoare annotation [2022-04-28 15:17:56,066 WARN L170 areAnnotationChecker]: L1593 has no Hoare annotation [2022-04-28 15:17:56,066 WARN L170 areAnnotationChecker]: L1593 has no Hoare annotation [2022-04-28 15:17:56,066 WARN L170 areAnnotationChecker]: L1270 has no Hoare annotation [2022-04-28 15:17:56,066 WARN L170 areAnnotationChecker]: L1269 has no Hoare annotation [2022-04-28 15:17:56,066 WARN L170 areAnnotationChecker]: L1269 has no Hoare annotation [2022-04-28 15:17:56,066 WARN L170 areAnnotationChecker]: L1593-2 has no Hoare annotation [2022-04-28 15:17:56,066 WARN L170 areAnnotationChecker]: L1593-2 has no Hoare annotation [2022-04-28 15:17:56,066 WARN L170 areAnnotationChecker]: L1615 has no Hoare annotation [2022-04-28 15:17:56,066 WARN L170 areAnnotationChecker]: L1615 has no Hoare annotation [2022-04-28 15:17:56,066 WARN L170 areAnnotationChecker]: L1272 has no Hoare annotation [2022-04-28 15:17:56,066 WARN L170 areAnnotationChecker]: L1272 has no Hoare annotation [2022-04-28 15:17:56,066 WARN L170 areAnnotationChecker]: L1605 has no Hoare annotation [2022-04-28 15:17:56,066 WARN L170 areAnnotationChecker]: L1605 has no Hoare annotation [2022-04-28 15:17:56,066 WARN L170 areAnnotationChecker]: L1616 has no Hoare annotation [2022-04-28 15:17:56,066 WARN L170 areAnnotationChecker]: L1616 has no Hoare annotation [2022-04-28 15:17:56,066 WARN L170 areAnnotationChecker]: L1620 has no Hoare annotation [2022-04-28 15:17:56,066 WARN L170 areAnnotationChecker]: L1620 has no Hoare annotation [2022-04-28 15:17:56,066 WARN L170 areAnnotationChecker]: L1273 has no Hoare annotation [2022-04-28 15:17:56,066 WARN L170 areAnnotationChecker]: L1276 has no Hoare annotation [2022-04-28 15:17:56,066 WARN L170 areAnnotationChecker]: L1626 has no Hoare annotation [2022-04-28 15:17:56,066 WARN L170 areAnnotationChecker]: L1626 has no Hoare annotation [2022-04-28 15:17:56,066 WARN L170 areAnnotationChecker]: L1636 has no Hoare annotation [2022-04-28 15:17:56,066 WARN L170 areAnnotationChecker]: L1636 has no Hoare annotation [2022-04-28 15:17:56,066 WARN L170 areAnnotationChecker]: L1626-2 has no Hoare annotation [2022-04-28 15:17:56,066 WARN L170 areAnnotationChecker]: L1640 has no Hoare annotation [2022-04-28 15:17:56,066 WARN L170 areAnnotationChecker]: L1640 has no Hoare annotation [2022-04-28 15:17:56,066 WARN L170 areAnnotationChecker]: L1636-1 has no Hoare annotation [2022-04-28 15:17:56,067 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:17:56,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 03:17:56 BoogieIcfgContainer [2022-04-28 15:17:56,070 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 15:17:56,071 INFO L158 Benchmark]: Toolchain (without parser) took 118020.38ms. Allocated memory was 176.2MB in the beginning and 264.2MB in the end (delta: 88.1MB). Free memory was 123.1MB in the beginning and 91.9MB in the end (delta: 31.2MB). Peak memory consumption was 120.3MB. Max. memory is 8.0GB. [2022-04-28 15:17:56,071 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 176.2MB. Free memory was 141.6MB in the beginning and 141.5MB in the end (delta: 73.1kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 15:17:56,071 INFO L158 Benchmark]: CACSL2BoogieTranslator took 662.70ms. Allocated memory was 176.2MB in the beginning and 220.2MB in the end (delta: 44.0MB). Free memory was 122.9MB in the beginning and 172.5MB in the end (delta: -49.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-28 15:17:56,072 INFO L158 Benchmark]: Boogie Preprocessor took 144.57ms. Allocated memory is still 220.2MB. Free memory was 172.5MB in the beginning and 162.4MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 15:17:56,073 INFO L158 Benchmark]: RCFGBuilder took 3204.41ms. Allocated memory is still 220.2MB. Free memory was 162.4MB in the beginning and 155.3MB in the end (delta: 7.2MB). Peak memory consumption was 64.2MB. Max. memory is 8.0GB. [2022-04-28 15:17:56,073 INFO L158 Benchmark]: TraceAbstraction took 114002.97ms. Allocated memory was 220.2MB in the beginning and 264.2MB in the end (delta: 44.0MB). Free memory was 154.8MB in the beginning and 91.9MB in the end (delta: 62.9MB). Peak memory consumption was 106.4MB. Max. memory is 8.0GB. [2022-04-28 15:17:56,078 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.12ms. Allocated memory is still 176.2MB. Free memory was 141.6MB in the beginning and 141.5MB in the end (delta: 73.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 662.70ms. Allocated memory was 176.2MB in the beginning and 220.2MB in the end (delta: 44.0MB). Free memory was 122.9MB in the beginning and 172.5MB in the end (delta: -49.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 144.57ms. Allocated memory is still 220.2MB. Free memory was 172.5MB in the beginning and 162.4MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * RCFGBuilder took 3204.41ms. Allocated memory is still 220.2MB. Free memory was 162.4MB in the beginning and 155.3MB in the end (delta: 7.2MB). Peak memory consumption was 64.2MB. Max. memory is 8.0GB. * TraceAbstraction took 114002.97ms. Allocated memory was 220.2MB in the beginning and 264.2MB in the end (delta: 44.0MB). Free memory was 154.8MB in the beginning and 91.9MB in the end (delta: 62.9MB). Peak memory consumption was 106.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: 1733]: 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 [L1692] EXPR s->s3 [L1692] EXPR (s->s3)->tmp.reuse_message [L1692] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1721] 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 [L1382] COND FALSE !(ret <= 0) [L1387] s->hit [L1387] COND TRUE s->hit [L1388] s->state = 8656 [L1392] s->init_num = 0 [L1692] EXPR s->s3 [L1692] EXPR (s->s3)->tmp.reuse_message [L1692] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1721] 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 [L1585] EXPR s->session [L1585] EXPR s->s3 [L1585] EXPR (s->s3)->tmp.new_cipher [L1585] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1586] COND FALSE !(! tmp___9) [L1592] ret = __VERIFIER_nondet_int() [L1593] COND TRUE blastFlag == 2 [L1594] blastFlag = 3 [L1598] COND FALSE !(ret <= 0) [L1603] s->state = 8672 [L1604] s->init_num = 0 [L1605] COND FALSE !(! tmp___10) [L1692] EXPR s->s3 [L1692] EXPR (s->s3)->tmp.reuse_message [L1692] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1721] 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 [L1614] ret = __VERIFIER_nondet_int() [L1615] COND TRUE blastFlag == 3 [L1733] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 184 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 113.9s, OverallIterations: 26, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 99.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 29 mSolverCounterUnknown, 1287 SdHoareTripleChecker+Valid, 70.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1287 mSDsluCounter, 11457 SdHoareTripleChecker+Invalid, 70.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7203 mSDsCounter, 532 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9964 IncrementalHoareTripleChecker+Invalid, 10525 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 532 mSolverCounterUnsat, 4254 mSDtfsCounter, 9964 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 196 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s 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.6s AutomataMinimizationTime, 25 MinimizatonAttempts, 880 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:17:56,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...