/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.01.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 08:37:27,432 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 08:37:27,434 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 08:37:27,478 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 08:37:27,479 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 08:37:27,481 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 08:37:27,483 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 08:37:27,486 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 08:37:27,488 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 08:37:27,492 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 08:37:27,493 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 08:37:27,494 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 08:37:27,494 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 08:37:27,496 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 08:37:27,497 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 08:37:27,500 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 08:37:27,501 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 08:37:27,501 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 08:37:27,504 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 08:37:27,509 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 08:37:27,511 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 08:37:27,512 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 08:37:27,513 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 08:37:27,514 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 08:37:27,515 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 08:37:27,521 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 08:37:27,522 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 08:37:27,522 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 08:37:27,523 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 08:37:27,523 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 08:37:27,524 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 08:37:27,525 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 08:37:27,526 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 08:37:27,527 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 08:37:27,527 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 08:37:27,528 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 08:37:27,528 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 08:37:27,529 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 08:37:27,529 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 08:37:27,529 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 08:37:27,530 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 08:37:27,531 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 08:37:27,532 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 08:37:27,543 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 08:37:27,544 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 08:37:27,545 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 08:37:27,545 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 08:37:27,545 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 08:37:27,545 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 08:37:27,545 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 08:37:27,546 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 08:37:27,546 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 08:37:27,547 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 08:37:27,547 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 08:37:27,547 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 08:37:27,547 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 08:37:27,547 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 08:37:27,547 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 08:37:27,547 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 08:37:27,548 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 08:37:27,548 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 08:37:27,548 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 08:37:27,548 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 08:37:27,548 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 08:37:27,548 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 08:37:27,548 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 08:37:27,549 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 08:37:27,549 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 08:37:27,549 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 08:37:27,818 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 08:37:27,850 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 08:37:27,853 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 08:37:27,854 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 08:37:27,854 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 08:37:27,855 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_srvr.blast.01.i.cil-2.c [2022-04-08 08:37:27,920 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3e004f0c/779151df22ee405384590b09ee5b1161/FLAGb86d67334 [2022-04-08 08:37:28,434 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 08:37:28,435 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.01.i.cil-2.c [2022-04-08 08:37:28,464 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3e004f0c/779151df22ee405384590b09ee5b1161/FLAGb86d67334 [2022-04-08 08:37:28,749 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3e004f0c/779151df22ee405384590b09ee5b1161 [2022-04-08 08:37:28,751 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 08:37:28,752 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 08:37:28,754 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 08:37:28,754 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 08:37:28,758 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 08:37:28,760 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:37:28" (1/1) ... [2022-04-08 08:37:28,761 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6912a228 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:37:28, skipping insertion in model container [2022-04-08 08:37:28,761 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:37:28" (1/1) ... [2022-04-08 08:37:28,782 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 08:37:28,838 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 08:37:29,175 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.01.i.cil-2.c[72913,72926] [2022-04-08 08:37:29,190 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 08:37:29,212 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 08:37:29,319 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.01.i.cil-2.c[72913,72926] [2022-04-08 08:37:29,322 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 08:37:29,344 INFO L208 MainTranslator]: Completed translation [2022-04-08 08:37:29,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:37:29 WrapperNode [2022-04-08 08:37:29,345 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 08:37:29,346 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 08:37:29,346 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 08:37:29,346 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 08:37:29,357 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:37:29" (1/1) ... [2022-04-08 08:37:29,357 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:37:29" (1/1) ... [2022-04-08 08:37:29,392 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:37:29" (1/1) ... [2022-04-08 08:37:29,392 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:37:29" (1/1) ... [2022-04-08 08:37:29,466 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:37:29" (1/1) ... [2022-04-08 08:37:29,472 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:37:29" (1/1) ... [2022-04-08 08:37:29,479 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:37:29" (1/1) ... [2022-04-08 08:37:29,485 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 08:37:29,486 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 08:37:29,486 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 08:37:29,486 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 08:37:29,495 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:37:29" (1/1) ... [2022-04-08 08:37:29,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 08:37:29,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:37:29,541 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 08:37:29,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 08:37:29,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 08:37:29,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 08:37:29,584 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 08:37:29,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2022-04-08 08:37:29,584 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2022-04-08 08:37:29,584 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 08:37:29,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2022-04-08 08:37:29,584 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-08 08:37:29,585 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-08 08:37:29,585 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-08 08:37:29,585 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 08:37:29,586 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 08:37:29,586 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 08:37:29,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 08:37:29,586 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-08 08:37:29,587 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-08 08:37:29,587 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 08:37:29,587 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-08 08:37:29,587 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-08 08:37:29,587 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-08 08:37:29,587 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2022-04-08 08:37:29,587 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-08 08:37:29,587 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2022-04-08 08:37:29,587 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2022-04-08 08:37:29,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-08 08:37:29,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-08 08:37:29,588 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 08:37:29,588 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-08 08:37:29,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 08:37:29,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-08 08:37:29,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 08:37:29,588 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-08 08:37:29,588 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-08 08:37:29,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 08:37:29,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 08:37:29,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 08:37:29,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-08 08:37:29,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-08 08:37:29,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-08 08:37:29,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-08 08:37:29,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 08:37:29,805 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 08:37:29,806 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 08:37:32,340 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:37:32,877 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2022-04-08 08:37:32,877 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2022-04-08 08:37:32,894 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 08:37:32,903 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 08:37:32,903 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 08:37:32,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:37:32 BoogieIcfgContainer [2022-04-08 08:37:32,905 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 08:37:32,906 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 08:37:32,906 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 08:37:32,909 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 08:37:32,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 08:37:28" (1/3) ... [2022-04-08 08:37:32,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@485db9a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:37:32, skipping insertion in model container [2022-04-08 08:37:32,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:37:29" (2/3) ... [2022-04-08 08:37:32,911 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@485db9a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:37:32, skipping insertion in model container [2022-04-08 08:37:32,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:37:32" (3/3) ... [2022-04-08 08:37:32,912 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.01.i.cil-2.c [2022-04-08 08:37:32,917 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 08:37:32,917 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 08:37:32,955 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 08:37:32,961 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 08:37:32,961 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 08:37:32,982 INFO L276 IsEmpty]: Start isEmpty. Operand has 155 states, 147 states have (on average 1.6870748299319729) internal successors, (248), 148 states have internal predecessors, (248), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 08:37:32,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-08 08:37:32,992 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:37:32,993 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:37:32,993 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:37:32,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:37:32,998 INFO L85 PathProgramCache]: Analyzing trace with hash 740864289, now seen corresponding path program 1 times [2022-04-08 08:37:33,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:37:33,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [539947856] [2022-04-08 08:37:33,015 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:37:33,015 INFO L85 PathProgramCache]: Analyzing trace with hash 740864289, now seen corresponding path program 2 times [2022-04-08 08:37:33,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:37:33,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961720174] [2022-04-08 08:37:33,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:37:33,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:37:33,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:37:33,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:37:33,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:37:33,534 INFO L290 TraceCheckUtils]: 0: Hoare triple {165#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {158#true} is VALID [2022-04-08 08:37:33,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {158#true} assume true; {158#true} is VALID [2022-04-08 08:37:33,535 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {158#true} {158#true} #664#return; {158#true} is VALID [2022-04-08 08:37:33,537 INFO L272 TraceCheckUtils]: 0: Hoare triple {158#true} call ULTIMATE.init(); {165#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:37:33,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {165#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {158#true} is VALID [2022-04-08 08:37:33,537 INFO L290 TraceCheckUtils]: 2: Hoare triple {158#true} assume true; {158#true} is VALID [2022-04-08 08:37:33,538 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {158#true} {158#true} #664#return; {158#true} is VALID [2022-04-08 08:37:33,538 INFO L272 TraceCheckUtils]: 4: Hoare triple {158#true} call #t~ret162 := main(); {158#true} is VALID [2022-04-08 08:37:33,539 INFO L290 TraceCheckUtils]: 5: Hoare triple {158#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {158#true} is VALID [2022-04-08 08:37:33,539 INFO L290 TraceCheckUtils]: 6: Hoare triple {158#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {158#true} is VALID [2022-04-08 08:37:33,539 INFO L272 TraceCheckUtils]: 7: Hoare triple {158#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {158#true} is VALID [2022-04-08 08:37:33,546 INFO L290 TraceCheckUtils]: 8: Hoare triple {158#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;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~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~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~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:37:33,548 INFO L290 TraceCheckUtils]: 9: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:37:33,549 INFO L290 TraceCheckUtils]: 10: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:37:33,550 INFO L290 TraceCheckUtils]: 11: Hoare triple {163#(= 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)))); {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:37:33,552 INFO L290 TraceCheckUtils]: 12: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:37:33,553 INFO L290 TraceCheckUtils]: 13: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:37:33,554 INFO L290 TraceCheckUtils]: 14: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:37:33,554 INFO L290 TraceCheckUtils]: 15: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:37:33,555 INFO L290 TraceCheckUtils]: 16: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:37:33,556 INFO L290 TraceCheckUtils]: 17: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:37:33,557 INFO L290 TraceCheckUtils]: 18: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:37:33,558 INFO L290 TraceCheckUtils]: 19: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:37:33,559 INFO L290 TraceCheckUtils]: 20: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:37:33,559 INFO L290 TraceCheckUtils]: 21: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:37:33,560 INFO L290 TraceCheckUtils]: 22: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:37:33,561 INFO L290 TraceCheckUtils]: 23: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {164#(= 8464 |ssl3_accept_#t~mem50|)} is VALID [2022-04-08 08:37:33,562 INFO L290 TraceCheckUtils]: 24: Hoare triple {164#(= 8464 |ssl3_accept_#t~mem50|)} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-08 08:37:33,563 INFO L290 TraceCheckUtils]: 25: Hoare triple {159#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-08 08:37:33,563 INFO L290 TraceCheckUtils]: 26: Hoare triple {159#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-08 08:37:33,563 INFO L290 TraceCheckUtils]: 27: Hoare triple {159#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-08 08:37:33,564 INFO L290 TraceCheckUtils]: 28: Hoare triple {159#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-08 08:37:33,564 INFO L290 TraceCheckUtils]: 29: Hoare triple {159#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-08 08:37:33,564 INFO L290 TraceCheckUtils]: 30: Hoare triple {159#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-08 08:37:33,564 INFO L290 TraceCheckUtils]: 31: Hoare triple {159#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-08 08:37:33,564 INFO L290 TraceCheckUtils]: 32: Hoare triple {159#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-08 08:37:33,565 INFO L290 TraceCheckUtils]: 33: Hoare triple {159#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-08 08:37:33,565 INFO L290 TraceCheckUtils]: 34: Hoare triple {159#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-08 08:37:33,566 INFO L290 TraceCheckUtils]: 35: Hoare triple {159#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-08 08:37:33,605 INFO L290 TraceCheckUtils]: 36: Hoare triple {159#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-08 08:37:33,605 INFO L290 TraceCheckUtils]: 37: Hoare triple {159#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-08 08:37:33,605 INFO L290 TraceCheckUtils]: 38: Hoare triple {159#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-08 08:37:33,605 INFO L290 TraceCheckUtils]: 39: Hoare triple {159#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-08 08:37:33,605 INFO L290 TraceCheckUtils]: 40: Hoare triple {159#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-08 08:37:33,606 INFO L290 TraceCheckUtils]: 41: Hoare triple {159#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-08 08:37:33,606 INFO L290 TraceCheckUtils]: 42: Hoare triple {159#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-08 08:37:33,606 INFO L290 TraceCheckUtils]: 43: Hoare triple {159#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-08 08:37:33,606 INFO L290 TraceCheckUtils]: 44: Hoare triple {159#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-08 08:37:33,606 INFO L290 TraceCheckUtils]: 45: Hoare triple {159#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-08 08:37:33,607 INFO L290 TraceCheckUtils]: 46: Hoare triple {159#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-08 08:37:33,607 INFO L290 TraceCheckUtils]: 47: Hoare triple {159#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-08 08:37:33,607 INFO L290 TraceCheckUtils]: 48: Hoare triple {159#false} assume 8672 == #t~mem74;havoc #t~mem74; {159#false} is VALID [2022-04-08 08:37:33,607 INFO L290 TraceCheckUtils]: 49: Hoare triple {159#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {159#false} is VALID [2022-04-08 08:37:33,607 INFO L290 TraceCheckUtils]: 50: Hoare triple {159#false} assume 4 == ~blastFlag~0; {159#false} is VALID [2022-04-08 08:37:33,608 INFO L290 TraceCheckUtils]: 51: Hoare triple {159#false} assume !false; {159#false} is VALID [2022-04-08 08:37:33,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:37:33,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:37:33,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961720174] [2022-04-08 08:37:33,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961720174] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:37:33,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:37:33,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:37:33,612 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:37:33,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [539947856] [2022-04-08 08:37:33,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [539947856] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:37:33,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:37:33,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:37:33,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415803565] [2022-04-08 08:37:33,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:37:33,619 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2022-04-08 08:37:33,620 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:37:33,623 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:37:33,692 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:37:33,692 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:37:33,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:37:33,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:37:33,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:37:33,722 INFO L87 Difference]: Start difference. First operand has 155 states, 147 states have (on average 1.6870748299319729) internal successors, (248), 148 states have internal predecessors, (248), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:37:35,776 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:37:37,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:37:37,356 INFO L93 Difference]: Finished difference Result 328 states and 543 transitions. [2022-04-08 08:37:37,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:37:37,356 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2022-04-08 08:37:37,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:37:37,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:37:37,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 543 transitions. [2022-04-08 08:37:37,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:37:37,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 543 transitions. [2022-04-08 08:37:37,404 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 543 transitions. [2022-04-08 08:37:37,889 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 543 edges. 543 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:37:37,904 INFO L225 Difference]: With dead ends: 328 [2022-04-08 08:37:37,904 INFO L226 Difference]: Without dead ends: 167 [2022-04-08 08:37:37,907 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:37:37,910 INFO L913 BasicCegarLoop]: 221 mSDtfsCounter, 33 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-08 08:37:37,911 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 583 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 403 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-08 08:37:37,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-04-08 08:37:37,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 150. [2022-04-08 08:37:37,949 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:37:37,950 INFO L82 GeneralOperation]: Start isEquivalent. First operand 167 states. Second operand has 150 states, 145 states have (on average 1.5379310344827586) internal successors, (223), 145 states have internal predecessors, (223), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:37:37,952 INFO L74 IsIncluded]: Start isIncluded. First operand 167 states. Second operand has 150 states, 145 states have (on average 1.5379310344827586) internal successors, (223), 145 states have internal predecessors, (223), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:37:37,953 INFO L87 Difference]: Start difference. First operand 167 states. Second operand has 150 states, 145 states have (on average 1.5379310344827586) internal successors, (223), 145 states have internal predecessors, (223), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:37:37,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:37:37,963 INFO L93 Difference]: Finished difference Result 167 states and 248 transitions. [2022-04-08 08:37:37,963 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 248 transitions. [2022-04-08 08:37:37,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:37:37,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:37:37,966 INFO L74 IsIncluded]: Start isIncluded. First operand has 150 states, 145 states have (on average 1.5379310344827586) internal successors, (223), 145 states have internal predecessors, (223), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 167 states. [2022-04-08 08:37:37,967 INFO L87 Difference]: Start difference. First operand has 150 states, 145 states have (on average 1.5379310344827586) internal successors, (223), 145 states have internal predecessors, (223), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 167 states. [2022-04-08 08:37:37,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:37:37,975 INFO L93 Difference]: Finished difference Result 167 states and 248 transitions. [2022-04-08 08:37:37,975 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 248 transitions. [2022-04-08 08:37:37,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:37:37,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:37:37,977 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:37:37,977 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:37:37,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 145 states have (on average 1.5379310344827586) internal successors, (223), 145 states have internal predecessors, (223), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:37:37,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 227 transitions. [2022-04-08 08:37:37,985 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 227 transitions. Word has length 52 [2022-04-08 08:37:37,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:37:37,986 INFO L478 AbstractCegarLoop]: Abstraction has 150 states and 227 transitions. [2022-04-08 08:37:37,986 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:37:37,986 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 150 states and 227 transitions. [2022-04-08 08:37:38,182 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 227 edges. 227 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:37:38,182 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 227 transitions. [2022-04-08 08:37:38,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-08 08:37:38,184 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:37:38,185 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:37:38,185 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 08:37:38,185 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:37:38,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:37:38,186 INFO L85 PathProgramCache]: Analyzing trace with hash -444444622, now seen corresponding path program 1 times [2022-04-08 08:37:38,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:37:38,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1820105395] [2022-04-08 08:37:38,230 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:37:38,230 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:37:38,231 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:37:38,231 INFO L85 PathProgramCache]: Analyzing trace with hash -444444622, now seen corresponding path program 2 times [2022-04-08 08:37:38,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:37:38,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709460291] [2022-04-08 08:37:38,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:37:38,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:37:38,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:37:38,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:37:38,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:37:38,505 INFO L290 TraceCheckUtils]: 0: Hoare triple {1467#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {1460#true} is VALID [2022-04-08 08:37:38,505 INFO L290 TraceCheckUtils]: 1: Hoare triple {1460#true} assume true; {1460#true} is VALID [2022-04-08 08:37:38,506 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1460#true} {1460#true} #664#return; {1460#true} is VALID [2022-04-08 08:37:38,507 INFO L272 TraceCheckUtils]: 0: Hoare triple {1460#true} call ULTIMATE.init(); {1467#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:37:38,507 INFO L290 TraceCheckUtils]: 1: Hoare triple {1467#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {1460#true} is VALID [2022-04-08 08:37:38,507 INFO L290 TraceCheckUtils]: 2: Hoare triple {1460#true} assume true; {1460#true} is VALID [2022-04-08 08:37:38,507 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1460#true} {1460#true} #664#return; {1460#true} is VALID [2022-04-08 08:37:38,507 INFO L272 TraceCheckUtils]: 4: Hoare triple {1460#true} call #t~ret162 := main(); {1460#true} is VALID [2022-04-08 08:37:38,508 INFO L290 TraceCheckUtils]: 5: Hoare triple {1460#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {1460#true} is VALID [2022-04-08 08:37:38,508 INFO L290 TraceCheckUtils]: 6: Hoare triple {1460#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {1460#true} is VALID [2022-04-08 08:37:38,508 INFO L272 TraceCheckUtils]: 7: Hoare triple {1460#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {1460#true} is VALID [2022-04-08 08:37:38,510 INFO L290 TraceCheckUtils]: 8: Hoare triple {1460#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;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~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~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~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:37:38,511 INFO L290 TraceCheckUtils]: 9: Hoare triple {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:37:38,512 INFO L290 TraceCheckUtils]: 10: Hoare triple {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:37:38,512 INFO L290 TraceCheckUtils]: 11: Hoare triple {1465#(= 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)))); {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:37:38,513 INFO L290 TraceCheckUtils]: 12: Hoare triple {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:37:38,513 INFO L290 TraceCheckUtils]: 13: Hoare triple {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:37:38,514 INFO L290 TraceCheckUtils]: 14: Hoare triple {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:37:38,514 INFO L290 TraceCheckUtils]: 15: Hoare triple {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:37:38,515 INFO L290 TraceCheckUtils]: 16: Hoare triple {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:37:38,518 INFO L290 TraceCheckUtils]: 17: Hoare triple {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:37:38,519 INFO L290 TraceCheckUtils]: 18: Hoare triple {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:37:38,519 INFO L290 TraceCheckUtils]: 19: Hoare triple {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:37:38,520 INFO L290 TraceCheckUtils]: 20: Hoare triple {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {1466#(= 8464 |ssl3_accept_#t~mem47|)} is VALID [2022-04-08 08:37:38,520 INFO L290 TraceCheckUtils]: 21: Hoare triple {1466#(= 8464 |ssl3_accept_#t~mem47|)} assume 8480 == #t~mem47;havoc #t~mem47; {1461#false} is VALID [2022-04-08 08:37:38,520 INFO L290 TraceCheckUtils]: 22: Hoare triple {1461#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet87 && #t~nondet87 <= 2147483647;~ret~0 := #t~nondet87;havoc #t~nondet87; {1461#false} is VALID [2022-04-08 08:37:38,521 INFO L290 TraceCheckUtils]: 23: Hoare triple {1461#false} assume !(~ret~0 <= 0);call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem88.base, 844 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {1461#false} is VALID [2022-04-08 08:37:38,521 INFO L290 TraceCheckUtils]: 24: Hoare triple {1461#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {1461#false} is VALID [2022-04-08 08:37:38,521 INFO L290 TraceCheckUtils]: 25: Hoare triple {1461#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {1461#false} is VALID [2022-04-08 08:37:38,521 INFO L290 TraceCheckUtils]: 26: Hoare triple {1461#false} ~skip~0 := 0; {1461#false} is VALID [2022-04-08 08:37:38,521 INFO L290 TraceCheckUtils]: 27: Hoare triple {1461#false} assume !false; {1461#false} is VALID [2022-04-08 08:37:38,522 INFO L290 TraceCheckUtils]: 28: Hoare triple {1461#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {1461#false} is VALID [2022-04-08 08:37:38,522 INFO L290 TraceCheckUtils]: 29: Hoare triple {1461#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {1461#false} is VALID [2022-04-08 08:37:38,522 INFO L290 TraceCheckUtils]: 30: Hoare triple {1461#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {1461#false} is VALID [2022-04-08 08:37:38,522 INFO L290 TraceCheckUtils]: 31: Hoare triple {1461#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {1461#false} is VALID [2022-04-08 08:37:38,522 INFO L290 TraceCheckUtils]: 32: Hoare triple {1461#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {1461#false} is VALID [2022-04-08 08:37:38,523 INFO L290 TraceCheckUtils]: 33: Hoare triple {1461#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {1461#false} is VALID [2022-04-08 08:37:38,523 INFO L290 TraceCheckUtils]: 34: Hoare triple {1461#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {1461#false} is VALID [2022-04-08 08:37:38,523 INFO L290 TraceCheckUtils]: 35: Hoare triple {1461#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {1461#false} is VALID [2022-04-08 08:37:38,523 INFO L290 TraceCheckUtils]: 36: Hoare triple {1461#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {1461#false} is VALID [2022-04-08 08:37:38,523 INFO L290 TraceCheckUtils]: 37: Hoare triple {1461#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {1461#false} is VALID [2022-04-08 08:37:38,524 INFO L290 TraceCheckUtils]: 38: Hoare triple {1461#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {1461#false} is VALID [2022-04-08 08:37:38,524 INFO L290 TraceCheckUtils]: 39: Hoare triple {1461#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {1461#false} is VALID [2022-04-08 08:37:38,524 INFO L290 TraceCheckUtils]: 40: Hoare triple {1461#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {1461#false} is VALID [2022-04-08 08:37:38,524 INFO L290 TraceCheckUtils]: 41: Hoare triple {1461#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {1461#false} is VALID [2022-04-08 08:37:38,524 INFO L290 TraceCheckUtils]: 42: Hoare triple {1461#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {1461#false} is VALID [2022-04-08 08:37:38,525 INFO L290 TraceCheckUtils]: 43: Hoare triple {1461#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {1461#false} is VALID [2022-04-08 08:37:38,525 INFO L290 TraceCheckUtils]: 44: Hoare triple {1461#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {1461#false} is VALID [2022-04-08 08:37:38,525 INFO L290 TraceCheckUtils]: 45: Hoare triple {1461#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {1461#false} is VALID [2022-04-08 08:37:38,525 INFO L290 TraceCheckUtils]: 46: Hoare triple {1461#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {1461#false} is VALID [2022-04-08 08:37:38,525 INFO L290 TraceCheckUtils]: 47: Hoare triple {1461#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {1461#false} is VALID [2022-04-08 08:37:38,526 INFO L290 TraceCheckUtils]: 48: Hoare triple {1461#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {1461#false} is VALID [2022-04-08 08:37:38,526 INFO L290 TraceCheckUtils]: 49: Hoare triple {1461#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {1461#false} is VALID [2022-04-08 08:37:38,526 INFO L290 TraceCheckUtils]: 50: Hoare triple {1461#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {1461#false} is VALID [2022-04-08 08:37:38,526 INFO L290 TraceCheckUtils]: 51: Hoare triple {1461#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {1461#false} is VALID [2022-04-08 08:37:38,526 INFO L290 TraceCheckUtils]: 52: Hoare triple {1461#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {1461#false} is VALID [2022-04-08 08:37:38,527 INFO L290 TraceCheckUtils]: 53: Hoare triple {1461#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {1461#false} is VALID [2022-04-08 08:37:38,527 INFO L290 TraceCheckUtils]: 54: Hoare triple {1461#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {1461#false} is VALID [2022-04-08 08:37:38,527 INFO L290 TraceCheckUtils]: 55: Hoare triple {1461#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {1461#false} is VALID [2022-04-08 08:37:38,527 INFO L290 TraceCheckUtils]: 56: Hoare triple {1461#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {1461#false} is VALID [2022-04-08 08:37:38,527 INFO L290 TraceCheckUtils]: 57: Hoare triple {1461#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {1461#false} is VALID [2022-04-08 08:37:38,527 INFO L290 TraceCheckUtils]: 58: Hoare triple {1461#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {1461#false} is VALID [2022-04-08 08:37:38,528 INFO L290 TraceCheckUtils]: 59: Hoare triple {1461#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {1461#false} is VALID [2022-04-08 08:37:38,528 INFO L290 TraceCheckUtils]: 60: Hoare triple {1461#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {1461#false} is VALID [2022-04-08 08:37:38,528 INFO L290 TraceCheckUtils]: 61: Hoare triple {1461#false} assume 8672 == #t~mem74;havoc #t~mem74; {1461#false} is VALID [2022-04-08 08:37:38,528 INFO L290 TraceCheckUtils]: 62: Hoare triple {1461#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {1461#false} is VALID [2022-04-08 08:37:38,528 INFO L290 TraceCheckUtils]: 63: Hoare triple {1461#false} assume 4 == ~blastFlag~0; {1461#false} is VALID [2022-04-08 08:37:38,529 INFO L290 TraceCheckUtils]: 64: Hoare triple {1461#false} assume !false; {1461#false} is VALID [2022-04-08 08:37:38,529 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:37:38,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:37:38,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709460291] [2022-04-08 08:37:38,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709460291] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:37:38,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:37:38,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:37:38,530 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:37:38,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1820105395] [2022-04-08 08:37:38,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1820105395] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:37:38,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:37:38,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:37:38,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338792316] [2022-04-08 08:37:38,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:37:38,532 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-08 08:37:38,532 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:37:38,533 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:37:38,588 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:37:38,589 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:37:38,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:37:38,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:37:38,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:37:38,590 INFO L87 Difference]: Start difference. First operand 150 states and 227 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:37:40,628 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:37:41,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:37:41,782 INFO L93 Difference]: Finished difference Result 291 states and 437 transitions. [2022-04-08 08:37:41,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:37:41,782 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-08 08:37:41,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:37:41,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:37:41,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 437 transitions. [2022-04-08 08:37:41,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:37:41,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 437 transitions. [2022-04-08 08:37:41,792 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 437 transitions. [2022-04-08 08:37:42,146 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 437 edges. 437 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:37:42,150 INFO L225 Difference]: With dead ends: 291 [2022-04-08 08:37:42,150 INFO L226 Difference]: Without dead ends: 167 [2022-04-08 08:37:42,151 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:37:42,152 INFO L913 BasicCegarLoop]: 180 mSDtfsCounter, 24 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 08:37:42,153 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 462 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 353 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 08:37:42,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-04-08 08:37:42,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 150. [2022-04-08 08:37:42,163 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:37:42,164 INFO L82 GeneralOperation]: Start isEquivalent. First operand 167 states. Second operand has 150 states, 145 states have (on average 1.5310344827586206) internal successors, (222), 145 states have internal predecessors, (222), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:37:42,164 INFO L74 IsIncluded]: Start isIncluded. First operand 167 states. Second operand has 150 states, 145 states have (on average 1.5310344827586206) internal successors, (222), 145 states have internal predecessors, (222), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:37:42,165 INFO L87 Difference]: Start difference. First operand 167 states. Second operand has 150 states, 145 states have (on average 1.5310344827586206) internal successors, (222), 145 states have internal predecessors, (222), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:37:42,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:37:42,172 INFO L93 Difference]: Finished difference Result 167 states and 247 transitions. [2022-04-08 08:37:42,173 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 247 transitions. [2022-04-08 08:37:42,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:37:42,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:37:42,174 INFO L74 IsIncluded]: Start isIncluded. First operand has 150 states, 145 states have (on average 1.5310344827586206) internal successors, (222), 145 states have internal predecessors, (222), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 167 states. [2022-04-08 08:37:42,175 INFO L87 Difference]: Start difference. First operand has 150 states, 145 states have (on average 1.5310344827586206) internal successors, (222), 145 states have internal predecessors, (222), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 167 states. [2022-04-08 08:37:42,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:37:42,183 INFO L93 Difference]: Finished difference Result 167 states and 247 transitions. [2022-04-08 08:37:42,183 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 247 transitions. [2022-04-08 08:37:42,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:37:42,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:37:42,184 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:37:42,184 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:37:42,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 145 states have (on average 1.5310344827586206) internal successors, (222), 145 states have internal predecessors, (222), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:37:42,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 226 transitions. [2022-04-08 08:37:42,191 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 226 transitions. Word has length 65 [2022-04-08 08:37:42,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:37:42,192 INFO L478 AbstractCegarLoop]: Abstraction has 150 states and 226 transitions. [2022-04-08 08:37:42,192 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:37:42,192 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 150 states and 226 transitions. [2022-04-08 08:37:42,374 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 226 edges. 226 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:37:42,375 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 226 transitions. [2022-04-08 08:37:42,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-08 08:37:42,376 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:37:42,376 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:37:42,377 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 08:37:42,377 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:37:42,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:37:42,377 INFO L85 PathProgramCache]: Analyzing trace with hash 795477037, now seen corresponding path program 1 times [2022-04-08 08:37:42,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:37:42,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [592129315] [2022-04-08 08:37:42,404 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:37:42,405 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:37:42,405 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:37:42,405 INFO L85 PathProgramCache]: Analyzing trace with hash 795477037, now seen corresponding path program 2 times [2022-04-08 08:37:42,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:37:42,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731442309] [2022-04-08 08:37:42,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:37:42,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:37:42,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:37:42,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:37:42,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:37:42,590 INFO L290 TraceCheckUtils]: 0: Hoare triple {2695#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {2688#true} is VALID [2022-04-08 08:37:42,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {2688#true} assume true; {2688#true} is VALID [2022-04-08 08:37:42,591 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2688#true} {2688#true} #664#return; {2688#true} is VALID [2022-04-08 08:37:42,592 INFO L272 TraceCheckUtils]: 0: Hoare triple {2688#true} call ULTIMATE.init(); {2695#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:37:42,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {2695#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {2688#true} is VALID [2022-04-08 08:37:42,593 INFO L290 TraceCheckUtils]: 2: Hoare triple {2688#true} assume true; {2688#true} is VALID [2022-04-08 08:37:42,593 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2688#true} {2688#true} #664#return; {2688#true} is VALID [2022-04-08 08:37:42,593 INFO L272 TraceCheckUtils]: 4: Hoare triple {2688#true} call #t~ret162 := main(); {2688#true} is VALID [2022-04-08 08:37:42,593 INFO L290 TraceCheckUtils]: 5: Hoare triple {2688#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {2688#true} is VALID [2022-04-08 08:37:42,593 INFO L290 TraceCheckUtils]: 6: Hoare triple {2688#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {2688#true} is VALID [2022-04-08 08:37:42,593 INFO L272 TraceCheckUtils]: 7: Hoare triple {2688#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {2688#true} is VALID [2022-04-08 08:37:42,595 INFO L290 TraceCheckUtils]: 8: Hoare triple {2688#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;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~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~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~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {2693#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:37:42,596 INFO L290 TraceCheckUtils]: 9: Hoare triple {2693#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {2693#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:37:42,597 INFO L290 TraceCheckUtils]: 10: Hoare triple {2693#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {2693#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:37:42,598 INFO L290 TraceCheckUtils]: 11: Hoare triple {2693#(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)))); {2693#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:37:42,598 INFO L290 TraceCheckUtils]: 12: Hoare triple {2693#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {2693#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:37:42,599 INFO L290 TraceCheckUtils]: 13: Hoare triple {2693#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {2693#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:37:42,599 INFO L290 TraceCheckUtils]: 14: Hoare triple {2693#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !false; {2693#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:37:42,600 INFO L290 TraceCheckUtils]: 15: Hoare triple {2693#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {2693#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:37:42,600 INFO L290 TraceCheckUtils]: 16: Hoare triple {2693#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {2693#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:37:42,601 INFO L290 TraceCheckUtils]: 17: Hoare triple {2693#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {2693#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:37:42,601 INFO L290 TraceCheckUtils]: 18: Hoare triple {2693#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {2693#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:37:42,602 INFO L290 TraceCheckUtils]: 19: Hoare triple {2693#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {2693#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:37:42,602 INFO L290 TraceCheckUtils]: 20: Hoare triple {2693#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {2693#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:37:42,603 INFO L290 TraceCheckUtils]: 21: Hoare triple {2693#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {2694#(not (= |ssl3_accept_#t~mem48| 8481))} is VALID [2022-04-08 08:37:42,603 INFO L290 TraceCheckUtils]: 22: Hoare triple {2694#(not (= |ssl3_accept_#t~mem48| 8481))} assume 8481 == #t~mem48;havoc #t~mem48; {2689#false} is VALID [2022-04-08 08:37:42,603 INFO L290 TraceCheckUtils]: 23: Hoare triple {2689#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet87 && #t~nondet87 <= 2147483647;~ret~0 := #t~nondet87;havoc #t~nondet87; {2689#false} is VALID [2022-04-08 08:37:42,603 INFO L290 TraceCheckUtils]: 24: Hoare triple {2689#false} assume !(~ret~0 <= 0);call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem88.base, 844 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {2689#false} is VALID [2022-04-08 08:37:42,603 INFO L290 TraceCheckUtils]: 25: Hoare triple {2689#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {2689#false} is VALID [2022-04-08 08:37:42,604 INFO L290 TraceCheckUtils]: 26: Hoare triple {2689#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {2689#false} is VALID [2022-04-08 08:37:42,604 INFO L290 TraceCheckUtils]: 27: Hoare triple {2689#false} ~skip~0 := 0; {2689#false} is VALID [2022-04-08 08:37:42,604 INFO L290 TraceCheckUtils]: 28: Hoare triple {2689#false} assume !false; {2689#false} is VALID [2022-04-08 08:37:42,604 INFO L290 TraceCheckUtils]: 29: Hoare triple {2689#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {2689#false} is VALID [2022-04-08 08:37:42,604 INFO L290 TraceCheckUtils]: 30: Hoare triple {2689#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {2689#false} is VALID [2022-04-08 08:37:42,604 INFO L290 TraceCheckUtils]: 31: Hoare triple {2689#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {2689#false} is VALID [2022-04-08 08:37:42,605 INFO L290 TraceCheckUtils]: 32: Hoare triple {2689#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {2689#false} is VALID [2022-04-08 08:37:42,605 INFO L290 TraceCheckUtils]: 33: Hoare triple {2689#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {2689#false} is VALID [2022-04-08 08:37:42,605 INFO L290 TraceCheckUtils]: 34: Hoare triple {2689#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {2689#false} is VALID [2022-04-08 08:37:42,605 INFO L290 TraceCheckUtils]: 35: Hoare triple {2689#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {2689#false} is VALID [2022-04-08 08:37:42,605 INFO L290 TraceCheckUtils]: 36: Hoare triple {2689#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {2689#false} is VALID [2022-04-08 08:37:42,605 INFO L290 TraceCheckUtils]: 37: Hoare triple {2689#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {2689#false} is VALID [2022-04-08 08:37:42,605 INFO L290 TraceCheckUtils]: 38: Hoare triple {2689#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {2689#false} is VALID [2022-04-08 08:37:42,606 INFO L290 TraceCheckUtils]: 39: Hoare triple {2689#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {2689#false} is VALID [2022-04-08 08:37:42,606 INFO L290 TraceCheckUtils]: 40: Hoare triple {2689#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {2689#false} is VALID [2022-04-08 08:37:42,606 INFO L290 TraceCheckUtils]: 41: Hoare triple {2689#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {2689#false} is VALID [2022-04-08 08:37:42,606 INFO L290 TraceCheckUtils]: 42: Hoare triple {2689#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {2689#false} is VALID [2022-04-08 08:37:42,606 INFO L290 TraceCheckUtils]: 43: Hoare triple {2689#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {2689#false} is VALID [2022-04-08 08:37:42,606 INFO L290 TraceCheckUtils]: 44: Hoare triple {2689#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {2689#false} is VALID [2022-04-08 08:37:42,607 INFO L290 TraceCheckUtils]: 45: Hoare triple {2689#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {2689#false} is VALID [2022-04-08 08:37:42,607 INFO L290 TraceCheckUtils]: 46: Hoare triple {2689#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {2689#false} is VALID [2022-04-08 08:37:42,607 INFO L290 TraceCheckUtils]: 47: Hoare triple {2689#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {2689#false} is VALID [2022-04-08 08:37:42,607 INFO L290 TraceCheckUtils]: 48: Hoare triple {2689#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {2689#false} is VALID [2022-04-08 08:37:42,607 INFO L290 TraceCheckUtils]: 49: Hoare triple {2689#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {2689#false} is VALID [2022-04-08 08:37:42,607 INFO L290 TraceCheckUtils]: 50: Hoare triple {2689#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {2689#false} is VALID [2022-04-08 08:37:42,608 INFO L290 TraceCheckUtils]: 51: Hoare triple {2689#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {2689#false} is VALID [2022-04-08 08:37:42,608 INFO L290 TraceCheckUtils]: 52: Hoare triple {2689#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {2689#false} is VALID [2022-04-08 08:37:42,608 INFO L290 TraceCheckUtils]: 53: Hoare triple {2689#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {2689#false} is VALID [2022-04-08 08:37:42,608 INFO L290 TraceCheckUtils]: 54: Hoare triple {2689#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {2689#false} is VALID [2022-04-08 08:37:42,608 INFO L290 TraceCheckUtils]: 55: Hoare triple {2689#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {2689#false} is VALID [2022-04-08 08:37:42,608 INFO L290 TraceCheckUtils]: 56: Hoare triple {2689#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {2689#false} is VALID [2022-04-08 08:37:42,609 INFO L290 TraceCheckUtils]: 57: Hoare triple {2689#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {2689#false} is VALID [2022-04-08 08:37:42,609 INFO L290 TraceCheckUtils]: 58: Hoare triple {2689#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {2689#false} is VALID [2022-04-08 08:37:42,609 INFO L290 TraceCheckUtils]: 59: Hoare triple {2689#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {2689#false} is VALID [2022-04-08 08:37:42,609 INFO L290 TraceCheckUtils]: 60: Hoare triple {2689#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {2689#false} is VALID [2022-04-08 08:37:42,609 INFO L290 TraceCheckUtils]: 61: Hoare triple {2689#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {2689#false} is VALID [2022-04-08 08:37:42,609 INFO L290 TraceCheckUtils]: 62: Hoare triple {2689#false} assume 8672 == #t~mem74;havoc #t~mem74; {2689#false} is VALID [2022-04-08 08:37:42,610 INFO L290 TraceCheckUtils]: 63: Hoare triple {2689#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {2689#false} is VALID [2022-04-08 08:37:42,610 INFO L290 TraceCheckUtils]: 64: Hoare triple {2689#false} assume 4 == ~blastFlag~0; {2689#false} is VALID [2022-04-08 08:37:42,610 INFO L290 TraceCheckUtils]: 65: Hoare triple {2689#false} assume !false; {2689#false} is VALID [2022-04-08 08:37:42,610 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:37:42,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:37:42,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731442309] [2022-04-08 08:37:42,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731442309] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:37:42,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:37:42,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:37:42,611 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:37:42,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [592129315] [2022-04-08 08:37:42,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [592129315] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:37:42,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:37:42,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:37:42,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844020950] [2022-04-08 08:37:42,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:37:42,613 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-08 08:37:42,613 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:37:42,613 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:37:42,667 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:37:42,668 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:37:42,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:37:42,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:37:42,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:37:42,669 INFO L87 Difference]: Start difference. First operand 150 states and 226 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:37:44,693 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:37:46,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:37:46,084 INFO L93 Difference]: Finished difference Result 390 states and 594 transitions. [2022-04-08 08:37:46,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:37:46,084 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-08 08:37:46,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:37:46,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:37:46,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 576 transitions. [2022-04-08 08:37:46,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:37:46,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 576 transitions. [2022-04-08 08:37:46,096 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 576 transitions. [2022-04-08 08:37:46,558 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 576 edges. 576 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:37:46,579 INFO L225 Difference]: With dead ends: 390 [2022-04-08 08:37:46,580 INFO L226 Difference]: Without dead ends: 266 [2022-04-08 08:37:46,580 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:37:46,581 INFO L913 BasicCegarLoop]: 110 mSDtfsCounter, 139 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 64 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-08 08:37:46,582 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 321 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 466 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-08 08:37:46,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-04-08 08:37:46,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 167. [2022-04-08 08:37:46,593 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:37:46,594 INFO L82 GeneralOperation]: Start isEquivalent. First operand 266 states. Second operand has 167 states, 162 states have (on average 1.537037037037037) internal successors, (249), 162 states have internal predecessors, (249), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:37:46,594 INFO L74 IsIncluded]: Start isIncluded. First operand 266 states. Second operand has 167 states, 162 states have (on average 1.537037037037037) internal successors, (249), 162 states have internal predecessors, (249), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:37:46,595 INFO L87 Difference]: Start difference. First operand 266 states. Second operand has 167 states, 162 states have (on average 1.537037037037037) internal successors, (249), 162 states have internal predecessors, (249), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:37:46,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:37:46,603 INFO L93 Difference]: Finished difference Result 266 states and 403 transitions. [2022-04-08 08:37:46,603 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 403 transitions. [2022-04-08 08:37:46,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:37:46,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:37:46,604 INFO L74 IsIncluded]: Start isIncluded. First operand has 167 states, 162 states have (on average 1.537037037037037) internal successors, (249), 162 states have internal predecessors, (249), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 266 states. [2022-04-08 08:37:46,605 INFO L87 Difference]: Start difference. First operand has 167 states, 162 states have (on average 1.537037037037037) internal successors, (249), 162 states have internal predecessors, (249), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 266 states. [2022-04-08 08:37:46,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:37:46,613 INFO L93 Difference]: Finished difference Result 266 states and 403 transitions. [2022-04-08 08:37:46,613 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 403 transitions. [2022-04-08 08:37:46,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:37:46,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:37:46,614 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:37:46,614 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:37:46,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 162 states have (on average 1.537037037037037) internal successors, (249), 162 states have internal predecessors, (249), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:37:46,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 253 transitions. [2022-04-08 08:37:46,621 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 253 transitions. Word has length 66 [2022-04-08 08:37:46,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:37:46,621 INFO L478 AbstractCegarLoop]: Abstraction has 167 states and 253 transitions. [2022-04-08 08:37:46,622 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:37:46,622 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 167 states and 253 transitions. [2022-04-08 08:37:46,812 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 253 edges. 253 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:37:46,815 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 253 transitions. [2022-04-08 08:37:46,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-08 08:37:46,816 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:37:46,816 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:37:46,816 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 08:37:46,817 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:37:46,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:37:46,817 INFO L85 PathProgramCache]: Analyzing trace with hash -498657998, now seen corresponding path program 1 times [2022-04-08 08:37:46,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:37:46,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1198079188] [2022-04-08 08:37:46,839 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:37:46,839 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:37:46,840 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:37:46,840 INFO L85 PathProgramCache]: Analyzing trace with hash -498657998, now seen corresponding path program 2 times [2022-04-08 08:37:46,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:37:46,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367995336] [2022-04-08 08:37:46,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:37:46,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:37:46,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:37:47,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:37:47,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:37:47,026 INFO L290 TraceCheckUtils]: 0: Hoare triple {4353#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {4346#true} is VALID [2022-04-08 08:37:47,026 INFO L290 TraceCheckUtils]: 1: Hoare triple {4346#true} assume true; {4346#true} is VALID [2022-04-08 08:37:47,026 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4346#true} {4346#true} #664#return; {4346#true} is VALID [2022-04-08 08:37:47,027 INFO L272 TraceCheckUtils]: 0: Hoare triple {4346#true} call ULTIMATE.init(); {4353#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:37:47,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {4353#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {4346#true} is VALID [2022-04-08 08:37:47,027 INFO L290 TraceCheckUtils]: 2: Hoare triple {4346#true} assume true; {4346#true} is VALID [2022-04-08 08:37:47,028 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4346#true} {4346#true} #664#return; {4346#true} is VALID [2022-04-08 08:37:47,028 INFO L272 TraceCheckUtils]: 4: Hoare triple {4346#true} call #t~ret162 := main(); {4346#true} is VALID [2022-04-08 08:37:47,028 INFO L290 TraceCheckUtils]: 5: Hoare triple {4346#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {4346#true} is VALID [2022-04-08 08:37:47,031 INFO L290 TraceCheckUtils]: 6: Hoare triple {4346#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {4346#true} is VALID [2022-04-08 08:37:47,033 INFO L272 TraceCheckUtils]: 7: Hoare triple {4346#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {4346#true} is VALID [2022-04-08 08:37:47,035 INFO L290 TraceCheckUtils]: 8: Hoare triple {4346#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;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~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~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~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {4351#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:37:47,036 INFO L290 TraceCheckUtils]: 9: Hoare triple {4351#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {4351#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:37:47,036 INFO L290 TraceCheckUtils]: 10: Hoare triple {4351#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {4351#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:37:47,037 INFO L290 TraceCheckUtils]: 11: Hoare triple {4351#(= 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)))); {4351#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:37:47,037 INFO L290 TraceCheckUtils]: 12: Hoare triple {4351#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {4351#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:37:47,038 INFO L290 TraceCheckUtils]: 13: Hoare triple {4351#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {4351#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:37:47,038 INFO L290 TraceCheckUtils]: 14: Hoare triple {4351#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {4351#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:37:47,039 INFO L290 TraceCheckUtils]: 15: Hoare triple {4351#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {4351#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:37:47,039 INFO L290 TraceCheckUtils]: 16: Hoare triple {4351#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {4351#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:37:47,040 INFO L290 TraceCheckUtils]: 17: Hoare triple {4351#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {4351#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:37:47,040 INFO L290 TraceCheckUtils]: 18: Hoare triple {4351#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {4351#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:37:47,041 INFO L290 TraceCheckUtils]: 19: Hoare triple {4351#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {4351#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:37:47,041 INFO L290 TraceCheckUtils]: 20: Hoare triple {4351#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {4351#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:37:47,041 INFO L290 TraceCheckUtils]: 21: Hoare triple {4351#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {4351#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:37:47,042 INFO L290 TraceCheckUtils]: 22: Hoare triple {4351#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {4352#(= 8464 |ssl3_accept_#t~mem49|)} is VALID [2022-04-08 08:37:47,043 INFO L290 TraceCheckUtils]: 23: Hoare triple {4352#(= 8464 |ssl3_accept_#t~mem49|)} assume 8482 == #t~mem49;havoc #t~mem49; {4347#false} is VALID [2022-04-08 08:37:47,044 INFO L290 TraceCheckUtils]: 24: Hoare triple {4347#false} call write~int(3, ~s.base, 52 + ~s.offset, 4); {4347#false} is VALID [2022-04-08 08:37:47,044 INFO L290 TraceCheckUtils]: 25: Hoare triple {4347#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {4347#false} is VALID [2022-04-08 08:37:47,044 INFO L290 TraceCheckUtils]: 26: Hoare triple {4347#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {4347#false} is VALID [2022-04-08 08:37:47,044 INFO L290 TraceCheckUtils]: 27: Hoare triple {4347#false} ~skip~0 := 0; {4347#false} is VALID [2022-04-08 08:37:47,044 INFO L290 TraceCheckUtils]: 28: Hoare triple {4347#false} assume !false; {4347#false} is VALID [2022-04-08 08:37:47,044 INFO L290 TraceCheckUtils]: 29: Hoare triple {4347#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {4347#false} is VALID [2022-04-08 08:37:47,044 INFO L290 TraceCheckUtils]: 30: Hoare triple {4347#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {4347#false} is VALID [2022-04-08 08:37:47,044 INFO L290 TraceCheckUtils]: 31: Hoare triple {4347#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {4347#false} is VALID [2022-04-08 08:37:47,045 INFO L290 TraceCheckUtils]: 32: Hoare triple {4347#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {4347#false} is VALID [2022-04-08 08:37:47,045 INFO L290 TraceCheckUtils]: 33: Hoare triple {4347#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {4347#false} is VALID [2022-04-08 08:37:47,045 INFO L290 TraceCheckUtils]: 34: Hoare triple {4347#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {4347#false} is VALID [2022-04-08 08:37:47,045 INFO L290 TraceCheckUtils]: 35: Hoare triple {4347#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {4347#false} is VALID [2022-04-08 08:37:47,045 INFO L290 TraceCheckUtils]: 36: Hoare triple {4347#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {4347#false} is VALID [2022-04-08 08:37:47,045 INFO L290 TraceCheckUtils]: 37: Hoare triple {4347#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {4347#false} is VALID [2022-04-08 08:37:47,045 INFO L290 TraceCheckUtils]: 38: Hoare triple {4347#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {4347#false} is VALID [2022-04-08 08:37:47,045 INFO L290 TraceCheckUtils]: 39: Hoare triple {4347#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {4347#false} is VALID [2022-04-08 08:37:47,046 INFO L290 TraceCheckUtils]: 40: Hoare triple {4347#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {4347#false} is VALID [2022-04-08 08:37:47,046 INFO L290 TraceCheckUtils]: 41: Hoare triple {4347#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {4347#false} is VALID [2022-04-08 08:37:47,046 INFO L290 TraceCheckUtils]: 42: Hoare triple {4347#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {4347#false} is VALID [2022-04-08 08:37:47,046 INFO L290 TraceCheckUtils]: 43: Hoare triple {4347#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {4347#false} is VALID [2022-04-08 08:37:47,046 INFO L290 TraceCheckUtils]: 44: Hoare triple {4347#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {4347#false} is VALID [2022-04-08 08:37:47,051 INFO L290 TraceCheckUtils]: 45: Hoare triple {4347#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {4347#false} is VALID [2022-04-08 08:37:47,051 INFO L290 TraceCheckUtils]: 46: Hoare triple {4347#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {4347#false} is VALID [2022-04-08 08:37:47,052 INFO L290 TraceCheckUtils]: 47: Hoare triple {4347#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {4347#false} is VALID [2022-04-08 08:37:47,054 INFO L290 TraceCheckUtils]: 48: Hoare triple {4347#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {4347#false} is VALID [2022-04-08 08:37:47,055 INFO L290 TraceCheckUtils]: 49: Hoare triple {4347#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {4347#false} is VALID [2022-04-08 08:37:47,056 INFO L290 TraceCheckUtils]: 50: Hoare triple {4347#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {4347#false} is VALID [2022-04-08 08:37:47,056 INFO L290 TraceCheckUtils]: 51: Hoare triple {4347#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {4347#false} is VALID [2022-04-08 08:37:47,056 INFO L290 TraceCheckUtils]: 52: Hoare triple {4347#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {4347#false} is VALID [2022-04-08 08:37:47,056 INFO L290 TraceCheckUtils]: 53: Hoare triple {4347#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {4347#false} is VALID [2022-04-08 08:37:47,057 INFO L290 TraceCheckUtils]: 54: Hoare triple {4347#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {4347#false} is VALID [2022-04-08 08:37:47,058 INFO L290 TraceCheckUtils]: 55: Hoare triple {4347#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {4347#false} is VALID [2022-04-08 08:37:47,059 INFO L290 TraceCheckUtils]: 56: Hoare triple {4347#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {4347#false} is VALID [2022-04-08 08:37:47,059 INFO L290 TraceCheckUtils]: 57: Hoare triple {4347#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {4347#false} is VALID [2022-04-08 08:37:47,059 INFO L290 TraceCheckUtils]: 58: Hoare triple {4347#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {4347#false} is VALID [2022-04-08 08:37:47,059 INFO L290 TraceCheckUtils]: 59: Hoare triple {4347#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {4347#false} is VALID [2022-04-08 08:37:47,059 INFO L290 TraceCheckUtils]: 60: Hoare triple {4347#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {4347#false} is VALID [2022-04-08 08:37:47,059 INFO L290 TraceCheckUtils]: 61: Hoare triple {4347#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {4347#false} is VALID [2022-04-08 08:37:47,059 INFO L290 TraceCheckUtils]: 62: Hoare triple {4347#false} assume 8672 == #t~mem74;havoc #t~mem74; {4347#false} is VALID [2022-04-08 08:37:47,059 INFO L290 TraceCheckUtils]: 63: Hoare triple {4347#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {4347#false} is VALID [2022-04-08 08:37:47,060 INFO L290 TraceCheckUtils]: 64: Hoare triple {4347#false} assume 4 == ~blastFlag~0; {4347#false} is VALID [2022-04-08 08:37:47,060 INFO L290 TraceCheckUtils]: 65: Hoare triple {4347#false} assume !false; {4347#false} is VALID [2022-04-08 08:37:47,060 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:37:47,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:37:47,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367995336] [2022-04-08 08:37:47,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367995336] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:37:47,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:37:47,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:37:47,061 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:37:47,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1198079188] [2022-04-08 08:37:47,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1198079188] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:37:47,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:37:47,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:37:47,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471257036] [2022-04-08 08:37:47,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:37:47,062 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-08 08:37:47,062 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:37:47,062 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:37:47,114 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:37:47,114 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:37:47,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:37:47,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:37:47,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:37:47,115 INFO L87 Difference]: Start difference. First operand 167 states and 253 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:37:49,141 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:37:50,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:37:50,127 INFO L93 Difference]: Finished difference Result 322 states and 488 transitions. [2022-04-08 08:37:50,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:37:50,127 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-08 08:37:50,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:37:50,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:37:50,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 432 transitions. [2022-04-08 08:37:50,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:37:50,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 432 transitions. [2022-04-08 08:37:50,136 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 432 transitions. [2022-04-08 08:37:50,450 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 432 edges. 432 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:37:50,453 INFO L225 Difference]: With dead ends: 322 [2022-04-08 08:37:50,453 INFO L226 Difference]: Without dead ends: 181 [2022-04-08 08:37:50,453 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:37:50,454 INFO L913 BasicCegarLoop]: 183 mSDtfsCounter, 20 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 08:37:50,454 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 468 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 347 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 08:37:50,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-04-08 08:37:50,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 167. [2022-04-08 08:37:50,463 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:37:50,464 INFO L82 GeneralOperation]: Start isEquivalent. First operand 181 states. Second operand has 167 states, 162 states have (on average 1.5308641975308641) internal successors, (248), 162 states have internal predecessors, (248), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:37:50,464 INFO L74 IsIncluded]: Start isIncluded. First operand 181 states. Second operand has 167 states, 162 states have (on average 1.5308641975308641) internal successors, (248), 162 states have internal predecessors, (248), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:37:50,465 INFO L87 Difference]: Start difference. First operand 181 states. Second operand has 167 states, 162 states have (on average 1.5308641975308641) internal successors, (248), 162 states have internal predecessors, (248), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:37:50,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:37:50,475 INFO L93 Difference]: Finished difference Result 181 states and 270 transitions. [2022-04-08 08:37:50,475 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 270 transitions. [2022-04-08 08:37:50,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:37:50,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:37:50,476 INFO L74 IsIncluded]: Start isIncluded. First operand has 167 states, 162 states have (on average 1.5308641975308641) internal successors, (248), 162 states have internal predecessors, (248), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 181 states. [2022-04-08 08:37:50,476 INFO L87 Difference]: Start difference. First operand has 167 states, 162 states have (on average 1.5308641975308641) internal successors, (248), 162 states have internal predecessors, (248), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 181 states. [2022-04-08 08:37:50,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:37:50,480 INFO L93 Difference]: Finished difference Result 181 states and 270 transitions. [2022-04-08 08:37:50,480 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 270 transitions. [2022-04-08 08:37:50,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:37:50,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:37:50,481 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:37:50,481 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:37:50,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 162 states have (on average 1.5308641975308641) internal successors, (248), 162 states have internal predecessors, (248), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:37:50,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 252 transitions. [2022-04-08 08:37:50,485 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 252 transitions. Word has length 66 [2022-04-08 08:37:50,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:37:50,486 INFO L478 AbstractCegarLoop]: Abstraction has 167 states and 252 transitions. [2022-04-08 08:37:50,486 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:37:50,486 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 167 states and 252 transitions. [2022-04-08 08:37:50,670 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 252 edges. 252 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:37:50,670 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 252 transitions. [2022-04-08 08:37:50,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-08 08:37:50,671 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:37:50,671 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:37:50,672 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 08:37:50,672 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:37:50,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:37:50,673 INFO L85 PathProgramCache]: Analyzing trace with hash -2086075870, now seen corresponding path program 1 times [2022-04-08 08:37:50,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:37:50,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1299552572] [2022-04-08 08:37:50,709 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:37:50,709 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:37:50,709 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:37:50,710 INFO L85 PathProgramCache]: Analyzing trace with hash -2086075870, now seen corresponding path program 2 times [2022-04-08 08:37:50,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:37:50,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240012496] [2022-04-08 08:37:50,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:37:50,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:37:50,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:37:50,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:37:50,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:37:50,834 INFO L290 TraceCheckUtils]: 0: Hoare triple {5705#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {5698#true} is VALID [2022-04-08 08:37:50,834 INFO L290 TraceCheckUtils]: 1: Hoare triple {5698#true} assume true; {5698#true} is VALID [2022-04-08 08:37:50,834 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5698#true} {5698#true} #664#return; {5698#true} is VALID [2022-04-08 08:37:50,835 INFO L272 TraceCheckUtils]: 0: Hoare triple {5698#true} call ULTIMATE.init(); {5705#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:37:50,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {5705#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {5698#true} is VALID [2022-04-08 08:37:50,835 INFO L290 TraceCheckUtils]: 2: Hoare triple {5698#true} assume true; {5698#true} is VALID [2022-04-08 08:37:50,835 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5698#true} {5698#true} #664#return; {5698#true} is VALID [2022-04-08 08:37:50,836 INFO L272 TraceCheckUtils]: 4: Hoare triple {5698#true} call #t~ret162 := main(); {5698#true} is VALID [2022-04-08 08:37:50,836 INFO L290 TraceCheckUtils]: 5: Hoare triple {5698#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {5698#true} is VALID [2022-04-08 08:37:50,836 INFO L290 TraceCheckUtils]: 6: Hoare triple {5698#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {5698#true} is VALID [2022-04-08 08:37:50,836 INFO L272 TraceCheckUtils]: 7: Hoare triple {5698#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {5698#true} is VALID [2022-04-08 08:37:50,838 INFO L290 TraceCheckUtils]: 8: Hoare triple {5698#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;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~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~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~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {5703#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:37:50,838 INFO L290 TraceCheckUtils]: 9: Hoare triple {5703#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {5703#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:37:50,839 INFO L290 TraceCheckUtils]: 10: Hoare triple {5703#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {5703#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:37:50,840 INFO L290 TraceCheckUtils]: 11: Hoare triple {5703#(= 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)))); {5703#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:37:50,840 INFO L290 TraceCheckUtils]: 12: Hoare triple {5703#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {5703#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:37:50,840 INFO L290 TraceCheckUtils]: 13: Hoare triple {5703#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {5703#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:37:50,841 INFO L290 TraceCheckUtils]: 14: Hoare triple {5703#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {5703#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:37:50,842 INFO L290 TraceCheckUtils]: 15: Hoare triple {5703#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {5704#(= 8464 |ssl3_accept_#t~mem42|)} is VALID [2022-04-08 08:37:50,842 INFO L290 TraceCheckUtils]: 16: Hoare triple {5704#(= 8464 |ssl3_accept_#t~mem42|)} assume 12292 == #t~mem42;havoc #t~mem42; {5699#false} is VALID [2022-04-08 08:37:50,843 INFO L290 TraceCheckUtils]: 17: Hoare triple {5699#false} call write~int(1, ~s.base, 40 + ~s.offset, 4); {5699#false} is VALID [2022-04-08 08:37:50,843 INFO L290 TraceCheckUtils]: 18: Hoare triple {5699#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {5699#false} is VALID [2022-04-08 08:37:50,843 INFO L290 TraceCheckUtils]: 19: Hoare triple {5699#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {5699#false} is VALID [2022-04-08 08:37:50,843 INFO L290 TraceCheckUtils]: 20: Hoare triple {5699#false} call #t~mem77 := read~int(~s.base, ~s.offset, 4); {5699#false} is VALID [2022-04-08 08:37:50,843 INFO L290 TraceCheckUtils]: 21: Hoare triple {5699#false} assume !(3 != #t~mem77 / 256);havoc #t~mem77;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem78.base, #t~mem78.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {5699#false} is VALID [2022-04-08 08:37:50,843 INFO L290 TraceCheckUtils]: 22: Hoare triple {5699#false} assume !(0 == (#t~mem78.base + #t~mem78.offset) % 4294967296);havoc #t~mem78.base, #t~mem78.offset; {5699#false} is VALID [2022-04-08 08:37:50,843 INFO L290 TraceCheckUtils]: 23: Hoare triple {5699#false} assume -2147483648 <= #t~nondet80 && #t~nondet80 <= 2147483647;~tmp___4~0 := #t~nondet80;havoc #t~nondet80; {5699#false} is VALID [2022-04-08 08:37:50,843 INFO L290 TraceCheckUtils]: 24: Hoare triple {5699#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem81 := read~int(~s.base, 52 + ~s.offset, 4); {5699#false} is VALID [2022-04-08 08:37:50,844 INFO L290 TraceCheckUtils]: 25: Hoare triple {5699#false} assume !(12292 != #t~mem81);havoc #t~mem81;call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem86 := read~int(#t~mem85.base, 76 + #t~mem85.offset, 4);call write~int(1 + #t~mem86, #t~mem85.base, 76 + #t~mem85.offset, 4);havoc #t~mem85.base, #t~mem85.offset;havoc #t~mem86;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {5699#false} is VALID [2022-04-08 08:37:50,844 INFO L290 TraceCheckUtils]: 26: Hoare triple {5699#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {5699#false} is VALID [2022-04-08 08:37:50,844 INFO L290 TraceCheckUtils]: 27: Hoare triple {5699#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {5699#false} is VALID [2022-04-08 08:37:50,844 INFO L290 TraceCheckUtils]: 28: Hoare triple {5699#false} ~skip~0 := 0; {5699#false} is VALID [2022-04-08 08:37:50,844 INFO L290 TraceCheckUtils]: 29: Hoare triple {5699#false} assume !false; {5699#false} is VALID [2022-04-08 08:37:50,844 INFO L290 TraceCheckUtils]: 30: Hoare triple {5699#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {5699#false} is VALID [2022-04-08 08:37:50,844 INFO L290 TraceCheckUtils]: 31: Hoare triple {5699#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {5699#false} is VALID [2022-04-08 08:37:50,844 INFO L290 TraceCheckUtils]: 32: Hoare triple {5699#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {5699#false} is VALID [2022-04-08 08:37:50,845 INFO L290 TraceCheckUtils]: 33: Hoare triple {5699#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {5699#false} is VALID [2022-04-08 08:37:50,845 INFO L290 TraceCheckUtils]: 34: Hoare triple {5699#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {5699#false} is VALID [2022-04-08 08:37:50,845 INFO L290 TraceCheckUtils]: 35: Hoare triple {5699#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {5699#false} is VALID [2022-04-08 08:37:50,845 INFO L290 TraceCheckUtils]: 36: Hoare triple {5699#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {5699#false} is VALID [2022-04-08 08:37:50,845 INFO L290 TraceCheckUtils]: 37: Hoare triple {5699#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {5699#false} is VALID [2022-04-08 08:37:50,845 INFO L290 TraceCheckUtils]: 38: Hoare triple {5699#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {5699#false} is VALID [2022-04-08 08:37:50,845 INFO L290 TraceCheckUtils]: 39: Hoare triple {5699#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {5699#false} is VALID [2022-04-08 08:37:50,845 INFO L290 TraceCheckUtils]: 40: Hoare triple {5699#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {5699#false} is VALID [2022-04-08 08:37:50,845 INFO L290 TraceCheckUtils]: 41: Hoare triple {5699#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {5699#false} is VALID [2022-04-08 08:37:50,846 INFO L290 TraceCheckUtils]: 42: Hoare triple {5699#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {5699#false} is VALID [2022-04-08 08:37:50,846 INFO L290 TraceCheckUtils]: 43: Hoare triple {5699#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {5699#false} is VALID [2022-04-08 08:37:50,846 INFO L290 TraceCheckUtils]: 44: Hoare triple {5699#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {5699#false} is VALID [2022-04-08 08:37:50,846 INFO L290 TraceCheckUtils]: 45: Hoare triple {5699#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {5699#false} is VALID [2022-04-08 08:37:50,846 INFO L290 TraceCheckUtils]: 46: Hoare triple {5699#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {5699#false} is VALID [2022-04-08 08:37:50,846 INFO L290 TraceCheckUtils]: 47: Hoare triple {5699#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {5699#false} is VALID [2022-04-08 08:37:50,846 INFO L290 TraceCheckUtils]: 48: Hoare triple {5699#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {5699#false} is VALID [2022-04-08 08:37:50,846 INFO L290 TraceCheckUtils]: 49: Hoare triple {5699#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {5699#false} is VALID [2022-04-08 08:37:50,846 INFO L290 TraceCheckUtils]: 50: Hoare triple {5699#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {5699#false} is VALID [2022-04-08 08:37:50,847 INFO L290 TraceCheckUtils]: 51: Hoare triple {5699#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {5699#false} is VALID [2022-04-08 08:37:50,847 INFO L290 TraceCheckUtils]: 52: Hoare triple {5699#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {5699#false} is VALID [2022-04-08 08:37:50,847 INFO L290 TraceCheckUtils]: 53: Hoare triple {5699#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {5699#false} is VALID [2022-04-08 08:37:50,847 INFO L290 TraceCheckUtils]: 54: Hoare triple {5699#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {5699#false} is VALID [2022-04-08 08:37:50,847 INFO L290 TraceCheckUtils]: 55: Hoare triple {5699#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {5699#false} is VALID [2022-04-08 08:37:50,847 INFO L290 TraceCheckUtils]: 56: Hoare triple {5699#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {5699#false} is VALID [2022-04-08 08:37:50,847 INFO L290 TraceCheckUtils]: 57: Hoare triple {5699#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {5699#false} is VALID [2022-04-08 08:37:50,847 INFO L290 TraceCheckUtils]: 58: Hoare triple {5699#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {5699#false} is VALID [2022-04-08 08:37:50,848 INFO L290 TraceCheckUtils]: 59: Hoare triple {5699#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {5699#false} is VALID [2022-04-08 08:37:50,848 INFO L290 TraceCheckUtils]: 60: Hoare triple {5699#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {5699#false} is VALID [2022-04-08 08:37:50,848 INFO L290 TraceCheckUtils]: 61: Hoare triple {5699#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {5699#false} is VALID [2022-04-08 08:37:50,848 INFO L290 TraceCheckUtils]: 62: Hoare triple {5699#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {5699#false} is VALID [2022-04-08 08:37:50,848 INFO L290 TraceCheckUtils]: 63: Hoare triple {5699#false} assume 8672 == #t~mem74;havoc #t~mem74; {5699#false} is VALID [2022-04-08 08:37:50,848 INFO L290 TraceCheckUtils]: 64: Hoare triple {5699#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {5699#false} is VALID [2022-04-08 08:37:50,848 INFO L290 TraceCheckUtils]: 65: Hoare triple {5699#false} assume 4 == ~blastFlag~0; {5699#false} is VALID [2022-04-08 08:37:50,848 INFO L290 TraceCheckUtils]: 66: Hoare triple {5699#false} assume !false; {5699#false} is VALID [2022-04-08 08:37:50,849 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:37:50,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:37:50,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240012496] [2022-04-08 08:37:50,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240012496] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:37:50,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:37:50,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:37:50,850 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:37:50,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1299552572] [2022-04-08 08:37:50,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1299552572] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:37:50,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:37:50,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:37:50,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056237342] [2022-04-08 08:37:50,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:37:50,851 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-08 08:37:50,851 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:37:50,851 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:37:50,904 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:37:50,904 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:37:50,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:37:50,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:37:50,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:37:50,905 INFO L87 Difference]: Start difference. First operand 167 states and 252 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:37:52,932 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:37:53,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:37:53,897 INFO L93 Difference]: Finished difference Result 321 states and 486 transitions. [2022-04-08 08:37:53,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:37:53,897 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-08 08:37:53,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:37:53,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:37:53,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 430 transitions. [2022-04-08 08:37:53,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:37:53,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 430 transitions. [2022-04-08 08:37:53,904 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 430 transitions. [2022-04-08 08:37:54,260 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 430 edges. 430 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:37:54,264 INFO L225 Difference]: With dead ends: 321 [2022-04-08 08:37:54,264 INFO L226 Difference]: Without dead ends: 180 [2022-04-08 08:37:54,265 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:37:54,266 INFO L913 BasicCegarLoop]: 184 mSDtfsCounter, 26 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 08:37:54,266 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 470 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 345 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 08:37:54,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-04-08 08:37:54,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 167. [2022-04-08 08:37:54,284 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:37:54,285 INFO L82 GeneralOperation]: Start isEquivalent. First operand 180 states. Second operand has 167 states, 162 states have (on average 1.5246913580246915) internal successors, (247), 162 states have internal predecessors, (247), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:37:54,285 INFO L74 IsIncluded]: Start isIncluded. First operand 180 states. Second operand has 167 states, 162 states have (on average 1.5246913580246915) internal successors, (247), 162 states have internal predecessors, (247), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:37:54,285 INFO L87 Difference]: Start difference. First operand 180 states. Second operand has 167 states, 162 states have (on average 1.5246913580246915) internal successors, (247), 162 states have internal predecessors, (247), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:37:54,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:37:54,289 INFO L93 Difference]: Finished difference Result 180 states and 268 transitions. [2022-04-08 08:37:54,289 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 268 transitions. [2022-04-08 08:37:54,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:37:54,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:37:54,290 INFO L74 IsIncluded]: Start isIncluded. First operand has 167 states, 162 states have (on average 1.5246913580246915) internal successors, (247), 162 states have internal predecessors, (247), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 180 states. [2022-04-08 08:37:54,291 INFO L87 Difference]: Start difference. First operand has 167 states, 162 states have (on average 1.5246913580246915) internal successors, (247), 162 states have internal predecessors, (247), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 180 states. [2022-04-08 08:37:54,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:37:54,298 INFO L93 Difference]: Finished difference Result 180 states and 268 transitions. [2022-04-08 08:37:54,298 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 268 transitions. [2022-04-08 08:37:54,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:37:54,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:37:54,299 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:37:54,299 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:37:54,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 162 states have (on average 1.5246913580246915) internal successors, (247), 162 states have internal predecessors, (247), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:37:54,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 251 transitions. [2022-04-08 08:37:54,303 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 251 transitions. Word has length 67 [2022-04-08 08:37:54,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:37:54,303 INFO L478 AbstractCegarLoop]: Abstraction has 167 states and 251 transitions. [2022-04-08 08:37:54,304 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:37:54,304 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 167 states and 251 transitions. [2022-04-08 08:37:54,501 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 251 edges. 251 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:37:54,501 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 251 transitions. [2022-04-08 08:37:54,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-08 08:37:54,502 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:37:54,502 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:37:54,502 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-08 08:37:54,503 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:37:54,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:37:54,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1877545714, now seen corresponding path program 1 times [2022-04-08 08:37:54,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:37:54,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1971935897] [2022-04-08 08:37:54,846 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 20 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 08:37:54,846 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 08:37:54,847 INFO L85 PathProgramCache]: Analyzing trace with hash 809606660, now seen corresponding path program 1 times [2022-04-08 08:37:54,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:37:54,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987620086] [2022-04-08 08:37:54,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:37:54,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:37:54,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:37:54,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:37:54,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:37:54,973 INFO L290 TraceCheckUtils]: 0: Hoare triple {7052#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {7046#true} is VALID [2022-04-08 08:37:54,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {7046#true} assume true; {7046#true} is VALID [2022-04-08 08:37:54,974 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7046#true} {7046#true} #664#return; {7046#true} is VALID [2022-04-08 08:37:54,975 INFO L272 TraceCheckUtils]: 0: Hoare triple {7046#true} call ULTIMATE.init(); {7052#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:37:54,975 INFO L290 TraceCheckUtils]: 1: Hoare triple {7052#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {7046#true} is VALID [2022-04-08 08:37:54,975 INFO L290 TraceCheckUtils]: 2: Hoare triple {7046#true} assume true; {7046#true} is VALID [2022-04-08 08:37:54,975 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7046#true} {7046#true} #664#return; {7046#true} is VALID [2022-04-08 08:37:54,975 INFO L272 TraceCheckUtils]: 4: Hoare triple {7046#true} call #t~ret162 := main(); {7046#true} is VALID [2022-04-08 08:37:54,975 INFO L290 TraceCheckUtils]: 5: Hoare triple {7046#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {7046#true} is VALID [2022-04-08 08:37:54,975 INFO L290 TraceCheckUtils]: 6: Hoare triple {7046#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {7046#true} is VALID [2022-04-08 08:37:54,975 INFO L272 TraceCheckUtils]: 7: Hoare triple {7046#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {7046#true} is VALID [2022-04-08 08:37:54,976 INFO L290 TraceCheckUtils]: 8: Hoare triple {7046#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;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~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~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~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:37:54,976 INFO L290 TraceCheckUtils]: 9: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:37:54,979 INFO L290 TraceCheckUtils]: 10: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:37:54,980 INFO L290 TraceCheckUtils]: 11: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:37:54,980 INFO L290 TraceCheckUtils]: 12: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:37:54,980 INFO L290 TraceCheckUtils]: 13: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:37:54,981 INFO L290 TraceCheckUtils]: 14: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} [670] L1166-2-->L1167_primed: Formula: true InVars {} OutVars{ssl3_accept_#t~mem81=|v_ssl3_accept_#t~mem81_8|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_277|, ssl3_accept_#t~mem78.base=|v_ssl3_accept_#t~mem78.base_8|, ssl3_accept_#t~mem41=|v_ssl3_accept_#t~mem41_7|, ssl3_accept_#t~mem151.base=|v_ssl3_accept_#t~mem151.base_12|, ssl3_accept_~tmp___4~0=v_ssl3_accept_~tmp___4~0_6, ssl3_accept_#t~mem85.base=|v_ssl3_accept_#t~mem85.base_4|, ssl3_accept_#t~nondet80=|v_ssl3_accept_#t~nondet80_5|, ssl3_accept_#t~mem78.offset=|v_ssl3_accept_#t~mem78.offset_8|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_17, ssl3_accept_#t~mem43=|v_ssl3_accept_#t~mem43_12|, ssl3_accept_#t~mem42=|v_ssl3_accept_#t~mem42_14|, ssl3_accept_#t~mem151.offset=|v_ssl3_accept_#t~mem151.offset_12|, ssl3_accept_#t~mem152=|v_ssl3_accept_#t~mem152_14|, #memory_int=|v_#memory_int_268|, ssl3_accept_#t~mem86=|v_ssl3_accept_#t~mem86_4|, ssl3_accept_#t~mem77=|v_ssl3_accept_#t~mem77_8|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_277|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_9, ssl3_accept_#t~mem85.offset=|v_ssl3_accept_#t~mem85.offset_4|} AuxVars[] AssignedVars[ssl3_accept_#t~mem81, #memory_$Pointer$.base, ssl3_accept_#t~mem78.base, ssl3_accept_#t~mem41, ssl3_accept_#t~mem151.base, ssl3_accept_~tmp___4~0, ssl3_accept_#t~mem85.base, ssl3_accept_#t~nondet80, ssl3_accept_#t~mem78.offset, ssl3_accept_~skip~0, ssl3_accept_#t~mem43, ssl3_accept_#t~mem42, ssl3_accept_#t~mem151.offset, ssl3_accept_#t~mem152, #memory_int, ssl3_accept_#t~mem86, ssl3_accept_#t~mem77, #memory_$Pointer$.offset, ssl3_accept_~state~0, ssl3_accept_#t~mem85.offset] {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:37:54,981 INFO L290 TraceCheckUtils]: 15: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} [669] L1167_primed-->L1167: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:37:54,981 INFO L290 TraceCheckUtils]: 16: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:37:54,982 INFO L290 TraceCheckUtils]: 17: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:37:54,982 INFO L290 TraceCheckUtils]: 18: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:37:54,982 INFO L290 TraceCheckUtils]: 19: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:37:54,983 INFO L290 TraceCheckUtils]: 20: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:37:54,983 INFO L290 TraceCheckUtils]: 21: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:37:54,984 INFO L290 TraceCheckUtils]: 22: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:37:54,984 INFO L290 TraceCheckUtils]: 23: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:37:54,984 INFO L290 TraceCheckUtils]: 24: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:37:54,985 INFO L290 TraceCheckUtils]: 25: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:37:54,985 INFO L290 TraceCheckUtils]: 26: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:37:54,985 INFO L290 TraceCheckUtils]: 27: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:37:54,986 INFO L290 TraceCheckUtils]: 28: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:37:54,986 INFO L290 TraceCheckUtils]: 29: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:37:54,986 INFO L290 TraceCheckUtils]: 30: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:37:54,987 INFO L290 TraceCheckUtils]: 31: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:37:54,987 INFO L290 TraceCheckUtils]: 32: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:37:54,987 INFO L290 TraceCheckUtils]: 33: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:37:54,988 INFO L290 TraceCheckUtils]: 34: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:37:54,989 INFO L290 TraceCheckUtils]: 35: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:37:54,989 INFO L290 TraceCheckUtils]: 36: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:37:54,991 INFO L290 TraceCheckUtils]: 37: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:37:54,992 INFO L290 TraceCheckUtils]: 38: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:37:54,993 INFO L290 TraceCheckUtils]: 39: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:37:54,993 INFO L290 TraceCheckUtils]: 40: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:37:54,993 INFO L290 TraceCheckUtils]: 41: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:37:54,994 INFO L290 TraceCheckUtils]: 42: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:37:54,994 INFO L290 TraceCheckUtils]: 43: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:37:54,994 INFO L290 TraceCheckUtils]: 44: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:37:54,995 INFO L290 TraceCheckUtils]: 45: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:37:54,995 INFO L290 TraceCheckUtils]: 46: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:37:54,995 INFO L290 TraceCheckUtils]: 47: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:37:54,996 INFO L290 TraceCheckUtils]: 48: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:37:54,998 INFO L290 TraceCheckUtils]: 49: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} assume 8672 == #t~mem74;havoc #t~mem74; {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:37:54,998 INFO L290 TraceCheckUtils]: 50: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {7051#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:37:54,999 INFO L290 TraceCheckUtils]: 51: Hoare triple {7051#(= ssl3_accept_~blastFlag~0 0)} assume 4 == ~blastFlag~0; {7047#false} is VALID [2022-04-08 08:37:54,999 INFO L290 TraceCheckUtils]: 52: Hoare triple {7047#false} assume !false; {7047#false} is VALID [2022-04-08 08:37:54,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:37:54,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:37:55,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987620086] [2022-04-08 08:37:55,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987620086] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:37:55,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:37:55,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:37:58,285 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:37:58,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1971935897] [2022-04-08 08:37:58,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1971935897] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:37:58,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:37:58,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 08:37:58,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906544664] [2022-04-08 08:37:58,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:37:58,286 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 13 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-08 08:37:58,286 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:37:58,287 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 4.5) internal successors, (63), 13 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:37:58,367 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:37:58,367 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 08:37:58,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:37:58,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 08:37:58,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=125, Unknown=1, NotChecked=0, Total=182 [2022-04-08 08:37:58,369 INFO L87 Difference]: Start difference. First operand 167 states and 251 transitions. Second operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 13 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:38:00,400 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:38:01,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:38:01,855 INFO L93 Difference]: Finished difference Result 319 states and 482 transitions. [2022-04-08 08:38:01,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 08:38:01,856 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 13 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-08 08:38:01,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:38:01,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 13 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:38:01,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 426 transitions. [2022-04-08 08:38:01,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 13 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:38:01,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 426 transitions. [2022-04-08 08:38:01,862 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 426 transitions. [2022-04-08 08:38:02,234 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 426 edges. 426 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:38:02,238 INFO L225 Difference]: With dead ends: 319 [2022-04-08 08:38:02,238 INFO L226 Difference]: Without dead ends: 178 [2022-04-08 08:38:02,238 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=56, Invalid=125, Unknown=1, NotChecked=0, Total=182 [2022-04-08 08:38:02,239 INFO L913 BasicCegarLoop]: 195 mSDtfsCounter, 13 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 133 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-08 08:38:02,239 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 563 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 424 Invalid, 1 Unknown, 133 Unchecked, 2.5s Time] [2022-04-08 08:38:02,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-04-08 08:38:02,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 175. [2022-04-08 08:38:02,258 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:38:02,259 INFO L82 GeneralOperation]: Start isEquivalent. First operand 178 states. Second operand has 175 states, 170 states have (on average 1.511764705882353) internal successors, (257), 170 states have internal predecessors, (257), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:38:02,259 INFO L74 IsIncluded]: Start isIncluded. First operand 178 states. Second operand has 175 states, 170 states have (on average 1.511764705882353) internal successors, (257), 170 states have internal predecessors, (257), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:38:02,259 INFO L87 Difference]: Start difference. First operand 178 states. Second operand has 175 states, 170 states have (on average 1.511764705882353) internal successors, (257), 170 states have internal predecessors, (257), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:38:02,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:38:02,263 INFO L93 Difference]: Finished difference Result 178 states and 264 transitions. [2022-04-08 08:38:02,263 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 264 transitions. [2022-04-08 08:38:02,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:38:02,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:38:02,264 INFO L74 IsIncluded]: Start isIncluded. First operand has 175 states, 170 states have (on average 1.511764705882353) internal successors, (257), 170 states have internal predecessors, (257), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 178 states. [2022-04-08 08:38:02,264 INFO L87 Difference]: Start difference. First operand has 175 states, 170 states have (on average 1.511764705882353) internal successors, (257), 170 states have internal predecessors, (257), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 178 states. [2022-04-08 08:38:02,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:38:02,268 INFO L93 Difference]: Finished difference Result 178 states and 264 transitions. [2022-04-08 08:38:02,268 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 264 transitions. [2022-04-08 08:38:02,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:38:02,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:38:02,268 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:38:02,268 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:38:02,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 170 states have (on average 1.511764705882353) internal successors, (257), 170 states have internal predecessors, (257), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:38:02,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 261 transitions. [2022-04-08 08:38:02,273 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 261 transitions. Word has length 67 [2022-04-08 08:38:02,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:38:02,273 INFO L478 AbstractCegarLoop]: Abstraction has 175 states and 261 transitions. [2022-04-08 08:38:02,273 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 13 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:38:02,273 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 175 states and 261 transitions. [2022-04-08 08:38:02,487 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 261 edges. 261 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:38:02,487 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 261 transitions. [2022-04-08 08:38:02,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-08 08:38:02,488 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:38:02,488 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:38:02,488 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-08 08:38:02,488 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:38:02,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:38:02,489 INFO L85 PathProgramCache]: Analyzing trace with hash 61616332, now seen corresponding path program 1 times [2022-04-08 08:38:02,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:38:02,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [403028504] [2022-04-08 08:38:02,643 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 20 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 08:38:02,644 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 08:38:02,644 INFO L85 PathProgramCache]: Analyzing trace with hash -2065119804, now seen corresponding path program 1 times [2022-04-08 08:38:02,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:38:02,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225001513] [2022-04-08 08:38:02,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:38:02,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:38:02,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:38:02,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:38:02,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:38:02,755 INFO L290 TraceCheckUtils]: 0: Hoare triple {8415#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {8409#true} is VALID [2022-04-08 08:38:02,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {8409#true} assume true; {8409#true} is VALID [2022-04-08 08:38:02,755 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8409#true} {8409#true} #664#return; {8409#true} is VALID [2022-04-08 08:38:02,756 INFO L272 TraceCheckUtils]: 0: Hoare triple {8409#true} call ULTIMATE.init(); {8415#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:38:02,756 INFO L290 TraceCheckUtils]: 1: Hoare triple {8415#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {8409#true} is VALID [2022-04-08 08:38:02,756 INFO L290 TraceCheckUtils]: 2: Hoare triple {8409#true} assume true; {8409#true} is VALID [2022-04-08 08:38:02,756 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8409#true} {8409#true} #664#return; {8409#true} is VALID [2022-04-08 08:38:02,757 INFO L272 TraceCheckUtils]: 4: Hoare triple {8409#true} call #t~ret162 := main(); {8409#true} is VALID [2022-04-08 08:38:02,757 INFO L290 TraceCheckUtils]: 5: Hoare triple {8409#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {8409#true} is VALID [2022-04-08 08:38:02,757 INFO L290 TraceCheckUtils]: 6: Hoare triple {8409#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {8409#true} is VALID [2022-04-08 08:38:02,757 INFO L272 TraceCheckUtils]: 7: Hoare triple {8409#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {8409#true} is VALID [2022-04-08 08:38:02,757 INFO L290 TraceCheckUtils]: 8: Hoare triple {8409#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;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~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~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~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:02,758 INFO L290 TraceCheckUtils]: 9: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:02,758 INFO L290 TraceCheckUtils]: 10: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:02,758 INFO L290 TraceCheckUtils]: 11: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:02,759 INFO L290 TraceCheckUtils]: 12: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:02,759 INFO L290 TraceCheckUtils]: 13: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:02,759 INFO L290 TraceCheckUtils]: 14: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} [672] L1166-2-->L1167_primed: Formula: true InVars {} OutVars{ssl3_accept_#t~mem81=|v_ssl3_accept_#t~mem81_14|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_296|, ssl3_accept_#t~mem78.base=|v_ssl3_accept_#t~mem78.base_14|, ssl3_accept_#t~mem41=|v_ssl3_accept_#t~mem41_11|, ssl3_accept_#t~mem151.base=|v_ssl3_accept_#t~mem151.base_17|, ssl3_accept_~tmp___4~0=v_ssl3_accept_~tmp___4~0_10, ssl3_accept_#t~mem85.base=|v_ssl3_accept_#t~mem85.base_8|, ssl3_accept_#t~nondet80=|v_ssl3_accept_#t~nondet80_11|, ssl3_accept_#t~mem78.offset=|v_ssl3_accept_#t~mem78.offset_14|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_21, ssl3_accept_#t~mem43=|v_ssl3_accept_#t~mem43_18|, ssl3_accept_#t~mem42=|v_ssl3_accept_#t~mem42_20|, ssl3_accept_#t~mem151.offset=|v_ssl3_accept_#t~mem151.offset_17|, ssl3_accept_#t~mem152=|v_ssl3_accept_#t~mem152_19|, #memory_int=|v_#memory_int_286|, ssl3_accept_#t~mem86=|v_ssl3_accept_#t~mem86_8|, ssl3_accept_#t~mem77=|v_ssl3_accept_#t~mem77_14|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_296|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_13, ssl3_accept_#t~mem85.offset=|v_ssl3_accept_#t~mem85.offset_8|} AuxVars[] AssignedVars[ssl3_accept_#t~mem81, #memory_$Pointer$.base, ssl3_accept_#t~mem78.base, ssl3_accept_#t~mem41, ssl3_accept_#t~mem151.base, ssl3_accept_~tmp___4~0, ssl3_accept_#t~mem85.base, ssl3_accept_#t~nondet80, ssl3_accept_#t~mem78.offset, ssl3_accept_~skip~0, ssl3_accept_#t~mem43, ssl3_accept_#t~mem42, ssl3_accept_#t~mem151.offset, ssl3_accept_#t~mem152, #memory_int, ssl3_accept_#t~mem86, ssl3_accept_#t~mem77, #memory_$Pointer$.offset, ssl3_accept_~state~0, ssl3_accept_#t~mem85.offset] {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:02,760 INFO L290 TraceCheckUtils]: 15: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} [671] L1167_primed-->L1167: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:02,760 INFO L290 TraceCheckUtils]: 16: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:02,760 INFO L290 TraceCheckUtils]: 17: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:02,761 INFO L290 TraceCheckUtils]: 18: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:02,761 INFO L290 TraceCheckUtils]: 19: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:02,761 INFO L290 TraceCheckUtils]: 20: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:02,762 INFO L290 TraceCheckUtils]: 21: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:02,762 INFO L290 TraceCheckUtils]: 22: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:02,762 INFO L290 TraceCheckUtils]: 23: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:02,763 INFO L290 TraceCheckUtils]: 24: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:02,763 INFO L290 TraceCheckUtils]: 25: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:02,763 INFO L290 TraceCheckUtils]: 26: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:02,764 INFO L290 TraceCheckUtils]: 27: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:02,764 INFO L290 TraceCheckUtils]: 28: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:02,764 INFO L290 TraceCheckUtils]: 29: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:02,765 INFO L290 TraceCheckUtils]: 30: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:02,765 INFO L290 TraceCheckUtils]: 31: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:02,765 INFO L290 TraceCheckUtils]: 32: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:02,766 INFO L290 TraceCheckUtils]: 33: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:02,766 INFO L290 TraceCheckUtils]: 34: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:02,766 INFO L290 TraceCheckUtils]: 35: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:02,767 INFO L290 TraceCheckUtils]: 36: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:02,767 INFO L290 TraceCheckUtils]: 37: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:02,767 INFO L290 TraceCheckUtils]: 38: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:02,768 INFO L290 TraceCheckUtils]: 39: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:02,768 INFO L290 TraceCheckUtils]: 40: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:02,768 INFO L290 TraceCheckUtils]: 41: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:02,769 INFO L290 TraceCheckUtils]: 42: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:02,769 INFO L290 TraceCheckUtils]: 43: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:02,769 INFO L290 TraceCheckUtils]: 44: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:02,770 INFO L290 TraceCheckUtils]: 45: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:02,770 INFO L290 TraceCheckUtils]: 46: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:02,770 INFO L290 TraceCheckUtils]: 47: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:02,771 INFO L290 TraceCheckUtils]: 48: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:02,771 INFO L290 TraceCheckUtils]: 49: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} assume 8672 == #t~mem74;havoc #t~mem74; {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:02,771 INFO L290 TraceCheckUtils]: 50: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {8414#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:02,772 INFO L290 TraceCheckUtils]: 51: Hoare triple {8414#(= ssl3_accept_~blastFlag~0 0)} assume 4 == ~blastFlag~0; {8410#false} is VALID [2022-04-08 08:38:02,772 INFO L290 TraceCheckUtils]: 52: Hoare triple {8410#false} assume !false; {8410#false} is VALID [2022-04-08 08:38:02,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:38:02,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:38:02,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225001513] [2022-04-08 08:38:02,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225001513] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:38:02,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:38:02,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:38:06,821 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:38:06,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [403028504] [2022-04-08 08:38:06,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [403028504] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:38:06,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:38:06,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 08:38:06,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410556875] [2022-04-08 08:38:06,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:38:06,822 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 13 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-08 08:38:06,822 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:38:06,823 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 4.5) internal successors, (63), 13 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:38:06,885 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:38:06,885 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 08:38:06,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:38:06,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 08:38:06,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=125, Unknown=1, NotChecked=0, Total=182 [2022-04-08 08:38:06,886 INFO L87 Difference]: Start difference. First operand 175 states and 261 transitions. Second operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 13 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:38:08,906 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:38:09,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:38:09,976 INFO L93 Difference]: Finished difference Result 327 states and 493 transitions. [2022-04-08 08:38:09,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 08:38:09,977 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 13 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-08 08:38:09,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:38:09,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 13 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:38:09,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 431 transitions. [2022-04-08 08:38:09,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 13 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:38:09,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 431 transitions. [2022-04-08 08:38:09,986 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 431 transitions. [2022-04-08 08:38:10,379 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 431 edges. 431 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:38:10,382 INFO L225 Difference]: With dead ends: 327 [2022-04-08 08:38:10,383 INFO L226 Difference]: Without dead ends: 186 [2022-04-08 08:38:10,383 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=56, Invalid=125, Unknown=1, NotChecked=0, Total=182 [2022-04-08 08:38:10,384 INFO L913 BasicCegarLoop]: 200 mSDtfsCounter, 17 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 150 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-08 08:38:10,384 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 522 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 266 Invalid, 1 Unknown, 150 Unchecked, 2.3s Time] [2022-04-08 08:38:10,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-04-08 08:38:10,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 177. [2022-04-08 08:38:10,408 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:38:10,409 INFO L82 GeneralOperation]: Start isEquivalent. First operand 186 states. Second operand has 177 states, 172 states have (on average 1.505813953488372) internal successors, (259), 172 states have internal predecessors, (259), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:38:10,409 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states. Second operand has 177 states, 172 states have (on average 1.505813953488372) internal successors, (259), 172 states have internal predecessors, (259), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:38:10,410 INFO L87 Difference]: Start difference. First operand 186 states. Second operand has 177 states, 172 states have (on average 1.505813953488372) internal successors, (259), 172 states have internal predecessors, (259), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:38:10,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:38:10,414 INFO L93 Difference]: Finished difference Result 186 states and 274 transitions. [2022-04-08 08:38:10,414 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 274 transitions. [2022-04-08 08:38:10,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:38:10,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:38:10,415 INFO L74 IsIncluded]: Start isIncluded. First operand has 177 states, 172 states have (on average 1.505813953488372) internal successors, (259), 172 states have internal predecessors, (259), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 186 states. [2022-04-08 08:38:10,415 INFO L87 Difference]: Start difference. First operand has 177 states, 172 states have (on average 1.505813953488372) internal successors, (259), 172 states have internal predecessors, (259), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 186 states. [2022-04-08 08:38:10,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:38:10,419 INFO L93 Difference]: Finished difference Result 186 states and 274 transitions. [2022-04-08 08:38:10,419 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 274 transitions. [2022-04-08 08:38:10,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:38:10,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:38:10,420 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:38:10,420 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:38:10,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 172 states have (on average 1.505813953488372) internal successors, (259), 172 states have internal predecessors, (259), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:38:10,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 263 transitions. [2022-04-08 08:38:10,424 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 263 transitions. Word has length 67 [2022-04-08 08:38:10,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:38:10,424 INFO L478 AbstractCegarLoop]: Abstraction has 177 states and 263 transitions. [2022-04-08 08:38:10,424 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 13 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:38:10,424 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 177 states and 263 transitions. [2022-04-08 08:38:10,726 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 263 edges. 263 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:38:10,726 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 263 transitions. [2022-04-08 08:38:10,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-08 08:38:10,727 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:38:10,727 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:38:10,727 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-08 08:38:10,727 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:38:10,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:38:10,728 INFO L85 PathProgramCache]: Analyzing trace with hash -957475682, now seen corresponding path program 1 times [2022-04-08 08:38:10,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:38:10,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [442864729] [2022-04-08 08:38:10,756 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:38:10,756 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:38:10,756 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:38:10,757 INFO L85 PathProgramCache]: Analyzing trace with hash -957475682, now seen corresponding path program 2 times [2022-04-08 08:38:10,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:38:10,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238548059] [2022-04-08 08:38:10,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:38:10,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:38:10,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:38:10,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:38:10,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:38:10,893 INFO L290 TraceCheckUtils]: 0: Hoare triple {9815#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {9808#true} is VALID [2022-04-08 08:38:10,893 INFO L290 TraceCheckUtils]: 1: Hoare triple {9808#true} assume true; {9808#true} is VALID [2022-04-08 08:38:10,893 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9808#true} {9808#true} #664#return; {9808#true} is VALID [2022-04-08 08:38:10,894 INFO L272 TraceCheckUtils]: 0: Hoare triple {9808#true} call ULTIMATE.init(); {9815#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:38:10,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {9815#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {9808#true} is VALID [2022-04-08 08:38:10,894 INFO L290 TraceCheckUtils]: 2: Hoare triple {9808#true} assume true; {9808#true} is VALID [2022-04-08 08:38:10,894 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9808#true} {9808#true} #664#return; {9808#true} is VALID [2022-04-08 08:38:10,894 INFO L272 TraceCheckUtils]: 4: Hoare triple {9808#true} call #t~ret162 := main(); {9808#true} is VALID [2022-04-08 08:38:10,895 INFO L290 TraceCheckUtils]: 5: Hoare triple {9808#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {9808#true} is VALID [2022-04-08 08:38:10,895 INFO L290 TraceCheckUtils]: 6: Hoare triple {9808#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {9808#true} is VALID [2022-04-08 08:38:10,895 INFO L272 TraceCheckUtils]: 7: Hoare triple {9808#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {9808#true} is VALID [2022-04-08 08:38:10,897 INFO L290 TraceCheckUtils]: 8: Hoare triple {9808#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;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~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~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~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {9813#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:38:10,897 INFO L290 TraceCheckUtils]: 9: Hoare triple {9813#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {9813#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:38:10,898 INFO L290 TraceCheckUtils]: 10: Hoare triple {9813#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {9813#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:38:10,899 INFO L290 TraceCheckUtils]: 11: Hoare triple {9813#(not (= 16384 (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)))); {9813#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:38:10,900 INFO L290 TraceCheckUtils]: 12: Hoare triple {9813#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {9813#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:38:10,900 INFO L290 TraceCheckUtils]: 13: Hoare triple {9813#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {9813#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:38:10,901 INFO L290 TraceCheckUtils]: 14: Hoare triple {9813#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {9813#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:38:10,901 INFO L290 TraceCheckUtils]: 15: Hoare triple {9813#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {9813#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:38:10,902 INFO L290 TraceCheckUtils]: 16: Hoare triple {9813#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {9814#(not (= |ssl3_accept_#t~mem43| 16384))} is VALID [2022-04-08 08:38:10,902 INFO L290 TraceCheckUtils]: 17: Hoare triple {9814#(not (= |ssl3_accept_#t~mem43| 16384))} assume 16384 == #t~mem43;havoc #t~mem43; {9809#false} is VALID [2022-04-08 08:38:10,902 INFO L290 TraceCheckUtils]: 18: Hoare triple {9809#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {9809#false} is VALID [2022-04-08 08:38:10,902 INFO L290 TraceCheckUtils]: 19: Hoare triple {9809#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {9809#false} is VALID [2022-04-08 08:38:10,902 INFO L290 TraceCheckUtils]: 20: Hoare triple {9809#false} call #t~mem77 := read~int(~s.base, ~s.offset, 4); {9809#false} is VALID [2022-04-08 08:38:10,902 INFO L290 TraceCheckUtils]: 21: Hoare triple {9809#false} assume !(3 != #t~mem77 / 256);havoc #t~mem77;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem78.base, #t~mem78.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {9809#false} is VALID [2022-04-08 08:38:10,902 INFO L290 TraceCheckUtils]: 22: Hoare triple {9809#false} assume 0 == (#t~mem78.base + #t~mem78.offset) % 4294967296;havoc #t~mem78.base, #t~mem78.offset;assume -2147483648 <= #t~nondet79 && #t~nondet79 <= 2147483647;~tmp___3~0 := #t~nondet79;havoc #t~nondet79; {9809#false} is VALID [2022-04-08 08:38:10,903 INFO L290 TraceCheckUtils]: 23: Hoare triple {9809#false} assume !(0 == ~tmp___3~0);call write~$Pointer$(~buf~0.base, ~buf~0.offset, ~s.base, 60 + ~s.offset, 4); {9809#false} is VALID [2022-04-08 08:38:10,903 INFO L290 TraceCheckUtils]: 24: Hoare triple {9809#false} assume -2147483648 <= #t~nondet80 && #t~nondet80 <= 2147483647;~tmp___4~0 := #t~nondet80;havoc #t~nondet80; {9809#false} is VALID [2022-04-08 08:38:10,903 INFO L290 TraceCheckUtils]: 25: Hoare triple {9809#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem81 := read~int(~s.base, 52 + ~s.offset, 4); {9809#false} is VALID [2022-04-08 08:38:10,903 INFO L290 TraceCheckUtils]: 26: Hoare triple {9809#false} assume !(12292 != #t~mem81);havoc #t~mem81;call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem86 := read~int(#t~mem85.base, 76 + #t~mem85.offset, 4);call write~int(1 + #t~mem86, #t~mem85.base, 76 + #t~mem85.offset, 4);havoc #t~mem85.base, #t~mem85.offset;havoc #t~mem86;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {9809#false} is VALID [2022-04-08 08:38:10,903 INFO L290 TraceCheckUtils]: 27: Hoare triple {9809#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {9809#false} is VALID [2022-04-08 08:38:10,903 INFO L290 TraceCheckUtils]: 28: Hoare triple {9809#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {9809#false} is VALID [2022-04-08 08:38:10,903 INFO L290 TraceCheckUtils]: 29: Hoare triple {9809#false} ~skip~0 := 0; {9809#false} is VALID [2022-04-08 08:38:10,903 INFO L290 TraceCheckUtils]: 30: Hoare triple {9809#false} assume !false; {9809#false} is VALID [2022-04-08 08:38:10,903 INFO L290 TraceCheckUtils]: 31: Hoare triple {9809#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {9809#false} is VALID [2022-04-08 08:38:10,903 INFO L290 TraceCheckUtils]: 32: Hoare triple {9809#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {9809#false} is VALID [2022-04-08 08:38:10,904 INFO L290 TraceCheckUtils]: 33: Hoare triple {9809#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {9809#false} is VALID [2022-04-08 08:38:10,904 INFO L290 TraceCheckUtils]: 34: Hoare triple {9809#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {9809#false} is VALID [2022-04-08 08:38:10,904 INFO L290 TraceCheckUtils]: 35: Hoare triple {9809#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {9809#false} is VALID [2022-04-08 08:38:10,904 INFO L290 TraceCheckUtils]: 36: Hoare triple {9809#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {9809#false} is VALID [2022-04-08 08:38:10,904 INFO L290 TraceCheckUtils]: 37: Hoare triple {9809#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {9809#false} is VALID [2022-04-08 08:38:10,904 INFO L290 TraceCheckUtils]: 38: Hoare triple {9809#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {9809#false} is VALID [2022-04-08 08:38:10,904 INFO L290 TraceCheckUtils]: 39: Hoare triple {9809#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {9809#false} is VALID [2022-04-08 08:38:10,904 INFO L290 TraceCheckUtils]: 40: Hoare triple {9809#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {9809#false} is VALID [2022-04-08 08:38:10,904 INFO L290 TraceCheckUtils]: 41: Hoare triple {9809#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {9809#false} is VALID [2022-04-08 08:38:10,904 INFO L290 TraceCheckUtils]: 42: Hoare triple {9809#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {9809#false} is VALID [2022-04-08 08:38:10,904 INFO L290 TraceCheckUtils]: 43: Hoare triple {9809#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {9809#false} is VALID [2022-04-08 08:38:10,905 INFO L290 TraceCheckUtils]: 44: Hoare triple {9809#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {9809#false} is VALID [2022-04-08 08:38:10,905 INFO L290 TraceCheckUtils]: 45: Hoare triple {9809#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {9809#false} is VALID [2022-04-08 08:38:10,905 INFO L290 TraceCheckUtils]: 46: Hoare triple {9809#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {9809#false} is VALID [2022-04-08 08:38:10,905 INFO L290 TraceCheckUtils]: 47: Hoare triple {9809#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {9809#false} is VALID [2022-04-08 08:38:10,905 INFO L290 TraceCheckUtils]: 48: Hoare triple {9809#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {9809#false} is VALID [2022-04-08 08:38:10,905 INFO L290 TraceCheckUtils]: 49: Hoare triple {9809#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {9809#false} is VALID [2022-04-08 08:38:10,905 INFO L290 TraceCheckUtils]: 50: Hoare triple {9809#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {9809#false} is VALID [2022-04-08 08:38:10,905 INFO L290 TraceCheckUtils]: 51: Hoare triple {9809#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {9809#false} is VALID [2022-04-08 08:38:10,905 INFO L290 TraceCheckUtils]: 52: Hoare triple {9809#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {9809#false} is VALID [2022-04-08 08:38:10,905 INFO L290 TraceCheckUtils]: 53: Hoare triple {9809#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {9809#false} is VALID [2022-04-08 08:38:10,906 INFO L290 TraceCheckUtils]: 54: Hoare triple {9809#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {9809#false} is VALID [2022-04-08 08:38:10,906 INFO L290 TraceCheckUtils]: 55: Hoare triple {9809#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {9809#false} is VALID [2022-04-08 08:38:10,906 INFO L290 TraceCheckUtils]: 56: Hoare triple {9809#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {9809#false} is VALID [2022-04-08 08:38:10,906 INFO L290 TraceCheckUtils]: 57: Hoare triple {9809#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {9809#false} is VALID [2022-04-08 08:38:10,906 INFO L290 TraceCheckUtils]: 58: Hoare triple {9809#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {9809#false} is VALID [2022-04-08 08:38:10,906 INFO L290 TraceCheckUtils]: 59: Hoare triple {9809#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {9809#false} is VALID [2022-04-08 08:38:10,906 INFO L290 TraceCheckUtils]: 60: Hoare triple {9809#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {9809#false} is VALID [2022-04-08 08:38:10,906 INFO L290 TraceCheckUtils]: 61: Hoare triple {9809#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {9809#false} is VALID [2022-04-08 08:38:10,906 INFO L290 TraceCheckUtils]: 62: Hoare triple {9809#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {9809#false} is VALID [2022-04-08 08:38:10,906 INFO L290 TraceCheckUtils]: 63: Hoare triple {9809#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {9809#false} is VALID [2022-04-08 08:38:10,907 INFO L290 TraceCheckUtils]: 64: Hoare triple {9809#false} assume 8672 == #t~mem74;havoc #t~mem74; {9809#false} is VALID [2022-04-08 08:38:10,907 INFO L290 TraceCheckUtils]: 65: Hoare triple {9809#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {9809#false} is VALID [2022-04-08 08:38:10,907 INFO L290 TraceCheckUtils]: 66: Hoare triple {9809#false} assume 4 == ~blastFlag~0; {9809#false} is VALID [2022-04-08 08:38:10,907 INFO L290 TraceCheckUtils]: 67: Hoare triple {9809#false} assume !false; {9809#false} is VALID [2022-04-08 08:38:10,907 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:38:10,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:38:10,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238548059] [2022-04-08 08:38:10,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238548059] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:38:10,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:38:10,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:38:10,908 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:38:10,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [442864729] [2022-04-08 08:38:10,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [442864729] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:38:10,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:38:10,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:38:10,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57276080] [2022-04-08 08:38:10,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:38:10,909 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-08 08:38:10,909 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:38:10,909 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-08 08:38:10,972 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-08 08:38:10,972 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:38:10,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:38:10,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:38:10,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:38:10,973 INFO L87 Difference]: Start difference. First operand 177 states and 263 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-08 08:38:13,004 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:38:14,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:38:14,729 INFO L93 Difference]: Finished difference Result 417 states and 630 transitions. [2022-04-08 08:38:14,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:38:14,730 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-08 08:38:14,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:38:14,730 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-08 08:38:14,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 575 transitions. [2022-04-08 08:38:14,734 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-08 08:38:14,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 575 transitions. [2022-04-08 08:38:14,738 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 575 transitions. [2022-04-08 08:38:15,249 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 575 edges. 575 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:38:15,255 INFO L225 Difference]: With dead ends: 417 [2022-04-08 08:38:15,255 INFO L226 Difference]: Without dead ends: 268 [2022-04-08 08:38:15,256 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:38:15,256 INFO L913 BasicCegarLoop]: 110 mSDtfsCounter, 143 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 64 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-08 08:38:15,256 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 321 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 466 Invalid, 1 Unknown, 0 Unchecked, 2.7s Time] [2022-04-08 08:38:15,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-04-08 08:38:15,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 169. [2022-04-08 08:38:15,263 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:38:15,264 INFO L82 GeneralOperation]: Start isEquivalent. First operand 268 states. Second operand has 169 states, 164 states have (on average 1.5060975609756098) internal successors, (247), 164 states have internal predecessors, (247), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:38:15,264 INFO L74 IsIncluded]: Start isIncluded. First operand 268 states. Second operand has 169 states, 164 states have (on average 1.5060975609756098) internal successors, (247), 164 states have internal predecessors, (247), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:38:15,265 INFO L87 Difference]: Start difference. First operand 268 states. Second operand has 169 states, 164 states have (on average 1.5060975609756098) internal successors, (247), 164 states have internal predecessors, (247), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:38:15,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:38:15,270 INFO L93 Difference]: Finished difference Result 268 states and 401 transitions. [2022-04-08 08:38:15,270 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 401 transitions. [2022-04-08 08:38:15,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:38:15,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:38:15,272 INFO L74 IsIncluded]: Start isIncluded. First operand has 169 states, 164 states have (on average 1.5060975609756098) internal successors, (247), 164 states have internal predecessors, (247), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 268 states. [2022-04-08 08:38:15,272 INFO L87 Difference]: Start difference. First operand has 169 states, 164 states have (on average 1.5060975609756098) internal successors, (247), 164 states have internal predecessors, (247), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 268 states. [2022-04-08 08:38:15,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:38:15,278 INFO L93 Difference]: Finished difference Result 268 states and 401 transitions. [2022-04-08 08:38:15,278 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 401 transitions. [2022-04-08 08:38:15,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:38:15,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:38:15,278 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:38:15,278 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:38:15,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 164 states have (on average 1.5060975609756098) internal successors, (247), 164 states have internal predecessors, (247), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:38:15,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 251 transitions. [2022-04-08 08:38:15,282 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 251 transitions. Word has length 68 [2022-04-08 08:38:15,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:38:15,282 INFO L478 AbstractCegarLoop]: Abstraction has 169 states and 251 transitions. [2022-04-08 08:38:15,283 INFO L479 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-08 08:38:15,283 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 169 states and 251 transitions. [2022-04-08 08:38:15,479 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 251 edges. 251 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:38:15,479 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 251 transitions. [2022-04-08 08:38:15,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-08 08:38:15,480 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:38:15,480 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:38:15,480 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-08 08:38:15,480 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:38:15,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:38:15,480 INFO L85 PathProgramCache]: Analyzing trace with hash -175906935, now seen corresponding path program 1 times [2022-04-08 08:38:15,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:38:15,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1826408266] [2022-04-08 08:38:15,649 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 21 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 08:38:15,649 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 08:38:15,650 INFO L85 PathProgramCache]: Analyzing trace with hash -644878972, now seen corresponding path program 1 times [2022-04-08 08:38:15,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:38:15,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802560640] [2022-04-08 08:38:15,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:38:15,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:38:15,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:38:15,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:38:15,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:38:15,818 INFO L290 TraceCheckUtils]: 0: Hoare triple {11534#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {11528#true} is VALID [2022-04-08 08:38:15,818 INFO L290 TraceCheckUtils]: 1: Hoare triple {11528#true} assume true; {11528#true} is VALID [2022-04-08 08:38:15,818 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11528#true} {11528#true} #664#return; {11528#true} is VALID [2022-04-08 08:38:15,835 INFO L272 TraceCheckUtils]: 0: Hoare triple {11528#true} call ULTIMATE.init(); {11534#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:38:15,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {11534#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {11528#true} is VALID [2022-04-08 08:38:15,836 INFO L290 TraceCheckUtils]: 2: Hoare triple {11528#true} assume true; {11528#true} is VALID [2022-04-08 08:38:15,836 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11528#true} {11528#true} #664#return; {11528#true} is VALID [2022-04-08 08:38:15,836 INFO L272 TraceCheckUtils]: 4: Hoare triple {11528#true} call #t~ret162 := main(); {11528#true} is VALID [2022-04-08 08:38:15,836 INFO L290 TraceCheckUtils]: 5: Hoare triple {11528#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {11528#true} is VALID [2022-04-08 08:38:15,836 INFO L290 TraceCheckUtils]: 6: Hoare triple {11528#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {11528#true} is VALID [2022-04-08 08:38:15,836 INFO L272 TraceCheckUtils]: 7: Hoare triple {11528#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {11528#true} is VALID [2022-04-08 08:38:15,837 INFO L290 TraceCheckUtils]: 8: Hoare triple {11528#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;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~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~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~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {11533#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:15,837 INFO L290 TraceCheckUtils]: 9: Hoare triple {11533#(= ssl3_accept_~blastFlag~0 0)} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {11533#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:15,837 INFO L290 TraceCheckUtils]: 10: Hoare triple {11533#(= ssl3_accept_~blastFlag~0 0)} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {11533#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:15,838 INFO L290 TraceCheckUtils]: 11: Hoare triple {11533#(= ssl3_accept_~blastFlag~0 0)} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {11533#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:15,838 INFO L290 TraceCheckUtils]: 12: Hoare triple {11533#(= ssl3_accept_~blastFlag~0 0)} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {11533#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:15,838 INFO L290 TraceCheckUtils]: 13: Hoare triple {11533#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {11533#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:15,839 INFO L290 TraceCheckUtils]: 14: Hoare triple {11533#(= ssl3_accept_~blastFlag~0 0)} [674] L1166-2-->L1167_primed: Formula: true InVars {} OutVars{ssl3_accept_#t~mem81=|v_ssl3_accept_#t~mem81_22|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_337|, ssl3_accept_#t~mem78.base=|v_ssl3_accept_#t~mem78.base_22|, ssl3_accept_#t~mem41=|v_ssl3_accept_#t~mem41_16|, ssl3_accept_#t~mem151.base=|v_ssl3_accept_#t~mem151.base_24|, ssl3_accept_~tmp___4~0=v_ssl3_accept_~tmp___4~0_15, ssl3_accept_#t~mem85.base=|v_ssl3_accept_#t~mem85.base_13|, ssl3_accept_#t~nondet80=|v_ssl3_accept_#t~nondet80_19|, ssl3_accept_#t~mem78.offset=|v_ssl3_accept_#t~mem78.offset_22|, ssl3_accept_#t~mem44=|v_ssl3_accept_#t~mem44_12|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_26, ssl3_accept_#t~mem43=|v_ssl3_accept_#t~mem43_26|, ssl3_accept_#t~mem42=|v_ssl3_accept_#t~mem42_28|, ssl3_accept_#t~mem152=|v_ssl3_accept_#t~mem152_26|, ssl3_accept_#t~mem151.offset=|v_ssl3_accept_#t~mem151.offset_24|, #memory_int=|v_#memory_int_318|, ssl3_accept_#t~mem86=|v_ssl3_accept_#t~mem86_13|, ssl3_accept_#t~mem77=|v_ssl3_accept_#t~mem77_22|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_337|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_18, ssl3_accept_#t~mem85.offset=|v_ssl3_accept_#t~mem85.offset_13|} AuxVars[] AssignedVars[ssl3_accept_#t~mem81, #memory_$Pointer$.base, ssl3_accept_#t~mem78.base, ssl3_accept_#t~mem41, ssl3_accept_#t~mem151.base, ssl3_accept_~tmp___4~0, ssl3_accept_#t~mem85.base, ssl3_accept_#t~nondet80, ssl3_accept_#t~mem78.offset, ssl3_accept_#t~mem44, ssl3_accept_~skip~0, ssl3_accept_#t~mem43, ssl3_accept_#t~mem42, ssl3_accept_#t~mem152, ssl3_accept_#t~mem151.offset, #memory_int, ssl3_accept_#t~mem86, ssl3_accept_#t~mem77, #memory_$Pointer$.offset, ssl3_accept_~state~0, ssl3_accept_#t~mem85.offset] {11533#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:15,839 INFO L290 TraceCheckUtils]: 15: Hoare triple {11533#(= ssl3_accept_~blastFlag~0 0)} [673] L1167_primed-->L1167: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11533#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:15,839 INFO L290 TraceCheckUtils]: 16: Hoare triple {11533#(= ssl3_accept_~blastFlag~0 0)} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {11533#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:15,840 INFO L290 TraceCheckUtils]: 17: Hoare triple {11533#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {11533#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:15,840 INFO L290 TraceCheckUtils]: 18: Hoare triple {11533#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {11533#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:15,840 INFO L290 TraceCheckUtils]: 19: Hoare triple {11533#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {11533#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:15,841 INFO L290 TraceCheckUtils]: 20: Hoare triple {11533#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {11533#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:15,841 INFO L290 TraceCheckUtils]: 21: Hoare triple {11533#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {11533#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:15,841 INFO L290 TraceCheckUtils]: 22: Hoare triple {11533#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {11533#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:15,842 INFO L290 TraceCheckUtils]: 23: Hoare triple {11533#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {11533#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:15,842 INFO L290 TraceCheckUtils]: 24: Hoare triple {11533#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {11533#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:15,842 INFO L290 TraceCheckUtils]: 25: Hoare triple {11533#(= ssl3_accept_~blastFlag~0 0)} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {11533#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:15,843 INFO L290 TraceCheckUtils]: 26: Hoare triple {11533#(= ssl3_accept_~blastFlag~0 0)} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {11533#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:15,843 INFO L290 TraceCheckUtils]: 27: Hoare triple {11533#(= ssl3_accept_~blastFlag~0 0)} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {11533#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:15,843 INFO L290 TraceCheckUtils]: 28: Hoare triple {11533#(= ssl3_accept_~blastFlag~0 0)} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {11533#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:15,844 INFO L290 TraceCheckUtils]: 29: Hoare triple {11533#(= ssl3_accept_~blastFlag~0 0)} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {11533#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:15,844 INFO L290 TraceCheckUtils]: 30: Hoare triple {11533#(= ssl3_accept_~blastFlag~0 0)} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {11533#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:15,844 INFO L290 TraceCheckUtils]: 31: Hoare triple {11533#(= ssl3_accept_~blastFlag~0 0)} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {11533#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:15,845 INFO L290 TraceCheckUtils]: 32: Hoare triple {11533#(= ssl3_accept_~blastFlag~0 0)} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {11533#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:15,845 INFO L290 TraceCheckUtils]: 33: Hoare triple {11533#(= ssl3_accept_~blastFlag~0 0)} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {11533#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:15,845 INFO L290 TraceCheckUtils]: 34: Hoare triple {11533#(= ssl3_accept_~blastFlag~0 0)} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {11533#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:15,846 INFO L290 TraceCheckUtils]: 35: Hoare triple {11533#(= ssl3_accept_~blastFlag~0 0)} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {11533#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:15,846 INFO L290 TraceCheckUtils]: 36: Hoare triple {11533#(= ssl3_accept_~blastFlag~0 0)} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {11533#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:15,846 INFO L290 TraceCheckUtils]: 37: Hoare triple {11533#(= ssl3_accept_~blastFlag~0 0)} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {11533#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:15,847 INFO L290 TraceCheckUtils]: 38: Hoare triple {11533#(= ssl3_accept_~blastFlag~0 0)} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {11533#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:15,847 INFO L290 TraceCheckUtils]: 39: Hoare triple {11533#(= ssl3_accept_~blastFlag~0 0)} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {11533#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:15,847 INFO L290 TraceCheckUtils]: 40: Hoare triple {11533#(= ssl3_accept_~blastFlag~0 0)} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {11533#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:15,848 INFO L290 TraceCheckUtils]: 41: Hoare triple {11533#(= ssl3_accept_~blastFlag~0 0)} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {11533#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:15,848 INFO L290 TraceCheckUtils]: 42: Hoare triple {11533#(= ssl3_accept_~blastFlag~0 0)} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {11533#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:15,848 INFO L290 TraceCheckUtils]: 43: Hoare triple {11533#(= ssl3_accept_~blastFlag~0 0)} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {11533#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:15,848 INFO L290 TraceCheckUtils]: 44: Hoare triple {11533#(= ssl3_accept_~blastFlag~0 0)} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {11533#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:15,849 INFO L290 TraceCheckUtils]: 45: Hoare triple {11533#(= ssl3_accept_~blastFlag~0 0)} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {11533#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:15,849 INFO L290 TraceCheckUtils]: 46: Hoare triple {11533#(= ssl3_accept_~blastFlag~0 0)} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {11533#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:15,849 INFO L290 TraceCheckUtils]: 47: Hoare triple {11533#(= ssl3_accept_~blastFlag~0 0)} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {11533#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:15,850 INFO L290 TraceCheckUtils]: 48: Hoare triple {11533#(= ssl3_accept_~blastFlag~0 0)} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {11533#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:15,850 INFO L290 TraceCheckUtils]: 49: Hoare triple {11533#(= ssl3_accept_~blastFlag~0 0)} assume 8672 == #t~mem74;havoc #t~mem74; {11533#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:15,850 INFO L290 TraceCheckUtils]: 50: Hoare triple {11533#(= ssl3_accept_~blastFlag~0 0)} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {11533#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:15,851 INFO L290 TraceCheckUtils]: 51: Hoare triple {11533#(= ssl3_accept_~blastFlag~0 0)} assume 4 == ~blastFlag~0; {11529#false} is VALID [2022-04-08 08:38:15,851 INFO L290 TraceCheckUtils]: 52: Hoare triple {11529#false} assume !false; {11529#false} is VALID [2022-04-08 08:38:15,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:38:15,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:38:15,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802560640] [2022-04-08 08:38:15,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802560640] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:38:15,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:38:15,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:38:19,476 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:38:19,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1826408266] [2022-04-08 08:38:19,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1826408266] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:38:19,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:38:19,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 08:38:19,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764793319] [2022-04-08 08:38:19,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:38:19,477 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 14 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-08 08:38:19,477 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:38:19,478 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 14 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-08 08:38:19,551 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-08 08:38:19,551 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 08:38:19,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:38:19,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 08:38:19,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=150, Unknown=1, NotChecked=0, Total=210 [2022-04-08 08:38:19,552 INFO L87 Difference]: Start difference. First operand 169 states and 251 transitions. Second operand has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 14 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-08 08:38:21,571 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:38:22,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:38:22,520 INFO L93 Difference]: Finished difference Result 321 states and 482 transitions. [2022-04-08 08:38:22,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 08:38:22,521 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 14 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-08 08:38:22,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:38:22,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 14 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-08 08:38:22,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 428 transitions. [2022-04-08 08:38:22,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 14 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-08 08:38:22,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 428 transitions. [2022-04-08 08:38:22,530 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 428 transitions. [2022-04-08 08:38:22,897 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 428 edges. 428 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:38:22,900 INFO L225 Difference]: With dead ends: 321 [2022-04-08 08:38:22,900 INFO L226 Difference]: Without dead ends: 180 [2022-04-08 08:38:22,900 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=59, Invalid=150, Unknown=1, NotChecked=0, Total=210 [2022-04-08 08:38:22,901 INFO L913 BasicCegarLoop]: 193 mSDtfsCounter, 15 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-08 08:38:22,901 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 454 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 259 Invalid, 1 Unknown, 30 Unchecked, 2.3s Time] [2022-04-08 08:38:22,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-04-08 08:38:22,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 177. [2022-04-08 08:38:22,912 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:38:22,913 INFO L82 GeneralOperation]: Start isEquivalent. First operand 180 states. Second operand has 177 states, 172 states have (on average 1.494186046511628) internal successors, (257), 172 states have internal predecessors, (257), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:38:22,913 INFO L74 IsIncluded]: Start isIncluded. First operand 180 states. Second operand has 177 states, 172 states have (on average 1.494186046511628) internal successors, (257), 172 states have internal predecessors, (257), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:38:22,914 INFO L87 Difference]: Start difference. First operand 180 states. Second operand has 177 states, 172 states have (on average 1.494186046511628) internal successors, (257), 172 states have internal predecessors, (257), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:38:22,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:38:22,917 INFO L93 Difference]: Finished difference Result 180 states and 265 transitions. [2022-04-08 08:38:22,917 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 265 transitions. [2022-04-08 08:38:22,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:38:22,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:38:22,918 INFO L74 IsIncluded]: Start isIncluded. First operand has 177 states, 172 states have (on average 1.494186046511628) internal successors, (257), 172 states have internal predecessors, (257), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 180 states. [2022-04-08 08:38:22,918 INFO L87 Difference]: Start difference. First operand has 177 states, 172 states have (on average 1.494186046511628) internal successors, (257), 172 states have internal predecessors, (257), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 180 states. [2022-04-08 08:38:22,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:38:22,921 INFO L93 Difference]: Finished difference Result 180 states and 265 transitions. [2022-04-08 08:38:22,921 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 265 transitions. [2022-04-08 08:38:22,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:38:22,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:38:22,922 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:38:22,922 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:38:22,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 172 states have (on average 1.494186046511628) internal successors, (257), 172 states have internal predecessors, (257), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:38:22,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 261 transitions. [2022-04-08 08:38:22,926 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 261 transitions. Word has length 68 [2022-04-08 08:38:22,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:38:22,926 INFO L478 AbstractCegarLoop]: Abstraction has 177 states and 261 transitions. [2022-04-08 08:38:22,926 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 14 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-08 08:38:22,926 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 177 states and 261 transitions. [2022-04-08 08:38:23,170 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 261 edges. 261 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:38:23,171 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 261 transitions. [2022-04-08 08:38:23,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-08 08:38:23,171 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:38:23,171 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:38:23,172 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-08 08:38:23,172 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:38:23,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:38:23,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1763255111, now seen corresponding path program 1 times [2022-04-08 08:38:23,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:38:23,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2028935583] [2022-04-08 08:38:23,372 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 21 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 08:38:23,373 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 08:38:23,373 INFO L85 PathProgramCache]: Analyzing trace with hash 775361860, now seen corresponding path program 1 times [2022-04-08 08:38:23,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:38:23,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159458237] [2022-04-08 08:38:23,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:38:23,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:38:23,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:38:23,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:38:23,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:38:23,510 INFO L290 TraceCheckUtils]: 0: Hoare triple {12910#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {12904#true} is VALID [2022-04-08 08:38:23,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {12904#true} assume true; {12904#true} is VALID [2022-04-08 08:38:23,510 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12904#true} {12904#true} #664#return; {12904#true} is VALID [2022-04-08 08:38:23,511 INFO L272 TraceCheckUtils]: 0: Hoare triple {12904#true} call ULTIMATE.init(); {12910#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:38:23,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {12910#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {12904#true} is VALID [2022-04-08 08:38:23,511 INFO L290 TraceCheckUtils]: 2: Hoare triple {12904#true} assume true; {12904#true} is VALID [2022-04-08 08:38:23,511 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12904#true} {12904#true} #664#return; {12904#true} is VALID [2022-04-08 08:38:23,511 INFO L272 TraceCheckUtils]: 4: Hoare triple {12904#true} call #t~ret162 := main(); {12904#true} is VALID [2022-04-08 08:38:23,512 INFO L290 TraceCheckUtils]: 5: Hoare triple {12904#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {12904#true} is VALID [2022-04-08 08:38:23,512 INFO L290 TraceCheckUtils]: 6: Hoare triple {12904#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {12904#true} is VALID [2022-04-08 08:38:23,512 INFO L272 TraceCheckUtils]: 7: Hoare triple {12904#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {12904#true} is VALID [2022-04-08 08:38:23,512 INFO L290 TraceCheckUtils]: 8: Hoare triple {12904#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;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~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~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~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {12909#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:23,512 INFO L290 TraceCheckUtils]: 9: Hoare triple {12909#(= ssl3_accept_~blastFlag~0 0)} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {12909#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:23,513 INFO L290 TraceCheckUtils]: 10: Hoare triple {12909#(= ssl3_accept_~blastFlag~0 0)} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {12909#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:23,513 INFO L290 TraceCheckUtils]: 11: Hoare triple {12909#(= ssl3_accept_~blastFlag~0 0)} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {12909#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:23,513 INFO L290 TraceCheckUtils]: 12: Hoare triple {12909#(= ssl3_accept_~blastFlag~0 0)} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {12909#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:23,514 INFO L290 TraceCheckUtils]: 13: Hoare triple {12909#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {12909#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:23,514 INFO L290 TraceCheckUtils]: 14: Hoare triple {12909#(= ssl3_accept_~blastFlag~0 0)} [676] L1166-2-->L1167_primed: Formula: true InVars {} OutVars{ssl3_accept_#t~mem81=|v_ssl3_accept_#t~mem81_28|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_356|, ssl3_accept_#t~mem78.base=|v_ssl3_accept_#t~mem78.base_28|, ssl3_accept_#t~mem41=|v_ssl3_accept_#t~mem41_20|, ssl3_accept_#t~mem151.base=|v_ssl3_accept_#t~mem151.base_29|, ssl3_accept_~tmp___4~0=v_ssl3_accept_~tmp___4~0_19, ssl3_accept_#t~mem85.base=|v_ssl3_accept_#t~mem85.base_17|, ssl3_accept_#t~nondet80=|v_ssl3_accept_#t~nondet80_25|, ssl3_accept_#t~mem78.offset=|v_ssl3_accept_#t~mem78.offset_28|, ssl3_accept_#t~mem44=|v_ssl3_accept_#t~mem44_18|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_30, ssl3_accept_#t~mem43=|v_ssl3_accept_#t~mem43_32|, ssl3_accept_#t~mem42=|v_ssl3_accept_#t~mem42_34|, ssl3_accept_#t~mem152=|v_ssl3_accept_#t~mem152_31|, ssl3_accept_#t~mem151.offset=|v_ssl3_accept_#t~mem151.offset_29|, #memory_int=|v_#memory_int_336|, ssl3_accept_#t~mem86=|v_ssl3_accept_#t~mem86_17|, ssl3_accept_#t~mem77=|v_ssl3_accept_#t~mem77_28|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_356|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_22, ssl3_accept_#t~mem85.offset=|v_ssl3_accept_#t~mem85.offset_17|} AuxVars[] AssignedVars[ssl3_accept_#t~mem81, #memory_$Pointer$.base, ssl3_accept_#t~mem78.base, ssl3_accept_#t~mem41, ssl3_accept_#t~mem151.base, ssl3_accept_~tmp___4~0, ssl3_accept_#t~mem85.base, ssl3_accept_#t~nondet80, ssl3_accept_#t~mem78.offset, ssl3_accept_#t~mem44, ssl3_accept_~skip~0, ssl3_accept_#t~mem43, ssl3_accept_#t~mem42, ssl3_accept_#t~mem152, ssl3_accept_#t~mem151.offset, #memory_int, ssl3_accept_#t~mem86, ssl3_accept_#t~mem77, #memory_$Pointer$.offset, ssl3_accept_~state~0, ssl3_accept_#t~mem85.offset] {12909#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:23,514 INFO L290 TraceCheckUtils]: 15: Hoare triple {12909#(= ssl3_accept_~blastFlag~0 0)} [675] L1167_primed-->L1167: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12909#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:23,515 INFO L290 TraceCheckUtils]: 16: Hoare triple {12909#(= ssl3_accept_~blastFlag~0 0)} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {12909#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:23,515 INFO L290 TraceCheckUtils]: 17: Hoare triple {12909#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {12909#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:23,515 INFO L290 TraceCheckUtils]: 18: Hoare triple {12909#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {12909#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:23,516 INFO L290 TraceCheckUtils]: 19: Hoare triple {12909#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {12909#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:23,516 INFO L290 TraceCheckUtils]: 20: Hoare triple {12909#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {12909#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:23,516 INFO L290 TraceCheckUtils]: 21: Hoare triple {12909#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {12909#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:23,517 INFO L290 TraceCheckUtils]: 22: Hoare triple {12909#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {12909#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:23,517 INFO L290 TraceCheckUtils]: 23: Hoare triple {12909#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {12909#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:23,517 INFO L290 TraceCheckUtils]: 24: Hoare triple {12909#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {12909#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:23,518 INFO L290 TraceCheckUtils]: 25: Hoare triple {12909#(= ssl3_accept_~blastFlag~0 0)} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {12909#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:23,518 INFO L290 TraceCheckUtils]: 26: Hoare triple {12909#(= ssl3_accept_~blastFlag~0 0)} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {12909#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:23,518 INFO L290 TraceCheckUtils]: 27: Hoare triple {12909#(= ssl3_accept_~blastFlag~0 0)} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {12909#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:23,519 INFO L290 TraceCheckUtils]: 28: Hoare triple {12909#(= ssl3_accept_~blastFlag~0 0)} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {12909#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:23,519 INFO L290 TraceCheckUtils]: 29: Hoare triple {12909#(= ssl3_accept_~blastFlag~0 0)} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {12909#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:23,520 INFO L290 TraceCheckUtils]: 30: Hoare triple {12909#(= ssl3_accept_~blastFlag~0 0)} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {12909#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:23,520 INFO L290 TraceCheckUtils]: 31: Hoare triple {12909#(= ssl3_accept_~blastFlag~0 0)} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {12909#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:23,520 INFO L290 TraceCheckUtils]: 32: Hoare triple {12909#(= ssl3_accept_~blastFlag~0 0)} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {12909#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:23,521 INFO L290 TraceCheckUtils]: 33: Hoare triple {12909#(= ssl3_accept_~blastFlag~0 0)} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {12909#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:23,521 INFO L290 TraceCheckUtils]: 34: Hoare triple {12909#(= ssl3_accept_~blastFlag~0 0)} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {12909#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:23,521 INFO L290 TraceCheckUtils]: 35: Hoare triple {12909#(= ssl3_accept_~blastFlag~0 0)} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {12909#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:23,521 INFO L290 TraceCheckUtils]: 36: Hoare triple {12909#(= ssl3_accept_~blastFlag~0 0)} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {12909#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:23,522 INFO L290 TraceCheckUtils]: 37: Hoare triple {12909#(= ssl3_accept_~blastFlag~0 0)} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {12909#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:23,522 INFO L290 TraceCheckUtils]: 38: Hoare triple {12909#(= ssl3_accept_~blastFlag~0 0)} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {12909#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:23,522 INFO L290 TraceCheckUtils]: 39: Hoare triple {12909#(= ssl3_accept_~blastFlag~0 0)} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {12909#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:23,523 INFO L290 TraceCheckUtils]: 40: Hoare triple {12909#(= ssl3_accept_~blastFlag~0 0)} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {12909#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:23,523 INFO L290 TraceCheckUtils]: 41: Hoare triple {12909#(= ssl3_accept_~blastFlag~0 0)} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {12909#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:23,523 INFO L290 TraceCheckUtils]: 42: Hoare triple {12909#(= ssl3_accept_~blastFlag~0 0)} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {12909#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:23,524 INFO L290 TraceCheckUtils]: 43: Hoare triple {12909#(= ssl3_accept_~blastFlag~0 0)} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {12909#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:23,524 INFO L290 TraceCheckUtils]: 44: Hoare triple {12909#(= ssl3_accept_~blastFlag~0 0)} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {12909#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:23,524 INFO L290 TraceCheckUtils]: 45: Hoare triple {12909#(= ssl3_accept_~blastFlag~0 0)} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {12909#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:23,525 INFO L290 TraceCheckUtils]: 46: Hoare triple {12909#(= ssl3_accept_~blastFlag~0 0)} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {12909#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:23,525 INFO L290 TraceCheckUtils]: 47: Hoare triple {12909#(= ssl3_accept_~blastFlag~0 0)} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {12909#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:23,525 INFO L290 TraceCheckUtils]: 48: Hoare triple {12909#(= ssl3_accept_~blastFlag~0 0)} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {12909#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:23,526 INFO L290 TraceCheckUtils]: 49: Hoare triple {12909#(= ssl3_accept_~blastFlag~0 0)} assume 8672 == #t~mem74;havoc #t~mem74; {12909#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:23,526 INFO L290 TraceCheckUtils]: 50: Hoare triple {12909#(= ssl3_accept_~blastFlag~0 0)} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {12909#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:23,526 INFO L290 TraceCheckUtils]: 51: Hoare triple {12909#(= ssl3_accept_~blastFlag~0 0)} assume 4 == ~blastFlag~0; {12905#false} is VALID [2022-04-08 08:38:23,527 INFO L290 TraceCheckUtils]: 52: Hoare triple {12905#false} assume !false; {12905#false} is VALID [2022-04-08 08:38:23,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:38:23,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:38:23,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159458237] [2022-04-08 08:38:23,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159458237] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:38:23,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:38:23,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:38:27,535 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:38:27,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2028935583] [2022-04-08 08:38:27,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2028935583] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:38:27,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:38:27,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 08:38:27,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756920956] [2022-04-08 08:38:27,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:38:27,536 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 14 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-08 08:38:27,537 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:38:27,537 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 14 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-08 08:38:27,605 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-08 08:38:27,605 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 08:38:27,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:38:27,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 08:38:27,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=150, Unknown=1, NotChecked=0, Total=210 [2022-04-08 08:38:27,606 INFO L87 Difference]: Start difference. First operand 177 states and 261 transitions. Second operand has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 14 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-08 08:38:29,654 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:38:31,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:38:31,529 INFO L93 Difference]: Finished difference Result 327 states and 489 transitions. [2022-04-08 08:38:31,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 08:38:31,529 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 14 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-08 08:38:31,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:38:31,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 14 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-08 08:38:31,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 429 transitions. [2022-04-08 08:38:31,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 14 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-08 08:38:31,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 429 transitions. [2022-04-08 08:38:31,536 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 429 transitions. [2022-04-08 08:38:31,856 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 429 edges. 429 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:38:31,858 INFO L225 Difference]: With dead ends: 327 [2022-04-08 08:38:31,859 INFO L226 Difference]: Without dead ends: 186 [2022-04-08 08:38:31,859 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=59, Invalid=150, Unknown=1, NotChecked=0, Total=210 [2022-04-08 08:38:31,860 INFO L913 BasicCegarLoop]: 199 mSDtfsCounter, 14 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 262 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-08 08:38:31,860 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 783 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 464 Invalid, 1 Unknown, 262 Unchecked, 2.6s Time] [2022-04-08 08:38:31,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-04-08 08:38:31,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 177. [2022-04-08 08:38:31,871 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:38:31,871 INFO L82 GeneralOperation]: Start isEquivalent. First operand 186 states. Second operand has 177 states, 172 states have (on average 1.494186046511628) internal successors, (257), 172 states have internal predecessors, (257), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:38:31,871 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states. Second operand has 177 states, 172 states have (on average 1.494186046511628) internal successors, (257), 172 states have internal predecessors, (257), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:38:31,872 INFO L87 Difference]: Start difference. First operand 186 states. Second operand has 177 states, 172 states have (on average 1.494186046511628) internal successors, (257), 172 states have internal predecessors, (257), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:38:31,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:38:31,875 INFO L93 Difference]: Finished difference Result 186 states and 272 transitions. [2022-04-08 08:38:31,875 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 272 transitions. [2022-04-08 08:38:31,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:38:31,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:38:31,877 INFO L74 IsIncluded]: Start isIncluded. First operand has 177 states, 172 states have (on average 1.494186046511628) internal successors, (257), 172 states have internal predecessors, (257), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 186 states. [2022-04-08 08:38:31,877 INFO L87 Difference]: Start difference. First operand has 177 states, 172 states have (on average 1.494186046511628) internal successors, (257), 172 states have internal predecessors, (257), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 186 states. [2022-04-08 08:38:31,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:38:31,880 INFO L93 Difference]: Finished difference Result 186 states and 272 transitions. [2022-04-08 08:38:31,880 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 272 transitions. [2022-04-08 08:38:31,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:38:31,881 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:38:31,881 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:38:31,881 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:38:31,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 172 states have (on average 1.494186046511628) internal successors, (257), 172 states have internal predecessors, (257), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:38:31,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 261 transitions. [2022-04-08 08:38:31,885 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 261 transitions. Word has length 68 [2022-04-08 08:38:31,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:38:31,885 INFO L478 AbstractCegarLoop]: Abstraction has 177 states and 261 transitions. [2022-04-08 08:38:31,885 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 14 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-08 08:38:31,885 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 177 states and 261 transitions. [2022-04-08 08:38:32,143 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 261 edges. 261 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:38:32,144 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 261 transitions. [2022-04-08 08:38:32,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-08 08:38:32,144 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:38:32,144 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:38:32,145 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-08 08:38:32,145 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:38:32,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:38:32,145 INFO L85 PathProgramCache]: Analyzing trace with hash 253718915, now seen corresponding path program 1 times [2022-04-08 08:38:32,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:38:32,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [539302027] [2022-04-08 08:38:32,174 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:38:32,175 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:38:32,175 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:38:32,175 INFO L85 PathProgramCache]: Analyzing trace with hash 253718915, now seen corresponding path program 2 times [2022-04-08 08:38:32,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:38:32,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310512454] [2022-04-08 08:38:32,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:38:32,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:38:32,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:38:32,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:38:32,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:38:32,303 INFO L290 TraceCheckUtils]: 0: Hoare triple {14311#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {14304#true} is VALID [2022-04-08 08:38:32,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {14304#true} assume true; {14304#true} is VALID [2022-04-08 08:38:32,303 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14304#true} {14304#true} #664#return; {14304#true} is VALID [2022-04-08 08:38:32,305 INFO L272 TraceCheckUtils]: 0: Hoare triple {14304#true} call ULTIMATE.init(); {14311#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:38:32,305 INFO L290 TraceCheckUtils]: 1: Hoare triple {14311#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {14304#true} is VALID [2022-04-08 08:38:32,305 INFO L290 TraceCheckUtils]: 2: Hoare triple {14304#true} assume true; {14304#true} is VALID [2022-04-08 08:38:32,305 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14304#true} {14304#true} #664#return; {14304#true} is VALID [2022-04-08 08:38:32,305 INFO L272 TraceCheckUtils]: 4: Hoare triple {14304#true} call #t~ret162 := main(); {14304#true} is VALID [2022-04-08 08:38:32,305 INFO L290 TraceCheckUtils]: 5: Hoare triple {14304#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {14304#true} is VALID [2022-04-08 08:38:32,305 INFO L290 TraceCheckUtils]: 6: Hoare triple {14304#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {14304#true} is VALID [2022-04-08 08:38:32,306 INFO L272 TraceCheckUtils]: 7: Hoare triple {14304#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {14304#true} is VALID [2022-04-08 08:38:32,307 INFO L290 TraceCheckUtils]: 8: Hoare triple {14304#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;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~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~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~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {14309#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:38:32,308 INFO L290 TraceCheckUtils]: 9: Hoare triple {14309#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {14309#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:38:32,309 INFO L290 TraceCheckUtils]: 10: Hoare triple {14309#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {14309#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:38:32,309 INFO L290 TraceCheckUtils]: 11: Hoare triple {14309#(= 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)))); {14309#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:38:32,310 INFO L290 TraceCheckUtils]: 12: Hoare triple {14309#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {14309#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:38:32,310 INFO L290 TraceCheckUtils]: 13: Hoare triple {14309#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {14309#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:38:32,311 INFO L290 TraceCheckUtils]: 14: Hoare triple {14309#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {14309#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:38:32,311 INFO L290 TraceCheckUtils]: 15: Hoare triple {14309#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {14309#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:38:32,312 INFO L290 TraceCheckUtils]: 16: Hoare triple {14309#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {14309#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:38:32,312 INFO L290 TraceCheckUtils]: 17: Hoare triple {14309#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {14310#(= 8464 |ssl3_accept_#t~mem44|)} is VALID [2022-04-08 08:38:32,313 INFO L290 TraceCheckUtils]: 18: Hoare triple {14310#(= 8464 |ssl3_accept_#t~mem44|)} assume 8192 == #t~mem44;havoc #t~mem44; {14305#false} is VALID [2022-04-08 08:38:32,313 INFO L290 TraceCheckUtils]: 19: Hoare triple {14305#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {14305#false} is VALID [2022-04-08 08:38:32,313 INFO L290 TraceCheckUtils]: 20: Hoare triple {14305#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {14305#false} is VALID [2022-04-08 08:38:32,313 INFO L290 TraceCheckUtils]: 21: Hoare triple {14305#false} call #t~mem77 := read~int(~s.base, ~s.offset, 4); {14305#false} is VALID [2022-04-08 08:38:32,313 INFO L290 TraceCheckUtils]: 22: Hoare triple {14305#false} assume !(3 != #t~mem77 / 256);havoc #t~mem77;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem78.base, #t~mem78.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {14305#false} is VALID [2022-04-08 08:38:32,313 INFO L290 TraceCheckUtils]: 23: Hoare triple {14305#false} assume 0 == (#t~mem78.base + #t~mem78.offset) % 4294967296;havoc #t~mem78.base, #t~mem78.offset;assume -2147483648 <= #t~nondet79 && #t~nondet79 <= 2147483647;~tmp___3~0 := #t~nondet79;havoc #t~nondet79; {14305#false} is VALID [2022-04-08 08:38:32,313 INFO L290 TraceCheckUtils]: 24: Hoare triple {14305#false} assume !(0 == ~tmp___3~0);call write~$Pointer$(~buf~0.base, ~buf~0.offset, ~s.base, 60 + ~s.offset, 4); {14305#false} is VALID [2022-04-08 08:38:32,314 INFO L290 TraceCheckUtils]: 25: Hoare triple {14305#false} assume -2147483648 <= #t~nondet80 && #t~nondet80 <= 2147483647;~tmp___4~0 := #t~nondet80;havoc #t~nondet80; {14305#false} is VALID [2022-04-08 08:38:32,314 INFO L290 TraceCheckUtils]: 26: Hoare triple {14305#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem81 := read~int(~s.base, 52 + ~s.offset, 4); {14305#false} is VALID [2022-04-08 08:38:32,314 INFO L290 TraceCheckUtils]: 27: Hoare triple {14305#false} assume !(12292 != #t~mem81);havoc #t~mem81;call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem86 := read~int(#t~mem85.base, 76 + #t~mem85.offset, 4);call write~int(1 + #t~mem86, #t~mem85.base, 76 + #t~mem85.offset, 4);havoc #t~mem85.base, #t~mem85.offset;havoc #t~mem86;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {14305#false} is VALID [2022-04-08 08:38:32,314 INFO L290 TraceCheckUtils]: 28: Hoare triple {14305#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {14305#false} is VALID [2022-04-08 08:38:32,314 INFO L290 TraceCheckUtils]: 29: Hoare triple {14305#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {14305#false} is VALID [2022-04-08 08:38:32,314 INFO L290 TraceCheckUtils]: 30: Hoare triple {14305#false} ~skip~0 := 0; {14305#false} is VALID [2022-04-08 08:38:32,314 INFO L290 TraceCheckUtils]: 31: Hoare triple {14305#false} assume !false; {14305#false} is VALID [2022-04-08 08:38:32,314 INFO L290 TraceCheckUtils]: 32: Hoare triple {14305#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {14305#false} is VALID [2022-04-08 08:38:32,314 INFO L290 TraceCheckUtils]: 33: Hoare triple {14305#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {14305#false} is VALID [2022-04-08 08:38:32,315 INFO L290 TraceCheckUtils]: 34: Hoare triple {14305#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {14305#false} is VALID [2022-04-08 08:38:32,315 INFO L290 TraceCheckUtils]: 35: Hoare triple {14305#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {14305#false} is VALID [2022-04-08 08:38:32,315 INFO L290 TraceCheckUtils]: 36: Hoare triple {14305#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {14305#false} is VALID [2022-04-08 08:38:32,315 INFO L290 TraceCheckUtils]: 37: Hoare triple {14305#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {14305#false} is VALID [2022-04-08 08:38:32,315 INFO L290 TraceCheckUtils]: 38: Hoare triple {14305#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {14305#false} is VALID [2022-04-08 08:38:32,315 INFO L290 TraceCheckUtils]: 39: Hoare triple {14305#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {14305#false} is VALID [2022-04-08 08:38:32,315 INFO L290 TraceCheckUtils]: 40: Hoare triple {14305#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {14305#false} is VALID [2022-04-08 08:38:32,315 INFO L290 TraceCheckUtils]: 41: Hoare triple {14305#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {14305#false} is VALID [2022-04-08 08:38:32,316 INFO L290 TraceCheckUtils]: 42: Hoare triple {14305#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {14305#false} is VALID [2022-04-08 08:38:32,316 INFO L290 TraceCheckUtils]: 43: Hoare triple {14305#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {14305#false} is VALID [2022-04-08 08:38:32,316 INFO L290 TraceCheckUtils]: 44: Hoare triple {14305#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {14305#false} is VALID [2022-04-08 08:38:32,316 INFO L290 TraceCheckUtils]: 45: Hoare triple {14305#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {14305#false} is VALID [2022-04-08 08:38:32,316 INFO L290 TraceCheckUtils]: 46: Hoare triple {14305#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {14305#false} is VALID [2022-04-08 08:38:32,316 INFO L290 TraceCheckUtils]: 47: Hoare triple {14305#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {14305#false} is VALID [2022-04-08 08:38:32,316 INFO L290 TraceCheckUtils]: 48: Hoare triple {14305#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {14305#false} is VALID [2022-04-08 08:38:32,316 INFO L290 TraceCheckUtils]: 49: Hoare triple {14305#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {14305#false} is VALID [2022-04-08 08:38:32,317 INFO L290 TraceCheckUtils]: 50: Hoare triple {14305#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {14305#false} is VALID [2022-04-08 08:38:32,317 INFO L290 TraceCheckUtils]: 51: Hoare triple {14305#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {14305#false} is VALID [2022-04-08 08:38:32,319 INFO L290 TraceCheckUtils]: 52: Hoare triple {14305#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {14305#false} is VALID [2022-04-08 08:38:32,320 INFO L290 TraceCheckUtils]: 53: Hoare triple {14305#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {14305#false} is VALID [2022-04-08 08:38:32,320 INFO L290 TraceCheckUtils]: 54: Hoare triple {14305#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {14305#false} is VALID [2022-04-08 08:38:32,320 INFO L290 TraceCheckUtils]: 55: Hoare triple {14305#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {14305#false} is VALID [2022-04-08 08:38:32,320 INFO L290 TraceCheckUtils]: 56: Hoare triple {14305#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {14305#false} is VALID [2022-04-08 08:38:32,320 INFO L290 TraceCheckUtils]: 57: Hoare triple {14305#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {14305#false} is VALID [2022-04-08 08:38:32,320 INFO L290 TraceCheckUtils]: 58: Hoare triple {14305#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {14305#false} is VALID [2022-04-08 08:38:32,320 INFO L290 TraceCheckUtils]: 59: Hoare triple {14305#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {14305#false} is VALID [2022-04-08 08:38:32,321 INFO L290 TraceCheckUtils]: 60: Hoare triple {14305#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {14305#false} is VALID [2022-04-08 08:38:32,321 INFO L290 TraceCheckUtils]: 61: Hoare triple {14305#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {14305#false} is VALID [2022-04-08 08:38:32,321 INFO L290 TraceCheckUtils]: 62: Hoare triple {14305#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {14305#false} is VALID [2022-04-08 08:38:32,321 INFO L290 TraceCheckUtils]: 63: Hoare triple {14305#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {14305#false} is VALID [2022-04-08 08:38:32,321 INFO L290 TraceCheckUtils]: 64: Hoare triple {14305#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {14305#false} is VALID [2022-04-08 08:38:32,321 INFO L290 TraceCheckUtils]: 65: Hoare triple {14305#false} assume 8672 == #t~mem74;havoc #t~mem74; {14305#false} is VALID [2022-04-08 08:38:32,321 INFO L290 TraceCheckUtils]: 66: Hoare triple {14305#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {14305#false} is VALID [2022-04-08 08:38:32,321 INFO L290 TraceCheckUtils]: 67: Hoare triple {14305#false} assume 4 == ~blastFlag~0; {14305#false} is VALID [2022-04-08 08:38:32,321 INFO L290 TraceCheckUtils]: 68: Hoare triple {14305#false} assume !false; {14305#false} is VALID [2022-04-08 08:38:32,322 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:38:32,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:38:32,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310512454] [2022-04-08 08:38:32,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310512454] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:38:32,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:38:32,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:38:32,323 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:38:32,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [539302027] [2022-04-08 08:38:32,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [539302027] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:38:32,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:38:32,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:38:32,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128991299] [2022-04-08 08:38:32,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:38:32,323 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2022-04-08 08:38:32,324 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:38:32,324 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:38:32,383 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:38:32,383 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:38:32,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:38:32,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:38:32,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:38:32,384 INFO L87 Difference]: Start difference. First operand 177 states and 261 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:38:34,422 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:38:35,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:38:35,779 INFO L93 Difference]: Finished difference Result 329 states and 491 transitions. [2022-04-08 08:38:35,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:38:35,779 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2022-04-08 08:38:35,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:38:35,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:38:35,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 427 transitions. [2022-04-08 08:38:35,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:38:35,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 427 transitions. [2022-04-08 08:38:35,785 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 427 transitions. [2022-04-08 08:38:36,100 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 427 edges. 427 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:38:36,104 INFO L225 Difference]: With dead ends: 329 [2022-04-08 08:38:36,104 INFO L226 Difference]: Without dead ends: 180 [2022-04-08 08:38:36,104 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:38:36,105 INFO L913 BasicCegarLoop]: 184 mSDtfsCounter, 21 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-08 08:38:36,105 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 470 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 345 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-08 08:38:36,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-04-08 08:38:36,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 169. [2022-04-08 08:38:36,112 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:38:36,113 INFO L82 GeneralOperation]: Start isEquivalent. First operand 180 states. Second operand has 169 states, 164 states have (on average 1.5) internal successors, (246), 164 states have internal predecessors, (246), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:38:36,113 INFO L74 IsIncluded]: Start isIncluded. First operand 180 states. Second operand has 169 states, 164 states have (on average 1.5) internal successors, (246), 164 states have internal predecessors, (246), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:38:36,114 INFO L87 Difference]: Start difference. First operand 180 states. Second operand has 169 states, 164 states have (on average 1.5) internal successors, (246), 164 states have internal predecessors, (246), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:38:36,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:38:36,117 INFO L93 Difference]: Finished difference Result 180 states and 264 transitions. [2022-04-08 08:38:36,117 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 264 transitions. [2022-04-08 08:38:36,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:38:36,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:38:36,118 INFO L74 IsIncluded]: Start isIncluded. First operand has 169 states, 164 states have (on average 1.5) internal successors, (246), 164 states have internal predecessors, (246), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 180 states. [2022-04-08 08:38:36,118 INFO L87 Difference]: Start difference. First operand has 169 states, 164 states have (on average 1.5) internal successors, (246), 164 states have internal predecessors, (246), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 180 states. [2022-04-08 08:38:36,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:38:36,121 INFO L93 Difference]: Finished difference Result 180 states and 264 transitions. [2022-04-08 08:38:36,121 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 264 transitions. [2022-04-08 08:38:36,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:38:36,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:38:36,122 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:38:36,122 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:38:36,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 164 states have (on average 1.5) internal successors, (246), 164 states have internal predecessors, (246), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:38:36,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 250 transitions. [2022-04-08 08:38:36,125 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 250 transitions. Word has length 69 [2022-04-08 08:38:36,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:38:36,125 INFO L478 AbstractCegarLoop]: Abstraction has 169 states and 250 transitions. [2022-04-08 08:38:36,125 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:38:36,126 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 169 states and 250 transitions. [2022-04-08 08:38:36,344 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 250 edges. 250 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:38:36,345 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 250 transitions. [2022-04-08 08:38:36,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-08 08:38:36,345 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:38:36,345 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:38:36,346 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-08 08:38:36,346 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:38:36,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:38:36,346 INFO L85 PathProgramCache]: Analyzing trace with hash -167412983, now seen corresponding path program 1 times [2022-04-08 08:38:36,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:38:36,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1701302083] [2022-04-08 08:38:36,527 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 22 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 08:38:36,528 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 08:38:36,528 INFO L85 PathProgramCache]: Analyzing trace with hash -2099364604, now seen corresponding path program 1 times [2022-04-08 08:38:36,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:38:36,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245458205] [2022-04-08 08:38:36,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:38:36,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:38:36,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:38:36,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:38:36,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:38:36,636 INFO L290 TraceCheckUtils]: 0: Hoare triple {15678#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {15672#true} is VALID [2022-04-08 08:38:36,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {15672#true} assume true; {15672#true} is VALID [2022-04-08 08:38:36,637 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15672#true} {15672#true} #664#return; {15672#true} is VALID [2022-04-08 08:38:36,638 INFO L272 TraceCheckUtils]: 0: Hoare triple {15672#true} call ULTIMATE.init(); {15678#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:38:36,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {15678#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {15672#true} is VALID [2022-04-08 08:38:36,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {15672#true} assume true; {15672#true} is VALID [2022-04-08 08:38:36,638 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15672#true} {15672#true} #664#return; {15672#true} is VALID [2022-04-08 08:38:36,638 INFO L272 TraceCheckUtils]: 4: Hoare triple {15672#true} call #t~ret162 := main(); {15672#true} is VALID [2022-04-08 08:38:36,638 INFO L290 TraceCheckUtils]: 5: Hoare triple {15672#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {15672#true} is VALID [2022-04-08 08:38:36,639 INFO L290 TraceCheckUtils]: 6: Hoare triple {15672#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {15672#true} is VALID [2022-04-08 08:38:36,639 INFO L272 TraceCheckUtils]: 7: Hoare triple {15672#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {15672#true} is VALID [2022-04-08 08:38:36,639 INFO L290 TraceCheckUtils]: 8: Hoare triple {15672#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;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~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~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~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {15677#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:36,639 INFO L290 TraceCheckUtils]: 9: Hoare triple {15677#(= ssl3_accept_~blastFlag~0 0)} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {15677#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:36,640 INFO L290 TraceCheckUtils]: 10: Hoare triple {15677#(= ssl3_accept_~blastFlag~0 0)} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {15677#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:36,640 INFO L290 TraceCheckUtils]: 11: Hoare triple {15677#(= ssl3_accept_~blastFlag~0 0)} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {15677#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:36,640 INFO L290 TraceCheckUtils]: 12: Hoare triple {15677#(= ssl3_accept_~blastFlag~0 0)} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {15677#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:36,641 INFO L290 TraceCheckUtils]: 13: Hoare triple {15677#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {15677#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:36,641 INFO L290 TraceCheckUtils]: 14: Hoare triple {15677#(= ssl3_accept_~blastFlag~0 0)} [678] L1166-2-->L1167_primed: Formula: true InVars {} OutVars{ssl3_accept_#t~mem81=|v_ssl3_accept_#t~mem81_36|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_397|, ssl3_accept_#t~mem78.base=|v_ssl3_accept_#t~mem78.base_36|, ssl3_accept_#t~mem41=|v_ssl3_accept_#t~mem41_25|, ssl3_accept_#t~mem151.base=|v_ssl3_accept_#t~mem151.base_36|, ssl3_accept_~tmp___4~0=v_ssl3_accept_~tmp___4~0_24, ssl3_accept_#t~mem85.base=|v_ssl3_accept_#t~mem85.base_22|, ssl3_accept_#t~nondet80=|v_ssl3_accept_#t~nondet80_33|, ssl3_accept_#t~mem78.offset=|v_ssl3_accept_#t~mem78.offset_36|, ssl3_accept_#t~mem45=|v_ssl3_accept_#t~mem45_12|, ssl3_accept_#t~mem44=|v_ssl3_accept_#t~mem44_26|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_35, ssl3_accept_#t~mem43=|v_ssl3_accept_#t~mem43_40|, ssl3_accept_#t~mem42=|v_ssl3_accept_#t~mem42_42|, ssl3_accept_#t~mem152=|v_ssl3_accept_#t~mem152_38|, ssl3_accept_#t~mem151.offset=|v_ssl3_accept_#t~mem151.offset_36|, #memory_int=|v_#memory_int_368|, ssl3_accept_#t~mem86=|v_ssl3_accept_#t~mem86_22|, ssl3_accept_#t~mem77=|v_ssl3_accept_#t~mem77_36|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_397|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_27, ssl3_accept_#t~mem85.offset=|v_ssl3_accept_#t~mem85.offset_22|} AuxVars[] AssignedVars[ssl3_accept_#t~mem81, #memory_$Pointer$.base, ssl3_accept_#t~mem78.base, ssl3_accept_#t~mem41, ssl3_accept_#t~mem151.base, ssl3_accept_~tmp___4~0, ssl3_accept_#t~mem85.base, ssl3_accept_#t~nondet80, ssl3_accept_#t~mem78.offset, ssl3_accept_#t~mem45, ssl3_accept_#t~mem44, ssl3_accept_~skip~0, ssl3_accept_#t~mem43, ssl3_accept_#t~mem42, ssl3_accept_#t~mem152, ssl3_accept_#t~mem151.offset, #memory_int, ssl3_accept_#t~mem86, ssl3_accept_#t~mem77, #memory_$Pointer$.offset, ssl3_accept_~state~0, ssl3_accept_#t~mem85.offset] {15677#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:36,642 INFO L290 TraceCheckUtils]: 15: Hoare triple {15677#(= ssl3_accept_~blastFlag~0 0)} [677] L1167_primed-->L1167: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15677#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:36,642 INFO L290 TraceCheckUtils]: 16: Hoare triple {15677#(= ssl3_accept_~blastFlag~0 0)} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {15677#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:36,642 INFO L290 TraceCheckUtils]: 17: Hoare triple {15677#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {15677#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:36,642 INFO L290 TraceCheckUtils]: 18: Hoare triple {15677#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {15677#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:36,643 INFO L290 TraceCheckUtils]: 19: Hoare triple {15677#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {15677#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:36,643 INFO L290 TraceCheckUtils]: 20: Hoare triple {15677#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {15677#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:36,643 INFO L290 TraceCheckUtils]: 21: Hoare triple {15677#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {15677#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:36,644 INFO L290 TraceCheckUtils]: 22: Hoare triple {15677#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {15677#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:36,644 INFO L290 TraceCheckUtils]: 23: Hoare triple {15677#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {15677#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:36,644 INFO L290 TraceCheckUtils]: 24: Hoare triple {15677#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {15677#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:36,645 INFO L290 TraceCheckUtils]: 25: Hoare triple {15677#(= ssl3_accept_~blastFlag~0 0)} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {15677#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:36,645 INFO L290 TraceCheckUtils]: 26: Hoare triple {15677#(= ssl3_accept_~blastFlag~0 0)} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {15677#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:36,645 INFO L290 TraceCheckUtils]: 27: Hoare triple {15677#(= ssl3_accept_~blastFlag~0 0)} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {15677#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:36,646 INFO L290 TraceCheckUtils]: 28: Hoare triple {15677#(= ssl3_accept_~blastFlag~0 0)} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {15677#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:36,646 INFO L290 TraceCheckUtils]: 29: Hoare triple {15677#(= ssl3_accept_~blastFlag~0 0)} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {15677#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:36,647 INFO L290 TraceCheckUtils]: 30: Hoare triple {15677#(= ssl3_accept_~blastFlag~0 0)} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {15677#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:36,647 INFO L290 TraceCheckUtils]: 31: Hoare triple {15677#(= ssl3_accept_~blastFlag~0 0)} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {15677#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:36,647 INFO L290 TraceCheckUtils]: 32: Hoare triple {15677#(= ssl3_accept_~blastFlag~0 0)} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {15677#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:36,648 INFO L290 TraceCheckUtils]: 33: Hoare triple {15677#(= ssl3_accept_~blastFlag~0 0)} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {15677#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:36,648 INFO L290 TraceCheckUtils]: 34: Hoare triple {15677#(= ssl3_accept_~blastFlag~0 0)} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {15677#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:36,664 INFO L290 TraceCheckUtils]: 35: Hoare triple {15677#(= ssl3_accept_~blastFlag~0 0)} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {15677#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:36,664 INFO L290 TraceCheckUtils]: 36: Hoare triple {15677#(= ssl3_accept_~blastFlag~0 0)} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {15677#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:36,665 INFO L290 TraceCheckUtils]: 37: Hoare triple {15677#(= ssl3_accept_~blastFlag~0 0)} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {15677#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:36,665 INFO L290 TraceCheckUtils]: 38: Hoare triple {15677#(= ssl3_accept_~blastFlag~0 0)} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {15677#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:36,665 INFO L290 TraceCheckUtils]: 39: Hoare triple {15677#(= ssl3_accept_~blastFlag~0 0)} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {15677#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:36,666 INFO L290 TraceCheckUtils]: 40: Hoare triple {15677#(= ssl3_accept_~blastFlag~0 0)} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {15677#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:36,666 INFO L290 TraceCheckUtils]: 41: Hoare triple {15677#(= ssl3_accept_~blastFlag~0 0)} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {15677#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:36,666 INFO L290 TraceCheckUtils]: 42: Hoare triple {15677#(= ssl3_accept_~blastFlag~0 0)} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {15677#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:36,667 INFO L290 TraceCheckUtils]: 43: Hoare triple {15677#(= ssl3_accept_~blastFlag~0 0)} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {15677#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:36,667 INFO L290 TraceCheckUtils]: 44: Hoare triple {15677#(= ssl3_accept_~blastFlag~0 0)} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {15677#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:36,667 INFO L290 TraceCheckUtils]: 45: Hoare triple {15677#(= ssl3_accept_~blastFlag~0 0)} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {15677#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:36,668 INFO L290 TraceCheckUtils]: 46: Hoare triple {15677#(= ssl3_accept_~blastFlag~0 0)} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {15677#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:36,668 INFO L290 TraceCheckUtils]: 47: Hoare triple {15677#(= ssl3_accept_~blastFlag~0 0)} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {15677#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:36,668 INFO L290 TraceCheckUtils]: 48: Hoare triple {15677#(= ssl3_accept_~blastFlag~0 0)} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {15677#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:36,669 INFO L290 TraceCheckUtils]: 49: Hoare triple {15677#(= ssl3_accept_~blastFlag~0 0)} assume 8672 == #t~mem74;havoc #t~mem74; {15677#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:36,669 INFO L290 TraceCheckUtils]: 50: Hoare triple {15677#(= ssl3_accept_~blastFlag~0 0)} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {15677#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:36,670 INFO L290 TraceCheckUtils]: 51: Hoare triple {15677#(= ssl3_accept_~blastFlag~0 0)} assume 4 == ~blastFlag~0; {15673#false} is VALID [2022-04-08 08:38:36,670 INFO L290 TraceCheckUtils]: 52: Hoare triple {15673#false} assume !false; {15673#false} is VALID [2022-04-08 08:38:36,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:38:36,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:38:36,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245458205] [2022-04-08 08:38:36,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245458205] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:38:36,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:38:36,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:38:41,804 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:38:41,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1701302083] [2022-04-08 08:38:41,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1701302083] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:38:41,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:38:41,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 08:38:41,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656404070] [2022-04-08 08:38:41,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:38:41,805 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.0625) internal successors, (65), 15 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2022-04-08 08:38:41,805 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:38:41,806 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 4.0625) internal successors, (65), 15 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:38:41,884 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:38:41,884 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 08:38:41,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:38:41,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 08:38:41,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=176, Unknown=2, NotChecked=0, Total=240 [2022-04-08 08:38:41,885 INFO L87 Difference]: Start difference. First operand 169 states and 250 transitions. Second operand has 16 states, 16 states have (on average 4.0625) internal successors, (65), 15 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:38:45,924 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:38:47,929 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:38:49,955 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:38:51,975 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:38:53,995 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:38:56,017 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:38:57,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:38:57,793 INFO L93 Difference]: Finished difference Result 321 states and 481 transitions. [2022-04-08 08:38:57,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 08:38:57,793 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.0625) internal successors, (65), 15 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2022-04-08 08:38:57,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:38:57,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 4.0625) internal successors, (65), 15 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:38:57,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 427 transitions. [2022-04-08 08:38:57,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 4.0625) internal successors, (65), 15 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:38:57,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 427 transitions. [2022-04-08 08:38:57,798 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 427 transitions. [2022-04-08 08:38:58,099 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 427 edges. 427 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:38:58,104 INFO L225 Difference]: With dead ends: 321 [2022-04-08 08:38:58,104 INFO L226 Difference]: Without dead ends: 180 [2022-04-08 08:38:58,105 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=62, Invalid=176, Unknown=2, NotChecked=0, Total=240 [2022-04-08 08:38:58,105 INFO L913 BasicCegarLoop]: 192 mSDtfsCounter, 14 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 4 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 57 IncrementalHoareTripleChecker+Unchecked, 12.7s IncrementalHoareTripleChecker+Time [2022-04-08 08:38:58,105 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 689 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 569 Invalid, 5 Unknown, 57 Unchecked, 12.7s Time] [2022-04-08 08:38:58,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-04-08 08:38:58,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 177. [2022-04-08 08:38:58,121 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:38:58,122 INFO L82 GeneralOperation]: Start isEquivalent. First operand 180 states. Second operand has 177 states, 172 states have (on average 1.4883720930232558) internal successors, (256), 172 states have internal predecessors, (256), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:38:58,122 INFO L74 IsIncluded]: Start isIncluded. First operand 180 states. Second operand has 177 states, 172 states have (on average 1.4883720930232558) internal successors, (256), 172 states have internal predecessors, (256), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:38:58,122 INFO L87 Difference]: Start difference. First operand 180 states. Second operand has 177 states, 172 states have (on average 1.4883720930232558) internal successors, (256), 172 states have internal predecessors, (256), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:38:58,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:38:58,125 INFO L93 Difference]: Finished difference Result 180 states and 264 transitions. [2022-04-08 08:38:58,125 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 264 transitions. [2022-04-08 08:38:58,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:38:58,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:38:58,126 INFO L74 IsIncluded]: Start isIncluded. First operand has 177 states, 172 states have (on average 1.4883720930232558) internal successors, (256), 172 states have internal predecessors, (256), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 180 states. [2022-04-08 08:38:58,128 INFO L87 Difference]: Start difference. First operand has 177 states, 172 states have (on average 1.4883720930232558) internal successors, (256), 172 states have internal predecessors, (256), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 180 states. [2022-04-08 08:38:58,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:38:58,131 INFO L93 Difference]: Finished difference Result 180 states and 264 transitions. [2022-04-08 08:38:58,131 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 264 transitions. [2022-04-08 08:38:58,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:38:58,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:38:58,132 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:38:58,132 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:38:58,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 172 states have (on average 1.4883720930232558) internal successors, (256), 172 states have internal predecessors, (256), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:38:58,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 260 transitions. [2022-04-08 08:38:58,136 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 260 transitions. Word has length 69 [2022-04-08 08:38:58,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:38:58,136 INFO L478 AbstractCegarLoop]: Abstraction has 177 states and 260 transitions. [2022-04-08 08:38:58,136 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.0625) internal successors, (65), 15 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:38:58,136 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 177 states and 260 transitions. [2022-04-08 08:38:58,363 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 260 edges. 260 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:38:58,363 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 260 transitions. [2022-04-08 08:38:58,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-08 08:38:58,364 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:38:58,364 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:38:58,364 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-08 08:38:58,367 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:38:58,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:38:58,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1771749063, now seen corresponding path program 1 times [2022-04-08 08:38:58,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:38:58,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [213096405] [2022-04-08 08:38:58,539 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 22 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 08:38:58,539 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 08:38:58,539 INFO L85 PathProgramCache]: Analyzing trace with hash -679123772, now seen corresponding path program 1 times [2022-04-08 08:38:58,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:38:58,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113628856] [2022-04-08 08:38:58,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:38:58,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:38:58,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:38:58,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:38:58,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:38:58,669 INFO L290 TraceCheckUtils]: 0: Hoare triple {17055#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {17049#true} is VALID [2022-04-08 08:38:58,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {17049#true} assume true; {17049#true} is VALID [2022-04-08 08:38:58,670 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17049#true} {17049#true} #664#return; {17049#true} is VALID [2022-04-08 08:38:58,671 INFO L272 TraceCheckUtils]: 0: Hoare triple {17049#true} call ULTIMATE.init(); {17055#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:38:58,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {17055#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {17049#true} is VALID [2022-04-08 08:38:58,671 INFO L290 TraceCheckUtils]: 2: Hoare triple {17049#true} assume true; {17049#true} is VALID [2022-04-08 08:38:58,671 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17049#true} {17049#true} #664#return; {17049#true} is VALID [2022-04-08 08:38:58,671 INFO L272 TraceCheckUtils]: 4: Hoare triple {17049#true} call #t~ret162 := main(); {17049#true} is VALID [2022-04-08 08:38:58,671 INFO L290 TraceCheckUtils]: 5: Hoare triple {17049#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {17049#true} is VALID [2022-04-08 08:38:58,671 INFO L290 TraceCheckUtils]: 6: Hoare triple {17049#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {17049#true} is VALID [2022-04-08 08:38:58,671 INFO L272 TraceCheckUtils]: 7: Hoare triple {17049#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {17049#true} is VALID [2022-04-08 08:38:58,672 INFO L290 TraceCheckUtils]: 8: Hoare triple {17049#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;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~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~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~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {17054#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:58,672 INFO L290 TraceCheckUtils]: 9: Hoare triple {17054#(= ssl3_accept_~blastFlag~0 0)} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {17054#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:58,672 INFO L290 TraceCheckUtils]: 10: Hoare triple {17054#(= ssl3_accept_~blastFlag~0 0)} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {17054#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:58,673 INFO L290 TraceCheckUtils]: 11: Hoare triple {17054#(= ssl3_accept_~blastFlag~0 0)} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {17054#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:58,673 INFO L290 TraceCheckUtils]: 12: Hoare triple {17054#(= ssl3_accept_~blastFlag~0 0)} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {17054#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:58,673 INFO L290 TraceCheckUtils]: 13: Hoare triple {17054#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {17054#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:58,674 INFO L290 TraceCheckUtils]: 14: Hoare triple {17054#(= ssl3_accept_~blastFlag~0 0)} [680] L1166-2-->L1167_primed: Formula: true InVars {} OutVars{ssl3_accept_#t~mem81=|v_ssl3_accept_#t~mem81_42|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_416|, ssl3_accept_#t~mem78.base=|v_ssl3_accept_#t~mem78.base_42|, ssl3_accept_#t~mem41=|v_ssl3_accept_#t~mem41_29|, ssl3_accept_#t~mem151.base=|v_ssl3_accept_#t~mem151.base_41|, ssl3_accept_~tmp___4~0=v_ssl3_accept_~tmp___4~0_28, ssl3_accept_#t~mem85.base=|v_ssl3_accept_#t~mem85.base_26|, ssl3_accept_#t~nondet80=|v_ssl3_accept_#t~nondet80_39|, ssl3_accept_#t~mem78.offset=|v_ssl3_accept_#t~mem78.offset_42|, ssl3_accept_#t~mem45=|v_ssl3_accept_#t~mem45_18|, ssl3_accept_#t~mem44=|v_ssl3_accept_#t~mem44_32|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_39, ssl3_accept_#t~mem43=|v_ssl3_accept_#t~mem43_46|, ssl3_accept_#t~mem42=|v_ssl3_accept_#t~mem42_48|, ssl3_accept_#t~mem152=|v_ssl3_accept_#t~mem152_43|, ssl3_accept_#t~mem151.offset=|v_ssl3_accept_#t~mem151.offset_41|, #memory_int=|v_#memory_int_386|, ssl3_accept_#t~mem86=|v_ssl3_accept_#t~mem86_26|, ssl3_accept_#t~mem77=|v_ssl3_accept_#t~mem77_42|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_416|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_31, ssl3_accept_#t~mem85.offset=|v_ssl3_accept_#t~mem85.offset_26|} AuxVars[] AssignedVars[ssl3_accept_#t~mem81, #memory_$Pointer$.base, ssl3_accept_#t~mem78.base, ssl3_accept_#t~mem41, ssl3_accept_#t~mem151.base, ssl3_accept_~tmp___4~0, ssl3_accept_#t~mem85.base, ssl3_accept_#t~nondet80, ssl3_accept_#t~mem78.offset, ssl3_accept_#t~mem45, ssl3_accept_#t~mem44, ssl3_accept_~skip~0, ssl3_accept_#t~mem43, ssl3_accept_#t~mem42, ssl3_accept_#t~mem152, ssl3_accept_#t~mem151.offset, #memory_int, ssl3_accept_#t~mem86, ssl3_accept_#t~mem77, #memory_$Pointer$.offset, ssl3_accept_~state~0, ssl3_accept_#t~mem85.offset] {17054#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:58,674 INFO L290 TraceCheckUtils]: 15: Hoare triple {17054#(= ssl3_accept_~blastFlag~0 0)} [679] L1167_primed-->L1167: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17054#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:58,674 INFO L290 TraceCheckUtils]: 16: Hoare triple {17054#(= ssl3_accept_~blastFlag~0 0)} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {17054#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:58,675 INFO L290 TraceCheckUtils]: 17: Hoare triple {17054#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {17054#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:58,675 INFO L290 TraceCheckUtils]: 18: Hoare triple {17054#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {17054#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:58,675 INFO L290 TraceCheckUtils]: 19: Hoare triple {17054#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {17054#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:58,676 INFO L290 TraceCheckUtils]: 20: Hoare triple {17054#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {17054#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:58,676 INFO L290 TraceCheckUtils]: 21: Hoare triple {17054#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {17054#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:58,676 INFO L290 TraceCheckUtils]: 22: Hoare triple {17054#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {17054#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:58,677 INFO L290 TraceCheckUtils]: 23: Hoare triple {17054#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {17054#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:58,677 INFO L290 TraceCheckUtils]: 24: Hoare triple {17054#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {17054#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:58,677 INFO L290 TraceCheckUtils]: 25: Hoare triple {17054#(= ssl3_accept_~blastFlag~0 0)} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {17054#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:58,678 INFO L290 TraceCheckUtils]: 26: Hoare triple {17054#(= ssl3_accept_~blastFlag~0 0)} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {17054#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:58,678 INFO L290 TraceCheckUtils]: 27: Hoare triple {17054#(= ssl3_accept_~blastFlag~0 0)} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {17054#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:58,678 INFO L290 TraceCheckUtils]: 28: Hoare triple {17054#(= ssl3_accept_~blastFlag~0 0)} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {17054#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:58,679 INFO L290 TraceCheckUtils]: 29: Hoare triple {17054#(= ssl3_accept_~blastFlag~0 0)} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {17054#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:58,679 INFO L290 TraceCheckUtils]: 30: Hoare triple {17054#(= ssl3_accept_~blastFlag~0 0)} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {17054#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:58,679 INFO L290 TraceCheckUtils]: 31: Hoare triple {17054#(= ssl3_accept_~blastFlag~0 0)} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {17054#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:58,680 INFO L290 TraceCheckUtils]: 32: Hoare triple {17054#(= ssl3_accept_~blastFlag~0 0)} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {17054#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:58,680 INFO L290 TraceCheckUtils]: 33: Hoare triple {17054#(= ssl3_accept_~blastFlag~0 0)} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {17054#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:58,680 INFO L290 TraceCheckUtils]: 34: Hoare triple {17054#(= ssl3_accept_~blastFlag~0 0)} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {17054#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:58,681 INFO L290 TraceCheckUtils]: 35: Hoare triple {17054#(= ssl3_accept_~blastFlag~0 0)} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {17054#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:58,681 INFO L290 TraceCheckUtils]: 36: Hoare triple {17054#(= ssl3_accept_~blastFlag~0 0)} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {17054#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:58,681 INFO L290 TraceCheckUtils]: 37: Hoare triple {17054#(= ssl3_accept_~blastFlag~0 0)} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {17054#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:58,682 INFO L290 TraceCheckUtils]: 38: Hoare triple {17054#(= ssl3_accept_~blastFlag~0 0)} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {17054#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:58,682 INFO L290 TraceCheckUtils]: 39: Hoare triple {17054#(= ssl3_accept_~blastFlag~0 0)} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {17054#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:58,682 INFO L290 TraceCheckUtils]: 40: Hoare triple {17054#(= ssl3_accept_~blastFlag~0 0)} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {17054#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:58,683 INFO L290 TraceCheckUtils]: 41: Hoare triple {17054#(= ssl3_accept_~blastFlag~0 0)} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {17054#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:58,683 INFO L290 TraceCheckUtils]: 42: Hoare triple {17054#(= ssl3_accept_~blastFlag~0 0)} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {17054#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:58,683 INFO L290 TraceCheckUtils]: 43: Hoare triple {17054#(= ssl3_accept_~blastFlag~0 0)} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {17054#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:58,684 INFO L290 TraceCheckUtils]: 44: Hoare triple {17054#(= ssl3_accept_~blastFlag~0 0)} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {17054#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:58,684 INFO L290 TraceCheckUtils]: 45: Hoare triple {17054#(= ssl3_accept_~blastFlag~0 0)} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {17054#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:58,684 INFO L290 TraceCheckUtils]: 46: Hoare triple {17054#(= ssl3_accept_~blastFlag~0 0)} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {17054#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:58,685 INFO L290 TraceCheckUtils]: 47: Hoare triple {17054#(= ssl3_accept_~blastFlag~0 0)} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {17054#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:58,685 INFO L290 TraceCheckUtils]: 48: Hoare triple {17054#(= ssl3_accept_~blastFlag~0 0)} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {17054#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:58,685 INFO L290 TraceCheckUtils]: 49: Hoare triple {17054#(= ssl3_accept_~blastFlag~0 0)} assume 8672 == #t~mem74;havoc #t~mem74; {17054#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:58,686 INFO L290 TraceCheckUtils]: 50: Hoare triple {17054#(= ssl3_accept_~blastFlag~0 0)} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {17054#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:38:58,686 INFO L290 TraceCheckUtils]: 51: Hoare triple {17054#(= ssl3_accept_~blastFlag~0 0)} assume 4 == ~blastFlag~0; {17050#false} is VALID [2022-04-08 08:38:58,686 INFO L290 TraceCheckUtils]: 52: Hoare triple {17050#false} assume !false; {17050#false} is VALID [2022-04-08 08:38:58,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:38:58,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:38:58,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113628856] [2022-04-08 08:38:58,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113628856] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:38:58,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:38:58,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:39:02,823 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:39:02,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [213096405] [2022-04-08 08:39:02,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [213096405] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:39:02,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:39:02,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 08:39:02,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924798629] [2022-04-08 08:39:02,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:39:02,824 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.0625) internal successors, (65), 15 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2022-04-08 08:39:02,825 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:39:02,825 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 4.0625) internal successors, (65), 15 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:02,896 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:39:02,896 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 08:39:02,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:39:02,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 08:39:02,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=177, Unknown=1, NotChecked=0, Total=240 [2022-04-08 08:39:02,897 INFO L87 Difference]: Start difference. First operand 177 states and 260 transitions. Second operand has 16 states, 16 states have (on average 4.0625) internal successors, (65), 15 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:04,936 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:39:08,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:39:08,173 INFO L93 Difference]: Finished difference Result 472 states and 711 transitions. [2022-04-08 08:39:08,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 08:39:08,173 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.0625) internal successors, (65), 15 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2022-04-08 08:39:08,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:39:08,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 4.0625) internal successors, (65), 15 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:08,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 605 transitions. [2022-04-08 08:39:08,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 4.0625) internal successors, (65), 15 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:08,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 605 transitions. [2022-04-08 08:39:08,180 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 605 transitions. [2022-04-08 08:39:08,607 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 605 edges. 605 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:39:08,614 INFO L225 Difference]: With dead ends: 472 [2022-04-08 08:39:08,614 INFO L226 Difference]: Without dead ends: 331 [2022-04-08 08:39:08,615 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=62, Invalid=177, Unknown=1, NotChecked=0, Total=240 [2022-04-08 08:39:08,615 INFO L913 BasicCegarLoop]: 338 mSDtfsCounter, 160 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 1010 mSolverCounterSat, 21 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 1188 SdHoareTripleChecker+Invalid, 1275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1010 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 243 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-04-08 08:39:08,615 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 1188 Invalid, 1275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1010 Invalid, 1 Unknown, 243 Unchecked, 3.2s Time] [2022-04-08 08:39:08,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-04-08 08:39:08,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 315. [2022-04-08 08:39:08,629 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:39:08,630 INFO L82 GeneralOperation]: Start isEquivalent. First operand 331 states. Second operand has 315 states, 310 states have (on average 1.5) internal successors, (465), 310 states have internal predecessors, (465), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:08,631 INFO L74 IsIncluded]: Start isIncluded. First operand 331 states. Second operand has 315 states, 310 states have (on average 1.5) internal successors, (465), 310 states have internal predecessors, (465), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:08,631 INFO L87 Difference]: Start difference. First operand 331 states. Second operand has 315 states, 310 states have (on average 1.5) internal successors, (465), 310 states have internal predecessors, (465), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:08,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:39:08,638 INFO L93 Difference]: Finished difference Result 331 states and 488 transitions. [2022-04-08 08:39:08,638 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 488 transitions. [2022-04-08 08:39:08,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:39:08,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:39:08,639 INFO L74 IsIncluded]: Start isIncluded. First operand has 315 states, 310 states have (on average 1.5) internal successors, (465), 310 states have internal predecessors, (465), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 331 states. [2022-04-08 08:39:08,640 INFO L87 Difference]: Start difference. First operand has 315 states, 310 states have (on average 1.5) internal successors, (465), 310 states have internal predecessors, (465), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 331 states. [2022-04-08 08:39:08,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:39:08,647 INFO L93 Difference]: Finished difference Result 331 states and 488 transitions. [2022-04-08 08:39:08,647 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 488 transitions. [2022-04-08 08:39:08,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:39:08,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:39:08,647 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:39:08,647 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:39:08,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 310 states have (on average 1.5) internal successors, (465), 310 states have internal predecessors, (465), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:08,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 469 transitions. [2022-04-08 08:39:08,656 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 469 transitions. Word has length 69 [2022-04-08 08:39:08,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:39:08,656 INFO L478 AbstractCegarLoop]: Abstraction has 315 states and 469 transitions. [2022-04-08 08:39:08,656 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.0625) internal successors, (65), 15 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:08,656 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 315 states and 469 transitions. [2022-04-08 08:39:09,076 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 469 edges. 469 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:39:09,076 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 469 transitions. [2022-04-08 08:39:09,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-08 08:39:09,077 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:39:09,077 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:39:09,077 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-08 08:39:09,077 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:39:09,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:39:09,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1642777843, now seen corresponding path program 1 times [2022-04-08 08:39:09,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:39:09,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1837944790] [2022-04-08 08:39:09,110 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:39:09,110 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:39:09,110 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:39:09,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1642777843, now seen corresponding path program 2 times [2022-04-08 08:39:09,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:39:09,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559258700] [2022-04-08 08:39:09,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:39:09,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:39:09,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:39:09,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:39:09,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:39:09,253 INFO L290 TraceCheckUtils]: 0: Hoare triple {19313#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {19306#true} is VALID [2022-04-08 08:39:09,253 INFO L290 TraceCheckUtils]: 1: Hoare triple {19306#true} assume true; {19306#true} is VALID [2022-04-08 08:39:09,253 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19306#true} {19306#true} #664#return; {19306#true} is VALID [2022-04-08 08:39:09,260 INFO L272 TraceCheckUtils]: 0: Hoare triple {19306#true} call ULTIMATE.init(); {19313#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:39:09,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {19313#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {19306#true} is VALID [2022-04-08 08:39:09,260 INFO L290 TraceCheckUtils]: 2: Hoare triple {19306#true} assume true; {19306#true} is VALID [2022-04-08 08:39:09,260 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19306#true} {19306#true} #664#return; {19306#true} is VALID [2022-04-08 08:39:09,261 INFO L272 TraceCheckUtils]: 4: Hoare triple {19306#true} call #t~ret162 := main(); {19306#true} is VALID [2022-04-08 08:39:09,261 INFO L290 TraceCheckUtils]: 5: Hoare triple {19306#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {19306#true} is VALID [2022-04-08 08:39:09,261 INFO L290 TraceCheckUtils]: 6: Hoare triple {19306#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {19306#true} is VALID [2022-04-08 08:39:09,261 INFO L272 TraceCheckUtils]: 7: Hoare triple {19306#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {19306#true} is VALID [2022-04-08 08:39:09,261 INFO L290 TraceCheckUtils]: 8: Hoare triple {19306#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;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~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~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~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {19306#true} is VALID [2022-04-08 08:39:09,261 INFO L290 TraceCheckUtils]: 9: Hoare triple {19306#true} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {19306#true} is VALID [2022-04-08 08:39:09,261 INFO L290 TraceCheckUtils]: 10: Hoare triple {19306#true} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {19306#true} is VALID [2022-04-08 08:39:09,261 INFO L290 TraceCheckUtils]: 11: Hoare triple {19306#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {19306#true} is VALID [2022-04-08 08:39:09,261 INFO L290 TraceCheckUtils]: 12: Hoare triple {19306#true} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {19306#true} is VALID [2022-04-08 08:39:09,261 INFO L290 TraceCheckUtils]: 13: Hoare triple {19306#true} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {19306#true} is VALID [2022-04-08 08:39:09,262 INFO L290 TraceCheckUtils]: 14: Hoare triple {19306#true} assume !false; {19306#true} is VALID [2022-04-08 08:39:09,262 INFO L290 TraceCheckUtils]: 15: Hoare triple {19306#true} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {19306#true} is VALID [2022-04-08 08:39:09,262 INFO L290 TraceCheckUtils]: 16: Hoare triple {19306#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {19306#true} is VALID [2022-04-08 08:39:09,262 INFO L290 TraceCheckUtils]: 17: Hoare triple {19306#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {19306#true} is VALID [2022-04-08 08:39:09,262 INFO L290 TraceCheckUtils]: 18: Hoare triple {19306#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {19306#true} is VALID [2022-04-08 08:39:09,262 INFO L290 TraceCheckUtils]: 19: Hoare triple {19306#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {19306#true} is VALID [2022-04-08 08:39:09,262 INFO L290 TraceCheckUtils]: 20: Hoare triple {19306#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {19306#true} is VALID [2022-04-08 08:39:09,262 INFO L290 TraceCheckUtils]: 21: Hoare triple {19306#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {19306#true} is VALID [2022-04-08 08:39:09,262 INFO L290 TraceCheckUtils]: 22: Hoare triple {19306#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {19306#true} is VALID [2022-04-08 08:39:09,262 INFO L290 TraceCheckUtils]: 23: Hoare triple {19306#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {19306#true} is VALID [2022-04-08 08:39:09,263 INFO L290 TraceCheckUtils]: 24: Hoare triple {19306#true} assume 8464 == #t~mem50;havoc #t~mem50; {19306#true} is VALID [2022-04-08 08:39:09,263 INFO L290 TraceCheckUtils]: 25: Hoare triple {19306#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {19306#true} is VALID [2022-04-08 08:39:09,263 INFO L290 TraceCheckUtils]: 26: Hoare triple {19306#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {19306#true} is VALID [2022-04-08 08:39:09,264 INFO L290 TraceCheckUtils]: 27: Hoare triple {19306#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {19311#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:09,265 INFO L290 TraceCheckUtils]: 28: Hoare triple {19311#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {19311#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:09,265 INFO L290 TraceCheckUtils]: 29: Hoare triple {19311#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {19311#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:09,266 INFO L290 TraceCheckUtils]: 30: Hoare triple {19311#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {19311#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:09,266 INFO L290 TraceCheckUtils]: 31: Hoare triple {19311#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {19311#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:09,267 INFO L290 TraceCheckUtils]: 32: Hoare triple {19311#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {19311#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:09,267 INFO L290 TraceCheckUtils]: 33: Hoare triple {19311#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {19311#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:09,268 INFO L290 TraceCheckUtils]: 34: Hoare triple {19311#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {19311#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:09,268 INFO L290 TraceCheckUtils]: 35: Hoare triple {19311#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {19311#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:09,269 INFO L290 TraceCheckUtils]: 36: Hoare triple {19311#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {19311#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:09,269 INFO L290 TraceCheckUtils]: 37: Hoare triple {19311#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {19311#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:09,270 INFO L290 TraceCheckUtils]: 38: Hoare triple {19311#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {19311#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:09,270 INFO L290 TraceCheckUtils]: 39: Hoare triple {19311#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {19311#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:09,270 INFO L290 TraceCheckUtils]: 40: Hoare triple {19311#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {19311#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:09,271 INFO L290 TraceCheckUtils]: 41: Hoare triple {19311#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {19311#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:09,271 INFO L290 TraceCheckUtils]: 42: Hoare triple {19311#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {19311#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:09,272 INFO L290 TraceCheckUtils]: 43: Hoare triple {19311#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {19312#(= |ssl3_accept_#t~mem53| 8496)} is VALID [2022-04-08 08:39:09,272 INFO L290 TraceCheckUtils]: 44: Hoare triple {19312#(= |ssl3_accept_#t~mem53| 8496)} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {19307#false} is VALID [2022-04-08 08:39:09,272 INFO L290 TraceCheckUtils]: 45: Hoare triple {19307#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {19307#false} is VALID [2022-04-08 08:39:09,273 INFO L290 TraceCheckUtils]: 46: Hoare triple {19307#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {19307#false} is VALID [2022-04-08 08:39:09,273 INFO L290 TraceCheckUtils]: 47: Hoare triple {19307#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {19307#false} is VALID [2022-04-08 08:39:09,273 INFO L290 TraceCheckUtils]: 48: Hoare triple {19307#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {19307#false} is VALID [2022-04-08 08:39:09,273 INFO L290 TraceCheckUtils]: 49: Hoare triple {19307#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {19307#false} is VALID [2022-04-08 08:39:09,273 INFO L290 TraceCheckUtils]: 50: Hoare triple {19307#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {19307#false} is VALID [2022-04-08 08:39:09,273 INFO L290 TraceCheckUtils]: 51: Hoare triple {19307#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {19307#false} is VALID [2022-04-08 08:39:09,273 INFO L290 TraceCheckUtils]: 52: Hoare triple {19307#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {19307#false} is VALID [2022-04-08 08:39:09,273 INFO L290 TraceCheckUtils]: 53: Hoare triple {19307#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {19307#false} is VALID [2022-04-08 08:39:09,273 INFO L290 TraceCheckUtils]: 54: Hoare triple {19307#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {19307#false} is VALID [2022-04-08 08:39:09,274 INFO L290 TraceCheckUtils]: 55: Hoare triple {19307#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {19307#false} is VALID [2022-04-08 08:39:09,274 INFO L290 TraceCheckUtils]: 56: Hoare triple {19307#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {19307#false} is VALID [2022-04-08 08:39:09,274 INFO L290 TraceCheckUtils]: 57: Hoare triple {19307#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {19307#false} is VALID [2022-04-08 08:39:09,274 INFO L290 TraceCheckUtils]: 58: Hoare triple {19307#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {19307#false} is VALID [2022-04-08 08:39:09,274 INFO L290 TraceCheckUtils]: 59: Hoare triple {19307#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {19307#false} is VALID [2022-04-08 08:39:09,274 INFO L290 TraceCheckUtils]: 60: Hoare triple {19307#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {19307#false} is VALID [2022-04-08 08:39:09,274 INFO L290 TraceCheckUtils]: 61: Hoare triple {19307#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {19307#false} is VALID [2022-04-08 08:39:09,274 INFO L290 TraceCheckUtils]: 62: Hoare triple {19307#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {19307#false} is VALID [2022-04-08 08:39:09,274 INFO L290 TraceCheckUtils]: 63: Hoare triple {19307#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {19307#false} is VALID [2022-04-08 08:39:09,274 INFO L290 TraceCheckUtils]: 64: Hoare triple {19307#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {19307#false} is VALID [2022-04-08 08:39:09,275 INFO L290 TraceCheckUtils]: 65: Hoare triple {19307#false} assume 8672 == #t~mem74;havoc #t~mem74; {19307#false} is VALID [2022-04-08 08:39:09,275 INFO L290 TraceCheckUtils]: 66: Hoare triple {19307#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {19307#false} is VALID [2022-04-08 08:39:09,275 INFO L290 TraceCheckUtils]: 67: Hoare triple {19307#false} assume 4 == ~blastFlag~0; {19307#false} is VALID [2022-04-08 08:39:09,275 INFO L290 TraceCheckUtils]: 68: Hoare triple {19307#false} assume !false; {19307#false} is VALID [2022-04-08 08:39:09,275 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:39:09,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:39:09,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559258700] [2022-04-08 08:39:09,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559258700] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:39:09,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:39:09,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:39:09,276 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:39:09,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1837944790] [2022-04-08 08:39:09,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1837944790] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:39:09,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:39:09,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:39:09,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064771677] [2022-04-08 08:39:09,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:39:09,277 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2022-04-08 08:39:09,277 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:39:09,277 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:09,340 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:39:09,340 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:39:09,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:39:09,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:39:09,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:39:09,341 INFO L87 Difference]: Start difference. First operand 315 states and 469 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:11,367 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:39:12,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:39:12,750 INFO L93 Difference]: Finished difference Result 499 states and 749 transitions. [2022-04-08 08:39:12,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:39:12,750 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2022-04-08 08:39:12,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:39:12,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:12,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 461 transitions. [2022-04-08 08:39:12,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:12,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 461 transitions. [2022-04-08 08:39:12,756 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 461 transitions. [2022-04-08 08:39:13,078 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 461 edges. 461 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:39:13,084 INFO L225 Difference]: With dead ends: 499 [2022-04-08 08:39:13,084 INFO L226 Difference]: Without dead ends: 358 [2022-04-08 08:39:13,084 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:39:13,085 INFO L913 BasicCegarLoop]: 201 mSDtfsCounter, 32 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-08 08:39:13,085 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 510 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 403 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-08 08:39:13,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2022-04-08 08:39:13,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 337. [2022-04-08 08:39:13,100 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:39:13,101 INFO L82 GeneralOperation]: Start isEquivalent. First operand 358 states. Second operand has 337 states, 332 states have (on average 1.5090361445783131) internal successors, (501), 332 states have internal predecessors, (501), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:13,101 INFO L74 IsIncluded]: Start isIncluded. First operand 358 states. Second operand has 337 states, 332 states have (on average 1.5090361445783131) internal successors, (501), 332 states have internal predecessors, (501), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:13,102 INFO L87 Difference]: Start difference. First operand 358 states. Second operand has 337 states, 332 states have (on average 1.5090361445783131) internal successors, (501), 332 states have internal predecessors, (501), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:13,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:39:13,109 INFO L93 Difference]: Finished difference Result 358 states and 532 transitions. [2022-04-08 08:39:13,109 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 532 transitions. [2022-04-08 08:39:13,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:39:13,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:39:13,111 INFO L74 IsIncluded]: Start isIncluded. First operand has 337 states, 332 states have (on average 1.5090361445783131) internal successors, (501), 332 states have internal predecessors, (501), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 358 states. [2022-04-08 08:39:13,111 INFO L87 Difference]: Start difference. First operand has 337 states, 332 states have (on average 1.5090361445783131) internal successors, (501), 332 states have internal predecessors, (501), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 358 states. [2022-04-08 08:39:13,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:39:13,119 INFO L93 Difference]: Finished difference Result 358 states and 532 transitions. [2022-04-08 08:39:13,119 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 532 transitions. [2022-04-08 08:39:13,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:39:13,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:39:13,120 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:39:13,120 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:39:13,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 332 states have (on average 1.5090361445783131) internal successors, (501), 332 states have internal predecessors, (501), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:13,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 505 transitions. [2022-04-08 08:39:13,129 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 505 transitions. Word has length 69 [2022-04-08 08:39:13,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:39:13,129 INFO L478 AbstractCegarLoop]: Abstraction has 337 states and 505 transitions. [2022-04-08 08:39:13,129 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:13,129 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 337 states and 505 transitions. [2022-04-08 08:39:13,552 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 505 edges. 505 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:39:13,553 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 505 transitions. [2022-04-08 08:39:13,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-08 08:39:13,554 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:39:13,554 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:39:13,554 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-08 08:39:13,554 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:39:13,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:39:13,554 INFO L85 PathProgramCache]: Analyzing trace with hash -299545146, now seen corresponding path program 1 times [2022-04-08 08:39:13,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:39:13,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1586117719] [2022-04-08 08:39:13,599 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:39:13,599 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:39:13,599 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:39:13,599 INFO L85 PathProgramCache]: Analyzing trace with hash -299545146, now seen corresponding path program 2 times [2022-04-08 08:39:13,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:39:13,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792093576] [2022-04-08 08:39:13,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:39:13,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:39:13,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:39:13,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:39:13,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:39:13,735 INFO L290 TraceCheckUtils]: 0: Hoare triple {21713#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {21706#true} is VALID [2022-04-08 08:39:13,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {21706#true} assume true; {21706#true} is VALID [2022-04-08 08:39:13,735 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21706#true} {21706#true} #664#return; {21706#true} is VALID [2022-04-08 08:39:13,736 INFO L272 TraceCheckUtils]: 0: Hoare triple {21706#true} call ULTIMATE.init(); {21713#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:39:13,736 INFO L290 TraceCheckUtils]: 1: Hoare triple {21713#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {21706#true} is VALID [2022-04-08 08:39:13,736 INFO L290 TraceCheckUtils]: 2: Hoare triple {21706#true} assume true; {21706#true} is VALID [2022-04-08 08:39:13,737 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21706#true} {21706#true} #664#return; {21706#true} is VALID [2022-04-08 08:39:13,737 INFO L272 TraceCheckUtils]: 4: Hoare triple {21706#true} call #t~ret162 := main(); {21706#true} is VALID [2022-04-08 08:39:13,737 INFO L290 TraceCheckUtils]: 5: Hoare triple {21706#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {21706#true} is VALID [2022-04-08 08:39:13,737 INFO L290 TraceCheckUtils]: 6: Hoare triple {21706#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {21706#true} is VALID [2022-04-08 08:39:13,737 INFO L272 TraceCheckUtils]: 7: Hoare triple {21706#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {21706#true} is VALID [2022-04-08 08:39:13,737 INFO L290 TraceCheckUtils]: 8: Hoare triple {21706#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;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~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~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~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {21706#true} is VALID [2022-04-08 08:39:13,737 INFO L290 TraceCheckUtils]: 9: Hoare triple {21706#true} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {21706#true} is VALID [2022-04-08 08:39:13,737 INFO L290 TraceCheckUtils]: 10: Hoare triple {21706#true} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {21706#true} is VALID [2022-04-08 08:39:13,737 INFO L290 TraceCheckUtils]: 11: Hoare triple {21706#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {21706#true} is VALID [2022-04-08 08:39:13,738 INFO L290 TraceCheckUtils]: 12: Hoare triple {21706#true} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {21706#true} is VALID [2022-04-08 08:39:13,738 INFO L290 TraceCheckUtils]: 13: Hoare triple {21706#true} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {21706#true} is VALID [2022-04-08 08:39:13,738 INFO L290 TraceCheckUtils]: 14: Hoare triple {21706#true} assume !false; {21706#true} is VALID [2022-04-08 08:39:13,738 INFO L290 TraceCheckUtils]: 15: Hoare triple {21706#true} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {21706#true} is VALID [2022-04-08 08:39:13,738 INFO L290 TraceCheckUtils]: 16: Hoare triple {21706#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {21706#true} is VALID [2022-04-08 08:39:13,738 INFO L290 TraceCheckUtils]: 17: Hoare triple {21706#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {21706#true} is VALID [2022-04-08 08:39:13,738 INFO L290 TraceCheckUtils]: 18: Hoare triple {21706#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {21706#true} is VALID [2022-04-08 08:39:13,738 INFO L290 TraceCheckUtils]: 19: Hoare triple {21706#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {21706#true} is VALID [2022-04-08 08:39:13,738 INFO L290 TraceCheckUtils]: 20: Hoare triple {21706#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {21706#true} is VALID [2022-04-08 08:39:13,738 INFO L290 TraceCheckUtils]: 21: Hoare triple {21706#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {21706#true} is VALID [2022-04-08 08:39:13,739 INFO L290 TraceCheckUtils]: 22: Hoare triple {21706#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {21706#true} is VALID [2022-04-08 08:39:13,739 INFO L290 TraceCheckUtils]: 23: Hoare triple {21706#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21706#true} is VALID [2022-04-08 08:39:13,739 INFO L290 TraceCheckUtils]: 24: Hoare triple {21706#true} assume 8464 == #t~mem50;havoc #t~mem50; {21706#true} is VALID [2022-04-08 08:39:13,739 INFO L290 TraceCheckUtils]: 25: Hoare triple {21706#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {21706#true} is VALID [2022-04-08 08:39:13,739 INFO L290 TraceCheckUtils]: 26: Hoare triple {21706#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {21706#true} is VALID [2022-04-08 08:39:13,740 INFO L290 TraceCheckUtils]: 27: Hoare triple {21706#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {21711#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:39:13,741 INFO L290 TraceCheckUtils]: 28: Hoare triple {21711#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {21711#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:39:13,741 INFO L290 TraceCheckUtils]: 29: Hoare triple {21711#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {21711#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:39:13,742 INFO L290 TraceCheckUtils]: 30: Hoare triple {21711#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {21711#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:39:13,742 INFO L290 TraceCheckUtils]: 31: Hoare triple {21711#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {21711#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:39:13,743 INFO L290 TraceCheckUtils]: 32: Hoare triple {21711#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {21711#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:39:13,744 INFO L290 TraceCheckUtils]: 33: Hoare triple {21711#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {21711#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:39:13,744 INFO L290 TraceCheckUtils]: 34: Hoare triple {21711#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {21711#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:39:13,745 INFO L290 TraceCheckUtils]: 35: Hoare triple {21711#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {21711#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:39:13,745 INFO L290 TraceCheckUtils]: 36: Hoare triple {21711#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {21711#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:39:13,746 INFO L290 TraceCheckUtils]: 37: Hoare triple {21711#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {21712#(not (= |ssl3_accept_#t~mem47| 8480))} is VALID [2022-04-08 08:39:13,746 INFO L290 TraceCheckUtils]: 38: Hoare triple {21712#(not (= |ssl3_accept_#t~mem47| 8480))} assume 8480 == #t~mem47;havoc #t~mem47; {21707#false} is VALID [2022-04-08 08:39:13,746 INFO L290 TraceCheckUtils]: 39: Hoare triple {21707#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet87 && #t~nondet87 <= 2147483647;~ret~0 := #t~nondet87;havoc #t~nondet87; {21707#false} is VALID [2022-04-08 08:39:13,746 INFO L290 TraceCheckUtils]: 40: Hoare triple {21707#false} assume !(~ret~0 <= 0);call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem88.base, 844 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {21707#false} is VALID [2022-04-08 08:39:13,746 INFO L290 TraceCheckUtils]: 41: Hoare triple {21707#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {21707#false} is VALID [2022-04-08 08:39:13,746 INFO L290 TraceCheckUtils]: 42: Hoare triple {21707#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {21707#false} is VALID [2022-04-08 08:39:13,746 INFO L290 TraceCheckUtils]: 43: Hoare triple {21707#false} ~skip~0 := 0; {21707#false} is VALID [2022-04-08 08:39:13,747 INFO L290 TraceCheckUtils]: 44: Hoare triple {21707#false} assume !false; {21707#false} is VALID [2022-04-08 08:39:13,747 INFO L290 TraceCheckUtils]: 45: Hoare triple {21707#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {21707#false} is VALID [2022-04-08 08:39:13,747 INFO L290 TraceCheckUtils]: 46: Hoare triple {21707#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {21707#false} is VALID [2022-04-08 08:39:13,747 INFO L290 TraceCheckUtils]: 47: Hoare triple {21707#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {21707#false} is VALID [2022-04-08 08:39:13,747 INFO L290 TraceCheckUtils]: 48: Hoare triple {21707#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {21707#false} is VALID [2022-04-08 08:39:13,747 INFO L290 TraceCheckUtils]: 49: Hoare triple {21707#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {21707#false} is VALID [2022-04-08 08:39:13,747 INFO L290 TraceCheckUtils]: 50: Hoare triple {21707#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {21707#false} is VALID [2022-04-08 08:39:13,747 INFO L290 TraceCheckUtils]: 51: Hoare triple {21707#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {21707#false} is VALID [2022-04-08 08:39:13,747 INFO L290 TraceCheckUtils]: 52: Hoare triple {21707#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {21707#false} is VALID [2022-04-08 08:39:13,748 INFO L290 TraceCheckUtils]: 53: Hoare triple {21707#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21707#false} is VALID [2022-04-08 08:39:13,748 INFO L290 TraceCheckUtils]: 54: Hoare triple {21707#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {21707#false} is VALID [2022-04-08 08:39:13,748 INFO L290 TraceCheckUtils]: 55: Hoare triple {21707#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {21707#false} is VALID [2022-04-08 08:39:13,748 INFO L290 TraceCheckUtils]: 56: Hoare triple {21707#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {21707#false} is VALID [2022-04-08 08:39:13,748 INFO L290 TraceCheckUtils]: 57: Hoare triple {21707#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {21707#false} is VALID [2022-04-08 08:39:13,748 INFO L290 TraceCheckUtils]: 58: Hoare triple {21707#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {21707#false} is VALID [2022-04-08 08:39:13,748 INFO L290 TraceCheckUtils]: 59: Hoare triple {21707#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {21707#false} is VALID [2022-04-08 08:39:13,748 INFO L290 TraceCheckUtils]: 60: Hoare triple {21707#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {21707#false} is VALID [2022-04-08 08:39:13,748 INFO L290 TraceCheckUtils]: 61: Hoare triple {21707#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {21707#false} is VALID [2022-04-08 08:39:13,748 INFO L290 TraceCheckUtils]: 62: Hoare triple {21707#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {21707#false} is VALID [2022-04-08 08:39:13,749 INFO L290 TraceCheckUtils]: 63: Hoare triple {21707#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {21707#false} is VALID [2022-04-08 08:39:13,749 INFO L290 TraceCheckUtils]: 64: Hoare triple {21707#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {21707#false} is VALID [2022-04-08 08:39:13,749 INFO L290 TraceCheckUtils]: 65: Hoare triple {21707#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {21707#false} is VALID [2022-04-08 08:39:13,749 INFO L290 TraceCheckUtils]: 66: Hoare triple {21707#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {21707#false} is VALID [2022-04-08 08:39:13,749 INFO L290 TraceCheckUtils]: 67: Hoare triple {21707#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {21707#false} is VALID [2022-04-08 08:39:13,749 INFO L290 TraceCheckUtils]: 68: Hoare triple {21707#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {21707#false} is VALID [2022-04-08 08:39:13,749 INFO L290 TraceCheckUtils]: 69: Hoare triple {21707#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {21707#false} is VALID [2022-04-08 08:39:13,749 INFO L290 TraceCheckUtils]: 70: Hoare triple {21707#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {21707#false} is VALID [2022-04-08 08:39:13,749 INFO L290 TraceCheckUtils]: 71: Hoare triple {21707#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {21707#false} is VALID [2022-04-08 08:39:13,749 INFO L290 TraceCheckUtils]: 72: Hoare triple {21707#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {21707#false} is VALID [2022-04-08 08:39:13,750 INFO L290 TraceCheckUtils]: 73: Hoare triple {21707#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {21707#false} is VALID [2022-04-08 08:39:13,750 INFO L290 TraceCheckUtils]: 74: Hoare triple {21707#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {21707#false} is VALID [2022-04-08 08:39:13,750 INFO L290 TraceCheckUtils]: 75: Hoare triple {21707#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {21707#false} is VALID [2022-04-08 08:39:13,750 INFO L290 TraceCheckUtils]: 76: Hoare triple {21707#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {21707#false} is VALID [2022-04-08 08:39:13,750 INFO L290 TraceCheckUtils]: 77: Hoare triple {21707#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {21707#false} is VALID [2022-04-08 08:39:13,750 INFO L290 TraceCheckUtils]: 78: Hoare triple {21707#false} assume 8672 == #t~mem74;havoc #t~mem74; {21707#false} is VALID [2022-04-08 08:39:13,750 INFO L290 TraceCheckUtils]: 79: Hoare triple {21707#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {21707#false} is VALID [2022-04-08 08:39:13,750 INFO L290 TraceCheckUtils]: 80: Hoare triple {21707#false} assume 4 == ~blastFlag~0; {21707#false} is VALID [2022-04-08 08:39:13,750 INFO L290 TraceCheckUtils]: 81: Hoare triple {21707#false} assume !false; {21707#false} is VALID [2022-04-08 08:39:13,751 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-08 08:39:13,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:39:13,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792093576] [2022-04-08 08:39:13,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792093576] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:39:13,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:39:13,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:39:13,752 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:39:13,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1586117719] [2022-04-08 08:39:13,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1586117719] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:39:13,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:39:13,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:39:13,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606356531] [2022-04-08 08:39:13,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:39:13,753 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-08 08:39:13,753 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:39:13,753 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-08 08:39:13,830 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-08 08:39:13,830 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:39:13,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:39:13,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:39:13,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:39:13,831 INFO L87 Difference]: Start difference. First operand 337 states and 505 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-08 08:39:15,865 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:39:17,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:39:17,669 INFO L93 Difference]: Finished difference Result 879 states and 1328 transitions. [2022-04-08 08:39:17,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:39:17,669 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-08 08:39:17,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:39:17,669 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-08 08:39:17,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 572 transitions. [2022-04-08 08:39:17,675 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-08 08:39:17,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 572 transitions. [2022-04-08 08:39:17,693 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 572 transitions. [2022-04-08 08:39:18,101 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 572 edges. 572 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:39:18,114 INFO L225 Difference]: With dead ends: 879 [2022-04-08 08:39:18,114 INFO L226 Difference]: Without dead ends: 570 [2022-04-08 08:39:18,115 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:39:18,116 INFO L913 BasicCegarLoop]: 222 mSDtfsCounter, 139 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-08 08:39:18,116 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 545 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 575 Invalid, 1 Unknown, 0 Unchecked, 2.7s Time] [2022-04-08 08:39:18,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2022-04-08 08:39:18,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 369. [2022-04-08 08:39:18,142 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:39:18,143 INFO L82 GeneralOperation]: Start isEquivalent. First operand 570 states. Second operand has 369 states, 364 states have (on average 1.510989010989011) internal successors, (550), 364 states have internal predecessors, (550), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:18,144 INFO L74 IsIncluded]: Start isIncluded. First operand 570 states. Second operand has 369 states, 364 states have (on average 1.510989010989011) internal successors, (550), 364 states have internal predecessors, (550), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:18,145 INFO L87 Difference]: Start difference. First operand 570 states. Second operand has 369 states, 364 states have (on average 1.510989010989011) internal successors, (550), 364 states have internal predecessors, (550), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:18,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:39:18,160 INFO L93 Difference]: Finished difference Result 570 states and 855 transitions. [2022-04-08 08:39:18,160 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 855 transitions. [2022-04-08 08:39:18,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:39:18,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:39:18,162 INFO L74 IsIncluded]: Start isIncluded. First operand has 369 states, 364 states have (on average 1.510989010989011) internal successors, (550), 364 states have internal predecessors, (550), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 570 states. [2022-04-08 08:39:18,163 INFO L87 Difference]: Start difference. First operand has 369 states, 364 states have (on average 1.510989010989011) internal successors, (550), 364 states have internal predecessors, (550), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 570 states. [2022-04-08 08:39:18,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:39:18,179 INFO L93 Difference]: Finished difference Result 570 states and 855 transitions. [2022-04-08 08:39:18,179 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 855 transitions. [2022-04-08 08:39:18,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:39:18,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:39:18,180 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:39:18,180 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:39:18,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 364 states have (on average 1.510989010989011) internal successors, (550), 364 states have internal predecessors, (550), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:18,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 554 transitions. [2022-04-08 08:39:18,190 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 554 transitions. Word has length 82 [2022-04-08 08:39:18,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:39:18,190 INFO L478 AbstractCegarLoop]: Abstraction has 369 states and 554 transitions. [2022-04-08 08:39:18,190 INFO L479 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-08 08:39:18,190 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 369 states and 554 transitions. [2022-04-08 08:39:18,666 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 554 edges. 554 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:39:18,666 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 554 transitions. [2022-04-08 08:39:18,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-04-08 08:39:18,667 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:39:18,668 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:39:18,668 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-08 08:39:18,668 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:39:18,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:39:18,668 INFO L85 PathProgramCache]: Analyzing trace with hash -301741538, now seen corresponding path program 1 times [2022-04-08 08:39:18,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:39:18,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1807714872] [2022-04-08 08:39:18,705 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:39:18,705 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:39:18,705 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:39:18,705 INFO L85 PathProgramCache]: Analyzing trace with hash -301741538, now seen corresponding path program 2 times [2022-04-08 08:39:18,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:39:18,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244112034] [2022-04-08 08:39:18,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:39:18,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:39:18,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:39:18,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:39:18,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:39:18,862 INFO L290 TraceCheckUtils]: 0: Hoare triple {25361#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {25354#true} is VALID [2022-04-08 08:39:18,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {25354#true} assume true; {25354#true} is VALID [2022-04-08 08:39:18,862 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25354#true} {25354#true} #664#return; {25354#true} is VALID [2022-04-08 08:39:18,863 INFO L272 TraceCheckUtils]: 0: Hoare triple {25354#true} call ULTIMATE.init(); {25361#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:39:18,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {25361#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {25354#true} is VALID [2022-04-08 08:39:18,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {25354#true} assume true; {25354#true} is VALID [2022-04-08 08:39:18,864 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25354#true} {25354#true} #664#return; {25354#true} is VALID [2022-04-08 08:39:18,864 INFO L272 TraceCheckUtils]: 4: Hoare triple {25354#true} call #t~ret162 := main(); {25354#true} is VALID [2022-04-08 08:39:18,864 INFO L290 TraceCheckUtils]: 5: Hoare triple {25354#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {25354#true} is VALID [2022-04-08 08:39:18,864 INFO L290 TraceCheckUtils]: 6: Hoare triple {25354#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {25354#true} is VALID [2022-04-08 08:39:18,864 INFO L272 TraceCheckUtils]: 7: Hoare triple {25354#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {25354#true} is VALID [2022-04-08 08:39:18,864 INFO L290 TraceCheckUtils]: 8: Hoare triple {25354#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;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~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~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~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {25354#true} is VALID [2022-04-08 08:39:18,864 INFO L290 TraceCheckUtils]: 9: Hoare triple {25354#true} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {25354#true} is VALID [2022-04-08 08:39:18,864 INFO L290 TraceCheckUtils]: 10: Hoare triple {25354#true} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {25354#true} is VALID [2022-04-08 08:39:18,864 INFO L290 TraceCheckUtils]: 11: Hoare triple {25354#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {25354#true} is VALID [2022-04-08 08:39:18,864 INFO L290 TraceCheckUtils]: 12: Hoare triple {25354#true} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {25354#true} is VALID [2022-04-08 08:39:18,865 INFO L290 TraceCheckUtils]: 13: Hoare triple {25354#true} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {25354#true} is VALID [2022-04-08 08:39:18,865 INFO L290 TraceCheckUtils]: 14: Hoare triple {25354#true} assume !false; {25354#true} is VALID [2022-04-08 08:39:18,865 INFO L290 TraceCheckUtils]: 15: Hoare triple {25354#true} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {25354#true} is VALID [2022-04-08 08:39:18,865 INFO L290 TraceCheckUtils]: 16: Hoare triple {25354#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {25354#true} is VALID [2022-04-08 08:39:18,865 INFO L290 TraceCheckUtils]: 17: Hoare triple {25354#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {25354#true} is VALID [2022-04-08 08:39:18,865 INFO L290 TraceCheckUtils]: 18: Hoare triple {25354#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {25354#true} is VALID [2022-04-08 08:39:18,865 INFO L290 TraceCheckUtils]: 19: Hoare triple {25354#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {25354#true} is VALID [2022-04-08 08:39:18,865 INFO L290 TraceCheckUtils]: 20: Hoare triple {25354#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {25354#true} is VALID [2022-04-08 08:39:18,865 INFO L290 TraceCheckUtils]: 21: Hoare triple {25354#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {25354#true} is VALID [2022-04-08 08:39:18,865 INFO L290 TraceCheckUtils]: 22: Hoare triple {25354#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {25354#true} is VALID [2022-04-08 08:39:18,865 INFO L290 TraceCheckUtils]: 23: Hoare triple {25354#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {25354#true} is VALID [2022-04-08 08:39:18,866 INFO L290 TraceCheckUtils]: 24: Hoare triple {25354#true} assume 8464 == #t~mem50;havoc #t~mem50; {25354#true} is VALID [2022-04-08 08:39:18,866 INFO L290 TraceCheckUtils]: 25: Hoare triple {25354#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {25354#true} is VALID [2022-04-08 08:39:18,866 INFO L290 TraceCheckUtils]: 26: Hoare triple {25354#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {25354#true} is VALID [2022-04-08 08:39:18,867 INFO L290 TraceCheckUtils]: 27: Hoare triple {25354#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {25359#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:39:18,868 INFO L290 TraceCheckUtils]: 28: Hoare triple {25359#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {25359#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:39:18,868 INFO L290 TraceCheckUtils]: 29: Hoare triple {25359#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {25359#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:39:18,868 INFO L290 TraceCheckUtils]: 30: Hoare triple {25359#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {25359#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:39:18,869 INFO L290 TraceCheckUtils]: 31: Hoare triple {25359#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {25359#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:39:18,869 INFO L290 TraceCheckUtils]: 32: Hoare triple {25359#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {25359#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:39:18,870 INFO L290 TraceCheckUtils]: 33: Hoare triple {25359#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {25359#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:39:18,870 INFO L290 TraceCheckUtils]: 34: Hoare triple {25359#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {25359#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:39:18,870 INFO L290 TraceCheckUtils]: 35: Hoare triple {25359#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {25359#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:39:18,871 INFO L290 TraceCheckUtils]: 36: Hoare triple {25359#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {25359#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:39:18,871 INFO L290 TraceCheckUtils]: 37: Hoare triple {25359#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {25359#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:39:18,872 INFO L290 TraceCheckUtils]: 38: Hoare triple {25359#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {25359#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:39:18,872 INFO L290 TraceCheckUtils]: 39: Hoare triple {25359#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {25360#(not (= |ssl3_accept_#t~mem49| 8482))} is VALID [2022-04-08 08:39:18,872 INFO L290 TraceCheckUtils]: 40: Hoare triple {25360#(not (= |ssl3_accept_#t~mem49| 8482))} assume 8482 == #t~mem49;havoc #t~mem49; {25355#false} is VALID [2022-04-08 08:39:18,873 INFO L290 TraceCheckUtils]: 41: Hoare triple {25355#false} call write~int(3, ~s.base, 52 + ~s.offset, 4); {25355#false} is VALID [2022-04-08 08:39:18,873 INFO L290 TraceCheckUtils]: 42: Hoare triple {25355#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {25355#false} is VALID [2022-04-08 08:39:18,873 INFO L290 TraceCheckUtils]: 43: Hoare triple {25355#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {25355#false} is VALID [2022-04-08 08:39:18,873 INFO L290 TraceCheckUtils]: 44: Hoare triple {25355#false} ~skip~0 := 0; {25355#false} is VALID [2022-04-08 08:39:18,873 INFO L290 TraceCheckUtils]: 45: Hoare triple {25355#false} assume !false; {25355#false} is VALID [2022-04-08 08:39:18,873 INFO L290 TraceCheckUtils]: 46: Hoare triple {25355#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {25355#false} is VALID [2022-04-08 08:39:18,873 INFO L290 TraceCheckUtils]: 47: Hoare triple {25355#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {25355#false} is VALID [2022-04-08 08:39:18,873 INFO L290 TraceCheckUtils]: 48: Hoare triple {25355#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {25355#false} is VALID [2022-04-08 08:39:18,873 INFO L290 TraceCheckUtils]: 49: Hoare triple {25355#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {25355#false} is VALID [2022-04-08 08:39:18,873 INFO L290 TraceCheckUtils]: 50: Hoare triple {25355#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {25355#false} is VALID [2022-04-08 08:39:18,874 INFO L290 TraceCheckUtils]: 51: Hoare triple {25355#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {25355#false} is VALID [2022-04-08 08:39:18,874 INFO L290 TraceCheckUtils]: 52: Hoare triple {25355#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {25355#false} is VALID [2022-04-08 08:39:18,874 INFO L290 TraceCheckUtils]: 53: Hoare triple {25355#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {25355#false} is VALID [2022-04-08 08:39:18,874 INFO L290 TraceCheckUtils]: 54: Hoare triple {25355#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {25355#false} is VALID [2022-04-08 08:39:18,874 INFO L290 TraceCheckUtils]: 55: Hoare triple {25355#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {25355#false} is VALID [2022-04-08 08:39:18,874 INFO L290 TraceCheckUtils]: 56: Hoare triple {25355#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {25355#false} is VALID [2022-04-08 08:39:18,874 INFO L290 TraceCheckUtils]: 57: Hoare triple {25355#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {25355#false} is VALID [2022-04-08 08:39:18,874 INFO L290 TraceCheckUtils]: 58: Hoare triple {25355#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {25355#false} is VALID [2022-04-08 08:39:18,874 INFO L290 TraceCheckUtils]: 59: Hoare triple {25355#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {25355#false} is VALID [2022-04-08 08:39:18,874 INFO L290 TraceCheckUtils]: 60: Hoare triple {25355#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {25355#false} is VALID [2022-04-08 08:39:18,874 INFO L290 TraceCheckUtils]: 61: Hoare triple {25355#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {25355#false} is VALID [2022-04-08 08:39:18,875 INFO L290 TraceCheckUtils]: 62: Hoare triple {25355#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {25355#false} is VALID [2022-04-08 08:39:18,875 INFO L290 TraceCheckUtils]: 63: Hoare triple {25355#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {25355#false} is VALID [2022-04-08 08:39:18,875 INFO L290 TraceCheckUtils]: 64: Hoare triple {25355#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {25355#false} is VALID [2022-04-08 08:39:18,875 INFO L290 TraceCheckUtils]: 65: Hoare triple {25355#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {25355#false} is VALID [2022-04-08 08:39:18,875 INFO L290 TraceCheckUtils]: 66: Hoare triple {25355#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {25355#false} is VALID [2022-04-08 08:39:18,875 INFO L290 TraceCheckUtils]: 67: Hoare triple {25355#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {25355#false} is VALID [2022-04-08 08:39:18,875 INFO L290 TraceCheckUtils]: 68: Hoare triple {25355#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {25355#false} is VALID [2022-04-08 08:39:18,875 INFO L290 TraceCheckUtils]: 69: Hoare triple {25355#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {25355#false} is VALID [2022-04-08 08:39:18,875 INFO L290 TraceCheckUtils]: 70: Hoare triple {25355#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {25355#false} is VALID [2022-04-08 08:39:18,875 INFO L290 TraceCheckUtils]: 71: Hoare triple {25355#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {25355#false} is VALID [2022-04-08 08:39:18,876 INFO L290 TraceCheckUtils]: 72: Hoare triple {25355#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {25355#false} is VALID [2022-04-08 08:39:18,876 INFO L290 TraceCheckUtils]: 73: Hoare triple {25355#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {25355#false} is VALID [2022-04-08 08:39:18,876 INFO L290 TraceCheckUtils]: 74: Hoare triple {25355#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {25355#false} is VALID [2022-04-08 08:39:18,876 INFO L290 TraceCheckUtils]: 75: Hoare triple {25355#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {25355#false} is VALID [2022-04-08 08:39:18,876 INFO L290 TraceCheckUtils]: 76: Hoare triple {25355#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {25355#false} is VALID [2022-04-08 08:39:18,876 INFO L290 TraceCheckUtils]: 77: Hoare triple {25355#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {25355#false} is VALID [2022-04-08 08:39:18,876 INFO L290 TraceCheckUtils]: 78: Hoare triple {25355#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {25355#false} is VALID [2022-04-08 08:39:18,876 INFO L290 TraceCheckUtils]: 79: Hoare triple {25355#false} assume 8672 == #t~mem74;havoc #t~mem74; {25355#false} is VALID [2022-04-08 08:39:18,876 INFO L290 TraceCheckUtils]: 80: Hoare triple {25355#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {25355#false} is VALID [2022-04-08 08:39:18,876 INFO L290 TraceCheckUtils]: 81: Hoare triple {25355#false} assume 4 == ~blastFlag~0; {25355#false} is VALID [2022-04-08 08:39:18,876 INFO L290 TraceCheckUtils]: 82: Hoare triple {25355#false} assume !false; {25355#false} is VALID [2022-04-08 08:39:18,877 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:39:18,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:39:18,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244112034] [2022-04-08 08:39:18,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244112034] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:39:18,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:39:18,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:39:18,879 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:39:18,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1807714872] [2022-04-08 08:39:18,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1807714872] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:39:18,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:39:18,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:39:18,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484318549] [2022-04-08 08:39:18,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:39:18,880 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-08 08:39:18,881 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:39:18,881 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:18,946 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:39:18,946 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:39:18,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:39:18,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:39:18,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:39:18,947 INFO L87 Difference]: Start difference. First operand 369 states and 554 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:20,980 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:39:22,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:39:22,394 INFO L93 Difference]: Finished difference Result 911 states and 1374 transitions. [2022-04-08 08:39:22,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:39:22,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-08 08:39:22,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:39:22,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:22,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 573 transitions. [2022-04-08 08:39:22,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:22,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 573 transitions. [2022-04-08 08:39:22,399 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 573 transitions. [2022-04-08 08:39:22,788 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 573 edges. 573 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:39:22,809 INFO L225 Difference]: With dead ends: 911 [2022-04-08 08:39:22,809 INFO L226 Difference]: Without dead ends: 570 [2022-04-08 08:39:22,810 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:39:22,810 INFO L913 BasicCegarLoop]: 111 mSDtfsCounter, 137 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-08 08:39:22,810 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 323 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 464 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2022-04-08 08:39:22,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2022-04-08 08:39:22,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 371. [2022-04-08 08:39:22,833 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:39:22,833 INFO L82 GeneralOperation]: Start isEquivalent. First operand 570 states. Second operand has 371 states, 366 states have (on average 1.505464480874317) internal successors, (551), 366 states have internal predecessors, (551), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:22,834 INFO L74 IsIncluded]: Start isIncluded. First operand 570 states. Second operand has 371 states, 366 states have (on average 1.505464480874317) internal successors, (551), 366 states have internal predecessors, (551), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:22,834 INFO L87 Difference]: Start difference. First operand 570 states. Second operand has 371 states, 366 states have (on average 1.505464480874317) internal successors, (551), 366 states have internal predecessors, (551), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:22,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:39:22,850 INFO L93 Difference]: Finished difference Result 570 states and 852 transitions. [2022-04-08 08:39:22,850 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 852 transitions. [2022-04-08 08:39:22,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:39:22,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:39:22,851 INFO L74 IsIncluded]: Start isIncluded. First operand has 371 states, 366 states have (on average 1.505464480874317) internal successors, (551), 366 states have internal predecessors, (551), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 570 states. [2022-04-08 08:39:22,852 INFO L87 Difference]: Start difference. First operand has 371 states, 366 states have (on average 1.505464480874317) internal successors, (551), 366 states have internal predecessors, (551), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 570 states. [2022-04-08 08:39:22,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:39:22,867 INFO L93 Difference]: Finished difference Result 570 states and 852 transitions. [2022-04-08 08:39:22,868 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 852 transitions. [2022-04-08 08:39:22,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:39:22,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:39:22,869 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:39:22,869 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:39:22,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 366 states have (on average 1.505464480874317) internal successors, (551), 366 states have internal predecessors, (551), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:22,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 555 transitions. [2022-04-08 08:39:22,879 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 555 transitions. Word has length 83 [2022-04-08 08:39:22,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:39:22,879 INFO L478 AbstractCegarLoop]: Abstraction has 371 states and 555 transitions. [2022-04-08 08:39:22,879 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:22,880 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 371 states and 555 transitions. [2022-04-08 08:39:23,369 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 555 edges. 555 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:39:23,370 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 555 transitions. [2022-04-08 08:39:23,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-08 08:39:23,371 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:39:23,372 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:39:23,372 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-08 08:39:23,372 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:39:23,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:39:23,372 INFO L85 PathProgramCache]: Analyzing trace with hash -276632906, now seen corresponding path program 1 times [2022-04-08 08:39:23,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:39:23,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2111933966] [2022-04-08 08:39:23,412 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:39:23,412 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:39:23,412 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:39:23,412 INFO L85 PathProgramCache]: Analyzing trace with hash -276632906, now seen corresponding path program 2 times [2022-04-08 08:39:23,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:39:23,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880293810] [2022-04-08 08:39:23,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:39:23,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:39:23,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:39:23,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:39:23,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:39:23,545 INFO L290 TraceCheckUtils]: 0: Hoare triple {29077#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {29070#true} is VALID [2022-04-08 08:39:23,546 INFO L290 TraceCheckUtils]: 1: Hoare triple {29070#true} assume true; {29070#true} is VALID [2022-04-08 08:39:23,546 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29070#true} {29070#true} #664#return; {29070#true} is VALID [2022-04-08 08:39:23,547 INFO L272 TraceCheckUtils]: 0: Hoare triple {29070#true} call ULTIMATE.init(); {29077#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:39:23,547 INFO L290 TraceCheckUtils]: 1: Hoare triple {29077#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {29070#true} is VALID [2022-04-08 08:39:23,547 INFO L290 TraceCheckUtils]: 2: Hoare triple {29070#true} assume true; {29070#true} is VALID [2022-04-08 08:39:23,547 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29070#true} {29070#true} #664#return; {29070#true} is VALID [2022-04-08 08:39:23,547 INFO L272 TraceCheckUtils]: 4: Hoare triple {29070#true} call #t~ret162 := main(); {29070#true} is VALID [2022-04-08 08:39:23,547 INFO L290 TraceCheckUtils]: 5: Hoare triple {29070#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {29070#true} is VALID [2022-04-08 08:39:23,548 INFO L290 TraceCheckUtils]: 6: Hoare triple {29070#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {29070#true} is VALID [2022-04-08 08:39:23,548 INFO L272 TraceCheckUtils]: 7: Hoare triple {29070#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {29070#true} is VALID [2022-04-08 08:39:23,548 INFO L290 TraceCheckUtils]: 8: Hoare triple {29070#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;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~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~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~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {29070#true} is VALID [2022-04-08 08:39:23,548 INFO L290 TraceCheckUtils]: 9: Hoare triple {29070#true} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {29070#true} is VALID [2022-04-08 08:39:23,548 INFO L290 TraceCheckUtils]: 10: Hoare triple {29070#true} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {29070#true} is VALID [2022-04-08 08:39:23,548 INFO L290 TraceCheckUtils]: 11: Hoare triple {29070#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {29070#true} is VALID [2022-04-08 08:39:23,548 INFO L290 TraceCheckUtils]: 12: Hoare triple {29070#true} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {29070#true} is VALID [2022-04-08 08:39:23,548 INFO L290 TraceCheckUtils]: 13: Hoare triple {29070#true} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {29070#true} is VALID [2022-04-08 08:39:23,548 INFO L290 TraceCheckUtils]: 14: Hoare triple {29070#true} assume !false; {29070#true} is VALID [2022-04-08 08:39:23,548 INFO L290 TraceCheckUtils]: 15: Hoare triple {29070#true} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {29070#true} is VALID [2022-04-08 08:39:23,548 INFO L290 TraceCheckUtils]: 16: Hoare triple {29070#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {29070#true} is VALID [2022-04-08 08:39:23,549 INFO L290 TraceCheckUtils]: 17: Hoare triple {29070#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {29070#true} is VALID [2022-04-08 08:39:23,549 INFO L290 TraceCheckUtils]: 18: Hoare triple {29070#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {29070#true} is VALID [2022-04-08 08:39:23,549 INFO L290 TraceCheckUtils]: 19: Hoare triple {29070#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {29070#true} is VALID [2022-04-08 08:39:23,549 INFO L290 TraceCheckUtils]: 20: Hoare triple {29070#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {29070#true} is VALID [2022-04-08 08:39:23,549 INFO L290 TraceCheckUtils]: 21: Hoare triple {29070#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {29070#true} is VALID [2022-04-08 08:39:23,549 INFO L290 TraceCheckUtils]: 22: Hoare triple {29070#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {29070#true} is VALID [2022-04-08 08:39:23,549 INFO L290 TraceCheckUtils]: 23: Hoare triple {29070#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {29070#true} is VALID [2022-04-08 08:39:23,549 INFO L290 TraceCheckUtils]: 24: Hoare triple {29070#true} assume 8464 == #t~mem50;havoc #t~mem50; {29070#true} is VALID [2022-04-08 08:39:23,549 INFO L290 TraceCheckUtils]: 25: Hoare triple {29070#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {29070#true} is VALID [2022-04-08 08:39:23,549 INFO L290 TraceCheckUtils]: 26: Hoare triple {29070#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {29070#true} is VALID [2022-04-08 08:39:23,550 INFO L290 TraceCheckUtils]: 27: Hoare triple {29070#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {29070#true} is VALID [2022-04-08 08:39:23,550 INFO L290 TraceCheckUtils]: 28: Hoare triple {29070#true} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {29070#true} is VALID [2022-04-08 08:39:23,550 INFO L290 TraceCheckUtils]: 29: Hoare triple {29070#true} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {29070#true} is VALID [2022-04-08 08:39:23,550 INFO L290 TraceCheckUtils]: 30: Hoare triple {29070#true} ~skip~0 := 0; {29070#true} is VALID [2022-04-08 08:39:23,550 INFO L290 TraceCheckUtils]: 31: Hoare triple {29070#true} assume !false; {29070#true} is VALID [2022-04-08 08:39:23,550 INFO L290 TraceCheckUtils]: 32: Hoare triple {29070#true} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {29070#true} is VALID [2022-04-08 08:39:23,550 INFO L290 TraceCheckUtils]: 33: Hoare triple {29070#true} assume 12292 == #t~mem42;havoc #t~mem42; {29070#true} is VALID [2022-04-08 08:39:23,550 INFO L290 TraceCheckUtils]: 34: Hoare triple {29070#true} call write~int(1, ~s.base, 40 + ~s.offset, 4); {29070#true} is VALID [2022-04-08 08:39:23,550 INFO L290 TraceCheckUtils]: 35: Hoare triple {29070#true} call write~int(1, ~s.base, 36 + ~s.offset, 4); {29070#true} is VALID [2022-04-08 08:39:23,550 INFO L290 TraceCheckUtils]: 36: Hoare triple {29070#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {29070#true} is VALID [2022-04-08 08:39:23,551 INFO L290 TraceCheckUtils]: 37: Hoare triple {29070#true} call #t~mem77 := read~int(~s.base, ~s.offset, 4); {29070#true} is VALID [2022-04-08 08:39:23,551 INFO L290 TraceCheckUtils]: 38: Hoare triple {29070#true} assume !(3 != #t~mem77 / 256);havoc #t~mem77;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem78.base, #t~mem78.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {29070#true} is VALID [2022-04-08 08:39:23,551 INFO L290 TraceCheckUtils]: 39: Hoare triple {29070#true} assume !(0 == (#t~mem78.base + #t~mem78.offset) % 4294967296);havoc #t~mem78.base, #t~mem78.offset; {29070#true} is VALID [2022-04-08 08:39:23,551 INFO L290 TraceCheckUtils]: 40: Hoare triple {29070#true} assume -2147483648 <= #t~nondet80 && #t~nondet80 <= 2147483647;~tmp___4~0 := #t~nondet80;havoc #t~nondet80; {29070#true} is VALID [2022-04-08 08:39:23,551 INFO L290 TraceCheckUtils]: 41: Hoare triple {29070#true} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem81 := read~int(~s.base, 52 + ~s.offset, 4); {29070#true} is VALID [2022-04-08 08:39:23,552 INFO L290 TraceCheckUtils]: 42: Hoare triple {29070#true} assume !(12292 != #t~mem81);havoc #t~mem81;call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem86 := read~int(#t~mem85.base, 76 + #t~mem85.offset, 4);call write~int(1 + #t~mem86, #t~mem85.base, 76 + #t~mem85.offset, 4);havoc #t~mem85.base, #t~mem85.offset;havoc #t~mem86;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {29075#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:23,553 INFO L290 TraceCheckUtils]: 43: Hoare triple {29075#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {29075#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:23,553 INFO L290 TraceCheckUtils]: 44: Hoare triple {29075#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {29075#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:23,554 INFO L290 TraceCheckUtils]: 45: Hoare triple {29075#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {29075#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:23,554 INFO L290 TraceCheckUtils]: 46: Hoare triple {29075#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {29075#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:23,554 INFO L290 TraceCheckUtils]: 47: Hoare triple {29075#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {29075#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:23,555 INFO L290 TraceCheckUtils]: 48: Hoare triple {29075#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {29075#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:23,555 INFO L290 TraceCheckUtils]: 49: Hoare triple {29075#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {29075#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:23,556 INFO L290 TraceCheckUtils]: 50: Hoare triple {29075#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {29075#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:23,556 INFO L290 TraceCheckUtils]: 51: Hoare triple {29075#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {29075#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:39:23,557 INFO L290 TraceCheckUtils]: 52: Hoare triple {29075#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {29076#(= |ssl3_accept_#t~mem47| 8480)} is VALID [2022-04-08 08:39:23,557 INFO L290 TraceCheckUtils]: 53: Hoare triple {29076#(= |ssl3_accept_#t~mem47| 8480)} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {29071#false} is VALID [2022-04-08 08:39:23,557 INFO L290 TraceCheckUtils]: 54: Hoare triple {29071#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {29071#false} is VALID [2022-04-08 08:39:23,557 INFO L290 TraceCheckUtils]: 55: Hoare triple {29071#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {29071#false} is VALID [2022-04-08 08:39:23,557 INFO L290 TraceCheckUtils]: 56: Hoare triple {29071#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {29071#false} is VALID [2022-04-08 08:39:23,557 INFO L290 TraceCheckUtils]: 57: Hoare triple {29071#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {29071#false} is VALID [2022-04-08 08:39:23,557 INFO L290 TraceCheckUtils]: 58: Hoare triple {29071#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {29071#false} is VALID [2022-04-08 08:39:23,558 INFO L290 TraceCheckUtils]: 59: Hoare triple {29071#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {29071#false} is VALID [2022-04-08 08:39:23,558 INFO L290 TraceCheckUtils]: 60: Hoare triple {29071#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {29071#false} is VALID [2022-04-08 08:39:23,558 INFO L290 TraceCheckUtils]: 61: Hoare triple {29071#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {29071#false} is VALID [2022-04-08 08:39:23,558 INFO L290 TraceCheckUtils]: 62: Hoare triple {29071#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {29071#false} is VALID [2022-04-08 08:39:23,558 INFO L290 TraceCheckUtils]: 63: Hoare triple {29071#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {29071#false} is VALID [2022-04-08 08:39:23,558 INFO L290 TraceCheckUtils]: 64: Hoare triple {29071#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {29071#false} is VALID [2022-04-08 08:39:23,558 INFO L290 TraceCheckUtils]: 65: Hoare triple {29071#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {29071#false} is VALID [2022-04-08 08:39:23,558 INFO L290 TraceCheckUtils]: 66: Hoare triple {29071#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {29071#false} is VALID [2022-04-08 08:39:23,558 INFO L290 TraceCheckUtils]: 67: Hoare triple {29071#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {29071#false} is VALID [2022-04-08 08:39:23,558 INFO L290 TraceCheckUtils]: 68: Hoare triple {29071#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {29071#false} is VALID [2022-04-08 08:39:23,558 INFO L290 TraceCheckUtils]: 69: Hoare triple {29071#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {29071#false} is VALID [2022-04-08 08:39:23,559 INFO L290 TraceCheckUtils]: 70: Hoare triple {29071#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {29071#false} is VALID [2022-04-08 08:39:23,559 INFO L290 TraceCheckUtils]: 71: Hoare triple {29071#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {29071#false} is VALID [2022-04-08 08:39:23,559 INFO L290 TraceCheckUtils]: 72: Hoare triple {29071#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {29071#false} is VALID [2022-04-08 08:39:23,559 INFO L290 TraceCheckUtils]: 73: Hoare triple {29071#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {29071#false} is VALID [2022-04-08 08:39:23,559 INFO L290 TraceCheckUtils]: 74: Hoare triple {29071#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {29071#false} is VALID [2022-04-08 08:39:23,559 INFO L290 TraceCheckUtils]: 75: Hoare triple {29071#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {29071#false} is VALID [2022-04-08 08:39:23,559 INFO L290 TraceCheckUtils]: 76: Hoare triple {29071#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {29071#false} is VALID [2022-04-08 08:39:23,559 INFO L290 TraceCheckUtils]: 77: Hoare triple {29071#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {29071#false} is VALID [2022-04-08 08:39:23,559 INFO L290 TraceCheckUtils]: 78: Hoare triple {29071#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {29071#false} is VALID [2022-04-08 08:39:23,559 INFO L290 TraceCheckUtils]: 79: Hoare triple {29071#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {29071#false} is VALID [2022-04-08 08:39:23,560 INFO L290 TraceCheckUtils]: 80: Hoare triple {29071#false} assume 8672 == #t~mem74;havoc #t~mem74; {29071#false} is VALID [2022-04-08 08:39:23,560 INFO L290 TraceCheckUtils]: 81: Hoare triple {29071#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {29071#false} is VALID [2022-04-08 08:39:23,560 INFO L290 TraceCheckUtils]: 82: Hoare triple {29071#false} assume 4 == ~blastFlag~0; {29071#false} is VALID [2022-04-08 08:39:23,560 INFO L290 TraceCheckUtils]: 83: Hoare triple {29071#false} assume !false; {29071#false} is VALID [2022-04-08 08:39:23,560 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 08:39:23,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:39:23,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880293810] [2022-04-08 08:39:23,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880293810] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:39:23,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:39:23,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:39:23,561 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:39:23,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2111933966] [2022-04-08 08:39:23,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2111933966] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:39:23,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:39:23,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:39:23,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104324323] [2022-04-08 08:39:23,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:39:23,562 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 84 [2022-04-08 08:39:23,562 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:39:23,562 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-08 08:39:23,630 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-08 08:39:23,630 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:39:23,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:39:23,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:39:23,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:39:23,631 INFO L87 Difference]: Start difference. First operand 371 states and 555 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-08 08:39:25,662 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:39:26,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:39:26,998 INFO L93 Difference]: Finished difference Result 748 states and 1117 transitions. [2022-04-08 08:39:26,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:39:26,998 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 84 [2022-04-08 08:39:26,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:39:26,999 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-08 08:39:27,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 439 transitions. [2022-04-08 08:39:27,001 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-08 08:39:27,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 439 transitions. [2022-04-08 08:39:27,002 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 439 transitions. [2022-04-08 08:39:27,289 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 439 edges. 439 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:39:27,299 INFO L225 Difference]: With dead ends: 748 [2022-04-08 08:39:27,300 INFO L226 Difference]: Without dead ends: 405 [2022-04-08 08:39:27,301 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:39:27,301 INFO L913 BasicCegarLoop]: 222 mSDtfsCounter, 21 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 08:39:27,301 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 551 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 387 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 08:39:27,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2022-04-08 08:39:27,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 371. [2022-04-08 08:39:27,324 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:39:27,325 INFO L82 GeneralOperation]: Start isEquivalent. First operand 405 states. Second operand has 371 states, 366 states have (on average 1.5) internal successors, (549), 366 states have internal predecessors, (549), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:27,325 INFO L74 IsIncluded]: Start isIncluded. First operand 405 states. Second operand has 371 states, 366 states have (on average 1.5) internal successors, (549), 366 states have internal predecessors, (549), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:27,326 INFO L87 Difference]: Start difference. First operand 405 states. Second operand has 371 states, 366 states have (on average 1.5) internal successors, (549), 366 states have internal predecessors, (549), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:27,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:39:27,334 INFO L93 Difference]: Finished difference Result 405 states and 595 transitions. [2022-04-08 08:39:27,334 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 595 transitions. [2022-04-08 08:39:27,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:39:27,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:39:27,336 INFO L74 IsIncluded]: Start isIncluded. First operand has 371 states, 366 states have (on average 1.5) internal successors, (549), 366 states have internal predecessors, (549), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 405 states. [2022-04-08 08:39:27,336 INFO L87 Difference]: Start difference. First operand has 371 states, 366 states have (on average 1.5) internal successors, (549), 366 states have internal predecessors, (549), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 405 states. [2022-04-08 08:39:27,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:39:27,345 INFO L93 Difference]: Finished difference Result 405 states and 595 transitions. [2022-04-08 08:39:27,345 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 595 transitions. [2022-04-08 08:39:27,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:39:27,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:39:27,346 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:39:27,346 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:39:27,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 366 states have (on average 1.5) internal successors, (549), 366 states have internal predecessors, (549), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:39:27,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 553 transitions. [2022-04-08 08:39:27,356 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 553 transitions. Word has length 84 [2022-04-08 08:39:27,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:39:27,356 INFO L478 AbstractCegarLoop]: Abstraction has 371 states and 553 transitions. [2022-04-08 08:39:27,356 INFO L479 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-08 08:39:27,357 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 371 states and 553 transitions. [2022-04-08 08:39:27,922 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 553 edges. 553 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:39:27,923 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 553 transitions. [2022-04-08 08:39:27,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-08 08:39:27,923 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:39:27,923 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:39:27,923 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-08 08:39:27,924 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:39:27,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:39:27,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1096918579, now seen corresponding path program 1 times [2022-04-08 08:39:27,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:39:27,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [421251626] [2022-04-08 08:39:28,114 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 21 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 08:39:28,115 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:39:28,115 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:39:28,115 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:190) 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:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:412) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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-08 08:39:28,120 INFO L158 Benchmark]: Toolchain (without parser) took 119367.27ms. Allocated memory was 175.1MB in the beginning and 272.6MB in the end (delta: 97.5MB). Free memory was 114.5MB in the beginning and 201.2MB in the end (delta: -86.7MB). Peak memory consumption was 10.7MB. Max. memory is 8.0GB. [2022-04-08 08:39:28,120 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 175.1MB. Free memory is still 133.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 08:39:28,120 INFO L158 Benchmark]: CACSL2BoogieTranslator took 591.46ms. Allocated memory was 175.1MB in the beginning and 226.5MB in the end (delta: 51.4MB). Free memory was 114.4MB in the beginning and 172.5MB in the end (delta: -58.1MB). Peak memory consumption was 8.9MB. Max. memory is 8.0GB. [2022-04-08 08:39:28,120 INFO L158 Benchmark]: Boogie Preprocessor took 139.79ms. Allocated memory is still 226.5MB. Free memory was 172.5MB in the beginning and 162.6MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-08 08:39:28,121 INFO L158 Benchmark]: RCFGBuilder took 3418.85ms. Allocated memory is still 226.5MB. Free memory was 162.6MB in the beginning and 133.2MB in the end (delta: 29.4MB). Peak memory consumption was 39.9MB. Max. memory is 8.0GB. [2022-04-08 08:39:28,121 INFO L158 Benchmark]: TraceAbstraction took 115212.48ms. Allocated memory was 226.5MB in the beginning and 272.6MB in the end (delta: 46.1MB). Free memory was 132.6MB in the beginning and 201.2MB in the end (delta: -68.6MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 08:39:28,122 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 175.1MB. Free memory is still 133.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 591.46ms. Allocated memory was 175.1MB in the beginning and 226.5MB in the end (delta: 51.4MB). Free memory was 114.4MB in the beginning and 172.5MB in the end (delta: -58.1MB). Peak memory consumption was 8.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 139.79ms. Allocated memory is still 226.5MB. Free memory was 172.5MB in the beginning and 162.6MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * RCFGBuilder took 3418.85ms. Allocated memory is still 226.5MB. Free memory was 162.6MB in the beginning and 133.2MB in the end (delta: 29.4MB). Peak memory consumption was 39.9MB. Max. memory is 8.0GB. * TraceAbstraction took 115212.48ms. Allocated memory was 226.5MB in the beginning and 272.6MB in the end (delta: 46.1MB). Free memory was 132.6MB in the beginning and 201.2MB in the end (delta: -68.6MB). There was no memory consumed. 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-08 08:39:28,173 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...