/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/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/openssl/s3_srvr.blast.09.i.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 08:40:55,052 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 08:40:55,063 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 08:40:55,118 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 08:40:55,119 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 08:40:55,119 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 08:40:55,120 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 08:40:55,121 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 08:40:55,122 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 08:40:55,123 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 08:40:55,123 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 08:40:55,124 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 08:40:55,124 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 08:40:55,125 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 08:40:55,125 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 08:40:55,126 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 08:40:55,126 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 08:40:55,128 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 08:40:55,131 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 08:40:55,135 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 08:40:55,138 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 08:40:55,141 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 08:40:55,142 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 08:40:55,144 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 08:40:55,146 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 08:40:55,148 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 08:40:55,148 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 08:40:55,148 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 08:40:55,148 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 08:40:55,149 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 08:40:55,149 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 08:40:55,149 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 08:40:55,150 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 08:40:55,151 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 08:40:55,151 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 08:40:55,152 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 08:40:55,152 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 08:40:55,152 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 08:40:55,152 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 08:40:55,152 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 08:40:55,153 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 08:40:55,154 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 08:40:55,155 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 08:40:55,162 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 08:40:55,163 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 08:40:55,164 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 08:40:55,164 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 08:40:55,164 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 08:40:55,164 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 08:40:55,164 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 08:40:55,164 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 08:40:55,164 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 08:40:55,165 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 08:40:55,165 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 08:40:55,165 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 08:40:55,165 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 08:40:55,165 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 08:40:55,166 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 08:40:55,166 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 08:40:55,166 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 08:40:55,166 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 08:40:55,166 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 08:40:55,166 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 08:40:55,166 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 08:40:55,166 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 08:40:55,166 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 08:40:55,166 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 08:40:55,166 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 08:40:55,166 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 08:40:55,348 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 08:40:55,360 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 08:40:55,362 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 08:40:55,363 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 08:40:55,370 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 08:40:55,371 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_srvr.blast.09.i.cil-1.c [2022-04-28 08:40:55,418 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f5d497c2/f8630d7fcc714da6bc1cc22d33141614/FLAGb2e84a1df [2022-04-28 08:40:55,822 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 08:40:55,823 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.09.i.cil-1.c [2022-04-28 08:40:55,838 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f5d497c2/f8630d7fcc714da6bc1cc22d33141614/FLAGb2e84a1df [2022-04-28 08:40:56,149 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f5d497c2/f8630d7fcc714da6bc1cc22d33141614 [2022-04-28 08:40:56,151 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 08:40:56,152 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 08:40:56,164 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 08:40:56,164 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 08:40:56,166 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 08:40:56,167 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 08:40:56" (1/1) ... [2022-04-28 08:40:56,168 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@570774b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:40:56, skipping insertion in model container [2022-04-28 08:40:56,168 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 08:40:56" (1/1) ... [2022-04-28 08:40:56,172 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 08:40:56,199 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 08:40:56,481 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.09.i.cil-1.c[74369,74382] [2022-04-28 08:40:56,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 08:40:56,496 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 08:40:56,583 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.09.i.cil-1.c[74369,74382] [2022-04-28 08:40:56,597 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 08:40:56,611 INFO L208 MainTranslator]: Completed translation [2022-04-28 08:40:56,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:40:56 WrapperNode [2022-04-28 08:40:56,612 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 08:40:56,612 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 08:40:56,612 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 08:40:56,613 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 08:40:56,621 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:40:56" (1/1) ... [2022-04-28 08:40:56,621 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:40:56" (1/1) ... [2022-04-28 08:40:56,649 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:40:56" (1/1) ... [2022-04-28 08:40:56,653 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:40:56" (1/1) ... [2022-04-28 08:40:56,712 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:40:56" (1/1) ... [2022-04-28 08:40:56,733 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:40:56" (1/1) ... [2022-04-28 08:40:56,739 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:40:56" (1/1) ... [2022-04-28 08:40:56,747 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 08:40:56,748 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 08:40:56,748 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 08:40:56,748 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 08:40:56,749 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:40:56" (1/1) ... [2022-04-28 08:40:56,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 08:40:56,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 08:40:56,771 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 08:40:56,779 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 08:40:56,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 08:40:56,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 08:40:56,804 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 08:40:56,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2022-04-28 08:40:56,804 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2022-04-28 08:40:56,804 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 08:40:56,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2022-04-28 08:40:56,804 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-28 08:40:56,804 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-28 08:40:56,804 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-28 08:40:56,804 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 08:40:56,805 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 08:40:56,805 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 08:40:56,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 08:40:56,805 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-28 08:40:56,805 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-28 08:40:56,805 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 08:40:56,805 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-28 08:40:56,805 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-28 08:40:56,805 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-28 08:40:56,805 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2022-04-28 08:40:56,805 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-28 08:40:56,805 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2022-04-28 08:40:56,805 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2022-04-28 08:40:56,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-28 08:40:56,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-28 08:40:56,806 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 08:40:56,806 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-28 08:40:56,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 08:40:56,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-28 08:40:56,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 08:40:56,806 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-28 08:40:56,806 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-28 08:40:56,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 08:40:56,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 08:40:56,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 08:40:56,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-28 08:40:56,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-28 08:40:56,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-28 08:40:56,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-28 08:40:56,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 08:40:56,924 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 08:40:56,925 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 08:40:57,664 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 08:40:58,002 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2022-04-28 08:40:58,002 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2022-04-28 08:40:58,012 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 08:40:58,020 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 08:40:58,020 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 08:40:58,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 08:40:58 BoogieIcfgContainer [2022-04-28 08:40:58,022 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 08:40:58,024 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 08:40:58,024 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 08:40:58,026 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 08:40:58,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 08:40:56" (1/3) ... [2022-04-28 08:40:58,027 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6093c0a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 08:40:58, skipping insertion in model container [2022-04-28 08:40:58,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:40:56" (2/3) ... [2022-04-28 08:40:58,027 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6093c0a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 08:40:58, skipping insertion in model container [2022-04-28 08:40:58,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 08:40:58" (3/3) ... [2022-04-28 08:40:58,032 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.09.i.cil-1.c [2022-04-28 08:40:58,041 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 08:40:58,042 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 08:40:58,093 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 08:40:58,100 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@53190ea3, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@172b0ddd [2022-04-28 08:40:58,100 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 08:40:58,109 INFO L276 IsEmpty]: Start isEmpty. Operand has 158 states, 150 states have (on average 1.7066666666666668) internal successors, (256), 151 states have internal predecessors, (256), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 08:40:58,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-28 08:40:58,118 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:40:58,118 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:40:58,119 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:40:58,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:40:58,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1538020646, now seen corresponding path program 1 times [2022-04-28 08:40:58,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:40:58,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1963511158] [2022-04-28 08:40:58,141 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:40:58,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1538020646, now seen corresponding path program 2 times [2022-04-28 08:40:58,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:40:58,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072942042] [2022-04-28 08:40:58,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:40:58,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:40:58,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:40:58,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:40:58,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:40:58,626 INFO L290 TraceCheckUtils]: 0: Hoare triple {168#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {161#true} is VALID [2022-04-28 08:40:58,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {161#true} assume true; {161#true} is VALID [2022-04-28 08:40:58,627 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {161#true} {161#true} #689#return; {161#true} is VALID [2022-04-28 08:40:58,628 INFO L272 TraceCheckUtils]: 0: Hoare triple {161#true} call ULTIMATE.init(); {168#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:40:58,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {168#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {161#true} is VALID [2022-04-28 08:40:58,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {161#true} assume true; {161#true} is VALID [2022-04-28 08:40:58,629 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {161#true} {161#true} #689#return; {161#true} is VALID [2022-04-28 08:40:58,629 INFO L272 TraceCheckUtils]: 4: Hoare triple {161#true} call #t~ret161 := main(); {161#true} is VALID [2022-04-28 08:40:58,629 INFO L290 TraceCheckUtils]: 5: Hoare triple {161#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~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(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #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, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);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, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);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, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {161#true} is VALID [2022-04-28 08:40:58,630 INFO L290 TraceCheckUtils]: 6: Hoare triple {161#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {161#true} is VALID [2022-04-28 08:40:58,630 INFO L272 TraceCheckUtils]: 7: Hoare triple {161#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {161#true} is VALID [2022-04-28 08:40:58,635 INFO L290 TraceCheckUtils]: 8: Hoare triple {161#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~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, 192 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:58,636 INFO L290 TraceCheckUtils]: 9: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:58,637 INFO L290 TraceCheckUtils]: 10: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:58,638 INFO L290 TraceCheckUtils]: 11: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:58,639 INFO L290 TraceCheckUtils]: 12: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:58,639 INFO L290 TraceCheckUtils]: 13: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:58,640 INFO L290 TraceCheckUtils]: 14: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:58,640 INFO L290 TraceCheckUtils]: 15: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:58,641 INFO L290 TraceCheckUtils]: 16: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:58,641 INFO L290 TraceCheckUtils]: 17: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:58,642 INFO L290 TraceCheckUtils]: 18: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:58,643 INFO L290 TraceCheckUtils]: 19: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:58,644 INFO L290 TraceCheckUtils]: 20: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:58,644 INFO L290 TraceCheckUtils]: 21: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:58,645 INFO L290 TraceCheckUtils]: 22: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:58,646 INFO L290 TraceCheckUtils]: 23: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:58,646 INFO L290 TraceCheckUtils]: 24: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:58,648 INFO L290 TraceCheckUtils]: 25: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:58,648 INFO L290 TraceCheckUtils]: 26: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:58,649 INFO L290 TraceCheckUtils]: 27: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:58,649 INFO L290 TraceCheckUtils]: 28: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:58,650 INFO L290 TraceCheckUtils]: 29: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:58,650 INFO L290 TraceCheckUtils]: 30: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:58,651 INFO L290 TraceCheckUtils]: 31: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:58,652 INFO L290 TraceCheckUtils]: 32: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {167#(not (= |ssl3_accept_#t~mem64| 8544))} is VALID [2022-04-28 08:40:58,652 INFO L290 TraceCheckUtils]: 33: Hoare triple {167#(not (= |ssl3_accept_#t~mem64| 8544))} assume 8544 == #t~mem64;havoc #t~mem64; {162#false} is VALID [2022-04-28 08:40:58,652 INFO L290 TraceCheckUtils]: 34: Hoare triple {162#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {162#false} is VALID [2022-04-28 08:40:58,653 INFO L290 TraceCheckUtils]: 35: Hoare triple {162#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {162#false} is VALID [2022-04-28 08:40:58,653 INFO L290 TraceCheckUtils]: 36: Hoare triple {162#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {162#false} is VALID [2022-04-28 08:40:58,653 INFO L290 TraceCheckUtils]: 37: Hoare triple {162#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {162#false} is VALID [2022-04-28 08:40:58,654 INFO L290 TraceCheckUtils]: 38: Hoare triple {162#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {162#false} is VALID [2022-04-28 08:40:58,654 INFO L290 TraceCheckUtils]: 39: Hoare triple {162#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {162#false} is VALID [2022-04-28 08:40:58,654 INFO L290 TraceCheckUtils]: 40: Hoare triple {162#false} assume 8 == ~blastFlag~0; {162#false} is VALID [2022-04-28 08:40:58,654 INFO L290 TraceCheckUtils]: 41: Hoare triple {162#false} assume !false; {162#false} is VALID [2022-04-28 08:40:58,656 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 08:40:58,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:40:58,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072942042] [2022-04-28 08:40:58,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072942042] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:40:58,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:40:58,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:40:58,660 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:40:58,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1963511158] [2022-04-28 08:40:58,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1963511158] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:40:58,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:40:58,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:40:58,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531970256] [2022-04-28 08:40:58,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:40:58,671 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-28 08:40:58,673 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:40:58,675 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:58,736 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:40:58,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:40:58,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:40:58,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:40:58,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:40:58,759 INFO L87 Difference]: Start difference. First operand has 158 states, 150 states have (on average 1.7066666666666668) internal successors, (256), 151 states have internal predecessors, (256), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:01,090 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:41:06,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:41:06,166 INFO L93 Difference]: Finished difference Result 430 states and 727 transitions. [2022-04-28 08:41:06,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:41:06,166 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-28 08:41:06,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:41:06,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:06,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 727 transitions. [2022-04-28 08:41:06,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:06,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 727 transitions. [2022-04-28 08:41:06,220 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 727 transitions. [2022-04-28 08:41:06,681 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 727 edges. 727 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:41:06,694 INFO L225 Difference]: With dead ends: 430 [2022-04-28 08:41:06,695 INFO L226 Difference]: Without dead ends: 261 [2022-04-28 08:41:06,697 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 08:41:06,699 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 167 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-04-28 08:41:06,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 461 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-04-28 08:41:06,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-04-28 08:41:06,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 170. [2022-04-28 08:41:06,727 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:41:06,728 INFO L82 GeneralOperation]: Start isEquivalent. First operand 261 states. Second operand has 170 states, 165 states have (on average 1.5818181818181818) internal successors, (261), 165 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:06,729 INFO L74 IsIncluded]: Start isIncluded. First operand 261 states. Second operand has 170 states, 165 states have (on average 1.5818181818181818) internal successors, (261), 165 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:06,730 INFO L87 Difference]: Start difference. First operand 261 states. Second operand has 170 states, 165 states have (on average 1.5818181818181818) internal successors, (261), 165 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:06,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:41:06,738 INFO L93 Difference]: Finished difference Result 261 states and 400 transitions. [2022-04-28 08:41:06,738 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 400 transitions. [2022-04-28 08:41:06,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:41:06,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:41:06,740 INFO L74 IsIncluded]: Start isIncluded. First operand has 170 states, 165 states have (on average 1.5818181818181818) internal successors, (261), 165 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 261 states. [2022-04-28 08:41:06,741 INFO L87 Difference]: Start difference. First operand has 170 states, 165 states have (on average 1.5818181818181818) internal successors, (261), 165 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 261 states. [2022-04-28 08:41:06,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:41:06,748 INFO L93 Difference]: Finished difference Result 261 states and 400 transitions. [2022-04-28 08:41:06,749 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 400 transitions. [2022-04-28 08:41:06,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:41:06,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:41:06,750 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:41:06,750 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:41:06,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 165 states have (on average 1.5818181818181818) internal successors, (261), 165 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:06,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 265 transitions. [2022-04-28 08:41:06,756 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 265 transitions. Word has length 42 [2022-04-28 08:41:06,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:41:06,756 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 265 transitions. [2022-04-28 08:41:06,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:06,757 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 170 states and 265 transitions. [2022-04-28 08:41:06,927 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 265 edges. 265 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:41:06,927 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 265 transitions. [2022-04-28 08:41:06,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 08:41:06,928 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:41:06,928 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:41:06,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 08:41:06,929 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:41:06,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:41:06,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1015183371, now seen corresponding path program 1 times [2022-04-28 08:41:06,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:41:06,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [286216875] [2022-04-28 08:41:06,930 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:41:06,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1015183371, now seen corresponding path program 2 times [2022-04-28 08:41:06,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:41:06,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267338389] [2022-04-28 08:41:06,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:41:06,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:41:07,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:41:07,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:41:07,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:41:07,077 INFO L290 TraceCheckUtils]: 0: Hoare triple {1902#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {1895#true} is VALID [2022-04-28 08:41:07,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {1895#true} assume true; {1895#true} is VALID [2022-04-28 08:41:07,078 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1895#true} {1895#true} #689#return; {1895#true} is VALID [2022-04-28 08:41:07,079 INFO L272 TraceCheckUtils]: 0: Hoare triple {1895#true} call ULTIMATE.init(); {1902#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:41:07,081 INFO L290 TraceCheckUtils]: 1: Hoare triple {1902#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {1895#true} is VALID [2022-04-28 08:41:07,081 INFO L290 TraceCheckUtils]: 2: Hoare triple {1895#true} assume true; {1895#true} is VALID [2022-04-28 08:41:07,081 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1895#true} {1895#true} #689#return; {1895#true} is VALID [2022-04-28 08:41:07,081 INFO L272 TraceCheckUtils]: 4: Hoare triple {1895#true} call #t~ret161 := main(); {1895#true} is VALID [2022-04-28 08:41:07,082 INFO L290 TraceCheckUtils]: 5: Hoare triple {1895#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~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(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #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, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);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, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);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, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {1895#true} is VALID [2022-04-28 08:41:07,082 INFO L290 TraceCheckUtils]: 6: Hoare triple {1895#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {1895#true} is VALID [2022-04-28 08:41:07,082 INFO L272 TraceCheckUtils]: 7: Hoare triple {1895#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {1895#true} is VALID [2022-04-28 08:41:07,084 INFO L290 TraceCheckUtils]: 8: Hoare triple {1895#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~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, 192 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:07,084 INFO L290 TraceCheckUtils]: 9: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:07,086 INFO L290 TraceCheckUtils]: 10: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:07,087 INFO L290 TraceCheckUtils]: 11: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:07,087 INFO L290 TraceCheckUtils]: 12: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:07,088 INFO L290 TraceCheckUtils]: 13: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:07,088 INFO L290 TraceCheckUtils]: 14: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:07,089 INFO L290 TraceCheckUtils]: 15: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:07,089 INFO L290 TraceCheckUtils]: 16: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:07,090 INFO L290 TraceCheckUtils]: 17: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:07,090 INFO L290 TraceCheckUtils]: 18: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:07,091 INFO L290 TraceCheckUtils]: 19: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:07,091 INFO L290 TraceCheckUtils]: 20: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:07,091 INFO L290 TraceCheckUtils]: 21: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:07,092 INFO L290 TraceCheckUtils]: 22: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:07,092 INFO L290 TraceCheckUtils]: 23: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:07,093 INFO L290 TraceCheckUtils]: 24: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:07,093 INFO L290 TraceCheckUtils]: 25: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:07,093 INFO L290 TraceCheckUtils]: 26: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:07,094 INFO L290 TraceCheckUtils]: 27: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:07,094 INFO L290 TraceCheckUtils]: 28: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:07,095 INFO L290 TraceCheckUtils]: 29: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:07,095 INFO L290 TraceCheckUtils]: 30: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:07,095 INFO L290 TraceCheckUtils]: 31: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:07,096 INFO L290 TraceCheckUtils]: 32: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:07,096 INFO L290 TraceCheckUtils]: 33: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {1901#(not (= |ssl3_accept_#t~mem65| 8545))} is VALID [2022-04-28 08:41:07,096 INFO L290 TraceCheckUtils]: 34: Hoare triple {1901#(not (= |ssl3_accept_#t~mem65| 8545))} assume 8545 == #t~mem65;havoc #t~mem65; {1896#false} is VALID [2022-04-28 08:41:07,097 INFO L290 TraceCheckUtils]: 35: Hoare triple {1896#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {1896#false} is VALID [2022-04-28 08:41:07,097 INFO L290 TraceCheckUtils]: 36: Hoare triple {1896#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {1896#false} is VALID [2022-04-28 08:41:07,097 INFO L290 TraceCheckUtils]: 37: Hoare triple {1896#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {1896#false} is VALID [2022-04-28 08:41:07,097 INFO L290 TraceCheckUtils]: 38: Hoare triple {1896#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {1896#false} is VALID [2022-04-28 08:41:07,097 INFO L290 TraceCheckUtils]: 39: Hoare triple {1896#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {1896#false} is VALID [2022-04-28 08:41:07,097 INFO L290 TraceCheckUtils]: 40: Hoare triple {1896#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {1896#false} is VALID [2022-04-28 08:41:07,097 INFO L290 TraceCheckUtils]: 41: Hoare triple {1896#false} assume 8 == ~blastFlag~0; {1896#false} is VALID [2022-04-28 08:41:07,097 INFO L290 TraceCheckUtils]: 42: Hoare triple {1896#false} assume !false; {1896#false} is VALID [2022-04-28 08:41:07,098 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 08:41:07,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:41:07,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267338389] [2022-04-28 08:41:07,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267338389] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:41:07,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:41:07,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:41:07,102 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:41:07,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [286216875] [2022-04-28 08:41:07,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [286216875] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:41:07,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:41:07,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:41:07,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002245267] [2022-04-28 08:41:07,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:41:07,104 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-28 08:41:07,104 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:41:07,105 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:07,133 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:41:07,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:41:07,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:41:07,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:41:07,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:41:07,136 INFO L87 Difference]: Start difference. First operand 170 states and 265 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:13,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:41:13,986 INFO L93 Difference]: Finished difference Result 444 states and 697 transitions. [2022-04-28 08:41:13,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:41:13,986 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-28 08:41:13,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:41:13,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:13,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 597 transitions. [2022-04-28 08:41:13,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:13,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 597 transitions. [2022-04-28 08:41:13,995 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 597 transitions. [2022-04-28 08:41:14,363 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 597 edges. 597 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:41:14,368 INFO L225 Difference]: With dead ends: 444 [2022-04-28 08:41:14,368 INFO L226 Difference]: Without dead ends: 289 [2022-04-28 08:41:14,368 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 08:41:14,369 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 134 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-04-28 08:41:14,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 342 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-04-28 08:41:14,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2022-04-28 08:41:14,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 199. [2022-04-28 08:41:14,384 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:41:14,385 INFO L82 GeneralOperation]: Start isEquivalent. First operand 289 states. Second operand has 199 states, 194 states have (on average 1.6134020618556701) internal successors, (313), 194 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:14,385 INFO L74 IsIncluded]: Start isIncluded. First operand 289 states. Second operand has 199 states, 194 states have (on average 1.6134020618556701) internal successors, (313), 194 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:14,386 INFO L87 Difference]: Start difference. First operand 289 states. Second operand has 199 states, 194 states have (on average 1.6134020618556701) internal successors, (313), 194 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:14,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:41:14,398 INFO L93 Difference]: Finished difference Result 289 states and 450 transitions. [2022-04-28 08:41:14,398 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 450 transitions. [2022-04-28 08:41:14,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:41:14,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:41:14,399 INFO L74 IsIncluded]: Start isIncluded. First operand has 199 states, 194 states have (on average 1.6134020618556701) internal successors, (313), 194 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 289 states. [2022-04-28 08:41:14,400 INFO L87 Difference]: Start difference. First operand has 199 states, 194 states have (on average 1.6134020618556701) internal successors, (313), 194 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 289 states. [2022-04-28 08:41:14,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:41:14,412 INFO L93 Difference]: Finished difference Result 289 states and 450 transitions. [2022-04-28 08:41:14,412 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 450 transitions. [2022-04-28 08:41:14,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:41:14,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:41:14,412 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:41:14,412 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:41:14,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 194 states have (on average 1.6134020618556701) internal successors, (313), 194 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:14,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 317 transitions. [2022-04-28 08:41:14,420 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 317 transitions. Word has length 43 [2022-04-28 08:41:14,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:41:14,420 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 317 transitions. [2022-04-28 08:41:14,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:14,421 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 199 states and 317 transitions. [2022-04-28 08:41:14,615 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 317 edges. 317 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:41:14,616 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 317 transitions. [2022-04-28 08:41:14,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-28 08:41:14,616 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:41:14,616 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:41:14,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 08:41:14,617 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:41:14,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:41:14,617 INFO L85 PathProgramCache]: Analyzing trace with hash 887448580, now seen corresponding path program 1 times [2022-04-28 08:41:14,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:41:14,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1335957597] [2022-04-28 08:41:14,617 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:41:14,618 INFO L85 PathProgramCache]: Analyzing trace with hash 887448580, now seen corresponding path program 2 times [2022-04-28 08:41:14,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:41:14,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082800564] [2022-04-28 08:41:14,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:41:14,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:41:14,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:41:14,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:41:14,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:41:14,755 INFO L290 TraceCheckUtils]: 0: Hoare triple {3778#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {3771#true} is VALID [2022-04-28 08:41:14,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {3771#true} assume true; {3771#true} is VALID [2022-04-28 08:41:14,755 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3771#true} {3771#true} #689#return; {3771#true} is VALID [2022-04-28 08:41:14,756 INFO L272 TraceCheckUtils]: 0: Hoare triple {3771#true} call ULTIMATE.init(); {3778#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:41:14,756 INFO L290 TraceCheckUtils]: 1: Hoare triple {3778#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {3771#true} is VALID [2022-04-28 08:41:14,756 INFO L290 TraceCheckUtils]: 2: Hoare triple {3771#true} assume true; {3771#true} is VALID [2022-04-28 08:41:14,756 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3771#true} {3771#true} #689#return; {3771#true} is VALID [2022-04-28 08:41:14,756 INFO L272 TraceCheckUtils]: 4: Hoare triple {3771#true} call #t~ret161 := main(); {3771#true} is VALID [2022-04-28 08:41:14,757 INFO L290 TraceCheckUtils]: 5: Hoare triple {3771#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~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(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #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, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);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, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);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, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {3771#true} is VALID [2022-04-28 08:41:14,757 INFO L290 TraceCheckUtils]: 6: Hoare triple {3771#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {3771#true} is VALID [2022-04-28 08:41:14,757 INFO L272 TraceCheckUtils]: 7: Hoare triple {3771#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {3771#true} is VALID [2022-04-28 08:41:14,758 INFO L290 TraceCheckUtils]: 8: Hoare triple {3771#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~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, 192 + ~s.offset, 4); {3776#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:14,759 INFO L290 TraceCheckUtils]: 9: Hoare triple {3776#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {3776#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:14,761 INFO L290 TraceCheckUtils]: 10: Hoare triple {3776#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {3776#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:14,762 INFO L290 TraceCheckUtils]: 11: Hoare triple {3776#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {3776#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:14,762 INFO L290 TraceCheckUtils]: 12: Hoare triple {3776#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {3776#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:14,763 INFO L290 TraceCheckUtils]: 13: Hoare triple {3776#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {3776#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:14,763 INFO L290 TraceCheckUtils]: 14: Hoare triple {3776#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {3776#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:14,763 INFO L290 TraceCheckUtils]: 15: Hoare triple {3776#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {3776#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:14,764 INFO L290 TraceCheckUtils]: 16: Hoare triple {3776#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {3776#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:14,764 INFO L290 TraceCheckUtils]: 17: Hoare triple {3776#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {3776#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:14,765 INFO L290 TraceCheckUtils]: 18: Hoare triple {3776#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {3776#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:14,766 INFO L290 TraceCheckUtils]: 19: Hoare triple {3776#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {3776#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:14,766 INFO L290 TraceCheckUtils]: 20: Hoare triple {3776#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {3776#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:14,767 INFO L290 TraceCheckUtils]: 21: Hoare triple {3776#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {3776#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:14,767 INFO L290 TraceCheckUtils]: 22: Hoare triple {3776#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {3776#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:14,768 INFO L290 TraceCheckUtils]: 23: Hoare triple {3776#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {3776#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:14,768 INFO L290 TraceCheckUtils]: 24: Hoare triple {3776#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {3776#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:14,769 INFO L290 TraceCheckUtils]: 25: Hoare triple {3776#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {3776#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:14,770 INFO L290 TraceCheckUtils]: 26: Hoare triple {3776#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {3776#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:14,770 INFO L290 TraceCheckUtils]: 27: Hoare triple {3776#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {3776#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:14,771 INFO L290 TraceCheckUtils]: 28: Hoare triple {3776#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {3776#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:14,777 INFO L290 TraceCheckUtils]: 29: Hoare triple {3776#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {3776#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:14,778 INFO L290 TraceCheckUtils]: 30: Hoare triple {3776#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {3776#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:14,778 INFO L290 TraceCheckUtils]: 31: Hoare triple {3776#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {3776#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:14,779 INFO L290 TraceCheckUtils]: 32: Hoare triple {3776#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {3776#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:14,779 INFO L290 TraceCheckUtils]: 33: Hoare triple {3776#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {3776#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:14,779 INFO L290 TraceCheckUtils]: 34: Hoare triple {3776#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {3776#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:14,780 INFO L290 TraceCheckUtils]: 35: Hoare triple {3776#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {3776#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:14,780 INFO L290 TraceCheckUtils]: 36: Hoare triple {3776#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {3776#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:14,781 INFO L290 TraceCheckUtils]: 37: Hoare triple {3776#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {3776#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:14,781 INFO L290 TraceCheckUtils]: 38: Hoare triple {3776#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {3776#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:14,781 INFO L290 TraceCheckUtils]: 39: Hoare triple {3776#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {3776#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:14,782 INFO L290 TraceCheckUtils]: 40: Hoare triple {3776#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {3776#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:14,782 INFO L290 TraceCheckUtils]: 41: Hoare triple {3776#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {3776#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:14,783 INFO L290 TraceCheckUtils]: 42: Hoare triple {3776#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {3776#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:14,783 INFO L290 TraceCheckUtils]: 43: Hoare triple {3776#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {3777#(not (= |ssl3_accept_#t~mem75| 8640))} is VALID [2022-04-28 08:41:14,783 INFO L290 TraceCheckUtils]: 44: Hoare triple {3777#(not (= |ssl3_accept_#t~mem75| 8640))} assume 8640 == #t~mem75;havoc #t~mem75; {3772#false} is VALID [2022-04-28 08:41:14,783 INFO L290 TraceCheckUtils]: 45: Hoare triple {3772#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {3772#false} is VALID [2022-04-28 08:41:14,784 INFO L290 TraceCheckUtils]: 46: Hoare triple {3772#false} assume 5 == ~blastFlag~0; {3772#false} is VALID [2022-04-28 08:41:14,784 INFO L290 TraceCheckUtils]: 47: Hoare triple {3772#false} assume !false; {3772#false} is VALID [2022-04-28 08:41:14,784 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 08:41:14,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:41:14,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082800564] [2022-04-28 08:41:14,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082800564] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:41:14,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:41:14,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:41:14,785 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:41:14,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1335957597] [2022-04-28 08:41:14,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1335957597] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:41:14,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:41:14,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:41:14,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477261173] [2022-04-28 08:41:14,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:41:14,785 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-04-28 08:41:14,786 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:41:14,786 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:14,820 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:41:14,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:41:14,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:41:14,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:41:14,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:41:14,821 INFO L87 Difference]: Start difference. First operand 199 states and 317 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:20,468 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 08:41:21,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:41:21,630 INFO L93 Difference]: Finished difference Result 503 states and 800 transitions. [2022-04-28 08:41:21,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:41:21,630 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-04-28 08:41:21,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:41:21,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:21,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 597 transitions. [2022-04-28 08:41:21,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:21,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 597 transitions. [2022-04-28 08:41:21,639 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 597 transitions. [2022-04-28 08:41:22,006 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 597 edges. 597 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:41:22,011 INFO L225 Difference]: With dead ends: 503 [2022-04-28 08:41:22,012 INFO L226 Difference]: Without dead ends: 319 [2022-04-28 08:41:22,013 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 08:41:22,013 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 123 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 61 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:41:22,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 342 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 479 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2022-04-28 08:41:22,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-04-28 08:41:22,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 239. [2022-04-28 08:41:22,027 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:41:22,028 INFO L82 GeneralOperation]: Start isEquivalent. First operand 319 states. Second operand has 239 states, 234 states have (on average 1.641025641025641) internal successors, (384), 234 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:22,028 INFO L74 IsIncluded]: Start isIncluded. First operand 319 states. Second operand has 239 states, 234 states have (on average 1.641025641025641) internal successors, (384), 234 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:22,029 INFO L87 Difference]: Start difference. First operand 319 states. Second operand has 239 states, 234 states have (on average 1.641025641025641) internal successors, (384), 234 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:22,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:41:22,035 INFO L93 Difference]: Finished difference Result 319 states and 501 transitions. [2022-04-28 08:41:22,035 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 501 transitions. [2022-04-28 08:41:22,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:41:22,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:41:22,036 INFO L74 IsIncluded]: Start isIncluded. First operand has 239 states, 234 states have (on average 1.641025641025641) internal successors, (384), 234 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 319 states. [2022-04-28 08:41:22,036 INFO L87 Difference]: Start difference. First operand has 239 states, 234 states have (on average 1.641025641025641) internal successors, (384), 234 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 319 states. [2022-04-28 08:41:22,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:41:22,041 INFO L93 Difference]: Finished difference Result 319 states and 501 transitions. [2022-04-28 08:41:22,041 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 501 transitions. [2022-04-28 08:41:22,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:41:22,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:41:22,042 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:41:22,042 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:41:22,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 234 states have (on average 1.641025641025641) internal successors, (384), 234 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:22,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 388 transitions. [2022-04-28 08:41:22,046 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 388 transitions. Word has length 48 [2022-04-28 08:41:22,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:41:22,047 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 388 transitions. [2022-04-28 08:41:22,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:22,047 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 239 states and 388 transitions. [2022-04-28 08:41:22,298 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 388 edges. 388 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:41:22,298 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 388 transitions. [2022-04-28 08:41:22,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-28 08:41:22,299 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:41:22,300 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:41:22,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 08:41:22,300 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:41:22,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:41:22,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1734094884, now seen corresponding path program 1 times [2022-04-28 08:41:22,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:41:22,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1368995558] [2022-04-28 08:41:22,301 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:41:22,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1734094884, now seen corresponding path program 2 times [2022-04-28 08:41:22,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:41:22,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749564952] [2022-04-28 08:41:22,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:41:22,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:41:22,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:41:22,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:41:22,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:41:22,431 INFO L290 TraceCheckUtils]: 0: Hoare triple {5912#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {5905#true} is VALID [2022-04-28 08:41:22,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {5905#true} assume true; {5905#true} is VALID [2022-04-28 08:41:22,432 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5905#true} {5905#true} #689#return; {5905#true} is VALID [2022-04-28 08:41:22,432 INFO L272 TraceCheckUtils]: 0: Hoare triple {5905#true} call ULTIMATE.init(); {5912#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:41:22,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {5912#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {5905#true} is VALID [2022-04-28 08:41:22,433 INFO L290 TraceCheckUtils]: 2: Hoare triple {5905#true} assume true; {5905#true} is VALID [2022-04-28 08:41:22,433 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5905#true} {5905#true} #689#return; {5905#true} is VALID [2022-04-28 08:41:22,433 INFO L272 TraceCheckUtils]: 4: Hoare triple {5905#true} call #t~ret161 := main(); {5905#true} is VALID [2022-04-28 08:41:22,433 INFO L290 TraceCheckUtils]: 5: Hoare triple {5905#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~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(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #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, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);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, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);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, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {5905#true} is VALID [2022-04-28 08:41:22,433 INFO L290 TraceCheckUtils]: 6: Hoare triple {5905#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {5905#true} is VALID [2022-04-28 08:41:22,433 INFO L272 TraceCheckUtils]: 7: Hoare triple {5905#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {5905#true} is VALID [2022-04-28 08:41:22,435 INFO L290 TraceCheckUtils]: 8: Hoare triple {5905#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~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, 192 + ~s.offset, 4); {5910#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:22,435 INFO L290 TraceCheckUtils]: 9: Hoare triple {5910#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {5910#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:22,436 INFO L290 TraceCheckUtils]: 10: Hoare triple {5910#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {5910#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:22,436 INFO L290 TraceCheckUtils]: 11: Hoare triple {5910#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {5910#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:22,437 INFO L290 TraceCheckUtils]: 12: Hoare triple {5910#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {5910#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:22,437 INFO L290 TraceCheckUtils]: 13: Hoare triple {5910#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {5910#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:22,438 INFO L290 TraceCheckUtils]: 14: Hoare triple {5910#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {5910#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:22,438 INFO L290 TraceCheckUtils]: 15: Hoare triple {5910#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {5910#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:22,438 INFO L290 TraceCheckUtils]: 16: Hoare triple {5910#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {5910#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:22,439 INFO L290 TraceCheckUtils]: 17: Hoare triple {5910#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {5910#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:22,439 INFO L290 TraceCheckUtils]: 18: Hoare triple {5910#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {5910#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:22,439 INFO L290 TraceCheckUtils]: 19: Hoare triple {5910#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {5910#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:22,440 INFO L290 TraceCheckUtils]: 20: Hoare triple {5910#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {5910#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:22,440 INFO L290 TraceCheckUtils]: 21: Hoare triple {5910#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {5910#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:22,440 INFO L290 TraceCheckUtils]: 22: Hoare triple {5910#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {5910#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:22,441 INFO L290 TraceCheckUtils]: 23: Hoare triple {5910#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {5910#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:22,441 INFO L290 TraceCheckUtils]: 24: Hoare triple {5910#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {5910#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:22,442 INFO L290 TraceCheckUtils]: 25: Hoare triple {5910#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {5910#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:22,442 INFO L290 TraceCheckUtils]: 26: Hoare triple {5910#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {5910#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:22,442 INFO L290 TraceCheckUtils]: 27: Hoare triple {5910#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {5910#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:22,443 INFO L290 TraceCheckUtils]: 28: Hoare triple {5910#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {5910#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:22,443 INFO L290 TraceCheckUtils]: 29: Hoare triple {5910#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {5910#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:22,444 INFO L290 TraceCheckUtils]: 30: Hoare triple {5910#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {5910#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:22,444 INFO L290 TraceCheckUtils]: 31: Hoare triple {5910#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {5910#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:22,445 INFO L290 TraceCheckUtils]: 32: Hoare triple {5910#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {5910#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:22,445 INFO L290 TraceCheckUtils]: 33: Hoare triple {5910#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {5910#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:22,445 INFO L290 TraceCheckUtils]: 34: Hoare triple {5910#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {5910#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:22,446 INFO L290 TraceCheckUtils]: 35: Hoare triple {5910#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {5910#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:22,446 INFO L290 TraceCheckUtils]: 36: Hoare triple {5910#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {5910#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:22,446 INFO L290 TraceCheckUtils]: 37: Hoare triple {5910#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {5910#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:22,447 INFO L290 TraceCheckUtils]: 38: Hoare triple {5910#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {5910#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:22,447 INFO L290 TraceCheckUtils]: 39: Hoare triple {5910#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {5910#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:22,447 INFO L290 TraceCheckUtils]: 40: Hoare triple {5910#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {5910#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:22,448 INFO L290 TraceCheckUtils]: 41: Hoare triple {5910#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {5910#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:22,448 INFO L290 TraceCheckUtils]: 42: Hoare triple {5910#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {5910#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:22,451 INFO L290 TraceCheckUtils]: 43: Hoare triple {5910#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {5910#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:22,451 INFO L290 TraceCheckUtils]: 44: Hoare triple {5910#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {5911#(not (= |ssl3_accept_#t~mem76| 8641))} is VALID [2022-04-28 08:41:22,451 INFO L290 TraceCheckUtils]: 45: Hoare triple {5911#(not (= |ssl3_accept_#t~mem76| 8641))} assume 8641 == #t~mem76;havoc #t~mem76; {5906#false} is VALID [2022-04-28 08:41:22,452 INFO L290 TraceCheckUtils]: 46: Hoare triple {5906#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {5906#false} is VALID [2022-04-28 08:41:22,452 INFO L290 TraceCheckUtils]: 47: Hoare triple {5906#false} assume 5 == ~blastFlag~0; {5906#false} is VALID [2022-04-28 08:41:22,452 INFO L290 TraceCheckUtils]: 48: Hoare triple {5906#false} assume !false; {5906#false} is VALID [2022-04-28 08:41:22,452 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 08:41:22,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:41:22,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749564952] [2022-04-28 08:41:22,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749564952] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:41:22,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:41:22,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:41:22,453 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:41:22,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1368995558] [2022-04-28 08:41:22,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1368995558] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:41:22,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:41:22,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:41:22,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337980521] [2022-04-28 08:41:22,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:41:22,454 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-28 08:41:22,454 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:41:22,454 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:22,515 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:41:22,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:41:22,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:41:22,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:41:22,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:41:22,516 INFO L87 Difference]: Start difference. First operand 239 states and 388 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:30,154 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 08:41:31,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:41:31,238 INFO L93 Difference]: Finished difference Result 553 states and 890 transitions. [2022-04-28 08:41:31,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:41:31,238 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-28 08:41:31,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:41:31,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:31,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 596 transitions. [2022-04-28 08:41:31,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:31,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 596 transitions. [2022-04-28 08:41:31,244 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 596 transitions. [2022-04-28 08:41:31,627 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 596 edges. 596 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:41:31,633 INFO L225 Difference]: With dead ends: 553 [2022-04-28 08:41:31,633 INFO L226 Difference]: Without dead ends: 329 [2022-04-28 08:41:31,633 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 08:41:31,634 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 122 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 62 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:41:31,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 356 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 483 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2022-04-28 08:41:31,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-04-28 08:41:31,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 250. [2022-04-28 08:41:31,644 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:41:31,645 INFO L82 GeneralOperation]: Start isEquivalent. First operand 329 states. Second operand has 250 states, 245 states have (on average 1.653061224489796) internal successors, (405), 245 states have internal predecessors, (405), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:31,645 INFO L74 IsIncluded]: Start isIncluded. First operand 329 states. Second operand has 250 states, 245 states have (on average 1.653061224489796) internal successors, (405), 245 states have internal predecessors, (405), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:31,646 INFO L87 Difference]: Start difference. First operand 329 states. Second operand has 250 states, 245 states have (on average 1.653061224489796) internal successors, (405), 245 states have internal predecessors, (405), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:31,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:41:31,651 INFO L93 Difference]: Finished difference Result 329 states and 520 transitions. [2022-04-28 08:41:31,651 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 520 transitions. [2022-04-28 08:41:31,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:41:31,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:41:31,652 INFO L74 IsIncluded]: Start isIncluded. First operand has 250 states, 245 states have (on average 1.653061224489796) internal successors, (405), 245 states have internal predecessors, (405), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 329 states. [2022-04-28 08:41:31,652 INFO L87 Difference]: Start difference. First operand has 250 states, 245 states have (on average 1.653061224489796) internal successors, (405), 245 states have internal predecessors, (405), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 329 states. [2022-04-28 08:41:31,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:41:31,657 INFO L93 Difference]: Finished difference Result 329 states and 520 transitions. [2022-04-28 08:41:31,657 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 520 transitions. [2022-04-28 08:41:31,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:41:31,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:41:31,658 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:41:31,658 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:41:31,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 245 states have (on average 1.653061224489796) internal successors, (405), 245 states have internal predecessors, (405), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:31,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 409 transitions. [2022-04-28 08:41:31,662 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 409 transitions. Word has length 49 [2022-04-28 08:41:31,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:41:31,662 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 409 transitions. [2022-04-28 08:41:31,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:31,663 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 409 transitions. [2022-04-28 08:41:31,937 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 409 edges. 409 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:41:31,938 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 409 transitions. [2022-04-28 08:41:31,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-04-28 08:41:31,938 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:41:31,938 INFO L195 NwaCegarLoop]: trace histogram [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 08:41:31,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 08:41:31,939 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:41:31,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:41:31,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1073389890, now seen corresponding path program 1 times [2022-04-28 08:41:31,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:41:31,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2050982704] [2022-04-28 08:41:32,003 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:41:32,003 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:41:32,003 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:41:32,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1073389890, now seen corresponding path program 2 times [2022-04-28 08:41:32,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:41:32,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231670656] [2022-04-28 08:41:32,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:41:32,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:41:32,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:41:32,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:41:32,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:41:32,111 INFO L290 TraceCheckUtils]: 0: Hoare triple {8188#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {8181#true} is VALID [2022-04-28 08:41:32,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {8181#true} assume true; {8181#true} is VALID [2022-04-28 08:41:32,111 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8181#true} {8181#true} #689#return; {8181#true} is VALID [2022-04-28 08:41:32,112 INFO L272 TraceCheckUtils]: 0: Hoare triple {8181#true} call ULTIMATE.init(); {8188#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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 08:41:32,112 INFO L290 TraceCheckUtils]: 1: Hoare triple {8188#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {8181#true} is VALID [2022-04-28 08:41:32,112 INFO L290 TraceCheckUtils]: 2: Hoare triple {8181#true} assume true; {8181#true} is VALID [2022-04-28 08:41:32,113 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8181#true} {8181#true} #689#return; {8181#true} is VALID [2022-04-28 08:41:32,113 INFO L272 TraceCheckUtils]: 4: Hoare triple {8181#true} call #t~ret161 := main(); {8181#true} is VALID [2022-04-28 08:41:32,113 INFO L290 TraceCheckUtils]: 5: Hoare triple {8181#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~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(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #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, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);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, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);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, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {8181#true} is VALID [2022-04-28 08:41:32,113 INFO L290 TraceCheckUtils]: 6: Hoare triple {8181#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {8181#true} is VALID [2022-04-28 08:41:32,113 INFO L272 TraceCheckUtils]: 7: Hoare triple {8181#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {8181#true} is VALID [2022-04-28 08:41:32,115 INFO L290 TraceCheckUtils]: 8: Hoare triple {8181#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 -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~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, 192 + ~s.offset, 4); {8186#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:32,115 INFO L290 TraceCheckUtils]: 9: Hoare triple {8186#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {8186#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:32,116 INFO L290 TraceCheckUtils]: 10: Hoare triple {8186#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {8186#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:32,116 INFO L290 TraceCheckUtils]: 11: Hoare triple {8186#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {8186#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:32,117 INFO L290 TraceCheckUtils]: 12: Hoare triple {8186#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {8186#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:32,117 INFO L290 TraceCheckUtils]: 13: Hoare triple {8186#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {8186#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:32,117 INFO L290 TraceCheckUtils]: 14: Hoare triple {8186#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {8186#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:32,118 INFO L290 TraceCheckUtils]: 15: Hoare triple {8186#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {8186#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:32,118 INFO L290 TraceCheckUtils]: 16: Hoare triple {8186#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {8186#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:32,118 INFO L290 TraceCheckUtils]: 17: Hoare triple {8186#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {8186#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:32,119 INFO L290 TraceCheckUtils]: 18: Hoare triple {8186#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {8186#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:32,119 INFO L290 TraceCheckUtils]: 19: Hoare triple {8186#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {8186#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:32,119 INFO L290 TraceCheckUtils]: 20: Hoare triple {8186#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {8186#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:32,120 INFO L290 TraceCheckUtils]: 21: Hoare triple {8186#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {8186#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:32,120 INFO L290 TraceCheckUtils]: 22: Hoare triple {8186#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {8186#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:32,120 INFO L290 TraceCheckUtils]: 23: Hoare triple {8186#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {8186#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:32,121 INFO L290 TraceCheckUtils]: 24: Hoare triple {8186#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {8186#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:32,121 INFO L290 TraceCheckUtils]: 25: Hoare triple {8186#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {8186#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:32,122 INFO L290 TraceCheckUtils]: 26: Hoare triple {8186#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {8186#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:32,122 INFO L290 TraceCheckUtils]: 27: Hoare triple {8186#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {8186#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:32,122 INFO L290 TraceCheckUtils]: 28: Hoare triple {8186#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {8186#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:32,123 INFO L290 TraceCheckUtils]: 29: Hoare triple {8186#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {8186#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:32,123 INFO L290 TraceCheckUtils]: 30: Hoare triple {8186#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {8187#(not (= |ssl3_accept_#t~mem62| 8528))} is VALID [2022-04-28 08:41:32,123 INFO L290 TraceCheckUtils]: 31: Hoare triple {8187#(not (= |ssl3_accept_#t~mem62| 8528))} assume 8528 == #t~mem62;havoc #t~mem62; {8182#false} is VALID [2022-04-28 08:41:32,123 INFO L290 TraceCheckUtils]: 32: Hoare triple {8182#false} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 836 + #t~mem99.offset, 4);call #t~mem101 := read~int(#t~mem100.base, 12 + #t~mem100.offset, 4);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 232 + ~s.offset, 4); {8182#false} is VALID [2022-04-28 08:41:32,123 INFO L290 TraceCheckUtils]: 33: Hoare triple {8182#false} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 4294967296;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem103.base, 871 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {8182#false} is VALID [2022-04-28 08:41:32,124 INFO L290 TraceCheckUtils]: 34: Hoare triple {8182#false} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem106 := read~int(#t~mem105.base, 871 + #t~mem105.offset, 4); {8182#false} is VALID [2022-04-28 08:41:32,124 INFO L290 TraceCheckUtils]: 35: Hoare triple {8182#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {8182#false} is VALID [2022-04-28 08:41:32,124 INFO L290 TraceCheckUtils]: 36: Hoare triple {8182#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {8182#false} is VALID [2022-04-28 08:41:32,124 INFO L290 TraceCheckUtils]: 37: Hoare triple {8182#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {8182#false} is VALID [2022-04-28 08:41:32,124 INFO L290 TraceCheckUtils]: 38: Hoare triple {8182#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {8182#false} is VALID [2022-04-28 08:41:32,124 INFO L290 TraceCheckUtils]: 39: Hoare triple {8182#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {8182#false} is VALID [2022-04-28 08:41:32,124 INFO L290 TraceCheckUtils]: 40: Hoare triple {8182#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {8182#false} is VALID [2022-04-28 08:41:32,124 INFO L290 TraceCheckUtils]: 41: Hoare triple {8182#false} ~skip~0 := 0; {8182#false} is VALID [2022-04-28 08:41:32,124 INFO L290 TraceCheckUtils]: 42: Hoare triple {8182#false} assume !false; {8182#false} is VALID [2022-04-28 08:41:32,124 INFO L290 TraceCheckUtils]: 43: Hoare triple {8182#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {8182#false} is VALID [2022-04-28 08:41:32,125 INFO L290 TraceCheckUtils]: 44: Hoare triple {8182#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {8182#false} is VALID [2022-04-28 08:41:32,125 INFO L290 TraceCheckUtils]: 45: Hoare triple {8182#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {8182#false} is VALID [2022-04-28 08:41:32,125 INFO L290 TraceCheckUtils]: 46: Hoare triple {8182#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {8182#false} is VALID [2022-04-28 08:41:32,125 INFO L290 TraceCheckUtils]: 47: Hoare triple {8182#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {8182#false} is VALID [2022-04-28 08:41:32,125 INFO L290 TraceCheckUtils]: 48: Hoare triple {8182#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {8182#false} is VALID [2022-04-28 08:41:32,125 INFO L290 TraceCheckUtils]: 49: Hoare triple {8182#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {8182#false} is VALID [2022-04-28 08:41:32,125 INFO L290 TraceCheckUtils]: 50: Hoare triple {8182#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {8182#false} is VALID [2022-04-28 08:41:32,125 INFO L290 TraceCheckUtils]: 51: Hoare triple {8182#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {8182#false} is VALID [2022-04-28 08:41:32,125 INFO L290 TraceCheckUtils]: 52: Hoare triple {8182#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {8182#false} is VALID [2022-04-28 08:41:32,125 INFO L290 TraceCheckUtils]: 53: Hoare triple {8182#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {8182#false} is VALID [2022-04-28 08:41:32,125 INFO L290 TraceCheckUtils]: 54: Hoare triple {8182#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {8182#false} is VALID [2022-04-28 08:41:32,125 INFO L290 TraceCheckUtils]: 55: Hoare triple {8182#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {8182#false} is VALID [2022-04-28 08:41:32,126 INFO L290 TraceCheckUtils]: 56: Hoare triple {8182#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {8182#false} is VALID [2022-04-28 08:41:32,126 INFO L290 TraceCheckUtils]: 57: Hoare triple {8182#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {8182#false} is VALID [2022-04-28 08:41:32,126 INFO L290 TraceCheckUtils]: 58: Hoare triple {8182#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {8182#false} is VALID [2022-04-28 08:41:32,126 INFO L290 TraceCheckUtils]: 59: Hoare triple {8182#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {8182#false} is VALID [2022-04-28 08:41:32,126 INFO L290 TraceCheckUtils]: 60: Hoare triple {8182#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {8182#false} is VALID [2022-04-28 08:41:32,126 INFO L290 TraceCheckUtils]: 61: Hoare triple {8182#false} assume 8544 == #t~mem64;havoc #t~mem64; {8182#false} is VALID [2022-04-28 08:41:32,126 INFO L290 TraceCheckUtils]: 62: Hoare triple {8182#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {8182#false} is VALID [2022-04-28 08:41:32,126 INFO L290 TraceCheckUtils]: 63: Hoare triple {8182#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {8182#false} is VALID [2022-04-28 08:41:32,126 INFO L290 TraceCheckUtils]: 64: Hoare triple {8182#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {8182#false} is VALID [2022-04-28 08:41:32,126 INFO L290 TraceCheckUtils]: 65: Hoare triple {8182#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {8182#false} is VALID [2022-04-28 08:41:32,126 INFO L290 TraceCheckUtils]: 66: Hoare triple {8182#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {8182#false} is VALID [2022-04-28 08:41:32,127 INFO L290 TraceCheckUtils]: 67: Hoare triple {8182#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {8182#false} is VALID [2022-04-28 08:41:32,127 INFO L290 TraceCheckUtils]: 68: Hoare triple {8182#false} assume 8 == ~blastFlag~0; {8182#false} is VALID [2022-04-28 08:41:32,127 INFO L290 TraceCheckUtils]: 69: Hoare triple {8182#false} assume !false; {8182#false} is VALID [2022-04-28 08:41:32,127 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:41:32,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:41:32,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231670656] [2022-04-28 08:41:32,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231670656] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:41:32,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:41:32,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:41:32,128 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:41:32,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2050982704] [2022-04-28 08:41:32,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2050982704] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:41:32,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:41:32,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:41:32,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570306930] [2022-04-28 08:41:32,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:41:32,128 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 08:41:32,129 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:41:32,129 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 08:41:32,175 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 08:41:32,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:41:32,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:41:32,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:41:32,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:41:32,177 INFO L87 Difference]: Start difference. First operand 250 states and 409 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 08:41:37,951 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:41:40,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:41:40,054 INFO L93 Difference]: Finished difference Result 604 states and 981 transitions. [2022-04-28 08:41:40,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:41:40,055 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 08:41:40,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:41:40,055 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 08:41:40,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 595 transitions. [2022-04-28 08:41:40,058 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 08:41:40,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 595 transitions. [2022-04-28 08:41:40,060 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 595 transitions. [2022-04-28 08:41:40,450 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 595 edges. 595 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:41:40,456 INFO L225 Difference]: With dead ends: 604 [2022-04-28 08:41:40,456 INFO L226 Difference]: Without dead ends: 369 [2022-04-28 08:41:40,457 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 08:41:40,457 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 135 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-04-28 08:41:40,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 356 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-04-28 08:41:40,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2022-04-28 08:41:40,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 276. [2022-04-28 08:41:40,469 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:41:40,469 INFO L82 GeneralOperation]: Start isEquivalent. First operand 369 states. Second operand has 276 states, 271 states have (on average 1.6568265682656826) internal successors, (449), 271 states have internal predecessors, (449), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:40,470 INFO L74 IsIncluded]: Start isIncluded. First operand 369 states. Second operand has 276 states, 271 states have (on average 1.6568265682656826) internal successors, (449), 271 states have internal predecessors, (449), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:40,470 INFO L87 Difference]: Start difference. First operand 369 states. Second operand has 276 states, 271 states have (on average 1.6568265682656826) internal successors, (449), 271 states have internal predecessors, (449), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:40,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:41:40,476 INFO L93 Difference]: Finished difference Result 369 states and 588 transitions. [2022-04-28 08:41:40,476 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 588 transitions. [2022-04-28 08:41:40,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:41:40,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:41:40,477 INFO L74 IsIncluded]: Start isIncluded. First operand has 276 states, 271 states have (on average 1.6568265682656826) internal successors, (449), 271 states have internal predecessors, (449), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 369 states. [2022-04-28 08:41:40,477 INFO L87 Difference]: Start difference. First operand has 276 states, 271 states have (on average 1.6568265682656826) internal successors, (449), 271 states have internal predecessors, (449), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 369 states. [2022-04-28 08:41:40,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:41:40,483 INFO L93 Difference]: Finished difference Result 369 states and 588 transitions. [2022-04-28 08:41:40,483 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 588 transitions. [2022-04-28 08:41:40,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:41:40,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:41:40,483 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:41:40,483 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:41:40,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 271 states have (on average 1.6568265682656826) internal successors, (449), 271 states have internal predecessors, (449), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:40,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 453 transitions. [2022-04-28 08:41:40,488 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 453 transitions. Word has length 70 [2022-04-28 08:41:40,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:41:40,488 INFO L495 AbstractCegarLoop]: Abstraction has 276 states and 453 transitions. [2022-04-28 08:41:40,488 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 08:41:40,488 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 276 states and 453 transitions. [2022-04-28 08:41:40,784 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 08:41:40,784 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 453 transitions. [2022-04-28 08:41:40,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-28 08:41:40,785 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:41:40,785 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-04-28 08:41:40,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 08:41:40,785 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:41:40,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:41:40,786 INFO L85 PathProgramCache]: Analyzing trace with hash -339232893, now seen corresponding path program 1 times [2022-04-28 08:41:40,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:41:40,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [695860604] [2022-04-28 08:41:40,832 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:41:40,832 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:41:40,832 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:41:40,832 INFO L85 PathProgramCache]: Analyzing trace with hash -339232893, now seen corresponding path program 2 times [2022-04-28 08:41:40,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:41:40,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373013072] [2022-04-28 08:41:40,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:41:40,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:41:40,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:41:40,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:41:40,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:41:40,967 INFO L290 TraceCheckUtils]: 0: Hoare triple {10698#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {10691#true} is VALID [2022-04-28 08:41:40,967 INFO L290 TraceCheckUtils]: 1: Hoare triple {10691#true} assume true; {10691#true} is VALID [2022-04-28 08:41:40,967 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10691#true} {10691#true} #689#return; {10691#true} is VALID [2022-04-28 08:41:40,968 INFO L272 TraceCheckUtils]: 0: Hoare triple {10691#true} call ULTIMATE.init(); {10698#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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 08:41:40,968 INFO L290 TraceCheckUtils]: 1: Hoare triple {10698#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {10691#true} is VALID [2022-04-28 08:41:40,968 INFO L290 TraceCheckUtils]: 2: Hoare triple {10691#true} assume true; {10691#true} is VALID [2022-04-28 08:41:40,969 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10691#true} {10691#true} #689#return; {10691#true} is VALID [2022-04-28 08:41:40,969 INFO L272 TraceCheckUtils]: 4: Hoare triple {10691#true} call #t~ret161 := main(); {10691#true} is VALID [2022-04-28 08:41:40,969 INFO L290 TraceCheckUtils]: 5: Hoare triple {10691#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~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(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #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, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);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, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);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, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {10691#true} is VALID [2022-04-28 08:41:40,969 INFO L290 TraceCheckUtils]: 6: Hoare triple {10691#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {10691#true} is VALID [2022-04-28 08:41:40,969 INFO L272 TraceCheckUtils]: 7: Hoare triple {10691#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {10691#true} is VALID [2022-04-28 08:41:40,971 INFO L290 TraceCheckUtils]: 8: Hoare triple {10691#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 -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~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, 192 + ~s.offset, 4); {10696#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:40,971 INFO L290 TraceCheckUtils]: 9: Hoare triple {10696#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {10696#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:40,972 INFO L290 TraceCheckUtils]: 10: Hoare triple {10696#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {10696#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:40,972 INFO L290 TraceCheckUtils]: 11: Hoare triple {10696#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {10696#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:40,972 INFO L290 TraceCheckUtils]: 12: Hoare triple {10696#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {10696#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:40,973 INFO L290 TraceCheckUtils]: 13: Hoare triple {10696#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {10696#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:40,973 INFO L290 TraceCheckUtils]: 14: Hoare triple {10696#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {10696#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:40,974 INFO L290 TraceCheckUtils]: 15: Hoare triple {10696#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {10696#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:40,974 INFO L290 TraceCheckUtils]: 16: Hoare triple {10696#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {10696#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:40,974 INFO L290 TraceCheckUtils]: 17: Hoare triple {10696#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {10696#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:40,975 INFO L290 TraceCheckUtils]: 18: Hoare triple {10696#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {10696#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:40,975 INFO L290 TraceCheckUtils]: 19: Hoare triple {10696#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {10696#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:40,975 INFO L290 TraceCheckUtils]: 20: Hoare triple {10696#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {10696#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:40,976 INFO L290 TraceCheckUtils]: 21: Hoare triple {10696#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {10696#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:40,976 INFO L290 TraceCheckUtils]: 22: Hoare triple {10696#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {10696#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:40,976 INFO L290 TraceCheckUtils]: 23: Hoare triple {10696#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {10696#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:40,977 INFO L290 TraceCheckUtils]: 24: Hoare triple {10696#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {10696#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:40,977 INFO L290 TraceCheckUtils]: 25: Hoare triple {10696#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {10696#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:40,977 INFO L290 TraceCheckUtils]: 26: Hoare triple {10696#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {10696#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:40,978 INFO L290 TraceCheckUtils]: 27: Hoare triple {10696#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {10696#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:40,978 INFO L290 TraceCheckUtils]: 28: Hoare triple {10696#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {10696#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:40,979 INFO L290 TraceCheckUtils]: 29: Hoare triple {10696#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {10696#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:40,979 INFO L290 TraceCheckUtils]: 30: Hoare triple {10696#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {10696#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:40,979 INFO L290 TraceCheckUtils]: 31: Hoare triple {10696#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {10697#(not (= |ssl3_accept_#t~mem63| 8529))} is VALID [2022-04-28 08:41:40,980 INFO L290 TraceCheckUtils]: 32: Hoare triple {10697#(not (= |ssl3_accept_#t~mem63| 8529))} assume 8529 == #t~mem63;havoc #t~mem63; {10692#false} is VALID [2022-04-28 08:41:40,980 INFO L290 TraceCheckUtils]: 33: Hoare triple {10692#false} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 836 + #t~mem99.offset, 4);call #t~mem101 := read~int(#t~mem100.base, 12 + #t~mem100.offset, 4);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 232 + ~s.offset, 4); {10692#false} is VALID [2022-04-28 08:41:40,980 INFO L290 TraceCheckUtils]: 34: Hoare triple {10692#false} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 4294967296;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem103.base, 871 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {10692#false} is VALID [2022-04-28 08:41:40,981 INFO L290 TraceCheckUtils]: 35: Hoare triple {10692#false} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem106 := read~int(#t~mem105.base, 871 + #t~mem105.offset, 4); {10692#false} is VALID [2022-04-28 08:41:40,981 INFO L290 TraceCheckUtils]: 36: Hoare triple {10692#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {10692#false} is VALID [2022-04-28 08:41:40,981 INFO L290 TraceCheckUtils]: 37: Hoare triple {10692#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {10692#false} is VALID [2022-04-28 08:41:40,981 INFO L290 TraceCheckUtils]: 38: Hoare triple {10692#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {10692#false} is VALID [2022-04-28 08:41:40,981 INFO L290 TraceCheckUtils]: 39: Hoare triple {10692#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {10692#false} is VALID [2022-04-28 08:41:40,981 INFO L290 TraceCheckUtils]: 40: Hoare triple {10692#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {10692#false} is VALID [2022-04-28 08:41:40,981 INFO L290 TraceCheckUtils]: 41: Hoare triple {10692#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {10692#false} is VALID [2022-04-28 08:41:40,981 INFO L290 TraceCheckUtils]: 42: Hoare triple {10692#false} ~skip~0 := 0; {10692#false} is VALID [2022-04-28 08:41:40,981 INFO L290 TraceCheckUtils]: 43: Hoare triple {10692#false} assume !false; {10692#false} is VALID [2022-04-28 08:41:40,981 INFO L290 TraceCheckUtils]: 44: Hoare triple {10692#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {10692#false} is VALID [2022-04-28 08:41:40,981 INFO L290 TraceCheckUtils]: 45: Hoare triple {10692#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {10692#false} is VALID [2022-04-28 08:41:40,982 INFO L290 TraceCheckUtils]: 46: Hoare triple {10692#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {10692#false} is VALID [2022-04-28 08:41:40,982 INFO L290 TraceCheckUtils]: 47: Hoare triple {10692#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {10692#false} is VALID [2022-04-28 08:41:40,982 INFO L290 TraceCheckUtils]: 48: Hoare triple {10692#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {10692#false} is VALID [2022-04-28 08:41:40,982 INFO L290 TraceCheckUtils]: 49: Hoare triple {10692#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {10692#false} is VALID [2022-04-28 08:41:40,982 INFO L290 TraceCheckUtils]: 50: Hoare triple {10692#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {10692#false} is VALID [2022-04-28 08:41:40,982 INFO L290 TraceCheckUtils]: 51: Hoare triple {10692#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {10692#false} is VALID [2022-04-28 08:41:40,982 INFO L290 TraceCheckUtils]: 52: Hoare triple {10692#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {10692#false} is VALID [2022-04-28 08:41:40,982 INFO L290 TraceCheckUtils]: 53: Hoare triple {10692#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {10692#false} is VALID [2022-04-28 08:41:40,982 INFO L290 TraceCheckUtils]: 54: Hoare triple {10692#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {10692#false} is VALID [2022-04-28 08:41:40,982 INFO L290 TraceCheckUtils]: 55: Hoare triple {10692#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {10692#false} is VALID [2022-04-28 08:41:40,982 INFO L290 TraceCheckUtils]: 56: Hoare triple {10692#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {10692#false} is VALID [2022-04-28 08:41:40,982 INFO L290 TraceCheckUtils]: 57: Hoare triple {10692#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {10692#false} is VALID [2022-04-28 08:41:40,983 INFO L290 TraceCheckUtils]: 58: Hoare triple {10692#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {10692#false} is VALID [2022-04-28 08:41:40,983 INFO L290 TraceCheckUtils]: 59: Hoare triple {10692#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {10692#false} is VALID [2022-04-28 08:41:40,983 INFO L290 TraceCheckUtils]: 60: Hoare triple {10692#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {10692#false} is VALID [2022-04-28 08:41:40,983 INFO L290 TraceCheckUtils]: 61: Hoare triple {10692#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {10692#false} is VALID [2022-04-28 08:41:40,983 INFO L290 TraceCheckUtils]: 62: Hoare triple {10692#false} assume 8544 == #t~mem64;havoc #t~mem64; {10692#false} is VALID [2022-04-28 08:41:40,983 INFO L290 TraceCheckUtils]: 63: Hoare triple {10692#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {10692#false} is VALID [2022-04-28 08:41:40,983 INFO L290 TraceCheckUtils]: 64: Hoare triple {10692#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {10692#false} is VALID [2022-04-28 08:41:40,983 INFO L290 TraceCheckUtils]: 65: Hoare triple {10692#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {10692#false} is VALID [2022-04-28 08:41:40,983 INFO L290 TraceCheckUtils]: 66: Hoare triple {10692#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {10692#false} is VALID [2022-04-28 08:41:40,983 INFO L290 TraceCheckUtils]: 67: Hoare triple {10692#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {10692#false} is VALID [2022-04-28 08:41:40,983 INFO L290 TraceCheckUtils]: 68: Hoare triple {10692#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {10692#false} is VALID [2022-04-28 08:41:40,983 INFO L290 TraceCheckUtils]: 69: Hoare triple {10692#false} assume 8 == ~blastFlag~0; {10692#false} is VALID [2022-04-28 08:41:40,984 INFO L290 TraceCheckUtils]: 70: Hoare triple {10692#false} assume !false; {10692#false} is VALID [2022-04-28 08:41:40,984 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:41:40,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:41:40,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373013072] [2022-04-28 08:41:40,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373013072] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:41:40,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:41:40,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:41:40,984 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:41:40,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [695860604] [2022-04-28 08:41:40,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [695860604] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:41:40,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:41:40,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:41:40,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197797672] [2022-04-28 08:41:40,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:41:40,986 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 71 [2022-04-28 08:41:40,986 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:41:40,986 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:41,036 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 08:41:41,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:41:41,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:41:41,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:41:41,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:41:41,038 INFO L87 Difference]: Start difference. First operand 276 states and 453 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:46,781 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:41:48,786 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 08:41:49,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:41:49,983 INFO L93 Difference]: Finished difference Result 616 states and 998 transitions. [2022-04-28 08:41:49,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:41:49,983 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 71 [2022-04-28 08:41:49,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:41:49,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:49,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 595 transitions. [2022-04-28 08:41:49,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:49,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 595 transitions. [2022-04-28 08:41:49,989 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 595 transitions. [2022-04-28 08:41:50,402 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 595 edges. 595 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:41:50,409 INFO L225 Difference]: With dead ends: 616 [2022-04-28 08:41:50,409 INFO L226 Difference]: Without dead ends: 355 [2022-04-28 08:41:50,409 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 08:41:50,410 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 134 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 58 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-04-28 08:41:50,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 392 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 501 Invalid, 1 Unknown, 0 Unchecked, 5.4s Time] [2022-04-28 08:41:50,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2022-04-28 08:41:50,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 276. [2022-04-28 08:41:50,424 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:41:50,425 INFO L82 GeneralOperation]: Start isEquivalent. First operand 355 states. Second operand has 276 states, 271 states have (on average 1.6457564575645756) internal successors, (446), 271 states have internal predecessors, (446), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:50,425 INFO L74 IsIncluded]: Start isIncluded. First operand 355 states. Second operand has 276 states, 271 states have (on average 1.6457564575645756) internal successors, (446), 271 states have internal predecessors, (446), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:50,426 INFO L87 Difference]: Start difference. First operand 355 states. Second operand has 276 states, 271 states have (on average 1.6457564575645756) internal successors, (446), 271 states have internal predecessors, (446), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:50,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:41:50,431 INFO L93 Difference]: Finished difference Result 355 states and 561 transitions. [2022-04-28 08:41:50,431 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 561 transitions. [2022-04-28 08:41:50,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:41:50,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:41:50,432 INFO L74 IsIncluded]: Start isIncluded. First operand has 276 states, 271 states have (on average 1.6457564575645756) internal successors, (446), 271 states have internal predecessors, (446), 3 states have call successors, (3), 3 states 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 08:41:50,433 INFO L87 Difference]: Start difference. First operand has 276 states, 271 states have (on average 1.6457564575645756) internal successors, (446), 271 states have internal predecessors, (446), 3 states have call successors, (3), 3 states 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 08:41:50,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:41:50,438 INFO L93 Difference]: Finished difference Result 355 states and 561 transitions. [2022-04-28 08:41:50,438 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 561 transitions. [2022-04-28 08:41:50,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:41:50,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:41:50,439 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:41:50,439 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:41:50,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 271 states have (on average 1.6457564575645756) internal successors, (446), 271 states have internal predecessors, (446), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:50,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 450 transitions. [2022-04-28 08:41:50,443 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 450 transitions. Word has length 71 [2022-04-28 08:41:50,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:41:50,443 INFO L495 AbstractCegarLoop]: Abstraction has 276 states and 450 transitions. [2022-04-28 08:41:50,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:50,444 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 276 states and 450 transitions. [2022-04-28 08:41:50,778 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 450 edges. 450 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:41:50,778 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 450 transitions. [2022-04-28 08:41:50,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-28 08:41:50,780 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:41:50,780 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-04-28 08:41:50,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 08:41:50,780 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:41:50,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:41:50,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1306774635, now seen corresponding path program 1 times [2022-04-28 08:41:50,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:41:50,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1857827583] [2022-04-28 08:41:50,804 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:41:50,804 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:41:50,804 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:41:50,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1306774635, now seen corresponding path program 2 times [2022-04-28 08:41:50,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:41:50,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348931317] [2022-04-28 08:41:50,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:41:50,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:41:50,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:41:50,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:41:50,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:41:50,916 INFO L290 TraceCheckUtils]: 0: Hoare triple {13204#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {13197#true} is VALID [2022-04-28 08:41:50,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {13197#true} assume true; {13197#true} is VALID [2022-04-28 08:41:50,917 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13197#true} {13197#true} #689#return; {13197#true} is VALID [2022-04-28 08:41:50,917 INFO L272 TraceCheckUtils]: 0: Hoare triple {13197#true} call ULTIMATE.init(); {13204#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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 08:41:50,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {13204#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {13197#true} is VALID [2022-04-28 08:41:50,917 INFO L290 TraceCheckUtils]: 2: Hoare triple {13197#true} assume true; {13197#true} is VALID [2022-04-28 08:41:50,918 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13197#true} {13197#true} #689#return; {13197#true} is VALID [2022-04-28 08:41:50,918 INFO L272 TraceCheckUtils]: 4: Hoare triple {13197#true} call #t~ret161 := main(); {13197#true} is VALID [2022-04-28 08:41:50,918 INFO L290 TraceCheckUtils]: 5: Hoare triple {13197#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~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(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #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, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);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, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);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, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {13197#true} is VALID [2022-04-28 08:41:50,918 INFO L290 TraceCheckUtils]: 6: Hoare triple {13197#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {13197#true} is VALID [2022-04-28 08:41:50,918 INFO L272 TraceCheckUtils]: 7: Hoare triple {13197#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {13197#true} is VALID [2022-04-28 08:41:50,920 INFO L290 TraceCheckUtils]: 8: Hoare triple {13197#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 -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~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, 192 + ~s.offset, 4); {13202#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:50,920 INFO L290 TraceCheckUtils]: 9: Hoare triple {13202#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {13202#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:50,921 INFO L290 TraceCheckUtils]: 10: Hoare triple {13202#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {13202#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:50,921 INFO L290 TraceCheckUtils]: 11: Hoare triple {13202#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {13202#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:50,921 INFO L290 TraceCheckUtils]: 12: Hoare triple {13202#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {13202#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:50,922 INFO L290 TraceCheckUtils]: 13: Hoare triple {13202#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {13202#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:50,922 INFO L290 TraceCheckUtils]: 14: Hoare triple {13202#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {13202#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:50,922 INFO L290 TraceCheckUtils]: 15: Hoare triple {13202#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {13202#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:50,923 INFO L290 TraceCheckUtils]: 16: Hoare triple {13202#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {13202#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:50,923 INFO L290 TraceCheckUtils]: 17: Hoare triple {13202#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {13202#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:50,923 INFO L290 TraceCheckUtils]: 18: Hoare triple {13202#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {13202#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:50,924 INFO L290 TraceCheckUtils]: 19: Hoare triple {13202#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {13202#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:50,924 INFO L290 TraceCheckUtils]: 20: Hoare triple {13202#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {13202#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:50,924 INFO L290 TraceCheckUtils]: 21: Hoare triple {13202#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {13202#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:50,925 INFO L290 TraceCheckUtils]: 22: Hoare triple {13202#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {13202#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:50,925 INFO L290 TraceCheckUtils]: 23: Hoare triple {13202#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {13202#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:50,925 INFO L290 TraceCheckUtils]: 24: Hoare triple {13202#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {13202#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:50,926 INFO L290 TraceCheckUtils]: 25: Hoare triple {13202#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {13202#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:50,926 INFO L290 TraceCheckUtils]: 26: Hoare triple {13202#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {13202#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:50,926 INFO L290 TraceCheckUtils]: 27: Hoare triple {13202#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {13202#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:50,927 INFO L290 TraceCheckUtils]: 28: Hoare triple {13202#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {13202#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:50,927 INFO L290 TraceCheckUtils]: 29: Hoare triple {13202#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {13202#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:50,927 INFO L290 TraceCheckUtils]: 30: Hoare triple {13202#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {13202#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:50,928 INFO L290 TraceCheckUtils]: 31: Hoare triple {13202#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {13202#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:50,928 INFO L290 TraceCheckUtils]: 32: Hoare triple {13202#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {13202#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:50,930 INFO L290 TraceCheckUtils]: 33: Hoare triple {13202#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {13202#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:50,932 INFO L290 TraceCheckUtils]: 34: Hoare triple {13202#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {13202#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:50,936 INFO L290 TraceCheckUtils]: 35: Hoare triple {13202#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {13202#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:41:50,937 INFO L290 TraceCheckUtils]: 36: Hoare triple {13202#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {13203#(not (= 8448 |ssl3_accept_#t~mem68|))} is VALID [2022-04-28 08:41:50,937 INFO L290 TraceCheckUtils]: 37: Hoare triple {13203#(not (= 8448 |ssl3_accept_#t~mem68|))} assume 8448 == #t~mem68;havoc #t~mem68; {13198#false} is VALID [2022-04-28 08:41:50,937 INFO L290 TraceCheckUtils]: 38: Hoare triple {13198#false} assume !(~num1~0 > 0); {13198#false} is VALID [2022-04-28 08:41:50,941 INFO L290 TraceCheckUtils]: 39: Hoare triple {13198#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {13198#false} is VALID [2022-04-28 08:41:50,941 INFO L290 TraceCheckUtils]: 40: Hoare triple {13198#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {13198#false} is VALID [2022-04-28 08:41:50,941 INFO L290 TraceCheckUtils]: 41: Hoare triple {13198#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {13198#false} is VALID [2022-04-28 08:41:50,941 INFO L290 TraceCheckUtils]: 42: Hoare triple {13198#false} ~skip~0 := 0; {13198#false} is VALID [2022-04-28 08:41:50,941 INFO L290 TraceCheckUtils]: 43: Hoare triple {13198#false} assume !false; {13198#false} is VALID [2022-04-28 08:41:50,941 INFO L290 TraceCheckUtils]: 44: Hoare triple {13198#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {13198#false} is VALID [2022-04-28 08:41:50,941 INFO L290 TraceCheckUtils]: 45: Hoare triple {13198#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {13198#false} is VALID [2022-04-28 08:41:50,941 INFO L290 TraceCheckUtils]: 46: Hoare triple {13198#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {13198#false} is VALID [2022-04-28 08:41:50,941 INFO L290 TraceCheckUtils]: 47: Hoare triple {13198#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {13198#false} is VALID [2022-04-28 08:41:50,941 INFO L290 TraceCheckUtils]: 48: Hoare triple {13198#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {13198#false} is VALID [2022-04-28 08:41:50,941 INFO L290 TraceCheckUtils]: 49: Hoare triple {13198#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {13198#false} is VALID [2022-04-28 08:41:50,942 INFO L290 TraceCheckUtils]: 50: Hoare triple {13198#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {13198#false} is VALID [2022-04-28 08:41:50,942 INFO L290 TraceCheckUtils]: 51: Hoare triple {13198#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {13198#false} is VALID [2022-04-28 08:41:50,942 INFO L290 TraceCheckUtils]: 52: Hoare triple {13198#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {13198#false} is VALID [2022-04-28 08:41:50,942 INFO L290 TraceCheckUtils]: 53: Hoare triple {13198#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {13198#false} is VALID [2022-04-28 08:41:50,942 INFO L290 TraceCheckUtils]: 54: Hoare triple {13198#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {13198#false} is VALID [2022-04-28 08:41:50,942 INFO L290 TraceCheckUtils]: 55: Hoare triple {13198#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {13198#false} is VALID [2022-04-28 08:41:50,942 INFO L290 TraceCheckUtils]: 56: Hoare triple {13198#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {13198#false} is VALID [2022-04-28 08:41:50,942 INFO L290 TraceCheckUtils]: 57: Hoare triple {13198#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {13198#false} is VALID [2022-04-28 08:41:50,942 INFO L290 TraceCheckUtils]: 58: Hoare triple {13198#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {13198#false} is VALID [2022-04-28 08:41:50,942 INFO L290 TraceCheckUtils]: 59: Hoare triple {13198#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {13198#false} is VALID [2022-04-28 08:41:50,942 INFO L290 TraceCheckUtils]: 60: Hoare triple {13198#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {13198#false} is VALID [2022-04-28 08:41:50,942 INFO L290 TraceCheckUtils]: 61: Hoare triple {13198#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {13198#false} is VALID [2022-04-28 08:41:50,942 INFO L290 TraceCheckUtils]: 62: Hoare triple {13198#false} assume 8544 == #t~mem64;havoc #t~mem64; {13198#false} is VALID [2022-04-28 08:41:50,942 INFO L290 TraceCheckUtils]: 63: Hoare triple {13198#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {13198#false} is VALID [2022-04-28 08:41:50,943 INFO L290 TraceCheckUtils]: 64: Hoare triple {13198#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {13198#false} is VALID [2022-04-28 08:41:50,943 INFO L290 TraceCheckUtils]: 65: Hoare triple {13198#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {13198#false} is VALID [2022-04-28 08:41:50,943 INFO L290 TraceCheckUtils]: 66: Hoare triple {13198#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {13198#false} is VALID [2022-04-28 08:41:50,943 INFO L290 TraceCheckUtils]: 67: Hoare triple {13198#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {13198#false} is VALID [2022-04-28 08:41:50,943 INFO L290 TraceCheckUtils]: 68: Hoare triple {13198#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {13198#false} is VALID [2022-04-28 08:41:50,943 INFO L290 TraceCheckUtils]: 69: Hoare triple {13198#false} assume 8 == ~blastFlag~0; {13198#false} is VALID [2022-04-28 08:41:50,943 INFO L290 TraceCheckUtils]: 70: Hoare triple {13198#false} assume !false; {13198#false} is VALID [2022-04-28 08:41:50,943 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:41:50,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:41:50,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348931317] [2022-04-28 08:41:50,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348931317] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:41:50,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:41:50,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:41:50,944 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:41:50,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1857827583] [2022-04-28 08:41:50,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1857827583] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:41:50,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:41:50,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:41:50,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791163218] [2022-04-28 08:41:50,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:41:50,945 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 71 [2022-04-28 08:41:50,945 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:41:50,945 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:50,989 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 08:41:50,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:41:50,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:41:50,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:41:50,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:41:50,990 INFO L87 Difference]: Start difference. First operand 276 states and 450 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:52,408 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:41:56,355 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:42:00,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:42:00,522 INFO L93 Difference]: Finished difference Result 692 states and 1126 transitions. [2022-04-28 08:42:00,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:42:00,523 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 71 [2022-04-28 08:42:00,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:42:00,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:00,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 590 transitions. [2022-04-28 08:42:00,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:00,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 590 transitions. [2022-04-28 08:42:00,528 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 590 transitions. [2022-04-28 08:42:00,910 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 590 edges. 590 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:42:00,918 INFO L225 Difference]: With dead ends: 692 [2022-04-28 08:42:00,918 INFO L226 Difference]: Without dead ends: 431 [2022-04-28 08:42:00,919 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 08:42:00,919 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 127 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-04-28 08:42:00,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 414 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-04-28 08:42:00,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2022-04-28 08:42:00,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 340. [2022-04-28 08:42:00,931 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:42:00,932 INFO L82 GeneralOperation]: Start isEquivalent. First operand 431 states. Second operand has 340 states, 335 states have (on average 1.653731343283582) internal successors, (554), 335 states have internal predecessors, (554), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:00,932 INFO L74 IsIncluded]: Start isIncluded. First operand 431 states. Second operand has 340 states, 335 states have (on average 1.653731343283582) internal successors, (554), 335 states have internal predecessors, (554), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:00,933 INFO L87 Difference]: Start difference. First operand 431 states. Second operand has 340 states, 335 states have (on average 1.653731343283582) internal successors, (554), 335 states have internal predecessors, (554), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:00,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:42:00,941 INFO L93 Difference]: Finished difference Result 431 states and 693 transitions. [2022-04-28 08:42:00,941 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 693 transitions. [2022-04-28 08:42:00,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:42:00,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:42:00,942 INFO L74 IsIncluded]: Start isIncluded. First operand has 340 states, 335 states have (on average 1.653731343283582) internal successors, (554), 335 states have internal predecessors, (554), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 431 states. [2022-04-28 08:42:00,943 INFO L87 Difference]: Start difference. First operand has 340 states, 335 states have (on average 1.653731343283582) internal successors, (554), 335 states have internal predecessors, (554), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 431 states. [2022-04-28 08:42:00,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:42:00,950 INFO L93 Difference]: Finished difference Result 431 states and 693 transitions. [2022-04-28 08:42:00,951 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 693 transitions. [2022-04-28 08:42:00,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:42:00,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:42:00,951 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:42:00,951 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:42:00,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 335 states have (on average 1.653731343283582) internal successors, (554), 335 states have internal predecessors, (554), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:00,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 558 transitions. [2022-04-28 08:42:00,957 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 558 transitions. Word has length 71 [2022-04-28 08:42:00,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:42:00,957 INFO L495 AbstractCegarLoop]: Abstraction has 340 states and 558 transitions. [2022-04-28 08:42:00,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:00,958 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 340 states and 558 transitions. [2022-04-28 08:42:01,493 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 08:42:01,493 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 558 transitions. [2022-04-28 08:42:01,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-28 08:42:01,494 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:42:01,494 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 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 08:42:01,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-28 08:42:01,494 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:42:01,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:42:01,494 INFO L85 PathProgramCache]: Analyzing trace with hash -351909833, now seen corresponding path program 1 times [2022-04-28 08:42:01,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:42:01,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1103676951] [2022-04-28 08:42:01,524 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:42:01,525 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:42:01,525 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:42:01,525 INFO L85 PathProgramCache]: Analyzing trace with hash -351909833, now seen corresponding path program 2 times [2022-04-28 08:42:01,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:42:01,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687255318] [2022-04-28 08:42:01,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:42:01,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:42:01,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:42:01,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:42:01,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:42:01,618 INFO L290 TraceCheckUtils]: 0: Hoare triple {16142#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {16135#true} is VALID [2022-04-28 08:42:01,618 INFO L290 TraceCheckUtils]: 1: Hoare triple {16135#true} assume true; {16135#true} is VALID [2022-04-28 08:42:01,618 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16135#true} {16135#true} #689#return; {16135#true} is VALID [2022-04-28 08:42:01,619 INFO L272 TraceCheckUtils]: 0: Hoare triple {16135#true} call ULTIMATE.init(); {16142#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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 08:42:01,619 INFO L290 TraceCheckUtils]: 1: Hoare triple {16142#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {16135#true} is VALID [2022-04-28 08:42:01,619 INFO L290 TraceCheckUtils]: 2: Hoare triple {16135#true} assume true; {16135#true} is VALID [2022-04-28 08:42:01,619 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16135#true} {16135#true} #689#return; {16135#true} is VALID [2022-04-28 08:42:01,619 INFO L272 TraceCheckUtils]: 4: Hoare triple {16135#true} call #t~ret161 := main(); {16135#true} is VALID [2022-04-28 08:42:01,619 INFO L290 TraceCheckUtils]: 5: Hoare triple {16135#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~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(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #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, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);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, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);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, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {16135#true} is VALID [2022-04-28 08:42:01,619 INFO L290 TraceCheckUtils]: 6: Hoare triple {16135#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {16135#true} is VALID [2022-04-28 08:42:01,619 INFO L272 TraceCheckUtils]: 7: Hoare triple {16135#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {16135#true} is VALID [2022-04-28 08:42:01,621 INFO L290 TraceCheckUtils]: 8: Hoare triple {16135#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 -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~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, 192 + ~s.offset, 4); {16140#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:01,622 INFO L290 TraceCheckUtils]: 9: Hoare triple {16140#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {16140#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:01,622 INFO L290 TraceCheckUtils]: 10: Hoare triple {16140#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {16140#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:01,623 INFO L290 TraceCheckUtils]: 11: Hoare triple {16140#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {16140#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:01,623 INFO L290 TraceCheckUtils]: 12: Hoare triple {16140#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {16140#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:01,623 INFO L290 TraceCheckUtils]: 13: Hoare triple {16140#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {16140#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:01,624 INFO L290 TraceCheckUtils]: 14: Hoare triple {16140#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {16140#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:01,624 INFO L290 TraceCheckUtils]: 15: Hoare triple {16140#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {16140#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:01,624 INFO L290 TraceCheckUtils]: 16: Hoare triple {16140#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {16140#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:01,625 INFO L290 TraceCheckUtils]: 17: Hoare triple {16140#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {16140#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:01,625 INFO L290 TraceCheckUtils]: 18: Hoare triple {16140#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {16140#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:01,625 INFO L290 TraceCheckUtils]: 19: Hoare triple {16140#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {16140#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:01,625 INFO L290 TraceCheckUtils]: 20: Hoare triple {16140#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {16140#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:01,626 INFO L290 TraceCheckUtils]: 21: Hoare triple {16140#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {16140#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:01,626 INFO L290 TraceCheckUtils]: 22: Hoare triple {16140#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {16140#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:01,626 INFO L290 TraceCheckUtils]: 23: Hoare triple {16140#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {16140#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:01,627 INFO L290 TraceCheckUtils]: 24: Hoare triple {16140#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {16140#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:01,627 INFO L290 TraceCheckUtils]: 25: Hoare triple {16140#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {16140#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:01,628 INFO L290 TraceCheckUtils]: 26: Hoare triple {16140#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {16140#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:01,628 INFO L290 TraceCheckUtils]: 27: Hoare triple {16140#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {16140#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:01,628 INFO L290 TraceCheckUtils]: 28: Hoare triple {16140#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {16140#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:01,629 INFO L290 TraceCheckUtils]: 29: Hoare triple {16140#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {16140#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:01,629 INFO L290 TraceCheckUtils]: 30: Hoare triple {16140#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {16140#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:01,629 INFO L290 TraceCheckUtils]: 31: Hoare triple {16140#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {16140#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:01,630 INFO L290 TraceCheckUtils]: 32: Hoare triple {16140#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {16140#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:01,630 INFO L290 TraceCheckUtils]: 33: Hoare triple {16140#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {16140#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:01,630 INFO L290 TraceCheckUtils]: 34: Hoare triple {16140#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {16140#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:01,631 INFO L290 TraceCheckUtils]: 35: Hoare triple {16140#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {16140#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:01,631 INFO L290 TraceCheckUtils]: 36: Hoare triple {16140#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {16140#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:01,631 INFO L290 TraceCheckUtils]: 37: Hoare triple {16140#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {16140#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:01,631 INFO L290 TraceCheckUtils]: 38: Hoare triple {16140#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {16140#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:01,632 INFO L290 TraceCheckUtils]: 39: Hoare triple {16140#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {16140#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:01,632 INFO L290 TraceCheckUtils]: 40: Hoare triple {16140#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {16140#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:01,632 INFO L290 TraceCheckUtils]: 41: Hoare triple {16140#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {16141#(not (= |ssl3_accept_#t~mem73| 8608))} is VALID [2022-04-28 08:42:01,633 INFO L290 TraceCheckUtils]: 42: Hoare triple {16141#(not (= |ssl3_accept_#t~mem73| 8608))} assume 8608 == #t~mem73;havoc #t~mem73; {16136#false} is VALID [2022-04-28 08:42:01,633 INFO L290 TraceCheckUtils]: 43: Hoare triple {16136#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {16136#false} is VALID [2022-04-28 08:42:01,633 INFO L290 TraceCheckUtils]: 44: Hoare triple {16136#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {16136#false} is VALID [2022-04-28 08:42:01,633 INFO L290 TraceCheckUtils]: 45: Hoare triple {16136#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {16136#false} is VALID [2022-04-28 08:42:01,633 INFO L290 TraceCheckUtils]: 46: Hoare triple {16136#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {16136#false} is VALID [2022-04-28 08:42:01,633 INFO L290 TraceCheckUtils]: 47: Hoare triple {16136#false} ~skip~0 := 0; {16136#false} is VALID [2022-04-28 08:42:01,633 INFO L290 TraceCheckUtils]: 48: Hoare triple {16136#false} assume !false; {16136#false} is VALID [2022-04-28 08:42:01,633 INFO L290 TraceCheckUtils]: 49: Hoare triple {16136#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {16136#false} is VALID [2022-04-28 08:42:01,633 INFO L290 TraceCheckUtils]: 50: Hoare triple {16136#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {16136#false} is VALID [2022-04-28 08:42:01,634 INFO L290 TraceCheckUtils]: 51: Hoare triple {16136#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {16136#false} is VALID [2022-04-28 08:42:01,634 INFO L290 TraceCheckUtils]: 52: Hoare triple {16136#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {16136#false} is VALID [2022-04-28 08:42:01,634 INFO L290 TraceCheckUtils]: 53: Hoare triple {16136#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {16136#false} is VALID [2022-04-28 08:42:01,634 INFO L290 TraceCheckUtils]: 54: Hoare triple {16136#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {16136#false} is VALID [2022-04-28 08:42:01,634 INFO L290 TraceCheckUtils]: 55: Hoare triple {16136#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {16136#false} is VALID [2022-04-28 08:42:01,634 INFO L290 TraceCheckUtils]: 56: Hoare triple {16136#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {16136#false} is VALID [2022-04-28 08:42:01,634 INFO L290 TraceCheckUtils]: 57: Hoare triple {16136#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {16136#false} is VALID [2022-04-28 08:42:01,634 INFO L290 TraceCheckUtils]: 58: Hoare triple {16136#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {16136#false} is VALID [2022-04-28 08:42:01,634 INFO L290 TraceCheckUtils]: 59: Hoare triple {16136#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {16136#false} is VALID [2022-04-28 08:42:01,634 INFO L290 TraceCheckUtils]: 60: Hoare triple {16136#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {16136#false} is VALID [2022-04-28 08:42:01,634 INFO L290 TraceCheckUtils]: 61: Hoare triple {16136#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {16136#false} is VALID [2022-04-28 08:42:01,634 INFO L290 TraceCheckUtils]: 62: Hoare triple {16136#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {16136#false} is VALID [2022-04-28 08:42:01,634 INFO L290 TraceCheckUtils]: 63: Hoare triple {16136#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {16136#false} is VALID [2022-04-28 08:42:01,634 INFO L290 TraceCheckUtils]: 64: Hoare triple {16136#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {16136#false} is VALID [2022-04-28 08:42:01,635 INFO L290 TraceCheckUtils]: 65: Hoare triple {16136#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {16136#false} is VALID [2022-04-28 08:42:01,635 INFO L290 TraceCheckUtils]: 66: Hoare triple {16136#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {16136#false} is VALID [2022-04-28 08:42:01,635 INFO L290 TraceCheckUtils]: 67: Hoare triple {16136#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {16136#false} is VALID [2022-04-28 08:42:01,635 INFO L290 TraceCheckUtils]: 68: Hoare triple {16136#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {16136#false} is VALID [2022-04-28 08:42:01,635 INFO L290 TraceCheckUtils]: 69: Hoare triple {16136#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {16136#false} is VALID [2022-04-28 08:42:01,635 INFO L290 TraceCheckUtils]: 70: Hoare triple {16136#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {16136#false} is VALID [2022-04-28 08:42:01,635 INFO L290 TraceCheckUtils]: 71: Hoare triple {16136#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {16136#false} is VALID [2022-04-28 08:42:01,635 INFO L290 TraceCheckUtils]: 72: Hoare triple {16136#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {16136#false} is VALID [2022-04-28 08:42:01,635 INFO L290 TraceCheckUtils]: 73: Hoare triple {16136#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {16136#false} is VALID [2022-04-28 08:42:01,635 INFO L290 TraceCheckUtils]: 74: Hoare triple {16136#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {16136#false} is VALID [2022-04-28 08:42:01,635 INFO L290 TraceCheckUtils]: 75: Hoare triple {16136#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {16136#false} is VALID [2022-04-28 08:42:01,635 INFO L290 TraceCheckUtils]: 76: Hoare triple {16136#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {16136#false} is VALID [2022-04-28 08:42:01,635 INFO L290 TraceCheckUtils]: 77: Hoare triple {16136#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {16136#false} is VALID [2022-04-28 08:42:01,635 INFO L290 TraceCheckUtils]: 78: Hoare triple {16136#false} assume 8640 == #t~mem75;havoc #t~mem75; {16136#false} is VALID [2022-04-28 08:42:01,636 INFO L290 TraceCheckUtils]: 79: Hoare triple {16136#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {16136#false} is VALID [2022-04-28 08:42:01,636 INFO L290 TraceCheckUtils]: 80: Hoare triple {16136#false} assume 5 == ~blastFlag~0; {16136#false} is VALID [2022-04-28 08:42:01,636 INFO L290 TraceCheckUtils]: 81: Hoare triple {16136#false} assume !false; {16136#false} is VALID [2022-04-28 08:42:01,636 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:42:01,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:42:01,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687255318] [2022-04-28 08:42:01,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687255318] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:42:01,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:42:01,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:42:01,637 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:42:01,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1103676951] [2022-04-28 08:42:01,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1103676951] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:42:01,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:42:01,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:42:01,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854264436] [2022-04-28 08:42:01,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:42:01,637 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 82 [2022-04-28 08:42:01,637 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:42:01,638 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 08:42:01,693 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 08:42:01,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:42:01,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:42:01,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:42:01,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:42:01,694 INFO L87 Difference]: Start difference. First operand 340 states and 558 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 08:42:09,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:42:09,396 INFO L93 Difference]: Finished difference Result 784 states and 1276 transitions. [2022-04-28 08:42:09,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:42:09,396 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 82 [2022-04-28 08:42:09,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:42:09,396 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 08:42:09,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 594 transitions. [2022-04-28 08:42:09,399 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 08:42:09,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 594 transitions. [2022-04-28 08:42:09,401 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 594 transitions. [2022-04-28 08:42:09,769 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 594 edges. 594 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:42:09,778 INFO L225 Difference]: With dead ends: 784 [2022-04-28 08:42:09,778 INFO L226 Difference]: Without dead ends: 459 [2022-04-28 08:42:09,779 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 08:42:09,779 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 123 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 08:42:09,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 376 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 08:42:09,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2022-04-28 08:42:09,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 377. [2022-04-28 08:42:09,792 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:42:09,793 INFO L82 GeneralOperation]: Start isEquivalent. First operand 459 states. Second operand has 377 states, 372 states have (on average 1.6559139784946237) internal successors, (616), 372 states have internal predecessors, (616), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:09,793 INFO L74 IsIncluded]: Start isIncluded. First operand 459 states. Second operand has 377 states, 372 states have (on average 1.6559139784946237) internal successors, (616), 372 states have internal predecessors, (616), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:09,794 INFO L87 Difference]: Start difference. First operand 459 states. Second operand has 377 states, 372 states have (on average 1.6559139784946237) internal successors, (616), 372 states have internal predecessors, (616), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:09,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:42:09,801 INFO L93 Difference]: Finished difference Result 459 states and 735 transitions. [2022-04-28 08:42:09,802 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 735 transitions. [2022-04-28 08:42:09,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:42:09,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:42:09,803 INFO L74 IsIncluded]: Start isIncluded. First operand has 377 states, 372 states have (on average 1.6559139784946237) internal successors, (616), 372 states have internal predecessors, (616), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 459 states. [2022-04-28 08:42:09,803 INFO L87 Difference]: Start difference. First operand has 377 states, 372 states have (on average 1.6559139784946237) internal successors, (616), 372 states have internal predecessors, (616), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 459 states. [2022-04-28 08:42:09,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:42:09,811 INFO L93 Difference]: Finished difference Result 459 states and 735 transitions. [2022-04-28 08:42:09,811 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 735 transitions. [2022-04-28 08:42:09,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:42:09,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:42:09,811 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:42:09,812 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:42:09,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 372 states have (on average 1.6559139784946237) internal successors, (616), 372 states have internal predecessors, (616), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:09,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 620 transitions. [2022-04-28 08:42:09,818 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 620 transitions. Word has length 82 [2022-04-28 08:42:09,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:42:09,818 INFO L495 AbstractCegarLoop]: Abstraction has 377 states and 620 transitions. [2022-04-28 08:42:09,818 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 08:42:09,818 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 377 states and 620 transitions. [2022-04-28 08:42:10,251 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 620 edges. 620 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:42:10,251 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 620 transitions. [2022-04-28 08:42:10,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-04-28 08:42:10,252 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:42:10,252 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 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 08:42:10,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-28 08:42:10,253 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:42:10,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:42:10,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1069537033, now seen corresponding path program 1 times [2022-04-28 08:42:10,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:42:10,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1623200808] [2022-04-28 08:42:10,286 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:42:10,286 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:42:10,286 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:42:10,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1069537033, now seen corresponding path program 2 times [2022-04-28 08:42:10,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:42:10,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568946707] [2022-04-28 08:42:10,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:42:10,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:42:10,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:42:10,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:42:10,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:42:10,376 INFO L290 TraceCheckUtils]: 0: Hoare triple {19394#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {19387#true} is VALID [2022-04-28 08:42:10,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {19387#true} assume true; {19387#true} is VALID [2022-04-28 08:42:10,376 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19387#true} {19387#true} #689#return; {19387#true} is VALID [2022-04-28 08:42:10,377 INFO L272 TraceCheckUtils]: 0: Hoare triple {19387#true} call ULTIMATE.init(); {19394#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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 08:42:10,377 INFO L290 TraceCheckUtils]: 1: Hoare triple {19394#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {19387#true} is VALID [2022-04-28 08:42:10,377 INFO L290 TraceCheckUtils]: 2: Hoare triple {19387#true} assume true; {19387#true} is VALID [2022-04-28 08:42:10,377 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19387#true} {19387#true} #689#return; {19387#true} is VALID [2022-04-28 08:42:10,377 INFO L272 TraceCheckUtils]: 4: Hoare triple {19387#true} call #t~ret161 := main(); {19387#true} is VALID [2022-04-28 08:42:10,377 INFO L290 TraceCheckUtils]: 5: Hoare triple {19387#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~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(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #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, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);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, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);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, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {19387#true} is VALID [2022-04-28 08:42:10,378 INFO L290 TraceCheckUtils]: 6: Hoare triple {19387#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {19387#true} is VALID [2022-04-28 08:42:10,378 INFO L272 TraceCheckUtils]: 7: Hoare triple {19387#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {19387#true} is VALID [2022-04-28 08:42:10,379 INFO L290 TraceCheckUtils]: 8: Hoare triple {19387#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 -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~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, 192 + ~s.offset, 4); {19392#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:42:10,380 INFO L290 TraceCheckUtils]: 9: Hoare triple {19392#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {19392#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:42:10,380 INFO L290 TraceCheckUtils]: 10: Hoare triple {19392#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {19392#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:42:10,381 INFO L290 TraceCheckUtils]: 11: Hoare triple {19392#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {19392#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:42:10,381 INFO L290 TraceCheckUtils]: 12: Hoare triple {19392#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {19392#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:42:10,381 INFO L290 TraceCheckUtils]: 13: Hoare triple {19392#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {19392#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:42:10,382 INFO L290 TraceCheckUtils]: 14: Hoare triple {19392#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !false; {19392#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:42:10,382 INFO L290 TraceCheckUtils]: 15: Hoare triple {19392#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {19392#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:42:10,382 INFO L290 TraceCheckUtils]: 16: Hoare triple {19392#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {19392#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:42:10,383 INFO L290 TraceCheckUtils]: 17: Hoare triple {19392#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {19392#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:42:10,383 INFO L290 TraceCheckUtils]: 18: Hoare triple {19392#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {19392#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:42:10,383 INFO L290 TraceCheckUtils]: 19: Hoare triple {19392#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {19392#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:42:10,384 INFO L290 TraceCheckUtils]: 20: Hoare triple {19392#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {19392#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:42:10,384 INFO L290 TraceCheckUtils]: 21: Hoare triple {19392#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {19392#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:42:10,384 INFO L290 TraceCheckUtils]: 22: Hoare triple {19392#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {19392#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:42:10,385 INFO L290 TraceCheckUtils]: 23: Hoare triple {19392#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {19392#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:42:10,385 INFO L290 TraceCheckUtils]: 24: Hoare triple {19392#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {19392#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:42:10,385 INFO L290 TraceCheckUtils]: 25: Hoare triple {19392#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {19392#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:42:10,386 INFO L290 TraceCheckUtils]: 26: Hoare triple {19392#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {19392#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:42:10,386 INFO L290 TraceCheckUtils]: 27: Hoare triple {19392#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {19392#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:42:10,386 INFO L290 TraceCheckUtils]: 28: Hoare triple {19392#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {19392#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:42:10,386 INFO L290 TraceCheckUtils]: 29: Hoare triple {19392#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {19392#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:42:10,387 INFO L290 TraceCheckUtils]: 30: Hoare triple {19392#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {19392#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:42:10,387 INFO L290 TraceCheckUtils]: 31: Hoare triple {19392#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {19392#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:42:10,387 INFO L290 TraceCheckUtils]: 32: Hoare triple {19392#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {19392#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:42:10,388 INFO L290 TraceCheckUtils]: 33: Hoare triple {19392#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {19392#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:42:10,388 INFO L290 TraceCheckUtils]: 34: Hoare triple {19392#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {19392#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:42:10,388 INFO L290 TraceCheckUtils]: 35: Hoare triple {19392#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {19392#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:42:10,389 INFO L290 TraceCheckUtils]: 36: Hoare triple {19392#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {19392#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:42:10,389 INFO L290 TraceCheckUtils]: 37: Hoare triple {19392#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {19392#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:42:10,389 INFO L290 TraceCheckUtils]: 38: Hoare triple {19392#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {19392#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:42:10,390 INFO L290 TraceCheckUtils]: 39: Hoare triple {19392#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {19392#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:42:10,390 INFO L290 TraceCheckUtils]: 40: Hoare triple {19392#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {19392#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:42:10,390 INFO L290 TraceCheckUtils]: 41: Hoare triple {19392#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {19392#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:42:10,391 INFO L290 TraceCheckUtils]: 42: Hoare triple {19392#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {19393#(not (= |ssl3_accept_#t~mem74| 8609))} is VALID [2022-04-28 08:42:10,391 INFO L290 TraceCheckUtils]: 43: Hoare triple {19393#(not (= |ssl3_accept_#t~mem74| 8609))} assume 8609 == #t~mem74;havoc #t~mem74; {19388#false} is VALID [2022-04-28 08:42:10,391 INFO L290 TraceCheckUtils]: 44: Hoare triple {19388#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {19388#false} is VALID [2022-04-28 08:42:10,391 INFO L290 TraceCheckUtils]: 45: Hoare triple {19388#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {19388#false} is VALID [2022-04-28 08:42:10,391 INFO L290 TraceCheckUtils]: 46: Hoare triple {19388#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {19388#false} is VALID [2022-04-28 08:42:10,391 INFO L290 TraceCheckUtils]: 47: Hoare triple {19388#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {19388#false} is VALID [2022-04-28 08:42:10,391 INFO L290 TraceCheckUtils]: 48: Hoare triple {19388#false} ~skip~0 := 0; {19388#false} is VALID [2022-04-28 08:42:10,392 INFO L290 TraceCheckUtils]: 49: Hoare triple {19388#false} assume !false; {19388#false} is VALID [2022-04-28 08:42:10,392 INFO L290 TraceCheckUtils]: 50: Hoare triple {19388#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {19388#false} is VALID [2022-04-28 08:42:10,392 INFO L290 TraceCheckUtils]: 51: Hoare triple {19388#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {19388#false} is VALID [2022-04-28 08:42:10,392 INFO L290 TraceCheckUtils]: 52: Hoare triple {19388#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {19388#false} is VALID [2022-04-28 08:42:10,392 INFO L290 TraceCheckUtils]: 53: Hoare triple {19388#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {19388#false} is VALID [2022-04-28 08:42:10,392 INFO L290 TraceCheckUtils]: 54: Hoare triple {19388#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {19388#false} is VALID [2022-04-28 08:42:10,392 INFO L290 TraceCheckUtils]: 55: Hoare triple {19388#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {19388#false} is VALID [2022-04-28 08:42:10,392 INFO L290 TraceCheckUtils]: 56: Hoare triple {19388#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {19388#false} is VALID [2022-04-28 08:42:10,392 INFO L290 TraceCheckUtils]: 57: Hoare triple {19388#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {19388#false} is VALID [2022-04-28 08:42:10,392 INFO L290 TraceCheckUtils]: 58: Hoare triple {19388#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {19388#false} is VALID [2022-04-28 08:42:10,392 INFO L290 TraceCheckUtils]: 59: Hoare triple {19388#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {19388#false} is VALID [2022-04-28 08:42:10,392 INFO L290 TraceCheckUtils]: 60: Hoare triple {19388#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {19388#false} is VALID [2022-04-28 08:42:10,392 INFO L290 TraceCheckUtils]: 61: Hoare triple {19388#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {19388#false} is VALID [2022-04-28 08:42:10,392 INFO L290 TraceCheckUtils]: 62: Hoare triple {19388#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {19388#false} is VALID [2022-04-28 08:42:10,392 INFO L290 TraceCheckUtils]: 63: Hoare triple {19388#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {19388#false} is VALID [2022-04-28 08:42:10,393 INFO L290 TraceCheckUtils]: 64: Hoare triple {19388#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {19388#false} is VALID [2022-04-28 08:42:10,393 INFO L290 TraceCheckUtils]: 65: Hoare triple {19388#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {19388#false} is VALID [2022-04-28 08:42:10,393 INFO L290 TraceCheckUtils]: 66: Hoare triple {19388#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {19388#false} is VALID [2022-04-28 08:42:10,393 INFO L290 TraceCheckUtils]: 67: Hoare triple {19388#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {19388#false} is VALID [2022-04-28 08:42:10,393 INFO L290 TraceCheckUtils]: 68: Hoare triple {19388#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {19388#false} is VALID [2022-04-28 08:42:10,393 INFO L290 TraceCheckUtils]: 69: Hoare triple {19388#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {19388#false} is VALID [2022-04-28 08:42:10,393 INFO L290 TraceCheckUtils]: 70: Hoare triple {19388#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {19388#false} is VALID [2022-04-28 08:42:10,393 INFO L290 TraceCheckUtils]: 71: Hoare triple {19388#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {19388#false} is VALID [2022-04-28 08:42:10,393 INFO L290 TraceCheckUtils]: 72: Hoare triple {19388#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {19388#false} is VALID [2022-04-28 08:42:10,393 INFO L290 TraceCheckUtils]: 73: Hoare triple {19388#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {19388#false} is VALID [2022-04-28 08:42:10,393 INFO L290 TraceCheckUtils]: 74: Hoare triple {19388#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {19388#false} is VALID [2022-04-28 08:42:10,393 INFO L290 TraceCheckUtils]: 75: Hoare triple {19388#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {19388#false} is VALID [2022-04-28 08:42:10,393 INFO L290 TraceCheckUtils]: 76: Hoare triple {19388#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {19388#false} is VALID [2022-04-28 08:42:10,393 INFO L290 TraceCheckUtils]: 77: Hoare triple {19388#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {19388#false} is VALID [2022-04-28 08:42:10,394 INFO L290 TraceCheckUtils]: 78: Hoare triple {19388#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {19388#false} is VALID [2022-04-28 08:42:10,394 INFO L290 TraceCheckUtils]: 79: Hoare triple {19388#false} assume 8640 == #t~mem75;havoc #t~mem75; {19388#false} is VALID [2022-04-28 08:42:10,394 INFO L290 TraceCheckUtils]: 80: Hoare triple {19388#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {19388#false} is VALID [2022-04-28 08:42:10,394 INFO L290 TraceCheckUtils]: 81: Hoare triple {19388#false} assume 5 == ~blastFlag~0; {19388#false} is VALID [2022-04-28 08:42:10,394 INFO L290 TraceCheckUtils]: 82: Hoare triple {19388#false} assume !false; {19388#false} is VALID [2022-04-28 08:42:10,394 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 08:42:10,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:42:10,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568946707] [2022-04-28 08:42:10,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568946707] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:42:10,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:42:10,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:42:10,395 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:42:10,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1623200808] [2022-04-28 08:42:10,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1623200808] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:42:10,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:42:10,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:42:10,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756568119] [2022-04-28 08:42:10,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:42:10,395 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 08:42:10,395 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:42:10,396 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 08:42:10,454 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 08:42:10,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:42:10,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:42:10,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:42:10,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:42:10,455 INFO L87 Difference]: Start difference. First operand 377 states and 620 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 08:42:12,043 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:42:15,904 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:42:19,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:42:19,301 INFO L93 Difference]: Finished difference Result 818 states and 1332 transitions. [2022-04-28 08:42:19,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:42:19,301 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 08:42:19,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:42:19,301 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 08:42:19,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 594 transitions. [2022-04-28 08:42:19,303 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 08:42:19,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 594 transitions. [2022-04-28 08:42:19,305 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 594 transitions. [2022-04-28 08:42:19,668 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 594 edges. 594 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:42:19,677 INFO L225 Difference]: With dead ends: 818 [2022-04-28 08:42:19,677 INFO L226 Difference]: Without dead ends: 456 [2022-04-28 08:42:19,679 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 08:42:19,681 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 122 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-04-28 08:42:19,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 392 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-04-28 08:42:19,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2022-04-28 08:42:19,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 377. [2022-04-28 08:42:19,696 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:42:19,696 INFO L82 GeneralOperation]: Start isEquivalent. First operand 456 states. Second operand has 377 states, 372 states have (on average 1.6505376344086022) internal successors, (614), 372 states have internal predecessors, (614), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:19,697 INFO L74 IsIncluded]: Start isIncluded. First operand 456 states. Second operand has 377 states, 372 states have (on average 1.6505376344086022) internal successors, (614), 372 states have internal predecessors, (614), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:19,697 INFO L87 Difference]: Start difference. First operand 456 states. Second operand has 377 states, 372 states have (on average 1.6505376344086022) internal successors, (614), 372 states have internal predecessors, (614), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:19,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:42:19,704 INFO L93 Difference]: Finished difference Result 456 states and 729 transitions. [2022-04-28 08:42:19,705 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 729 transitions. [2022-04-28 08:42:19,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:42:19,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:42:19,723 INFO L74 IsIncluded]: Start isIncluded. First operand has 377 states, 372 states have (on average 1.6505376344086022) internal successors, (614), 372 states have internal predecessors, (614), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 456 states. [2022-04-28 08:42:19,724 INFO L87 Difference]: Start difference. First operand has 377 states, 372 states have (on average 1.6505376344086022) internal successors, (614), 372 states have internal predecessors, (614), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 456 states. [2022-04-28 08:42:19,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:42:19,731 INFO L93 Difference]: Finished difference Result 456 states and 729 transitions. [2022-04-28 08:42:19,731 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 729 transitions. [2022-04-28 08:42:19,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:42:19,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:42:19,732 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:42:19,732 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:42:19,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 372 states have (on average 1.6505376344086022) internal successors, (614), 372 states have internal predecessors, (614), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:19,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 618 transitions. [2022-04-28 08:42:19,739 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 618 transitions. Word has length 83 [2022-04-28 08:42:19,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:42:19,739 INFO L495 AbstractCegarLoop]: Abstraction has 377 states and 618 transitions. [2022-04-28 08:42:19,739 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 08:42:19,739 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 377 states and 618 transitions. [2022-04-28 08:42:20,173 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 618 edges. 618 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:42:20,174 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 618 transitions. [2022-04-28 08:42:20,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-28 08:42:20,175 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:42:20,175 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:42:20,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-28 08:42:20,175 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:42:20,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:42:20,175 INFO L85 PathProgramCache]: Analyzing trace with hash -724966751, now seen corresponding path program 1 times [2022-04-28 08:42:20,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:42:20,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1603705800] [2022-04-28 08:42:20,212 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:42:20,213 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:42:20,213 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:42:20,213 INFO L85 PathProgramCache]: Analyzing trace with hash -724966751, now seen corresponding path program 2 times [2022-04-28 08:42:20,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:42:20,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622855291] [2022-04-28 08:42:20,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:42:20,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:42:20,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:42:20,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:42:20,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:42:20,328 INFO L290 TraceCheckUtils]: 0: Hoare triple {22708#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {22701#true} is VALID [2022-04-28 08:42:20,328 INFO L290 TraceCheckUtils]: 1: Hoare triple {22701#true} assume true; {22701#true} is VALID [2022-04-28 08:42:20,328 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22701#true} {22701#true} #689#return; {22701#true} is VALID [2022-04-28 08:42:20,329 INFO L272 TraceCheckUtils]: 0: Hoare triple {22701#true} call ULTIMATE.init(); {22708#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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 08:42:20,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {22708#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {22701#true} is VALID [2022-04-28 08:42:20,329 INFO L290 TraceCheckUtils]: 2: Hoare triple {22701#true} assume true; {22701#true} is VALID [2022-04-28 08:42:20,329 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22701#true} {22701#true} #689#return; {22701#true} is VALID [2022-04-28 08:42:20,330 INFO L272 TraceCheckUtils]: 4: Hoare triple {22701#true} call #t~ret161 := main(); {22701#true} is VALID [2022-04-28 08:42:20,330 INFO L290 TraceCheckUtils]: 5: Hoare triple {22701#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~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(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #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, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);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, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);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, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {22701#true} is VALID [2022-04-28 08:42:20,330 INFO L290 TraceCheckUtils]: 6: Hoare triple {22701#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {22701#true} is VALID [2022-04-28 08:42:20,330 INFO L272 TraceCheckUtils]: 7: Hoare triple {22701#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {22701#true} is VALID [2022-04-28 08:42:20,331 INFO L290 TraceCheckUtils]: 8: Hoare triple {22701#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 -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~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, 192 + ~s.offset, 4); {22706#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:20,332 INFO L290 TraceCheckUtils]: 9: Hoare triple {22706#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {22706#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:20,333 INFO L290 TraceCheckUtils]: 10: Hoare triple {22706#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {22706#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:20,333 INFO L290 TraceCheckUtils]: 11: Hoare triple {22706#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {22706#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:20,333 INFO L290 TraceCheckUtils]: 12: Hoare triple {22706#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {22706#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:20,334 INFO L290 TraceCheckUtils]: 13: Hoare triple {22706#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {22706#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:20,334 INFO L290 TraceCheckUtils]: 14: Hoare triple {22706#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {22706#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:20,334 INFO L290 TraceCheckUtils]: 15: Hoare triple {22706#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {22706#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:20,335 INFO L290 TraceCheckUtils]: 16: Hoare triple {22706#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {22706#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:20,335 INFO L290 TraceCheckUtils]: 17: Hoare triple {22706#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {22706#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:20,335 INFO L290 TraceCheckUtils]: 18: Hoare triple {22706#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {22706#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:20,336 INFO L290 TraceCheckUtils]: 19: Hoare triple {22706#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {22706#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:20,336 INFO L290 TraceCheckUtils]: 20: Hoare triple {22706#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {22707#(not (= |ssl3_accept_#t~mem52| 8480))} is VALID [2022-04-28 08:42:20,336 INFO L290 TraceCheckUtils]: 21: Hoare triple {22707#(not (= |ssl3_accept_#t~mem52| 8480))} assume 8480 == #t~mem52;havoc #t~mem52; {22702#false} is VALID [2022-04-28 08:42:20,336 INFO L290 TraceCheckUtils]: 22: Hoare triple {22702#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {22702#false} is VALID [2022-04-28 08:42:20,336 INFO L290 TraceCheckUtils]: 23: Hoare triple {22702#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem91.base, 844 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {22702#false} is VALID [2022-04-28 08:42:20,336 INFO L290 TraceCheckUtils]: 24: Hoare triple {22702#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {22702#false} is VALID [2022-04-28 08:42:20,337 INFO L290 TraceCheckUtils]: 25: Hoare triple {22702#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {22702#false} is VALID [2022-04-28 08:42:20,337 INFO L290 TraceCheckUtils]: 26: Hoare triple {22702#false} ~skip~0 := 0; {22702#false} is VALID [2022-04-28 08:42:20,337 INFO L290 TraceCheckUtils]: 27: Hoare triple {22702#false} assume !false; {22702#false} is VALID [2022-04-28 08:42:20,337 INFO L290 TraceCheckUtils]: 28: Hoare triple {22702#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {22702#false} is VALID [2022-04-28 08:42:20,337 INFO L290 TraceCheckUtils]: 29: Hoare triple {22702#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {22702#false} is VALID [2022-04-28 08:42:20,337 INFO L290 TraceCheckUtils]: 30: Hoare triple {22702#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {22702#false} is VALID [2022-04-28 08:42:20,337 INFO L290 TraceCheckUtils]: 31: Hoare triple {22702#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {22702#false} is VALID [2022-04-28 08:42:20,337 INFO L290 TraceCheckUtils]: 32: Hoare triple {22702#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {22702#false} is VALID [2022-04-28 08:42:20,337 INFO L290 TraceCheckUtils]: 33: Hoare triple {22702#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {22702#false} is VALID [2022-04-28 08:42:20,337 INFO L290 TraceCheckUtils]: 34: Hoare triple {22702#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {22702#false} is VALID [2022-04-28 08:42:20,337 INFO L290 TraceCheckUtils]: 35: Hoare triple {22702#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {22702#false} is VALID [2022-04-28 08:42:20,337 INFO L290 TraceCheckUtils]: 36: Hoare triple {22702#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {22702#false} is VALID [2022-04-28 08:42:20,337 INFO L290 TraceCheckUtils]: 37: Hoare triple {22702#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {22702#false} is VALID [2022-04-28 08:42:20,337 INFO L290 TraceCheckUtils]: 38: Hoare triple {22702#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {22702#false} is VALID [2022-04-28 08:42:20,338 INFO L290 TraceCheckUtils]: 39: Hoare triple {22702#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {22702#false} is VALID [2022-04-28 08:42:20,338 INFO L290 TraceCheckUtils]: 40: Hoare triple {22702#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {22702#false} is VALID [2022-04-28 08:42:20,338 INFO L290 TraceCheckUtils]: 41: Hoare triple {22702#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {22702#false} is VALID [2022-04-28 08:42:20,338 INFO L290 TraceCheckUtils]: 42: Hoare triple {22702#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {22702#false} is VALID [2022-04-28 08:42:20,338 INFO L290 TraceCheckUtils]: 43: Hoare triple {22702#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {22702#false} is VALID [2022-04-28 08:42:20,338 INFO L290 TraceCheckUtils]: 44: Hoare triple {22702#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {22702#false} is VALID [2022-04-28 08:42:20,338 INFO L290 TraceCheckUtils]: 45: Hoare triple {22702#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {22702#false} is VALID [2022-04-28 08:42:20,338 INFO L290 TraceCheckUtils]: 46: Hoare triple {22702#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {22702#false} is VALID [2022-04-28 08:42:20,338 INFO L290 TraceCheckUtils]: 47: Hoare triple {22702#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {22702#false} is VALID [2022-04-28 08:42:20,338 INFO L290 TraceCheckUtils]: 48: Hoare triple {22702#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {22702#false} is VALID [2022-04-28 08:42:20,338 INFO L290 TraceCheckUtils]: 49: Hoare triple {22702#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {22702#false} is VALID [2022-04-28 08:42:20,338 INFO L290 TraceCheckUtils]: 50: Hoare triple {22702#false} assume 8448 == #t~mem68;havoc #t~mem68; {22702#false} is VALID [2022-04-28 08:42:20,338 INFO L290 TraceCheckUtils]: 51: Hoare triple {22702#false} assume !(~num1~0 > 0); {22702#false} is VALID [2022-04-28 08:42:20,338 INFO L290 TraceCheckUtils]: 52: Hoare triple {22702#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {22702#false} is VALID [2022-04-28 08:42:20,339 INFO L290 TraceCheckUtils]: 53: Hoare triple {22702#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {22702#false} is VALID [2022-04-28 08:42:20,339 INFO L290 TraceCheckUtils]: 54: Hoare triple {22702#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {22702#false} is VALID [2022-04-28 08:42:20,339 INFO L290 TraceCheckUtils]: 55: Hoare triple {22702#false} ~skip~0 := 0; {22702#false} is VALID [2022-04-28 08:42:20,339 INFO L290 TraceCheckUtils]: 56: Hoare triple {22702#false} assume !false; {22702#false} is VALID [2022-04-28 08:42:20,339 INFO L290 TraceCheckUtils]: 57: Hoare triple {22702#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {22702#false} is VALID [2022-04-28 08:42:20,339 INFO L290 TraceCheckUtils]: 58: Hoare triple {22702#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {22702#false} is VALID [2022-04-28 08:42:20,339 INFO L290 TraceCheckUtils]: 59: Hoare triple {22702#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {22702#false} is VALID [2022-04-28 08:42:20,339 INFO L290 TraceCheckUtils]: 60: Hoare triple {22702#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {22702#false} is VALID [2022-04-28 08:42:20,339 INFO L290 TraceCheckUtils]: 61: Hoare triple {22702#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {22702#false} is VALID [2022-04-28 08:42:20,339 INFO L290 TraceCheckUtils]: 62: Hoare triple {22702#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {22702#false} is VALID [2022-04-28 08:42:20,339 INFO L290 TraceCheckUtils]: 63: Hoare triple {22702#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {22702#false} is VALID [2022-04-28 08:42:20,339 INFO L290 TraceCheckUtils]: 64: Hoare triple {22702#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {22702#false} is VALID [2022-04-28 08:42:20,339 INFO L290 TraceCheckUtils]: 65: Hoare triple {22702#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {22702#false} is VALID [2022-04-28 08:42:20,339 INFO L290 TraceCheckUtils]: 66: Hoare triple {22702#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {22702#false} is VALID [2022-04-28 08:42:20,340 INFO L290 TraceCheckUtils]: 67: Hoare triple {22702#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {22702#false} is VALID [2022-04-28 08:42:20,340 INFO L290 TraceCheckUtils]: 68: Hoare triple {22702#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {22702#false} is VALID [2022-04-28 08:42:20,340 INFO L290 TraceCheckUtils]: 69: Hoare triple {22702#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {22702#false} is VALID [2022-04-28 08:42:20,340 INFO L290 TraceCheckUtils]: 70: Hoare triple {22702#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {22702#false} is VALID [2022-04-28 08:42:20,340 INFO L290 TraceCheckUtils]: 71: Hoare triple {22702#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {22702#false} is VALID [2022-04-28 08:42:20,340 INFO L290 TraceCheckUtils]: 72: Hoare triple {22702#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {22702#false} is VALID [2022-04-28 08:42:20,340 INFO L290 TraceCheckUtils]: 73: Hoare triple {22702#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {22702#false} is VALID [2022-04-28 08:42:20,340 INFO L290 TraceCheckUtils]: 74: Hoare triple {22702#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {22702#false} is VALID [2022-04-28 08:42:20,340 INFO L290 TraceCheckUtils]: 75: Hoare triple {22702#false} assume 8544 == #t~mem64;havoc #t~mem64; {22702#false} is VALID [2022-04-28 08:42:20,340 INFO L290 TraceCheckUtils]: 76: Hoare triple {22702#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {22702#false} is VALID [2022-04-28 08:42:20,340 INFO L290 TraceCheckUtils]: 77: Hoare triple {22702#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {22702#false} is VALID [2022-04-28 08:42:20,340 INFO L290 TraceCheckUtils]: 78: Hoare triple {22702#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {22702#false} is VALID [2022-04-28 08:42:20,340 INFO L290 TraceCheckUtils]: 79: Hoare triple {22702#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {22702#false} is VALID [2022-04-28 08:42:20,340 INFO L290 TraceCheckUtils]: 80: Hoare triple {22702#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {22702#false} is VALID [2022-04-28 08:42:20,340 INFO L290 TraceCheckUtils]: 81: Hoare triple {22702#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {22702#false} is VALID [2022-04-28 08:42:20,341 INFO L290 TraceCheckUtils]: 82: Hoare triple {22702#false} assume 8 == ~blastFlag~0; {22702#false} is VALID [2022-04-28 08:42:20,341 INFO L290 TraceCheckUtils]: 83: Hoare triple {22702#false} assume !false; {22702#false} is VALID [2022-04-28 08:42:20,341 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-04-28 08:42:20,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:42:20,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622855291] [2022-04-28 08:42:20,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622855291] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:42:20,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:42:20,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:42:20,342 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:42:20,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1603705800] [2022-04-28 08:42:20,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1603705800] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:42:20,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:42:20,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:42:20,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479722448] [2022-04-28 08:42:20,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:42:20,342 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 84 [2022-04-28 08:42:20,343 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:42:20,343 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:20,387 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:42:20,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:42:20,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:42:20,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:42:20,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:42:20,388 INFO L87 Difference]: Start difference. First operand 377 states and 618 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:21,851 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:42:23,855 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 08:42:27,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:42:27,557 INFO L93 Difference]: Finished difference Result 858 states and 1394 transitions. [2022-04-28 08:42:27,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:42:27,558 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 84 [2022-04-28 08:42:27,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:42:27,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:27,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 593 transitions. [2022-04-28 08:42:27,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:27,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 593 transitions. [2022-04-28 08:42:27,562 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 593 transitions. [2022-04-28 08:42:27,930 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 593 edges. 593 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:42:27,944 INFO L225 Difference]: With dead ends: 858 [2022-04-28 08:42:27,944 INFO L226 Difference]: Without dead ends: 496 [2022-04-28 08:42:27,945 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 08:42:27,945 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 143 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 56 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-04-28 08:42:27,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 418 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 515 Invalid, 1 Unknown, 0 Unchecked, 4.8s Time] [2022-04-28 08:42:27,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2022-04-28 08:42:27,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 393. [2022-04-28 08:42:27,963 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:42:27,963 INFO L82 GeneralOperation]: Start isEquivalent. First operand 496 states. Second operand has 393 states, 388 states have (on average 1.634020618556701) internal successors, (634), 388 states have internal predecessors, (634), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:27,964 INFO L74 IsIncluded]: Start isIncluded. First operand 496 states. Second operand has 393 states, 388 states have (on average 1.634020618556701) internal successors, (634), 388 states have internal predecessors, (634), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:27,964 INFO L87 Difference]: Start difference. First operand 496 states. Second operand has 393 states, 388 states have (on average 1.634020618556701) internal successors, (634), 388 states have internal predecessors, (634), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:27,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:42:27,973 INFO L93 Difference]: Finished difference Result 496 states and 788 transitions. [2022-04-28 08:42:27,973 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 788 transitions. [2022-04-28 08:42:27,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:42:27,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:42:27,975 INFO L74 IsIncluded]: Start isIncluded. First operand has 393 states, 388 states have (on average 1.634020618556701) internal successors, (634), 388 states have internal predecessors, (634), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 496 states. [2022-04-28 08:42:27,976 INFO L87 Difference]: Start difference. First operand has 393 states, 388 states have (on average 1.634020618556701) internal successors, (634), 388 states have internal predecessors, (634), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 496 states. [2022-04-28 08:42:27,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:42:27,984 INFO L93 Difference]: Finished difference Result 496 states and 788 transitions. [2022-04-28 08:42:27,984 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 788 transitions. [2022-04-28 08:42:27,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:42:27,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:42:27,985 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:42:27,985 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:42:27,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 388 states have (on average 1.634020618556701) internal successors, (634), 388 states have internal predecessors, (634), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:27,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 638 transitions. [2022-04-28 08:42:27,993 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 638 transitions. Word has length 84 [2022-04-28 08:42:27,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:42:27,993 INFO L495 AbstractCegarLoop]: Abstraction has 393 states and 638 transitions. [2022-04-28 08:42:27,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:27,993 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 393 states and 638 transitions. [2022-04-28 08:42:28,534 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 638 edges. 638 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:42:28,535 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 638 transitions. [2022-04-28 08:42:28,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-28 08:42:28,536 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:42:28,536 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:42:28,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-28 08:42:28,536 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:42:28,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:42:28,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1180490630, now seen corresponding path program 1 times [2022-04-28 08:42:28,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:42:28,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1865514352] [2022-04-28 08:42:28,571 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:42:28,571 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:42:28,571 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:42:28,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1180490630, now seen corresponding path program 2 times [2022-04-28 08:42:28,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:42:28,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960859287] [2022-04-28 08:42:28,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:42:28,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:42:28,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:42:28,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:42:28,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:42:28,673 INFO L290 TraceCheckUtils]: 0: Hoare triple {26214#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {26207#true} is VALID [2022-04-28 08:42:28,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {26207#true} assume true; {26207#true} is VALID [2022-04-28 08:42:28,673 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26207#true} {26207#true} #689#return; {26207#true} is VALID [2022-04-28 08:42:28,674 INFO L272 TraceCheckUtils]: 0: Hoare triple {26207#true} call ULTIMATE.init(); {26214#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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 08:42:28,674 INFO L290 TraceCheckUtils]: 1: Hoare triple {26214#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {26207#true} is VALID [2022-04-28 08:42:28,674 INFO L290 TraceCheckUtils]: 2: Hoare triple {26207#true} assume true; {26207#true} is VALID [2022-04-28 08:42:28,674 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26207#true} {26207#true} #689#return; {26207#true} is VALID [2022-04-28 08:42:28,674 INFO L272 TraceCheckUtils]: 4: Hoare triple {26207#true} call #t~ret161 := main(); {26207#true} is VALID [2022-04-28 08:42:28,675 INFO L290 TraceCheckUtils]: 5: Hoare triple {26207#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~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(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #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, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);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, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);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, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {26207#true} is VALID [2022-04-28 08:42:28,675 INFO L290 TraceCheckUtils]: 6: Hoare triple {26207#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {26207#true} is VALID [2022-04-28 08:42:28,675 INFO L272 TraceCheckUtils]: 7: Hoare triple {26207#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {26207#true} is VALID [2022-04-28 08:42:28,676 INFO L290 TraceCheckUtils]: 8: Hoare triple {26207#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 -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~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, 192 + ~s.offset, 4); {26212#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-28 08:42:28,677 INFO L290 TraceCheckUtils]: 9: Hoare triple {26212#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {26212#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-28 08:42:28,677 INFO L290 TraceCheckUtils]: 10: Hoare triple {26212#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {26212#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-28 08:42:28,678 INFO L290 TraceCheckUtils]: 11: Hoare triple {26212#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {26212#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-28 08:42:28,678 INFO L290 TraceCheckUtils]: 12: Hoare triple {26212#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {26212#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-28 08:42:28,678 INFO L290 TraceCheckUtils]: 13: Hoare triple {26212#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {26212#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-28 08:42:28,679 INFO L290 TraceCheckUtils]: 14: Hoare triple {26212#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !false; {26212#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-28 08:42:28,679 INFO L290 TraceCheckUtils]: 15: Hoare triple {26212#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {26212#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-28 08:42:28,679 INFO L290 TraceCheckUtils]: 16: Hoare triple {26212#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {26212#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-28 08:42:28,680 INFO L290 TraceCheckUtils]: 17: Hoare triple {26212#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {26212#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-28 08:42:28,680 INFO L290 TraceCheckUtils]: 18: Hoare triple {26212#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {26212#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-28 08:42:28,680 INFO L290 TraceCheckUtils]: 19: Hoare triple {26212#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {26212#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-28 08:42:28,681 INFO L290 TraceCheckUtils]: 20: Hoare triple {26212#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {26212#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-28 08:42:28,681 INFO L290 TraceCheckUtils]: 21: Hoare triple {26212#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {26213#(not (= |ssl3_accept_#t~mem53| 8481))} is VALID [2022-04-28 08:42:28,681 INFO L290 TraceCheckUtils]: 22: Hoare triple {26213#(not (= |ssl3_accept_#t~mem53| 8481))} assume 8481 == #t~mem53;havoc #t~mem53; {26208#false} is VALID [2022-04-28 08:42:28,682 INFO L290 TraceCheckUtils]: 23: Hoare triple {26208#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {26208#false} is VALID [2022-04-28 08:42:28,682 INFO L290 TraceCheckUtils]: 24: Hoare triple {26208#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem91.base, 844 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {26208#false} is VALID [2022-04-28 08:42:28,682 INFO L290 TraceCheckUtils]: 25: Hoare triple {26208#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {26208#false} is VALID [2022-04-28 08:42:28,682 INFO L290 TraceCheckUtils]: 26: Hoare triple {26208#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {26208#false} is VALID [2022-04-28 08:42:28,682 INFO L290 TraceCheckUtils]: 27: Hoare triple {26208#false} ~skip~0 := 0; {26208#false} is VALID [2022-04-28 08:42:28,682 INFO L290 TraceCheckUtils]: 28: Hoare triple {26208#false} assume !false; {26208#false} is VALID [2022-04-28 08:42:28,682 INFO L290 TraceCheckUtils]: 29: Hoare triple {26208#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {26208#false} is VALID [2022-04-28 08:42:28,682 INFO L290 TraceCheckUtils]: 30: Hoare triple {26208#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {26208#false} is VALID [2022-04-28 08:42:28,682 INFO L290 TraceCheckUtils]: 31: Hoare triple {26208#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {26208#false} is VALID [2022-04-28 08:42:28,682 INFO L290 TraceCheckUtils]: 32: Hoare triple {26208#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {26208#false} is VALID [2022-04-28 08:42:28,682 INFO L290 TraceCheckUtils]: 33: Hoare triple {26208#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {26208#false} is VALID [2022-04-28 08:42:28,682 INFO L290 TraceCheckUtils]: 34: Hoare triple {26208#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {26208#false} is VALID [2022-04-28 08:42:28,682 INFO L290 TraceCheckUtils]: 35: Hoare triple {26208#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {26208#false} is VALID [2022-04-28 08:42:28,682 INFO L290 TraceCheckUtils]: 36: Hoare triple {26208#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {26208#false} is VALID [2022-04-28 08:42:28,683 INFO L290 TraceCheckUtils]: 37: Hoare triple {26208#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {26208#false} is VALID [2022-04-28 08:42:28,683 INFO L290 TraceCheckUtils]: 38: Hoare triple {26208#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {26208#false} is VALID [2022-04-28 08:42:28,683 INFO L290 TraceCheckUtils]: 39: Hoare triple {26208#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {26208#false} is VALID [2022-04-28 08:42:28,683 INFO L290 TraceCheckUtils]: 40: Hoare triple {26208#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {26208#false} is VALID [2022-04-28 08:42:28,683 INFO L290 TraceCheckUtils]: 41: Hoare triple {26208#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {26208#false} is VALID [2022-04-28 08:42:28,683 INFO L290 TraceCheckUtils]: 42: Hoare triple {26208#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {26208#false} is VALID [2022-04-28 08:42:28,683 INFO L290 TraceCheckUtils]: 43: Hoare triple {26208#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {26208#false} is VALID [2022-04-28 08:42:28,683 INFO L290 TraceCheckUtils]: 44: Hoare triple {26208#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {26208#false} is VALID [2022-04-28 08:42:28,683 INFO L290 TraceCheckUtils]: 45: Hoare triple {26208#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {26208#false} is VALID [2022-04-28 08:42:28,683 INFO L290 TraceCheckUtils]: 46: Hoare triple {26208#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {26208#false} is VALID [2022-04-28 08:42:28,683 INFO L290 TraceCheckUtils]: 47: Hoare triple {26208#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {26208#false} is VALID [2022-04-28 08:42:28,683 INFO L290 TraceCheckUtils]: 48: Hoare triple {26208#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {26208#false} is VALID [2022-04-28 08:42:28,683 INFO L290 TraceCheckUtils]: 49: Hoare triple {26208#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {26208#false} is VALID [2022-04-28 08:42:28,684 INFO L290 TraceCheckUtils]: 50: Hoare triple {26208#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {26208#false} is VALID [2022-04-28 08:42:28,684 INFO L290 TraceCheckUtils]: 51: Hoare triple {26208#false} assume 8448 == #t~mem68;havoc #t~mem68; {26208#false} is VALID [2022-04-28 08:42:28,684 INFO L290 TraceCheckUtils]: 52: Hoare triple {26208#false} assume !(~num1~0 > 0); {26208#false} is VALID [2022-04-28 08:42:28,684 INFO L290 TraceCheckUtils]: 53: Hoare triple {26208#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {26208#false} is VALID [2022-04-28 08:42:28,684 INFO L290 TraceCheckUtils]: 54: Hoare triple {26208#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {26208#false} is VALID [2022-04-28 08:42:28,684 INFO L290 TraceCheckUtils]: 55: Hoare triple {26208#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {26208#false} is VALID [2022-04-28 08:42:28,684 INFO L290 TraceCheckUtils]: 56: Hoare triple {26208#false} ~skip~0 := 0; {26208#false} is VALID [2022-04-28 08:42:28,684 INFO L290 TraceCheckUtils]: 57: Hoare triple {26208#false} assume !false; {26208#false} is VALID [2022-04-28 08:42:28,684 INFO L290 TraceCheckUtils]: 58: Hoare triple {26208#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {26208#false} is VALID [2022-04-28 08:42:28,684 INFO L290 TraceCheckUtils]: 59: Hoare triple {26208#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {26208#false} is VALID [2022-04-28 08:42:28,684 INFO L290 TraceCheckUtils]: 60: Hoare triple {26208#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {26208#false} is VALID [2022-04-28 08:42:28,684 INFO L290 TraceCheckUtils]: 61: Hoare triple {26208#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {26208#false} is VALID [2022-04-28 08:42:28,684 INFO L290 TraceCheckUtils]: 62: Hoare triple {26208#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {26208#false} is VALID [2022-04-28 08:42:28,684 INFO L290 TraceCheckUtils]: 63: Hoare triple {26208#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {26208#false} is VALID [2022-04-28 08:42:28,685 INFO L290 TraceCheckUtils]: 64: Hoare triple {26208#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {26208#false} is VALID [2022-04-28 08:42:28,685 INFO L290 TraceCheckUtils]: 65: Hoare triple {26208#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {26208#false} is VALID [2022-04-28 08:42:28,685 INFO L290 TraceCheckUtils]: 66: Hoare triple {26208#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {26208#false} is VALID [2022-04-28 08:42:28,685 INFO L290 TraceCheckUtils]: 67: Hoare triple {26208#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {26208#false} is VALID [2022-04-28 08:42:28,685 INFO L290 TraceCheckUtils]: 68: Hoare triple {26208#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {26208#false} is VALID [2022-04-28 08:42:28,685 INFO L290 TraceCheckUtils]: 69: Hoare triple {26208#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {26208#false} is VALID [2022-04-28 08:42:28,685 INFO L290 TraceCheckUtils]: 70: Hoare triple {26208#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {26208#false} is VALID [2022-04-28 08:42:28,685 INFO L290 TraceCheckUtils]: 71: Hoare triple {26208#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {26208#false} is VALID [2022-04-28 08:42:28,685 INFO L290 TraceCheckUtils]: 72: Hoare triple {26208#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {26208#false} is VALID [2022-04-28 08:42:28,685 INFO L290 TraceCheckUtils]: 73: Hoare triple {26208#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {26208#false} is VALID [2022-04-28 08:42:28,685 INFO L290 TraceCheckUtils]: 74: Hoare triple {26208#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {26208#false} is VALID [2022-04-28 08:42:28,685 INFO L290 TraceCheckUtils]: 75: Hoare triple {26208#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {26208#false} is VALID [2022-04-28 08:42:28,685 INFO L290 TraceCheckUtils]: 76: Hoare triple {26208#false} assume 8544 == #t~mem64;havoc #t~mem64; {26208#false} is VALID [2022-04-28 08:42:28,685 INFO L290 TraceCheckUtils]: 77: Hoare triple {26208#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {26208#false} is VALID [2022-04-28 08:42:28,686 INFO L290 TraceCheckUtils]: 78: Hoare triple {26208#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {26208#false} is VALID [2022-04-28 08:42:28,686 INFO L290 TraceCheckUtils]: 79: Hoare triple {26208#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {26208#false} is VALID [2022-04-28 08:42:28,686 INFO L290 TraceCheckUtils]: 80: Hoare triple {26208#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {26208#false} is VALID [2022-04-28 08:42:28,686 INFO L290 TraceCheckUtils]: 81: Hoare triple {26208#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {26208#false} is VALID [2022-04-28 08:42:28,686 INFO L290 TraceCheckUtils]: 82: Hoare triple {26208#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {26208#false} is VALID [2022-04-28 08:42:28,686 INFO L290 TraceCheckUtils]: 83: Hoare triple {26208#false} assume 8 == ~blastFlag~0; {26208#false} is VALID [2022-04-28 08:42:28,686 INFO L290 TraceCheckUtils]: 84: Hoare triple {26208#false} assume !false; {26208#false} is VALID [2022-04-28 08:42:28,686 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-04-28 08:42:28,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:42:28,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960859287] [2022-04-28 08:42:28,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960859287] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:42:28,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:42:28,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:42:28,687 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:42:28,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1865514352] [2022-04-28 08:42:28,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1865514352] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:42:28,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:42:28,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:42:28,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257057438] [2022-04-28 08:42:28,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:42:28,688 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2022-04-28 08:42:28,688 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:42:28,688 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:28,735 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:42:28,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:42:28,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:42:28,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:42:28,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:42:28,736 INFO L87 Difference]: Start difference. First operand 393 states and 638 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:37,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:42:37,077 INFO L93 Difference]: Finished difference Result 850 states and 1368 transitions. [2022-04-28 08:42:37,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:42:37,078 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2022-04-28 08:42:37,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:42:37,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:37,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 593 transitions. [2022-04-28 08:42:37,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:37,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 593 transitions. [2022-04-28 08:42:37,084 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 593 transitions. [2022-04-28 08:42:37,447 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 593 edges. 593 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:42:37,456 INFO L225 Difference]: With dead ends: 850 [2022-04-28 08:42:37,457 INFO L226 Difference]: Without dead ends: 472 [2022-04-28 08:42:37,457 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 08:42:37,458 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 142 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-04-28 08:42:37,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 342 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-04-28 08:42:37,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2022-04-28 08:42:37,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 393. [2022-04-28 08:42:37,474 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:42:37,475 INFO L82 GeneralOperation]: Start isEquivalent. First operand 472 states. Second operand has 393 states, 388 states have (on average 1.615979381443299) internal successors, (627), 388 states have internal predecessors, (627), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:37,475 INFO L74 IsIncluded]: Start isIncluded. First operand 472 states. Second operand has 393 states, 388 states have (on average 1.615979381443299) internal successors, (627), 388 states have internal predecessors, (627), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:37,475 INFO L87 Difference]: Start difference. First operand 472 states. Second operand has 393 states, 388 states have (on average 1.615979381443299) internal successors, (627), 388 states have internal predecessors, (627), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:37,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:42:37,484 INFO L93 Difference]: Finished difference Result 472 states and 742 transitions. [2022-04-28 08:42:37,484 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 742 transitions. [2022-04-28 08:42:37,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:42:37,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:42:37,485 INFO L74 IsIncluded]: Start isIncluded. First operand has 393 states, 388 states have (on average 1.615979381443299) internal successors, (627), 388 states have internal predecessors, (627), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 472 states. [2022-04-28 08:42:37,485 INFO L87 Difference]: Start difference. First operand has 393 states, 388 states have (on average 1.615979381443299) internal successors, (627), 388 states have internal predecessors, (627), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 472 states. [2022-04-28 08:42:37,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:42:37,493 INFO L93 Difference]: Finished difference Result 472 states and 742 transitions. [2022-04-28 08:42:37,493 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 742 transitions. [2022-04-28 08:42:37,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:42:37,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:42:37,494 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:42:37,494 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:42:37,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 388 states have (on average 1.615979381443299) internal successors, (627), 388 states have internal predecessors, (627), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:37,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 631 transitions. [2022-04-28 08:42:37,507 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 631 transitions. Word has length 85 [2022-04-28 08:42:37,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:42:37,507 INFO L495 AbstractCegarLoop]: Abstraction has 393 states and 631 transitions. [2022-04-28 08:42:37,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:37,507 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 393 states and 631 transitions. [2022-04-28 08:42:37,976 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 631 edges. 631 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:42:37,977 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 631 transitions. [2022-04-28 08:42:37,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-28 08:42:37,977 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:42:37,978 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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 08:42:37,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-28 08:42:37,978 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:42:37,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:42:37,978 INFO L85 PathProgramCache]: Analyzing trace with hash 646259126, now seen corresponding path program 1 times [2022-04-28 08:42:37,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:42:37,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [625885532] [2022-04-28 08:42:38,030 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:42:38,030 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:42:38,030 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:42:38,031 INFO L85 PathProgramCache]: Analyzing trace with hash 646259126, now seen corresponding path program 2 times [2022-04-28 08:42:38,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:42:38,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536858732] [2022-04-28 08:42:38,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:42:38,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:42:38,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:42:38,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:42:38,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:42:38,140 INFO L290 TraceCheckUtils]: 0: Hoare triple {29656#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {29649#true} is VALID [2022-04-28 08:42:38,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {29649#true} assume true; {29649#true} is VALID [2022-04-28 08:42:38,140 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29649#true} {29649#true} #689#return; {29649#true} is VALID [2022-04-28 08:42:38,140 INFO L272 TraceCheckUtils]: 0: Hoare triple {29649#true} call ULTIMATE.init(); {29656#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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 08:42:38,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {29656#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {29649#true} is VALID [2022-04-28 08:42:38,141 INFO L290 TraceCheckUtils]: 2: Hoare triple {29649#true} assume true; {29649#true} is VALID [2022-04-28 08:42:38,141 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29649#true} {29649#true} #689#return; {29649#true} is VALID [2022-04-28 08:42:38,141 INFO L272 TraceCheckUtils]: 4: Hoare triple {29649#true} call #t~ret161 := main(); {29649#true} is VALID [2022-04-28 08:42:38,141 INFO L290 TraceCheckUtils]: 5: Hoare triple {29649#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~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(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #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, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);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, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);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, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {29649#true} is VALID [2022-04-28 08:42:38,141 INFO L290 TraceCheckUtils]: 6: Hoare triple {29649#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {29649#true} is VALID [2022-04-28 08:42:38,141 INFO L272 TraceCheckUtils]: 7: Hoare triple {29649#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {29649#true} is VALID [2022-04-28 08:42:38,143 INFO L290 TraceCheckUtils]: 8: Hoare triple {29649#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 -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~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, 192 + ~s.offset, 4); {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:38,143 INFO L290 TraceCheckUtils]: 9: Hoare triple {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:38,144 INFO L290 TraceCheckUtils]: 10: Hoare triple {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:38,144 INFO L290 TraceCheckUtils]: 11: Hoare triple {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:38,144 INFO L290 TraceCheckUtils]: 12: Hoare triple {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:38,145 INFO L290 TraceCheckUtils]: 13: Hoare triple {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:38,145 INFO L290 TraceCheckUtils]: 14: Hoare triple {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:38,145 INFO L290 TraceCheckUtils]: 15: Hoare triple {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:38,146 INFO L290 TraceCheckUtils]: 16: Hoare triple {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:38,146 INFO L290 TraceCheckUtils]: 17: Hoare triple {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:38,146 INFO L290 TraceCheckUtils]: 18: Hoare triple {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:38,147 INFO L290 TraceCheckUtils]: 19: Hoare triple {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:38,147 INFO L290 TraceCheckUtils]: 20: Hoare triple {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:38,147 INFO L290 TraceCheckUtils]: 21: Hoare triple {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:38,148 INFO L290 TraceCheckUtils]: 22: Hoare triple {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:38,148 INFO L290 TraceCheckUtils]: 23: Hoare triple {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:38,148 INFO L290 TraceCheckUtils]: 24: Hoare triple {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:38,149 INFO L290 TraceCheckUtils]: 25: Hoare triple {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:38,149 INFO L290 TraceCheckUtils]: 26: Hoare triple {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:38,149 INFO L290 TraceCheckUtils]: 27: Hoare triple {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:38,150 INFO L290 TraceCheckUtils]: 28: Hoare triple {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:38,150 INFO L290 TraceCheckUtils]: 29: Hoare triple {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:38,150 INFO L290 TraceCheckUtils]: 30: Hoare triple {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:38,151 INFO L290 TraceCheckUtils]: 31: Hoare triple {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:38,151 INFO L290 TraceCheckUtils]: 32: Hoare triple {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:38,151 INFO L290 TraceCheckUtils]: 33: Hoare triple {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:38,152 INFO L290 TraceCheckUtils]: 34: Hoare triple {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:38,152 INFO L290 TraceCheckUtils]: 35: Hoare triple {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:38,152 INFO L290 TraceCheckUtils]: 36: Hoare triple {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:38,153 INFO L290 TraceCheckUtils]: 37: Hoare triple {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:38,153 INFO L290 TraceCheckUtils]: 38: Hoare triple {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:38,153 INFO L290 TraceCheckUtils]: 39: Hoare triple {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:38,154 INFO L290 TraceCheckUtils]: 40: Hoare triple {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:38,154 INFO L290 TraceCheckUtils]: 41: Hoare triple {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:38,154 INFO L290 TraceCheckUtils]: 42: Hoare triple {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:38,154 INFO L290 TraceCheckUtils]: 43: Hoare triple {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:38,155 INFO L290 TraceCheckUtils]: 44: Hoare triple {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:38,155 INFO L290 TraceCheckUtils]: 45: Hoare triple {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:38,155 INFO L290 TraceCheckUtils]: 46: Hoare triple {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:42:38,156 INFO L290 TraceCheckUtils]: 47: Hoare triple {29654#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {29655#(not (= |ssl3_accept_#t~mem79| 8672))} is VALID [2022-04-28 08:42:38,156 INFO L290 TraceCheckUtils]: 48: Hoare triple {29655#(not (= |ssl3_accept_#t~mem79| 8672))} assume 8672 == #t~mem79;havoc #t~mem79; {29650#false} is VALID [2022-04-28 08:42:38,162 INFO L290 TraceCheckUtils]: 49: Hoare triple {29650#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {29650#false} is VALID [2022-04-28 08:42:38,162 INFO L290 TraceCheckUtils]: 50: Hoare triple {29650#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {29650#false} is VALID [2022-04-28 08:42:38,162 INFO L290 TraceCheckUtils]: 51: Hoare triple {29650#false} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 52 + ~s.offset, 4);call #t~mem145 := read~int(~s.base, 92 + ~s.offset, 4); {29650#false} is VALID [2022-04-28 08:42:38,162 INFO L290 TraceCheckUtils]: 52: Hoare triple {29650#false} assume 0 != #t~mem145;havoc #t~mem145;call #t~mem146.base, #t~mem146.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8640, #t~mem146.base, 844 + #t~mem146.offset, 4);havoc #t~mem146.base, #t~mem146.offset; {29650#false} is VALID [2022-04-28 08:42:38,162 INFO L290 TraceCheckUtils]: 53: Hoare triple {29650#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {29650#false} is VALID [2022-04-28 08:42:38,162 INFO L290 TraceCheckUtils]: 54: Hoare triple {29650#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {29650#false} is VALID [2022-04-28 08:42:38,163 INFO L290 TraceCheckUtils]: 55: Hoare triple {29650#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {29650#false} is VALID [2022-04-28 08:42:38,163 INFO L290 TraceCheckUtils]: 56: Hoare triple {29650#false} ~skip~0 := 0; {29650#false} is VALID [2022-04-28 08:42:38,163 INFO L290 TraceCheckUtils]: 57: Hoare triple {29650#false} assume !false; {29650#false} is VALID [2022-04-28 08:42:38,163 INFO L290 TraceCheckUtils]: 58: Hoare triple {29650#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {29650#false} is VALID [2022-04-28 08:42:38,163 INFO L290 TraceCheckUtils]: 59: Hoare triple {29650#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {29650#false} is VALID [2022-04-28 08:42:38,163 INFO L290 TraceCheckUtils]: 60: Hoare triple {29650#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {29650#false} is VALID [2022-04-28 08:42:38,163 INFO L290 TraceCheckUtils]: 61: Hoare triple {29650#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {29650#false} is VALID [2022-04-28 08:42:38,163 INFO L290 TraceCheckUtils]: 62: Hoare triple {29650#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {29650#false} is VALID [2022-04-28 08:42:38,163 INFO L290 TraceCheckUtils]: 63: Hoare triple {29650#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {29650#false} is VALID [2022-04-28 08:42:38,163 INFO L290 TraceCheckUtils]: 64: Hoare triple {29650#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {29650#false} is VALID [2022-04-28 08:42:38,163 INFO L290 TraceCheckUtils]: 65: Hoare triple {29650#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {29650#false} is VALID [2022-04-28 08:42:38,163 INFO L290 TraceCheckUtils]: 66: Hoare triple {29650#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {29650#false} is VALID [2022-04-28 08:42:38,163 INFO L290 TraceCheckUtils]: 67: Hoare triple {29650#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {29650#false} is VALID [2022-04-28 08:42:38,164 INFO L290 TraceCheckUtils]: 68: Hoare triple {29650#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {29650#false} is VALID [2022-04-28 08:42:38,164 INFO L290 TraceCheckUtils]: 69: Hoare triple {29650#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {29650#false} is VALID [2022-04-28 08:42:38,164 INFO L290 TraceCheckUtils]: 70: Hoare triple {29650#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {29650#false} is VALID [2022-04-28 08:42:38,164 INFO L290 TraceCheckUtils]: 71: Hoare triple {29650#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {29650#false} is VALID [2022-04-28 08:42:38,164 INFO L290 TraceCheckUtils]: 72: Hoare triple {29650#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {29650#false} is VALID [2022-04-28 08:42:38,164 INFO L290 TraceCheckUtils]: 73: Hoare triple {29650#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {29650#false} is VALID [2022-04-28 08:42:38,164 INFO L290 TraceCheckUtils]: 74: Hoare triple {29650#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {29650#false} is VALID [2022-04-28 08:42:38,164 INFO L290 TraceCheckUtils]: 75: Hoare triple {29650#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {29650#false} is VALID [2022-04-28 08:42:38,164 INFO L290 TraceCheckUtils]: 76: Hoare triple {29650#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {29650#false} is VALID [2022-04-28 08:42:38,164 INFO L290 TraceCheckUtils]: 77: Hoare triple {29650#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {29650#false} is VALID [2022-04-28 08:42:38,164 INFO L290 TraceCheckUtils]: 78: Hoare triple {29650#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {29650#false} is VALID [2022-04-28 08:42:38,164 INFO L290 TraceCheckUtils]: 79: Hoare triple {29650#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {29650#false} is VALID [2022-04-28 08:42:38,164 INFO L290 TraceCheckUtils]: 80: Hoare triple {29650#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {29650#false} is VALID [2022-04-28 08:42:38,165 INFO L290 TraceCheckUtils]: 81: Hoare triple {29650#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {29650#false} is VALID [2022-04-28 08:42:38,165 INFO L290 TraceCheckUtils]: 82: Hoare triple {29650#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {29650#false} is VALID [2022-04-28 08:42:38,165 INFO L290 TraceCheckUtils]: 83: Hoare triple {29650#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {29650#false} is VALID [2022-04-28 08:42:38,165 INFO L290 TraceCheckUtils]: 84: Hoare triple {29650#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {29650#false} is VALID [2022-04-28 08:42:38,165 INFO L290 TraceCheckUtils]: 85: Hoare triple {29650#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {29650#false} is VALID [2022-04-28 08:42:38,165 INFO L290 TraceCheckUtils]: 86: Hoare triple {29650#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {29650#false} is VALID [2022-04-28 08:42:38,165 INFO L290 TraceCheckUtils]: 87: Hoare triple {29650#false} assume 8640 == #t~mem75;havoc #t~mem75; {29650#false} is VALID [2022-04-28 08:42:38,165 INFO L290 TraceCheckUtils]: 88: Hoare triple {29650#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {29650#false} is VALID [2022-04-28 08:42:38,165 INFO L290 TraceCheckUtils]: 89: Hoare triple {29650#false} assume 5 == ~blastFlag~0; {29650#false} is VALID [2022-04-28 08:42:38,165 INFO L290 TraceCheckUtils]: 90: Hoare triple {29650#false} assume !false; {29650#false} is VALID [2022-04-28 08:42:38,166 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:42:38,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:42:38,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536858732] [2022-04-28 08:42:38,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536858732] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:42:38,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:42:38,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:42:38,166 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:42:38,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [625885532] [2022-04-28 08:42:38,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [625885532] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:42:38,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:42:38,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:42:38,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512826438] [2022-04-28 08:42:38,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:42:38,167 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 91 [2022-04-28 08:42:38,167 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:42:38,167 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:38,226 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:42:38,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:42:38,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:42:38,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:42:38,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:42:38,228 INFO L87 Difference]: Start difference. First operand 393 states and 631 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:41,845 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:42:43,848 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 08:42:45,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:42:45,493 INFO L93 Difference]: Finished difference Result 890 states and 1418 transitions. [2022-04-28 08:42:45,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:42:45,495 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 91 [2022-04-28 08:42:45,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:42:45,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:45,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 592 transitions. [2022-04-28 08:42:45,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:45,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 592 transitions. [2022-04-28 08:42:45,506 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 592 transitions. [2022-04-28 08:42:45,885 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 592 edges. 592 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:42:45,896 INFO L225 Difference]: With dead ends: 890 [2022-04-28 08:42:45,896 INFO L226 Difference]: Without dead ends: 512 [2022-04-28 08:42:45,896 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 08:42:45,897 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 114 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-04-28 08:42:45,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 343 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 477 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2022-04-28 08:42:45,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2022-04-28 08:42:45,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 436. [2022-04-28 08:42:45,915 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:42:45,915 INFO L82 GeneralOperation]: Start isEquivalent. First operand 512 states. Second operand has 436 states, 431 states have (on average 1.6148491879350348) internal successors, (696), 431 states have internal predecessors, (696), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:45,916 INFO L74 IsIncluded]: Start isIncluded. First operand 512 states. Second operand has 436 states, 431 states have (on average 1.6148491879350348) internal successors, (696), 431 states have internal predecessors, (696), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:45,916 INFO L87 Difference]: Start difference. First operand 512 states. Second operand has 436 states, 431 states have (on average 1.6148491879350348) internal successors, (696), 431 states have internal predecessors, (696), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:45,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:42:45,924 INFO L93 Difference]: Finished difference Result 512 states and 805 transitions. [2022-04-28 08:42:45,925 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 805 transitions. [2022-04-28 08:42:45,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:42:45,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:42:45,925 INFO L74 IsIncluded]: Start isIncluded. First operand has 436 states, 431 states have (on average 1.6148491879350348) internal successors, (696), 431 states have internal predecessors, (696), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 512 states. [2022-04-28 08:42:45,926 INFO L87 Difference]: Start difference. First operand has 436 states, 431 states have (on average 1.6148491879350348) internal successors, (696), 431 states have internal predecessors, (696), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 512 states. [2022-04-28 08:42:45,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:42:45,935 INFO L93 Difference]: Finished difference Result 512 states and 805 transitions. [2022-04-28 08:42:45,935 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 805 transitions. [2022-04-28 08:42:45,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:42:45,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:42:45,935 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:42:45,935 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:42:45,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 431 states have (on average 1.6148491879350348) internal successors, (696), 431 states have internal predecessors, (696), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:45,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 700 transitions. [2022-04-28 08:42:45,943 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 700 transitions. Word has length 91 [2022-04-28 08:42:45,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:42:45,944 INFO L495 AbstractCegarLoop]: Abstraction has 436 states and 700 transitions. [2022-04-28 08:42:45,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:45,944 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 436 states and 700 transitions. [2022-04-28 08:42:46,483 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 700 edges. 700 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:42:46,484 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 700 transitions. [2022-04-28 08:42:46,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-04-28 08:42:46,485 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:42:46,485 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2022-04-28 08:42:46,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-28 08:42:46,485 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:42:46,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:42:46,485 INFO L85 PathProgramCache]: Analyzing trace with hash 2016065217, now seen corresponding path program 1 times [2022-04-28 08:42:46,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:42:46,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [535587280] [2022-04-28 08:42:46,570 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:42:46,571 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:42:46,571 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:42:46,571 INFO L85 PathProgramCache]: Analyzing trace with hash 2016065217, now seen corresponding path program 2 times [2022-04-28 08:42:46,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:42:46,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287155664] [2022-04-28 08:42:46,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:42:46,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:42:46,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:42:46,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:42:46,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:42:46,659 INFO L290 TraceCheckUtils]: 0: Hoare triple {33344#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {33337#true} is VALID [2022-04-28 08:42:46,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {33337#true} assume true; {33337#true} is VALID [2022-04-28 08:42:46,660 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33337#true} {33337#true} #689#return; {33337#true} is VALID [2022-04-28 08:42:46,660 INFO L272 TraceCheckUtils]: 0: Hoare triple {33337#true} call ULTIMATE.init(); {33344#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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 08:42:46,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {33344#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {33337#true} is VALID [2022-04-28 08:42:46,660 INFO L290 TraceCheckUtils]: 2: Hoare triple {33337#true} assume true; {33337#true} is VALID [2022-04-28 08:42:46,661 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33337#true} {33337#true} #689#return; {33337#true} is VALID [2022-04-28 08:42:46,661 INFO L272 TraceCheckUtils]: 4: Hoare triple {33337#true} call #t~ret161 := main(); {33337#true} is VALID [2022-04-28 08:42:46,661 INFO L290 TraceCheckUtils]: 5: Hoare triple {33337#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~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(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #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, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);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, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);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, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {33337#true} is VALID [2022-04-28 08:42:46,661 INFO L290 TraceCheckUtils]: 6: Hoare triple {33337#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {33337#true} is VALID [2022-04-28 08:42:46,661 INFO L272 TraceCheckUtils]: 7: Hoare triple {33337#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {33337#true} is VALID [2022-04-28 08:42:46,662 INFO L290 TraceCheckUtils]: 8: Hoare triple {33337#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 -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~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, 192 + ~s.offset, 4); {33342#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:42:46,663 INFO L290 TraceCheckUtils]: 9: Hoare triple {33342#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {33342#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:42:46,664 INFO L290 TraceCheckUtils]: 10: Hoare triple {33342#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {33342#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:42:46,664 INFO L290 TraceCheckUtils]: 11: Hoare triple {33342#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {33342#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:42:46,664 INFO L290 TraceCheckUtils]: 12: Hoare triple {33342#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {33342#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:42:46,665 INFO L290 TraceCheckUtils]: 13: Hoare triple {33342#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {33342#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:42:46,665 INFO L290 TraceCheckUtils]: 14: Hoare triple {33342#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {33342#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:42:46,665 INFO L290 TraceCheckUtils]: 15: Hoare triple {33342#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {33342#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:42:46,665 INFO L290 TraceCheckUtils]: 16: Hoare triple {33342#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {33342#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:42:46,666 INFO L290 TraceCheckUtils]: 17: Hoare triple {33342#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {33342#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:42:46,666 INFO L290 TraceCheckUtils]: 18: Hoare triple {33342#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {33342#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:42:46,666 INFO L290 TraceCheckUtils]: 19: Hoare triple {33342#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {33342#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:42:46,667 INFO L290 TraceCheckUtils]: 20: Hoare triple {33342#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {33342#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:42:46,667 INFO L290 TraceCheckUtils]: 21: Hoare triple {33342#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {33342#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:42:46,667 INFO L290 TraceCheckUtils]: 22: Hoare triple {33342#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {33342#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:42:46,668 INFO L290 TraceCheckUtils]: 23: Hoare triple {33342#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {33343#(= 8464 |ssl3_accept_#t~mem55|)} is VALID [2022-04-28 08:42:46,668 INFO L290 TraceCheckUtils]: 24: Hoare triple {33343#(= 8464 |ssl3_accept_#t~mem55|)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {33338#false} is VALID [2022-04-28 08:42:46,668 INFO L290 TraceCheckUtils]: 25: Hoare triple {33338#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {33338#false} is VALID [2022-04-28 08:42:46,668 INFO L290 TraceCheckUtils]: 26: Hoare triple {33338#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {33338#false} is VALID [2022-04-28 08:42:46,668 INFO L290 TraceCheckUtils]: 27: Hoare triple {33338#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {33338#false} is VALID [2022-04-28 08:42:46,668 INFO L290 TraceCheckUtils]: 28: Hoare triple {33338#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {33338#false} is VALID [2022-04-28 08:42:46,668 INFO L290 TraceCheckUtils]: 29: Hoare triple {33338#false} assume 8512 == #t~mem60;havoc #t~mem60; {33338#false} is VALID [2022-04-28 08:42:46,669 INFO L290 TraceCheckUtils]: 30: Hoare triple {33338#false} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 836 + #t~mem95.offset, 4);call #t~mem97 := read~int(#t~mem96.base, 12 + #t~mem96.offset, 4); {33338#false} is VALID [2022-04-28 08:42:46,669 INFO L290 TraceCheckUtils]: 31: Hoare triple {33338#false} assume 0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 4294967296;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;~skip~0 := 1; {33338#false} is VALID [2022-04-28 08:42:46,669 INFO L290 TraceCheckUtils]: 32: Hoare triple {33338#false} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {33338#false} is VALID [2022-04-28 08:42:46,669 INFO L290 TraceCheckUtils]: 33: Hoare triple {33338#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {33338#false} is VALID [2022-04-28 08:42:46,669 INFO L290 TraceCheckUtils]: 34: Hoare triple {33338#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {33338#false} is VALID [2022-04-28 08:42:46,669 INFO L290 TraceCheckUtils]: 35: Hoare triple {33338#false} ~skip~0 := 0; {33338#false} is VALID [2022-04-28 08:42:46,669 INFO L290 TraceCheckUtils]: 36: Hoare triple {33338#false} assume !false; {33338#false} is VALID [2022-04-28 08:42:46,669 INFO L290 TraceCheckUtils]: 37: Hoare triple {33338#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {33338#false} is VALID [2022-04-28 08:42:46,669 INFO L290 TraceCheckUtils]: 38: Hoare triple {33338#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {33338#false} is VALID [2022-04-28 08:42:46,669 INFO L290 TraceCheckUtils]: 39: Hoare triple {33338#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {33338#false} is VALID [2022-04-28 08:42:46,669 INFO L290 TraceCheckUtils]: 40: Hoare triple {33338#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {33338#false} is VALID [2022-04-28 08:42:46,669 INFO L290 TraceCheckUtils]: 41: Hoare triple {33338#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {33338#false} is VALID [2022-04-28 08:42:46,669 INFO L290 TraceCheckUtils]: 42: Hoare triple {33338#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {33338#false} is VALID [2022-04-28 08:42:46,670 INFO L290 TraceCheckUtils]: 43: Hoare triple {33338#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {33338#false} is VALID [2022-04-28 08:42:46,670 INFO L290 TraceCheckUtils]: 44: Hoare triple {33338#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {33338#false} is VALID [2022-04-28 08:42:46,670 INFO L290 TraceCheckUtils]: 45: Hoare triple {33338#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {33338#false} is VALID [2022-04-28 08:42:46,670 INFO L290 TraceCheckUtils]: 46: Hoare triple {33338#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {33338#false} is VALID [2022-04-28 08:42:46,670 INFO L290 TraceCheckUtils]: 47: Hoare triple {33338#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {33338#false} is VALID [2022-04-28 08:42:46,670 INFO L290 TraceCheckUtils]: 48: Hoare triple {33338#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {33338#false} is VALID [2022-04-28 08:42:46,670 INFO L290 TraceCheckUtils]: 49: Hoare triple {33338#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {33338#false} is VALID [2022-04-28 08:42:46,670 INFO L290 TraceCheckUtils]: 50: Hoare triple {33338#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {33338#false} is VALID [2022-04-28 08:42:46,670 INFO L290 TraceCheckUtils]: 51: Hoare triple {33338#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {33338#false} is VALID [2022-04-28 08:42:46,670 INFO L290 TraceCheckUtils]: 52: Hoare triple {33338#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {33338#false} is VALID [2022-04-28 08:42:46,670 INFO L290 TraceCheckUtils]: 53: Hoare triple {33338#false} assume 8528 == #t~mem62;havoc #t~mem62; {33338#false} is VALID [2022-04-28 08:42:46,670 INFO L290 TraceCheckUtils]: 54: Hoare triple {33338#false} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 836 + #t~mem99.offset, 4);call #t~mem101 := read~int(#t~mem100.base, 12 + #t~mem100.offset, 4);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 232 + ~s.offset, 4); {33338#false} is VALID [2022-04-28 08:42:46,670 INFO L290 TraceCheckUtils]: 55: Hoare triple {33338#false} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 4294967296;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem103.base, 871 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {33338#false} is VALID [2022-04-28 08:42:46,670 INFO L290 TraceCheckUtils]: 56: Hoare triple {33338#false} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem106 := read~int(#t~mem105.base, 871 + #t~mem105.offset, 4); {33338#false} is VALID [2022-04-28 08:42:46,670 INFO L290 TraceCheckUtils]: 57: Hoare triple {33338#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {33338#false} is VALID [2022-04-28 08:42:46,671 INFO L290 TraceCheckUtils]: 58: Hoare triple {33338#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {33338#false} is VALID [2022-04-28 08:42:46,671 INFO L290 TraceCheckUtils]: 59: Hoare triple {33338#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {33338#false} is VALID [2022-04-28 08:42:46,671 INFO L290 TraceCheckUtils]: 60: Hoare triple {33338#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {33338#false} is VALID [2022-04-28 08:42:46,671 INFO L290 TraceCheckUtils]: 61: Hoare triple {33338#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {33338#false} is VALID [2022-04-28 08:42:46,671 INFO L290 TraceCheckUtils]: 62: Hoare triple {33338#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {33338#false} is VALID [2022-04-28 08:42:46,671 INFO L290 TraceCheckUtils]: 63: Hoare triple {33338#false} ~skip~0 := 0; {33338#false} is VALID [2022-04-28 08:42:46,671 INFO L290 TraceCheckUtils]: 64: Hoare triple {33338#false} assume !false; {33338#false} is VALID [2022-04-28 08:42:46,671 INFO L290 TraceCheckUtils]: 65: Hoare triple {33338#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {33338#false} is VALID [2022-04-28 08:42:46,671 INFO L290 TraceCheckUtils]: 66: Hoare triple {33338#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {33338#false} is VALID [2022-04-28 08:42:46,671 INFO L290 TraceCheckUtils]: 67: Hoare triple {33338#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {33338#false} is VALID [2022-04-28 08:42:46,671 INFO L290 TraceCheckUtils]: 68: Hoare triple {33338#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {33338#false} is VALID [2022-04-28 08:42:46,671 INFO L290 TraceCheckUtils]: 69: Hoare triple {33338#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {33338#false} is VALID [2022-04-28 08:42:46,671 INFO L290 TraceCheckUtils]: 70: Hoare triple {33338#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {33338#false} is VALID [2022-04-28 08:42:46,671 INFO L290 TraceCheckUtils]: 71: Hoare triple {33338#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {33338#false} is VALID [2022-04-28 08:42:46,672 INFO L290 TraceCheckUtils]: 72: Hoare triple {33338#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {33338#false} is VALID [2022-04-28 08:42:46,672 INFO L290 TraceCheckUtils]: 73: Hoare triple {33338#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {33338#false} is VALID [2022-04-28 08:42:46,672 INFO L290 TraceCheckUtils]: 74: Hoare triple {33338#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {33338#false} is VALID [2022-04-28 08:42:46,672 INFO L290 TraceCheckUtils]: 75: Hoare triple {33338#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {33338#false} is VALID [2022-04-28 08:42:46,672 INFO L290 TraceCheckUtils]: 76: Hoare triple {33338#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {33338#false} is VALID [2022-04-28 08:42:46,672 INFO L290 TraceCheckUtils]: 77: Hoare triple {33338#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {33338#false} is VALID [2022-04-28 08:42:46,672 INFO L290 TraceCheckUtils]: 78: Hoare triple {33338#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {33338#false} is VALID [2022-04-28 08:42:46,672 INFO L290 TraceCheckUtils]: 79: Hoare triple {33338#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {33338#false} is VALID [2022-04-28 08:42:46,672 INFO L290 TraceCheckUtils]: 80: Hoare triple {33338#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {33338#false} is VALID [2022-04-28 08:42:46,672 INFO L290 TraceCheckUtils]: 81: Hoare triple {33338#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {33338#false} is VALID [2022-04-28 08:42:46,672 INFO L290 TraceCheckUtils]: 82: Hoare triple {33338#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {33338#false} is VALID [2022-04-28 08:42:46,672 INFO L290 TraceCheckUtils]: 83: Hoare triple {33338#false} assume 8544 == #t~mem64;havoc #t~mem64; {33338#false} is VALID [2022-04-28 08:42:46,672 INFO L290 TraceCheckUtils]: 84: Hoare triple {33338#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {33338#false} is VALID [2022-04-28 08:42:46,672 INFO L290 TraceCheckUtils]: 85: Hoare triple {33338#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {33338#false} is VALID [2022-04-28 08:42:46,673 INFO L290 TraceCheckUtils]: 86: Hoare triple {33338#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {33338#false} is VALID [2022-04-28 08:42:46,673 INFO L290 TraceCheckUtils]: 87: Hoare triple {33338#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {33338#false} is VALID [2022-04-28 08:42:46,673 INFO L290 TraceCheckUtils]: 88: Hoare triple {33338#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {33338#false} is VALID [2022-04-28 08:42:46,673 INFO L290 TraceCheckUtils]: 89: Hoare triple {33338#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {33338#false} is VALID [2022-04-28 08:42:46,673 INFO L290 TraceCheckUtils]: 90: Hoare triple {33338#false} assume 8 == ~blastFlag~0; {33338#false} is VALID [2022-04-28 08:42:46,673 INFO L290 TraceCheckUtils]: 91: Hoare triple {33338#false} assume !false; {33338#false} is VALID [2022-04-28 08:42:46,673 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-04-28 08:42:46,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:42:46,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287155664] [2022-04-28 08:42:46,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287155664] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:42:46,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:42:46,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:42:46,674 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:42:46,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [535587280] [2022-04-28 08:42:46,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [535587280] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:42:46,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:42:46,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:42:46,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582809221] [2022-04-28 08:42:46,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:42:46,674 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 92 [2022-04-28 08:42:46,675 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:42:46,675 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 08:42:46,722 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 08:42:46,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:42:46,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:42:46,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:42:46,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:42:46,723 INFO L87 Difference]: Start difference. First operand 436 states and 700 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 08:42:48,202 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:42:52,078 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:42:52,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:42:52,903 INFO L93 Difference]: Finished difference Result 883 states and 1418 transitions. [2022-04-28 08:42:52,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:42:52,903 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 92 [2022-04-28 08:42:52,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:42:52,903 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 08:42:52,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 448 transitions. [2022-04-28 08:42:52,905 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 08:42:52,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 448 transitions. [2022-04-28 08:42:52,907 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 448 transitions. [2022-04-28 08:42:53,167 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 448 edges. 448 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:42:53,176 INFO L225 Difference]: With dead ends: 883 [2022-04-28 08:42:53,176 INFO L226 Difference]: Without dead ends: 462 [2022-04-28 08:42:53,177 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 08:42:53,177 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 20 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-04-28 08:42:53,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 485 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-04-28 08:42:53,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2022-04-28 08:42:53,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 447. [2022-04-28 08:42:53,196 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:42:53,197 INFO L82 GeneralOperation]: Start isEquivalent. First operand 462 states. Second operand has 447 states, 442 states have (on average 1.6131221719457014) internal successors, (713), 442 states have internal predecessors, (713), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:53,197 INFO L74 IsIncluded]: Start isIncluded. First operand 462 states. Second operand has 447 states, 442 states have (on average 1.6131221719457014) internal successors, (713), 442 states have internal predecessors, (713), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:53,197 INFO L87 Difference]: Start difference. First operand 462 states. Second operand has 447 states, 442 states have (on average 1.6131221719457014) internal successors, (713), 442 states have internal predecessors, (713), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:53,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:42:53,205 INFO L93 Difference]: Finished difference Result 462 states and 736 transitions. [2022-04-28 08:42:53,205 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 736 transitions. [2022-04-28 08:42:53,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:42:53,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:42:53,206 INFO L74 IsIncluded]: Start isIncluded. First operand has 447 states, 442 states have (on average 1.6131221719457014) internal successors, (713), 442 states have internal predecessors, (713), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 462 states. [2022-04-28 08:42:53,206 INFO L87 Difference]: Start difference. First operand has 447 states, 442 states have (on average 1.6131221719457014) internal successors, (713), 442 states have internal predecessors, (713), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 462 states. [2022-04-28 08:42:53,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:42:53,213 INFO L93 Difference]: Finished difference Result 462 states and 736 transitions. [2022-04-28 08:42:53,213 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 736 transitions. [2022-04-28 08:42:53,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:42:53,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:42:53,214 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:42:53,214 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:42:53,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 442 states have (on average 1.6131221719457014) internal successors, (713), 442 states have internal predecessors, (713), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:42:53,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 717 transitions. [2022-04-28 08:42:53,222 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 717 transitions. Word has length 92 [2022-04-28 08:42:53,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:42:53,223 INFO L495 AbstractCegarLoop]: Abstraction has 447 states and 717 transitions. [2022-04-28 08:42:53,223 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 08:42:53,223 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 447 states and 717 transitions. [2022-04-28 08:42:53,801 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 717 edges. 717 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:42:53,801 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 717 transitions. [2022-04-28 08:42:53,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-04-28 08:42:53,815 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:42:53,815 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:42:53,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-28 08:42:53,816 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:42:53,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:42:53,816 INFO L85 PathProgramCache]: Analyzing trace with hash 340309531, now seen corresponding path program 1 times [2022-04-28 08:42:53,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:42:53,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [913556610] [2022-04-28 08:42:53,858 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:42:53,858 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:42:53,858 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:42:53,858 INFO L85 PathProgramCache]: Analyzing trace with hash 340309531, now seen corresponding path program 2 times [2022-04-28 08:42:53,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:42:53,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668062449] [2022-04-28 08:42:53,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:42:53,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:42:53,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:42:53,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:42:53,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:42:53,986 INFO L290 TraceCheckUtils]: 0: Hoare triple {36940#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {36933#true} is VALID [2022-04-28 08:42:53,986 INFO L290 TraceCheckUtils]: 1: Hoare triple {36933#true} assume true; {36933#true} is VALID [2022-04-28 08:42:53,986 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36933#true} {36933#true} #689#return; {36933#true} is VALID [2022-04-28 08:42:53,986 INFO L272 TraceCheckUtils]: 0: Hoare triple {36933#true} call ULTIMATE.init(); {36940#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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 08:42:53,987 INFO L290 TraceCheckUtils]: 1: Hoare triple {36940#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {36933#true} is VALID [2022-04-28 08:42:53,987 INFO L290 TraceCheckUtils]: 2: Hoare triple {36933#true} assume true; {36933#true} is VALID [2022-04-28 08:42:53,987 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36933#true} {36933#true} #689#return; {36933#true} is VALID [2022-04-28 08:42:53,987 INFO L272 TraceCheckUtils]: 4: Hoare triple {36933#true} call #t~ret161 := main(); {36933#true} is VALID [2022-04-28 08:42:53,987 INFO L290 TraceCheckUtils]: 5: Hoare triple {36933#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~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(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #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, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);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, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);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, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {36933#true} is VALID [2022-04-28 08:42:53,987 INFO L290 TraceCheckUtils]: 6: Hoare triple {36933#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {36933#true} is VALID [2022-04-28 08:42:53,987 INFO L272 TraceCheckUtils]: 7: Hoare triple {36933#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {36933#true} is VALID [2022-04-28 08:42:53,989 INFO L290 TraceCheckUtils]: 8: Hoare triple {36933#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 -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~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, 192 + ~s.offset, 4); {36938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:42:53,989 INFO L290 TraceCheckUtils]: 9: Hoare triple {36938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {36938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:42:53,990 INFO L290 TraceCheckUtils]: 10: Hoare triple {36938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {36938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:42:53,990 INFO L290 TraceCheckUtils]: 11: Hoare triple {36938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {36938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:42:53,990 INFO L290 TraceCheckUtils]: 12: Hoare triple {36938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {36938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:42:53,991 INFO L290 TraceCheckUtils]: 13: Hoare triple {36938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {36938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:42:53,991 INFO L290 TraceCheckUtils]: 14: Hoare triple {36938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {36938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:42:53,991 INFO L290 TraceCheckUtils]: 15: Hoare triple {36938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {36939#(= 8464 |ssl3_accept_#t~mem47|)} is VALID [2022-04-28 08:42:53,992 INFO L290 TraceCheckUtils]: 16: Hoare triple {36939#(= 8464 |ssl3_accept_#t~mem47|)} assume 12292 == #t~mem47;havoc #t~mem47; {36934#false} is VALID [2022-04-28 08:42:53,992 INFO L290 TraceCheckUtils]: 17: Hoare triple {36934#false} call write~int(1, ~s.base, 40 + ~s.offset, 4); {36934#false} is VALID [2022-04-28 08:42:53,992 INFO L290 TraceCheckUtils]: 18: Hoare triple {36934#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {36934#false} is VALID [2022-04-28 08:42:53,992 INFO L290 TraceCheckUtils]: 19: Hoare triple {36934#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {36934#false} is VALID [2022-04-28 08:42:53,992 INFO L290 TraceCheckUtils]: 20: Hoare triple {36934#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {36934#false} is VALID [2022-04-28 08:42:53,992 INFO L290 TraceCheckUtils]: 21: Hoare triple {36934#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, 60 + ~s.offset, 4); {36934#false} is VALID [2022-04-28 08:42:53,992 INFO L290 TraceCheckUtils]: 22: Hoare triple {36934#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {36934#false} is VALID [2022-04-28 08:42:53,992 INFO L290 TraceCheckUtils]: 23: Hoare triple {36934#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {36934#false} is VALID [2022-04-28 08:42:53,993 INFO L290 TraceCheckUtils]: 24: Hoare triple {36934#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem89 := read~int(#t~mem88.base, 76 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 76 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {36934#false} is VALID [2022-04-28 08:42:53,993 INFO L290 TraceCheckUtils]: 25: Hoare triple {36934#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {36934#false} is VALID [2022-04-28 08:42:53,993 INFO L290 TraceCheckUtils]: 26: Hoare triple {36934#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {36934#false} is VALID [2022-04-28 08:42:53,993 INFO L290 TraceCheckUtils]: 27: Hoare triple {36934#false} ~skip~0 := 0; {36934#false} is VALID [2022-04-28 08:42:53,993 INFO L290 TraceCheckUtils]: 28: Hoare triple {36934#false} assume !false; {36934#false} is VALID [2022-04-28 08:42:53,993 INFO L290 TraceCheckUtils]: 29: Hoare triple {36934#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {36934#false} is VALID [2022-04-28 08:42:53,993 INFO L290 TraceCheckUtils]: 30: Hoare triple {36934#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {36934#false} is VALID [2022-04-28 08:42:53,993 INFO L290 TraceCheckUtils]: 31: Hoare triple {36934#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {36934#false} is VALID [2022-04-28 08:42:53,993 INFO L290 TraceCheckUtils]: 32: Hoare triple {36934#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {36934#false} is VALID [2022-04-28 08:42:53,993 INFO L290 TraceCheckUtils]: 33: Hoare triple {36934#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {36934#false} is VALID [2022-04-28 08:42:53,993 INFO L290 TraceCheckUtils]: 34: Hoare triple {36934#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {36934#false} is VALID [2022-04-28 08:42:53,993 INFO L290 TraceCheckUtils]: 35: Hoare triple {36934#false} assume 8480 == #t~mem52;havoc #t~mem52; {36934#false} is VALID [2022-04-28 08:42:53,993 INFO L290 TraceCheckUtils]: 36: Hoare triple {36934#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {36934#false} is VALID [2022-04-28 08:42:53,993 INFO L290 TraceCheckUtils]: 37: Hoare triple {36934#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem91.base, 844 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {36934#false} is VALID [2022-04-28 08:42:53,994 INFO L290 TraceCheckUtils]: 38: Hoare triple {36934#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {36934#false} is VALID [2022-04-28 08:42:53,994 INFO L290 TraceCheckUtils]: 39: Hoare triple {36934#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {36934#false} is VALID [2022-04-28 08:42:53,994 INFO L290 TraceCheckUtils]: 40: Hoare triple {36934#false} ~skip~0 := 0; {36934#false} is VALID [2022-04-28 08:42:53,994 INFO L290 TraceCheckUtils]: 41: Hoare triple {36934#false} assume !false; {36934#false} is VALID [2022-04-28 08:42:53,994 INFO L290 TraceCheckUtils]: 42: Hoare triple {36934#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {36934#false} is VALID [2022-04-28 08:42:53,994 INFO L290 TraceCheckUtils]: 43: Hoare triple {36934#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {36934#false} is VALID [2022-04-28 08:42:53,994 INFO L290 TraceCheckUtils]: 44: Hoare triple {36934#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {36934#false} is VALID [2022-04-28 08:42:53,994 INFO L290 TraceCheckUtils]: 45: Hoare triple {36934#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {36934#false} is VALID [2022-04-28 08:42:53,994 INFO L290 TraceCheckUtils]: 46: Hoare triple {36934#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {36934#false} is VALID [2022-04-28 08:42:53,994 INFO L290 TraceCheckUtils]: 47: Hoare triple {36934#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {36934#false} is VALID [2022-04-28 08:42:53,994 INFO L290 TraceCheckUtils]: 48: Hoare triple {36934#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {36934#false} is VALID [2022-04-28 08:42:53,994 INFO L290 TraceCheckUtils]: 49: Hoare triple {36934#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {36934#false} is VALID [2022-04-28 08:42:53,994 INFO L290 TraceCheckUtils]: 50: Hoare triple {36934#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {36934#false} is VALID [2022-04-28 08:42:53,994 INFO L290 TraceCheckUtils]: 51: Hoare triple {36934#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {36934#false} is VALID [2022-04-28 08:42:53,995 INFO L290 TraceCheckUtils]: 52: Hoare triple {36934#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {36934#false} is VALID [2022-04-28 08:42:53,995 INFO L290 TraceCheckUtils]: 53: Hoare triple {36934#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {36934#false} is VALID [2022-04-28 08:42:53,995 INFO L290 TraceCheckUtils]: 54: Hoare triple {36934#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {36934#false} is VALID [2022-04-28 08:42:53,995 INFO L290 TraceCheckUtils]: 55: Hoare triple {36934#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {36934#false} is VALID [2022-04-28 08:42:53,995 INFO L290 TraceCheckUtils]: 56: Hoare triple {36934#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {36934#false} is VALID [2022-04-28 08:42:53,995 INFO L290 TraceCheckUtils]: 57: Hoare triple {36934#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {36934#false} is VALID [2022-04-28 08:42:53,995 INFO L290 TraceCheckUtils]: 58: Hoare triple {36934#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {36934#false} is VALID [2022-04-28 08:42:53,995 INFO L290 TraceCheckUtils]: 59: Hoare triple {36934#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {36934#false} is VALID [2022-04-28 08:42:53,995 INFO L290 TraceCheckUtils]: 60: Hoare triple {36934#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {36934#false} is VALID [2022-04-28 08:42:53,995 INFO L290 TraceCheckUtils]: 61: Hoare triple {36934#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {36934#false} is VALID [2022-04-28 08:42:53,995 INFO L290 TraceCheckUtils]: 62: Hoare triple {36934#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {36934#false} is VALID [2022-04-28 08:42:53,995 INFO L290 TraceCheckUtils]: 63: Hoare triple {36934#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {36934#false} is VALID [2022-04-28 08:42:53,995 INFO L290 TraceCheckUtils]: 64: Hoare triple {36934#false} assume 8448 == #t~mem68;havoc #t~mem68; {36934#false} is VALID [2022-04-28 08:42:53,995 INFO L290 TraceCheckUtils]: 65: Hoare triple {36934#false} assume !(~num1~0 > 0); {36934#false} is VALID [2022-04-28 08:42:53,996 INFO L290 TraceCheckUtils]: 66: Hoare triple {36934#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {36934#false} is VALID [2022-04-28 08:42:53,996 INFO L290 TraceCheckUtils]: 67: Hoare triple {36934#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {36934#false} is VALID [2022-04-28 08:42:53,996 INFO L290 TraceCheckUtils]: 68: Hoare triple {36934#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {36934#false} is VALID [2022-04-28 08:42:53,996 INFO L290 TraceCheckUtils]: 69: Hoare triple {36934#false} ~skip~0 := 0; {36934#false} is VALID [2022-04-28 08:42:53,996 INFO L290 TraceCheckUtils]: 70: Hoare triple {36934#false} assume !false; {36934#false} is VALID [2022-04-28 08:42:53,996 INFO L290 TraceCheckUtils]: 71: Hoare triple {36934#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {36934#false} is VALID [2022-04-28 08:42:53,996 INFO L290 TraceCheckUtils]: 72: Hoare triple {36934#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {36934#false} is VALID [2022-04-28 08:42:53,996 INFO L290 TraceCheckUtils]: 73: Hoare triple {36934#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {36934#false} is VALID [2022-04-28 08:42:53,996 INFO L290 TraceCheckUtils]: 74: Hoare triple {36934#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {36934#false} is VALID [2022-04-28 08:42:53,996 INFO L290 TraceCheckUtils]: 75: Hoare triple {36934#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {36934#false} is VALID [2022-04-28 08:42:53,996 INFO L290 TraceCheckUtils]: 76: Hoare triple {36934#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {36934#false} is VALID [2022-04-28 08:42:53,996 INFO L290 TraceCheckUtils]: 77: Hoare triple {36934#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {36934#false} is VALID [2022-04-28 08:42:53,996 INFO L290 TraceCheckUtils]: 78: Hoare triple {36934#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {36934#false} is VALID [2022-04-28 08:42:53,996 INFO L290 TraceCheckUtils]: 79: Hoare triple {36934#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {36934#false} is VALID [2022-04-28 08:42:53,997 INFO L290 TraceCheckUtils]: 80: Hoare triple {36934#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {36934#false} is VALID [2022-04-28 08:42:53,997 INFO L290 TraceCheckUtils]: 81: Hoare triple {36934#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {36934#false} is VALID [2022-04-28 08:42:53,997 INFO L290 TraceCheckUtils]: 82: Hoare triple {36934#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {36934#false} is VALID [2022-04-28 08:42:53,997 INFO L290 TraceCheckUtils]: 83: Hoare triple {36934#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {36934#false} is VALID [2022-04-28 08:42:53,997 INFO L290 TraceCheckUtils]: 84: Hoare triple {36934#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {36934#false} is VALID [2022-04-28 08:42:53,997 INFO L290 TraceCheckUtils]: 85: Hoare triple {36934#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {36934#false} is VALID [2022-04-28 08:42:53,997 INFO L290 TraceCheckUtils]: 86: Hoare triple {36934#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {36934#false} is VALID [2022-04-28 08:42:53,997 INFO L290 TraceCheckUtils]: 87: Hoare triple {36934#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {36934#false} is VALID [2022-04-28 08:42:53,997 INFO L290 TraceCheckUtils]: 88: Hoare triple {36934#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {36934#false} is VALID [2022-04-28 08:42:53,997 INFO L290 TraceCheckUtils]: 89: Hoare triple {36934#false} assume 8544 == #t~mem64;havoc #t~mem64; {36934#false} is VALID [2022-04-28 08:42:53,997 INFO L290 TraceCheckUtils]: 90: Hoare triple {36934#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {36934#false} is VALID [2022-04-28 08:42:53,997 INFO L290 TraceCheckUtils]: 91: Hoare triple {36934#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {36934#false} is VALID [2022-04-28 08:42:53,997 INFO L290 TraceCheckUtils]: 92: Hoare triple {36934#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {36934#false} is VALID [2022-04-28 08:42:53,997 INFO L290 TraceCheckUtils]: 93: Hoare triple {36934#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {36934#false} is VALID [2022-04-28 08:42:53,998 INFO L290 TraceCheckUtils]: 94: Hoare triple {36934#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {36934#false} is VALID [2022-04-28 08:42:53,998 INFO L290 TraceCheckUtils]: 95: Hoare triple {36934#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {36934#false} is VALID [2022-04-28 08:42:53,998 INFO L290 TraceCheckUtils]: 96: Hoare triple {36934#false} assume 8 == ~blastFlag~0; {36934#false} is VALID [2022-04-28 08:42:53,998 INFO L290 TraceCheckUtils]: 97: Hoare triple {36934#false} assume !false; {36934#false} is VALID [2022-04-28 08:42:53,998 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 08:42:53,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:42:53,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668062449] [2022-04-28 08:42:53,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668062449] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:42:53,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:42:53,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:42:53,999 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:42:53,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [913556610] [2022-04-28 08:42:53,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [913556610] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:42:53,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:42:53,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:42:53,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678782793] [2022-04-28 08:42:53,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:42:53,999 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 98 [2022-04-28 08:42:54,000 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:42:54,000 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 08:42:54,047 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 08:42:54,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:42:54,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:42:54,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:42:54,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:42:54,049 INFO L87 Difference]: Start difference. First operand 447 states and 717 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 08:42:57,068 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 08:43:01,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:43:01,569 INFO L93 Difference]: Finished difference Result 882 states and 1416 transitions. [2022-04-28 08:43:01,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:43:01,570 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 98 [2022-04-28 08:43:01,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:43:01,570 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 08:43:01,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 446 transitions. [2022-04-28 08:43:01,571 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 08:43:01,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 446 transitions. [2022-04-28 08:43:01,573 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 446 transitions. [2022-04-28 08:43:01,826 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 446 edges. 446 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:43:01,839 INFO L225 Difference]: With dead ends: 882 [2022-04-28 08:43:01,839 INFO L226 Difference]: Without dead ends: 461 [2022-04-28 08:43:01,840 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 08:43:01,841 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 27 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-28 08:43:01,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 489 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-04-28 08:43:01,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2022-04-28 08:43:01,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 447. [2022-04-28 08:43:01,861 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:43:01,861 INFO L82 GeneralOperation]: Start isEquivalent. First operand 461 states. Second operand has 447 states, 442 states have (on average 1.6108597285067874) internal successors, (712), 442 states have internal predecessors, (712), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:43:01,867 INFO L74 IsIncluded]: Start isIncluded. First operand 461 states. Second operand has 447 states, 442 states have (on average 1.6108597285067874) internal successors, (712), 442 states have internal predecessors, (712), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:43:01,868 INFO L87 Difference]: Start difference. First operand 461 states. Second operand has 447 states, 442 states have (on average 1.6108597285067874) internal successors, (712), 442 states have internal predecessors, (712), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:43:01,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:43:01,886 INFO L93 Difference]: Finished difference Result 461 states and 734 transitions. [2022-04-28 08:43:01,886 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 734 transitions. [2022-04-28 08:43:01,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:43:01,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:43:01,887 INFO L74 IsIncluded]: Start isIncluded. First operand has 447 states, 442 states have (on average 1.6108597285067874) internal successors, (712), 442 states have internal predecessors, (712), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 461 states. [2022-04-28 08:43:01,887 INFO L87 Difference]: Start difference. First operand has 447 states, 442 states have (on average 1.6108597285067874) internal successors, (712), 442 states have internal predecessors, (712), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 461 states. [2022-04-28 08:43:01,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:43:01,895 INFO L93 Difference]: Finished difference Result 461 states and 734 transitions. [2022-04-28 08:43:01,895 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 734 transitions. [2022-04-28 08:43:01,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:43:01,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:43:01,896 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:43:01,896 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:43:01,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 442 states have (on average 1.6108597285067874) internal successors, (712), 442 states have internal predecessors, (712), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:43:01,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 716 transitions. [2022-04-28 08:43:01,905 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 716 transitions. Word has length 98 [2022-04-28 08:43:01,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:43:01,905 INFO L495 AbstractCegarLoop]: Abstraction has 447 states and 716 transitions. [2022-04-28 08:43:01,905 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 08:43:01,905 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 447 states and 716 transitions. [2022-04-28 08:43:02,457 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 716 edges. 716 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:43:02,457 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 716 transitions. [2022-04-28 08:43:02,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-04-28 08:43:02,458 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:43:02,458 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:43:02,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-28 08:43:02,459 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:43:02,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:43:02,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1628990895, now seen corresponding path program 1 times [2022-04-28 08:43:02,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:43:02,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1032854889] [2022-04-28 08:43:02,518 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:43:02,518 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:43:02,519 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:43:02,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1628990895, now seen corresponding path program 2 times [2022-04-28 08:43:02,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:43:02,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729284620] [2022-04-28 08:43:02,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:43:02,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:43:02,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:43:02,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:43:02,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:43:02,616 INFO L290 TraceCheckUtils]: 0: Hoare triple {40532#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {40525#true} is VALID [2022-04-28 08:43:02,616 INFO L290 TraceCheckUtils]: 1: Hoare triple {40525#true} assume true; {40525#true} is VALID [2022-04-28 08:43:02,616 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40525#true} {40525#true} #689#return; {40525#true} is VALID [2022-04-28 08:43:02,617 INFO L272 TraceCheckUtils]: 0: Hoare triple {40525#true} call ULTIMATE.init(); {40532#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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 08:43:02,617 INFO L290 TraceCheckUtils]: 1: Hoare triple {40532#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {40525#true} is VALID [2022-04-28 08:43:02,617 INFO L290 TraceCheckUtils]: 2: Hoare triple {40525#true} assume true; {40525#true} is VALID [2022-04-28 08:43:02,617 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40525#true} {40525#true} #689#return; {40525#true} is VALID [2022-04-28 08:43:02,617 INFO L272 TraceCheckUtils]: 4: Hoare triple {40525#true} call #t~ret161 := main(); {40525#true} is VALID [2022-04-28 08:43:02,617 INFO L290 TraceCheckUtils]: 5: Hoare triple {40525#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~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(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #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, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);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, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);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, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {40525#true} is VALID [2022-04-28 08:43:02,617 INFO L290 TraceCheckUtils]: 6: Hoare triple {40525#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {40525#true} is VALID [2022-04-28 08:43:02,617 INFO L272 TraceCheckUtils]: 7: Hoare triple {40525#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {40525#true} is VALID [2022-04-28 08:43:02,619 INFO L290 TraceCheckUtils]: 8: Hoare triple {40525#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 -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~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, 192 + ~s.offset, 4); {40530#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:43:02,619 INFO L290 TraceCheckUtils]: 9: Hoare triple {40530#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {40530#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:43:02,620 INFO L290 TraceCheckUtils]: 10: Hoare triple {40530#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {40530#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:43:02,620 INFO L290 TraceCheckUtils]: 11: Hoare triple {40530#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {40530#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:43:02,621 INFO L290 TraceCheckUtils]: 12: Hoare triple {40530#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {40530#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:43:02,621 INFO L290 TraceCheckUtils]: 13: Hoare triple {40530#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {40530#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:43:02,621 INFO L290 TraceCheckUtils]: 14: Hoare triple {40530#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {40530#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:43:02,622 INFO L290 TraceCheckUtils]: 15: Hoare triple {40530#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {40530#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:43:02,622 INFO L290 TraceCheckUtils]: 16: Hoare triple {40530#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {40531#(= 8464 |ssl3_accept_#t~mem48|)} is VALID [2022-04-28 08:43:02,622 INFO L290 TraceCheckUtils]: 17: Hoare triple {40531#(= 8464 |ssl3_accept_#t~mem48|)} assume 16384 == #t~mem48;havoc #t~mem48; {40526#false} is VALID [2022-04-28 08:43:02,622 INFO L290 TraceCheckUtils]: 18: Hoare triple {40526#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {40526#false} is VALID [2022-04-28 08:43:02,622 INFO L290 TraceCheckUtils]: 19: Hoare triple {40526#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {40526#false} is VALID [2022-04-28 08:43:02,623 INFO L290 TraceCheckUtils]: 20: Hoare triple {40526#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {40526#false} is VALID [2022-04-28 08:43:02,623 INFO L290 TraceCheckUtils]: 21: Hoare triple {40526#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, 60 + ~s.offset, 4); {40526#false} is VALID [2022-04-28 08:43:02,623 INFO L290 TraceCheckUtils]: 22: Hoare triple {40526#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {40526#false} is VALID [2022-04-28 08:43:02,623 INFO L290 TraceCheckUtils]: 23: Hoare triple {40526#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {40526#false} is VALID [2022-04-28 08:43:02,623 INFO L290 TraceCheckUtils]: 24: Hoare triple {40526#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem89 := read~int(#t~mem88.base, 76 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 76 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {40526#false} is VALID [2022-04-28 08:43:02,623 INFO L290 TraceCheckUtils]: 25: Hoare triple {40526#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {40526#false} is VALID [2022-04-28 08:43:02,623 INFO L290 TraceCheckUtils]: 26: Hoare triple {40526#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {40526#false} is VALID [2022-04-28 08:43:02,623 INFO L290 TraceCheckUtils]: 27: Hoare triple {40526#false} ~skip~0 := 0; {40526#false} is VALID [2022-04-28 08:43:02,623 INFO L290 TraceCheckUtils]: 28: Hoare triple {40526#false} assume !false; {40526#false} is VALID [2022-04-28 08:43:02,623 INFO L290 TraceCheckUtils]: 29: Hoare triple {40526#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {40526#false} is VALID [2022-04-28 08:43:02,623 INFO L290 TraceCheckUtils]: 30: Hoare triple {40526#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {40526#false} is VALID [2022-04-28 08:43:02,623 INFO L290 TraceCheckUtils]: 31: Hoare triple {40526#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {40526#false} is VALID [2022-04-28 08:43:02,623 INFO L290 TraceCheckUtils]: 32: Hoare triple {40526#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {40526#false} is VALID [2022-04-28 08:43:02,623 INFO L290 TraceCheckUtils]: 33: Hoare triple {40526#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {40526#false} is VALID [2022-04-28 08:43:02,624 INFO L290 TraceCheckUtils]: 34: Hoare triple {40526#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {40526#false} is VALID [2022-04-28 08:43:02,624 INFO L290 TraceCheckUtils]: 35: Hoare triple {40526#false} assume 8480 == #t~mem52;havoc #t~mem52; {40526#false} is VALID [2022-04-28 08:43:02,624 INFO L290 TraceCheckUtils]: 36: Hoare triple {40526#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {40526#false} is VALID [2022-04-28 08:43:02,624 INFO L290 TraceCheckUtils]: 37: Hoare triple {40526#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem91.base, 844 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {40526#false} is VALID [2022-04-28 08:43:02,624 INFO L290 TraceCheckUtils]: 38: Hoare triple {40526#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {40526#false} is VALID [2022-04-28 08:43:02,624 INFO L290 TraceCheckUtils]: 39: Hoare triple {40526#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {40526#false} is VALID [2022-04-28 08:43:02,624 INFO L290 TraceCheckUtils]: 40: Hoare triple {40526#false} ~skip~0 := 0; {40526#false} is VALID [2022-04-28 08:43:02,624 INFO L290 TraceCheckUtils]: 41: Hoare triple {40526#false} assume !false; {40526#false} is VALID [2022-04-28 08:43:02,624 INFO L290 TraceCheckUtils]: 42: Hoare triple {40526#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {40526#false} is VALID [2022-04-28 08:43:02,624 INFO L290 TraceCheckUtils]: 43: Hoare triple {40526#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {40526#false} is VALID [2022-04-28 08:43:02,624 INFO L290 TraceCheckUtils]: 44: Hoare triple {40526#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {40526#false} is VALID [2022-04-28 08:43:02,624 INFO L290 TraceCheckUtils]: 45: Hoare triple {40526#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {40526#false} is VALID [2022-04-28 08:43:02,624 INFO L290 TraceCheckUtils]: 46: Hoare triple {40526#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {40526#false} is VALID [2022-04-28 08:43:02,625 INFO L290 TraceCheckUtils]: 47: Hoare triple {40526#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {40526#false} is VALID [2022-04-28 08:43:02,625 INFO L290 TraceCheckUtils]: 48: Hoare triple {40526#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {40526#false} is VALID [2022-04-28 08:43:02,625 INFO L290 TraceCheckUtils]: 49: Hoare triple {40526#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {40526#false} is VALID [2022-04-28 08:43:02,625 INFO L290 TraceCheckUtils]: 50: Hoare triple {40526#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {40526#false} is VALID [2022-04-28 08:43:02,625 INFO L290 TraceCheckUtils]: 51: Hoare triple {40526#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {40526#false} is VALID [2022-04-28 08:43:02,625 INFO L290 TraceCheckUtils]: 52: Hoare triple {40526#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {40526#false} is VALID [2022-04-28 08:43:02,625 INFO L290 TraceCheckUtils]: 53: Hoare triple {40526#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {40526#false} is VALID [2022-04-28 08:43:02,625 INFO L290 TraceCheckUtils]: 54: Hoare triple {40526#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {40526#false} is VALID [2022-04-28 08:43:02,625 INFO L290 TraceCheckUtils]: 55: Hoare triple {40526#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {40526#false} is VALID [2022-04-28 08:43:02,625 INFO L290 TraceCheckUtils]: 56: Hoare triple {40526#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {40526#false} is VALID [2022-04-28 08:43:02,625 INFO L290 TraceCheckUtils]: 57: Hoare triple {40526#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {40526#false} is VALID [2022-04-28 08:43:02,625 INFO L290 TraceCheckUtils]: 58: Hoare triple {40526#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {40526#false} is VALID [2022-04-28 08:43:02,626 INFO L290 TraceCheckUtils]: 59: Hoare triple {40526#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {40526#false} is VALID [2022-04-28 08:43:02,626 INFO L290 TraceCheckUtils]: 60: Hoare triple {40526#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {40526#false} is VALID [2022-04-28 08:43:02,626 INFO L290 TraceCheckUtils]: 61: Hoare triple {40526#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {40526#false} is VALID [2022-04-28 08:43:02,626 INFO L290 TraceCheckUtils]: 62: Hoare triple {40526#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {40526#false} is VALID [2022-04-28 08:43:02,626 INFO L290 TraceCheckUtils]: 63: Hoare triple {40526#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {40526#false} is VALID [2022-04-28 08:43:02,626 INFO L290 TraceCheckUtils]: 64: Hoare triple {40526#false} assume 8448 == #t~mem68;havoc #t~mem68; {40526#false} is VALID [2022-04-28 08:43:02,626 INFO L290 TraceCheckUtils]: 65: Hoare triple {40526#false} assume !(~num1~0 > 0); {40526#false} is VALID [2022-04-28 08:43:02,626 INFO L290 TraceCheckUtils]: 66: Hoare triple {40526#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {40526#false} is VALID [2022-04-28 08:43:02,626 INFO L290 TraceCheckUtils]: 67: Hoare triple {40526#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {40526#false} is VALID [2022-04-28 08:43:02,627 INFO L290 TraceCheckUtils]: 68: Hoare triple {40526#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {40526#false} is VALID [2022-04-28 08:43:02,627 INFO L290 TraceCheckUtils]: 69: Hoare triple {40526#false} ~skip~0 := 0; {40526#false} is VALID [2022-04-28 08:43:02,627 INFO L290 TraceCheckUtils]: 70: Hoare triple {40526#false} assume !false; {40526#false} is VALID [2022-04-28 08:43:02,627 INFO L290 TraceCheckUtils]: 71: Hoare triple {40526#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {40526#false} is VALID [2022-04-28 08:43:02,627 INFO L290 TraceCheckUtils]: 72: Hoare triple {40526#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {40526#false} is VALID [2022-04-28 08:43:02,627 INFO L290 TraceCheckUtils]: 73: Hoare triple {40526#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {40526#false} is VALID [2022-04-28 08:43:02,627 INFO L290 TraceCheckUtils]: 74: Hoare triple {40526#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {40526#false} is VALID [2022-04-28 08:43:02,627 INFO L290 TraceCheckUtils]: 75: Hoare triple {40526#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {40526#false} is VALID [2022-04-28 08:43:02,627 INFO L290 TraceCheckUtils]: 76: Hoare triple {40526#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {40526#false} is VALID [2022-04-28 08:43:02,627 INFO L290 TraceCheckUtils]: 77: Hoare triple {40526#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {40526#false} is VALID [2022-04-28 08:43:02,627 INFO L290 TraceCheckUtils]: 78: Hoare triple {40526#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {40526#false} is VALID [2022-04-28 08:43:02,627 INFO L290 TraceCheckUtils]: 79: Hoare triple {40526#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {40526#false} is VALID [2022-04-28 08:43:02,627 INFO L290 TraceCheckUtils]: 80: Hoare triple {40526#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {40526#false} is VALID [2022-04-28 08:43:02,627 INFO L290 TraceCheckUtils]: 81: Hoare triple {40526#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {40526#false} is VALID [2022-04-28 08:43:02,628 INFO L290 TraceCheckUtils]: 82: Hoare triple {40526#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {40526#false} is VALID [2022-04-28 08:43:02,628 INFO L290 TraceCheckUtils]: 83: Hoare triple {40526#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {40526#false} is VALID [2022-04-28 08:43:02,628 INFO L290 TraceCheckUtils]: 84: Hoare triple {40526#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {40526#false} is VALID [2022-04-28 08:43:02,628 INFO L290 TraceCheckUtils]: 85: Hoare triple {40526#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {40526#false} is VALID [2022-04-28 08:43:02,628 INFO L290 TraceCheckUtils]: 86: Hoare triple {40526#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {40526#false} is VALID [2022-04-28 08:43:02,628 INFO L290 TraceCheckUtils]: 87: Hoare triple {40526#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {40526#false} is VALID [2022-04-28 08:43:02,628 INFO L290 TraceCheckUtils]: 88: Hoare triple {40526#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {40526#false} is VALID [2022-04-28 08:43:02,628 INFO L290 TraceCheckUtils]: 89: Hoare triple {40526#false} assume 8544 == #t~mem64;havoc #t~mem64; {40526#false} is VALID [2022-04-28 08:43:02,628 INFO L290 TraceCheckUtils]: 90: Hoare triple {40526#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {40526#false} is VALID [2022-04-28 08:43:02,628 INFO L290 TraceCheckUtils]: 91: Hoare triple {40526#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {40526#false} is VALID [2022-04-28 08:43:02,628 INFO L290 TraceCheckUtils]: 92: Hoare triple {40526#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {40526#false} is VALID [2022-04-28 08:43:02,629 INFO L290 TraceCheckUtils]: 93: Hoare triple {40526#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {40526#false} is VALID [2022-04-28 08:43:02,629 INFO L290 TraceCheckUtils]: 94: Hoare triple {40526#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {40526#false} is VALID [2022-04-28 08:43:02,629 INFO L290 TraceCheckUtils]: 95: Hoare triple {40526#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {40526#false} is VALID [2022-04-28 08:43:02,629 INFO L290 TraceCheckUtils]: 96: Hoare triple {40526#false} assume 8 == ~blastFlag~0; {40526#false} is VALID [2022-04-28 08:43:02,629 INFO L290 TraceCheckUtils]: 97: Hoare triple {40526#false} assume !false; {40526#false} is VALID [2022-04-28 08:43:02,629 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 08:43:02,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:43:02,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729284620] [2022-04-28 08:43:02,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729284620] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:43:02,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:43:02,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:43:02,630 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:43:02,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1032854889] [2022-04-28 08:43:02,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1032854889] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:43:02,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:43:02,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:43:02,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272926627] [2022-04-28 08:43:02,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:43:02,631 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 98 [2022-04-28 08:43:02,631 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:43:02,632 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 08:43:02,674 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 08:43:02,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:43:02,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:43:02,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:43:02,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:43:02,675 INFO L87 Difference]: Start difference. First operand 447 states and 716 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 08:43:06,064 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 08:43:09,849 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:43:10,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:43:10,658 INFO L93 Difference]: Finished difference Result 882 states and 1415 transitions. [2022-04-28 08:43:10,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:43:10,658 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 98 [2022-04-28 08:43:10,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:43:10,658 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 08:43:10,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 445 transitions. [2022-04-28 08:43:10,660 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 08:43:10,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 445 transitions. [2022-04-28 08:43:10,662 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 445 transitions. [2022-04-28 08:43:10,908 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 445 edges. 445 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:43:10,917 INFO L225 Difference]: With dead ends: 882 [2022-04-28 08:43:10,917 INFO L226 Difference]: Without dead ends: 461 [2022-04-28 08:43:10,917 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 08:43:10,918 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 25 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-04-28 08:43:10,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 489 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 357 Invalid, 1 Unknown, 0 Unchecked, 4.8s Time] [2022-04-28 08:43:10,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2022-04-28 08:43:10,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 447. [2022-04-28 08:43:10,936 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:43:10,937 INFO L82 GeneralOperation]: Start isEquivalent. First operand 461 states. Second operand has 447 states, 442 states have (on average 1.6085972850678734) internal successors, (711), 442 states have internal predecessors, (711), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:43:10,937 INFO L74 IsIncluded]: Start isIncluded. First operand 461 states. Second operand has 447 states, 442 states have (on average 1.6085972850678734) internal successors, (711), 442 states have internal predecessors, (711), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:43:10,937 INFO L87 Difference]: Start difference. First operand 461 states. Second operand has 447 states, 442 states have (on average 1.6085972850678734) internal successors, (711), 442 states have internal predecessors, (711), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:43:10,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:43:10,945 INFO L93 Difference]: Finished difference Result 461 states and 733 transitions. [2022-04-28 08:43:10,945 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 733 transitions. [2022-04-28 08:43:10,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:43:10,945 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:43:10,946 INFO L74 IsIncluded]: Start isIncluded. First operand has 447 states, 442 states have (on average 1.6085972850678734) internal successors, (711), 442 states have internal predecessors, (711), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 461 states. [2022-04-28 08:43:10,946 INFO L87 Difference]: Start difference. First operand has 447 states, 442 states have (on average 1.6085972850678734) internal successors, (711), 442 states have internal predecessors, (711), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 461 states. [2022-04-28 08:43:10,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:43:10,953 INFO L93 Difference]: Finished difference Result 461 states and 733 transitions. [2022-04-28 08:43:10,953 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 733 transitions. [2022-04-28 08:43:10,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:43:10,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:43:10,954 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:43:10,954 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:43:10,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 442 states have (on average 1.6085972850678734) internal successors, (711), 442 states have internal predecessors, (711), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:43:10,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 715 transitions. [2022-04-28 08:43:10,962 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 715 transitions. Word has length 98 [2022-04-28 08:43:10,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:43:10,962 INFO L495 AbstractCegarLoop]: Abstraction has 447 states and 715 transitions. [2022-04-28 08:43:10,962 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 08:43:10,962 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 447 states and 715 transitions. [2022-04-28 08:43:11,508 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 715 edges. 715 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:43:11,508 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 715 transitions. [2022-04-28 08:43:11,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-28 08:43:11,509 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:43:11,509 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:43:11,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-28 08:43:11,509 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:43:11,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:43:11,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1597835116, now seen corresponding path program 1 times [2022-04-28 08:43:11,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:43:11,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [902975999] [2022-04-28 08:43:11,707 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 19 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 08:43:11,708 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:43:11,708 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:43:11,709 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:43:11,709 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:43:11,710 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.logic.Theory.term(Theory.java:1603) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:401) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:392) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.term(WrapperScript.java:249) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.term(WrapperScript.java:249) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.PredicateHelper.makeReflexive(PredicateHelper.java:222) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.acceleratedInterpolationCoreIsCorrect(AcceleratedInterpolationCore.java:253) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:195) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAcceleratedInterpolation.construct(IpTcStrategyModuleAcceleratedInterpolation.java:80) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-28 08:43:11,714 INFO L158 Benchmark]: Toolchain (without parser) took 135562.37ms. Allocated memory was 204.5MB in the beginning and 406.8MB in the end (delta: 202.4MB). Free memory was 151.4MB in the beginning and 345.8MB in the end (delta: -194.4MB). Peak memory consumption was 225.4MB. Max. memory is 8.0GB. [2022-04-28 08:43:11,714 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 204.5MB. Free memory is still 169.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 08:43:11,715 INFO L158 Benchmark]: CACSL2BoogieTranslator took 448.39ms. Allocated memory was 204.5MB in the beginning and 335.5MB in the end (delta: 131.1MB). Free memory was 151.2MB in the beginning and 284.5MB in the end (delta: -133.3MB). Peak memory consumption was 13.9MB. Max. memory is 8.0GB. [2022-04-28 08:43:11,715 INFO L158 Benchmark]: Boogie Preprocessor took 134.94ms. Allocated memory is still 335.5MB. Free memory was 284.5MB in the beginning and 274.6MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 08:43:11,715 INFO L158 Benchmark]: RCFGBuilder took 1274.18ms. Allocated memory is still 335.5MB. Free memory was 274.6MB in the beginning and 234.4MB in the end (delta: 40.2MB). Peak memory consumption was 40.5MB. Max. memory is 8.0GB. [2022-04-28 08:43:11,715 INFO L158 Benchmark]: TraceAbstraction took 133689.75ms. Allocated memory was 335.5MB in the beginning and 406.8MB in the end (delta: 71.3MB). Free memory was 233.9MB in the beginning and 345.8MB in the end (delta: -111.9MB). Peak memory consumption was 175.3MB. Max. memory is 8.0GB. [2022-04-28 08:43:11,717 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 204.5MB. Free memory is still 169.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 448.39ms. Allocated memory was 204.5MB in the beginning and 335.5MB in the end (delta: 131.1MB). Free memory was 151.2MB in the beginning and 284.5MB in the end (delta: -133.3MB). Peak memory consumption was 13.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 134.94ms. Allocated memory is still 335.5MB. Free memory was 284.5MB in the beginning and 274.6MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * RCFGBuilder took 1274.18ms. Allocated memory is still 335.5MB. Free memory was 274.6MB in the beginning and 234.4MB in the end (delta: 40.2MB). Peak memory consumption was 40.5MB. Max. memory is 8.0GB. * TraceAbstraction took 133689.75ms. Allocated memory was 335.5MB in the beginning and 406.8MB in the end (delta: 71.3MB). Free memory was 233.9MB in the beginning and 345.8MB in the end (delta: -111.9MB). Peak memory consumption was 175.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.logic.Theory.term(Theory.java:1603) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-28 08:43:11,756 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...