/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.10.i.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 08:42:17,747 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 08:42:17,748 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 08:42:17,768 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 08:42:17,768 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 08:42:17,769 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 08:42:17,770 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 08:42:17,773 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 08:42:17,774 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 08:42:17,774 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 08:42:17,775 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 08:42:17,776 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 08:42:17,776 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 08:42:17,776 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 08:42:17,777 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 08:42:17,778 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 08:42:17,778 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 08:42:17,779 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 08:42:17,779 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 08:42:17,780 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 08:42:17,781 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 08:42:17,787 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 08:42:17,788 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 08:42:17,789 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 08:42:17,789 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 08:42:17,791 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 08:42:17,791 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 08:42:17,791 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 08:42:17,792 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 08:42:17,792 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 08:42:17,792 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 08:42:17,793 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 08:42:17,793 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 08:42:17,793 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 08:42:17,794 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 08:42:17,795 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 08:42:17,795 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 08:42:17,795 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 08:42:17,795 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 08:42:17,796 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 08:42:17,796 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 08:42:17,797 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 08:42:17,797 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:42:17,803 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 08:42:17,803 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 08:42:17,804 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 08:42:17,804 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 08:42:17,804 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 08:42:17,804 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 08:42:17,804 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 08:42:17,804 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 08:42:17,805 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 08:42:17,805 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 08:42:17,805 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 08:42:17,805 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 08:42:17,805 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 08:42:17,805 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 08:42:17,805 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 08:42:17,805 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 08:42:17,805 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 08:42:17,805 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 08:42:17,806 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 08:42:17,806 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 08:42:17,806 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 08:42:17,806 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 08:42:17,806 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 08:42:17,806 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 08:42:17,806 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 08:42:17,806 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:42:18,014 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 08:42:18,033 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 08:42:18,035 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 08:42:18,036 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 08:42:18,037 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 08:42:18,038 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_srvr.blast.10.i.cil-1.c [2022-04-08 08:42:18,081 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bece9a45/a6097ae61e8d4c7a86614d79e3a66362/FLAGca772a138 [2022-04-08 08:42:18,474 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 08:42:18,475 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.10.i.cil-1.c [2022-04-08 08:42:18,499 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bece9a45/a6097ae61e8d4c7a86614d79e3a66362/FLAGca772a138 [2022-04-08 08:42:18,808 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bece9a45/a6097ae61e8d4c7a86614d79e3a66362 [2022-04-08 08:42:18,810 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 08:42:18,811 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 08:42:18,817 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 08:42:18,817 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 08:42:18,820 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 08:42:18,821 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:42:18" (1/1) ... [2022-04-08 08:42:18,821 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e29bb1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:42:18, skipping insertion in model container [2022-04-08 08:42:18,821 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:42:18" (1/1) ... [2022-04-08 08:42:18,826 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 08:42:18,881 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 08:42:19,166 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.10.i.cil-1.c[73581,73594] [2022-04-08 08:42:19,185 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 08:42:19,197 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 08:42:19,309 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.10.i.cil-1.c[73581,73594] [2022-04-08 08:42:19,311 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 08:42:19,329 INFO L208 MainTranslator]: Completed translation [2022-04-08 08:42:19,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:42:19 WrapperNode [2022-04-08 08:42:19,330 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 08:42:19,331 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 08:42:19,331 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 08:42:19,331 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 08:42:19,340 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:42:19" (1/1) ... [2022-04-08 08:42:19,340 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:42:19" (1/1) ... [2022-04-08 08:42:19,369 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:42:19" (1/1) ... [2022-04-08 08:42:19,369 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:42:19" (1/1) ... [2022-04-08 08:42:19,419 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:42:19" (1/1) ... [2022-04-08 08:42:19,425 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:42:19" (1/1) ... [2022-04-08 08:42:19,427 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:42:19" (1/1) ... [2022-04-08 08:42:19,432 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 08:42:19,432 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 08:42:19,432 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 08:42:19,432 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 08:42:19,437 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:42:19" (1/1) ... [2022-04-08 08:42:19,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 08:42:19,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:42:19,458 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:42:19,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 08:42:19,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 08:42:19,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 08:42:19,493 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 08:42:19,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2022-04-08 08:42:19,493 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2022-04-08 08:42:19,493 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 08:42:19,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2022-04-08 08:42:19,493 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-08 08:42:19,493 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-08 08:42:19,493 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-08 08:42:19,494 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 08:42:19,494 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 08:42:19,495 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 08:42:19,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 08:42:19,495 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-08 08:42:19,495 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-08 08:42:19,495 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 08:42:19,495 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-08 08:42:19,495 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-08 08:42:19,495 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-08 08:42:19,495 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2022-04-08 08:42:19,495 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-08 08:42:19,495 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2022-04-08 08:42:19,495 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2022-04-08 08:42:19,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-08 08:42:19,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-08 08:42:19,495 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 08:42:19,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-08 08:42:19,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 08:42:19,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-08 08:42:19,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 08:42:19,496 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-08 08:42:19,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-08 08:42:19,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 08:42:19,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 08:42:19,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 08:42:19,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-08 08:42:19,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-08 08:42:19,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-08 08:42:19,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-08 08:42:19,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 08:42:19,639 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 08:42:19,641 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 08:42:20,395 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:42:20,840 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2022-04-08 08:42:20,841 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2022-04-08 08:42:20,852 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 08:42:20,860 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 08:42:20,861 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 08:42:20,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:42:20 BoogieIcfgContainer [2022-04-08 08:42:20,863 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 08:42:20,864 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 08:42:20,864 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 08:42:20,867 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 08:42:20,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 08:42:18" (1/3) ... [2022-04-08 08:42:20,868 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5326eaf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:42:20, skipping insertion in model container [2022-04-08 08:42:20,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:42:19" (2/3) ... [2022-04-08 08:42:20,868 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5326eaf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:42:20, skipping insertion in model container [2022-04-08 08:42:20,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:42:20" (3/3) ... [2022-04-08 08:42:20,870 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.10.i.cil-1.c [2022-04-08 08:42:20,874 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 08:42:20,875 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 08:42:20,902 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 08:42:20,906 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:42:20,906 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 08:42:20,924 INFO L276 IsEmpty]: Start isEmpty. Operand has 156 states, 148 states have (on average 1.7027027027027026) internal successors, (252), 149 states have internal predecessors, (252), 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:42:20,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-08 08:42:20,932 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:42:20,932 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:42:20,933 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:42:20,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:42:20,936 INFO L85 PathProgramCache]: Analyzing trace with hash -159635105, now seen corresponding path program 1 times [2022-04-08 08:42:20,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:42:20,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1919763602] [2022-04-08 08:42:20,952 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:42:20,952 INFO L85 PathProgramCache]: Analyzing trace with hash -159635105, now seen corresponding path program 2 times [2022-04-08 08:42:20,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:42:20,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138501132] [2022-04-08 08:42:20,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:42:20,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:42:21,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:42:21,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:42:21,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:42:21,386 INFO L290 TraceCheckUtils]: 0: Hoare triple {166#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {159#true} is VALID [2022-04-08 08:42:21,386 INFO L290 TraceCheckUtils]: 1: Hoare triple {159#true} assume true; {159#true} is VALID [2022-04-08 08:42:21,386 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {159#true} {159#true} #678#return; {159#true} is VALID [2022-04-08 08:42:21,388 INFO L272 TraceCheckUtils]: 0: Hoare triple {159#true} call ULTIMATE.init(); {166#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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:42:21,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {166#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {159#true} is VALID [2022-04-08 08:42:21,390 INFO L290 TraceCheckUtils]: 2: Hoare triple {159#true} assume true; {159#true} is VALID [2022-04-08 08:42:21,390 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {159#true} {159#true} #678#return; {159#true} is VALID [2022-04-08 08:42:21,390 INFO L272 TraceCheckUtils]: 4: Hoare triple {159#true} call #t~ret161 := main(); {159#true} is VALID [2022-04-08 08:42:21,391 INFO L290 TraceCheckUtils]: 5: Hoare triple {159#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {159#true} is VALID [2022-04-08 08:42:21,391 INFO L290 TraceCheckUtils]: 6: Hoare triple {159#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {159#true} is VALID [2022-04-08 08:42:21,391 INFO L272 TraceCheckUtils]: 7: Hoare triple {159#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {159#true} is VALID [2022-04-08 08:42:21,397 INFO L290 TraceCheckUtils]: 8: Hoare triple {159#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:21,398 INFO L290 TraceCheckUtils]: 9: Hoare triple {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:21,399 INFO L290 TraceCheckUtils]: 10: Hoare triple {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:21,399 INFO L290 TraceCheckUtils]: 11: Hoare triple {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:21,400 INFO L290 TraceCheckUtils]: 12: Hoare triple {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:21,401 INFO L290 TraceCheckUtils]: 13: Hoare triple {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:21,401 INFO L290 TraceCheckUtils]: 14: Hoare triple {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:21,402 INFO L290 TraceCheckUtils]: 15: Hoare triple {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:21,402 INFO L290 TraceCheckUtils]: 16: Hoare triple {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:21,403 INFO L290 TraceCheckUtils]: 17: Hoare triple {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:21,404 INFO L290 TraceCheckUtils]: 18: Hoare triple {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:21,405 INFO L290 TraceCheckUtils]: 19: Hoare triple {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:21,406 INFO L290 TraceCheckUtils]: 20: Hoare triple {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:21,406 INFO L290 TraceCheckUtils]: 21: Hoare triple {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:21,407 INFO L290 TraceCheckUtils]: 22: Hoare triple {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:21,408 INFO L290 TraceCheckUtils]: 23: Hoare triple {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:21,408 INFO L290 TraceCheckUtils]: 24: Hoare triple {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:21,410 INFO L290 TraceCheckUtils]: 25: Hoare triple {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:21,410 INFO L290 TraceCheckUtils]: 26: Hoare triple {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:21,411 INFO L290 TraceCheckUtils]: 27: Hoare triple {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:21,412 INFO L290 TraceCheckUtils]: 28: Hoare triple {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:21,412 INFO L290 TraceCheckUtils]: 29: Hoare triple {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:21,413 INFO L290 TraceCheckUtils]: 30: Hoare triple {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:21,413 INFO L290 TraceCheckUtils]: 31: Hoare triple {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:21,414 INFO L290 TraceCheckUtils]: 32: Hoare triple {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:21,414 INFO L290 TraceCheckUtils]: 33: Hoare triple {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:21,415 INFO L290 TraceCheckUtils]: 34: Hoare triple {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:21,416 INFO L290 TraceCheckUtils]: 35: Hoare triple {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:21,416 INFO L290 TraceCheckUtils]: 36: Hoare triple {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:21,417 INFO L290 TraceCheckUtils]: 37: Hoare triple {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:21,417 INFO L290 TraceCheckUtils]: 38: Hoare triple {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:21,418 INFO L290 TraceCheckUtils]: 39: Hoare triple {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:21,418 INFO L290 TraceCheckUtils]: 40: Hoare triple {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:21,419 INFO L290 TraceCheckUtils]: 41: Hoare triple {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:21,419 INFO L290 TraceCheckUtils]: 42: Hoare triple {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:21,420 INFO L290 TraceCheckUtils]: 43: Hoare triple {164#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {165#(not (= |ssl3_accept_#t~mem75| 8640))} is VALID [2022-04-08 08:42:21,421 INFO L290 TraceCheckUtils]: 44: Hoare triple {165#(not (= |ssl3_accept_#t~mem75| 8640))} assume 8640 == #t~mem75;havoc #t~mem75; {160#false} is VALID [2022-04-08 08:42:21,422 INFO L290 TraceCheckUtils]: 45: Hoare triple {160#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {160#false} is VALID [2022-04-08 08:42:21,422 INFO L290 TraceCheckUtils]: 46: Hoare triple {160#false} assume !(4 == ~blastFlag~0); {160#false} is VALID [2022-04-08 08:42:21,424 INFO L290 TraceCheckUtils]: 47: Hoare triple {160#false} assume 7 == ~blastFlag~0; {160#false} is VALID [2022-04-08 08:42:21,424 INFO L290 TraceCheckUtils]: 48: Hoare triple {160#false} assume !false; {160#false} is VALID [2022-04-08 08:42:21,426 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:42:21,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:42:21,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138501132] [2022-04-08 08:42:21,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138501132] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:42:21,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:42:21,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:42:21,437 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:42:21,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1919763602] [2022-04-08 08:42:21,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1919763602] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:42:21,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:42:21,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:42:21,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506474529] [2022-04-08 08:42:21,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:42:21,444 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-08 08:42:21,446 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:42:21,448 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:21,518 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:42:21,518 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:42:21,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:42:21,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:42:21,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:42:21,539 INFO L87 Difference]: Start difference. First operand has 156 states, 148 states have (on average 1.7027027027027026) internal successors, (252), 149 states have internal predecessors, (252), 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.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:24,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:42:24,912 INFO L93 Difference]: Finished difference Result 424 states and 714 transitions. [2022-04-08 08:42:24,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:42:24,913 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-08 08:42:24,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:42:24,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:24,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 714 transitions. [2022-04-08 08:42:24,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:24,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 714 transitions. [2022-04-08 08:42:24,939 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 714 transitions. [2022-04-08 08:42:25,454 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 714 edges. 714 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:42:25,467 INFO L225 Difference]: With dead ends: 424 [2022-04-08 08:42:25,467 INFO L226 Difference]: Without dead ends: 257 [2022-04-08 08:42:25,470 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:42:25,472 INFO L913 BasicCegarLoop]: 154 mSDtfsCounter, 150 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-08 08:42:25,473 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 451 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-08 08:42:25,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2022-04-08 08:42:25,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 180. [2022-04-08 08:42:25,515 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:42:25,516 INFO L82 GeneralOperation]: Start isEquivalent. First operand 257 states. Second operand has 180 states, 175 states have (on average 1.6) internal successors, (280), 175 states have internal predecessors, (280), 3 states have call successors, (3), 3 states have 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:42:25,517 INFO L74 IsIncluded]: Start isIncluded. First operand 257 states. Second operand has 180 states, 175 states have (on average 1.6) internal successors, (280), 175 states have internal predecessors, (280), 3 states have call successors, (3), 3 states have 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:42:25,517 INFO L87 Difference]: Start difference. First operand 257 states. Second operand has 180 states, 175 states have (on average 1.6) internal successors, (280), 175 states have internal predecessors, (280), 3 states have call successors, (3), 3 states have 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:42:25,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:42:25,526 INFO L93 Difference]: Finished difference Result 257 states and 391 transitions. [2022-04-08 08:42:25,526 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 391 transitions. [2022-04-08 08:42:25,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:42:25,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:42:25,529 INFO L74 IsIncluded]: Start isIncluded. First operand has 180 states, 175 states have (on average 1.6) internal successors, (280), 175 states have internal predecessors, (280), 3 states have call successors, (3), 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 257 states. [2022-04-08 08:42:25,529 INFO L87 Difference]: Start difference. First operand has 180 states, 175 states have (on average 1.6) internal successors, (280), 175 states have internal predecessors, (280), 3 states have call successors, (3), 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 257 states. [2022-04-08 08:42:25,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:42:25,538 INFO L93 Difference]: Finished difference Result 257 states and 391 transitions. [2022-04-08 08:42:25,538 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 391 transitions. [2022-04-08 08:42:25,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:42:25,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:42:25,539 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:42:25,539 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:42:25,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 175 states have (on average 1.6) internal successors, (280), 175 states have internal predecessors, (280), 3 states have call successors, (3), 3 states have 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:42:25,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 284 transitions. [2022-04-08 08:42:25,546 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 284 transitions. Word has length 49 [2022-04-08 08:42:25,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:42:25,547 INFO L478 AbstractCegarLoop]: Abstraction has 180 states and 284 transitions. [2022-04-08 08:42:25,547 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:25,547 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 180 states and 284 transitions. [2022-04-08 08:42:25,741 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 284 edges. 284 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:42:25,741 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 284 transitions. [2022-04-08 08:42:25,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-08 08:42:25,742 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:42:25,743 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:42:25,743 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 08:42:25,743 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:42:25,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:42:25,744 INFO L85 PathProgramCache]: Analyzing trace with hash -855203969, now seen corresponding path program 1 times [2022-04-08 08:42:25,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:42:25,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1981421503] [2022-04-08 08:42:25,744 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:42:25,744 INFO L85 PathProgramCache]: Analyzing trace with hash -855203969, now seen corresponding path program 2 times [2022-04-08 08:42:25,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:42:25,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777772955] [2022-04-08 08:42:25,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:42:25,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:42:25,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:42:25,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:42:25,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:42:25,910 INFO L290 TraceCheckUtils]: 0: Hoare triple {1900#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {1893#true} is VALID [2022-04-08 08:42:25,910 INFO L290 TraceCheckUtils]: 1: Hoare triple {1893#true} assume true; {1893#true} is VALID [2022-04-08 08:42:25,911 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1893#true} {1893#true} #678#return; {1893#true} is VALID [2022-04-08 08:42:25,911 INFO L272 TraceCheckUtils]: 0: Hoare triple {1893#true} call ULTIMATE.init(); {1900#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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:42:25,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {1900#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {1893#true} is VALID [2022-04-08 08:42:25,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {1893#true} assume true; {1893#true} is VALID [2022-04-08 08:42:25,912 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1893#true} {1893#true} #678#return; {1893#true} is VALID [2022-04-08 08:42:25,912 INFO L272 TraceCheckUtils]: 4: Hoare triple {1893#true} call #t~ret161 := main(); {1893#true} is VALID [2022-04-08 08:42:25,912 INFO L290 TraceCheckUtils]: 5: Hoare triple {1893#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {1893#true} is VALID [2022-04-08 08:42:25,912 INFO L290 TraceCheckUtils]: 6: Hoare triple {1893#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {1893#true} is VALID [2022-04-08 08:42:25,912 INFO L272 TraceCheckUtils]: 7: Hoare triple {1893#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {1893#true} is VALID [2022-04-08 08:42:25,914 INFO L290 TraceCheckUtils]: 8: Hoare triple {1893#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:25,915 INFO L290 TraceCheckUtils]: 9: Hoare triple {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:25,915 INFO L290 TraceCheckUtils]: 10: Hoare triple {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:25,916 INFO L290 TraceCheckUtils]: 11: Hoare triple {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:25,916 INFO L290 TraceCheckUtils]: 12: Hoare triple {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:25,917 INFO L290 TraceCheckUtils]: 13: Hoare triple {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:25,917 INFO L290 TraceCheckUtils]: 14: Hoare triple {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:25,917 INFO L290 TraceCheckUtils]: 15: Hoare triple {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:25,918 INFO L290 TraceCheckUtils]: 16: Hoare triple {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:25,918 INFO L290 TraceCheckUtils]: 17: Hoare triple {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:25,919 INFO L290 TraceCheckUtils]: 18: Hoare triple {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:25,919 INFO L290 TraceCheckUtils]: 19: Hoare triple {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:25,920 INFO L290 TraceCheckUtils]: 20: Hoare triple {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:25,920 INFO L290 TraceCheckUtils]: 21: Hoare triple {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:25,920 INFO L290 TraceCheckUtils]: 22: Hoare triple {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:25,921 INFO L290 TraceCheckUtils]: 23: Hoare triple {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:25,921 INFO L290 TraceCheckUtils]: 24: Hoare triple {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:25,922 INFO L290 TraceCheckUtils]: 25: Hoare triple {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:25,922 INFO L290 TraceCheckUtils]: 26: Hoare triple {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:25,922 INFO L290 TraceCheckUtils]: 27: Hoare triple {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:25,923 INFO L290 TraceCheckUtils]: 28: Hoare triple {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:25,923 INFO L290 TraceCheckUtils]: 29: Hoare triple {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:25,924 INFO L290 TraceCheckUtils]: 30: Hoare triple {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:25,924 INFO L290 TraceCheckUtils]: 31: Hoare triple {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:25,924 INFO L290 TraceCheckUtils]: 32: Hoare triple {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:25,925 INFO L290 TraceCheckUtils]: 33: Hoare triple {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:25,925 INFO L290 TraceCheckUtils]: 34: Hoare triple {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:25,926 INFO L290 TraceCheckUtils]: 35: Hoare triple {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:25,926 INFO L290 TraceCheckUtils]: 36: Hoare triple {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:25,926 INFO L290 TraceCheckUtils]: 37: Hoare triple {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:25,927 INFO L290 TraceCheckUtils]: 38: Hoare triple {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:25,927 INFO L290 TraceCheckUtils]: 39: Hoare triple {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:25,928 INFO L290 TraceCheckUtils]: 40: Hoare triple {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:25,928 INFO L290 TraceCheckUtils]: 41: Hoare triple {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:25,931 INFO L290 TraceCheckUtils]: 42: Hoare triple {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:25,931 INFO L290 TraceCheckUtils]: 43: Hoare triple {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:25,933 INFO L290 TraceCheckUtils]: 44: Hoare triple {1898#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {1899#(not (= |ssl3_accept_#t~mem76| 8641))} is VALID [2022-04-08 08:42:25,933 INFO L290 TraceCheckUtils]: 45: Hoare triple {1899#(not (= |ssl3_accept_#t~mem76| 8641))} assume 8641 == #t~mem76;havoc #t~mem76; {1894#false} is VALID [2022-04-08 08:42:25,933 INFO L290 TraceCheckUtils]: 46: Hoare triple {1894#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {1894#false} is VALID [2022-04-08 08:42:25,933 INFO L290 TraceCheckUtils]: 47: Hoare triple {1894#false} assume !(4 == ~blastFlag~0); {1894#false} is VALID [2022-04-08 08:42:25,933 INFO L290 TraceCheckUtils]: 48: Hoare triple {1894#false} assume 7 == ~blastFlag~0; {1894#false} is VALID [2022-04-08 08:42:25,934 INFO L290 TraceCheckUtils]: 49: Hoare triple {1894#false} assume !false; {1894#false} is VALID [2022-04-08 08:42:25,934 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:42:25,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:42:25,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777772955] [2022-04-08 08:42:25,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777772955] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:42:25,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:42:25,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:42:25,935 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:42:25,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1981421503] [2022-04-08 08:42:25,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1981421503] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:42:25,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:42:25,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:42:25,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705684213] [2022-04-08 08:42:25,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:42:25,936 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2022-04-08 08:42:25,936 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:42:25,936 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:25,974 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:42:25,974 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:42:25,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:42:25,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:42:25,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:42:25,975 INFO L87 Difference]: Start difference. First operand 180 states and 284 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:30,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:42:30,277 INFO L93 Difference]: Finished difference Result 461 states and 729 transitions. [2022-04-08 08:42:30,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:42:30,278 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2022-04-08 08:42:30,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:42:30,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:30,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 583 transitions. [2022-04-08 08:42:30,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:30,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 583 transitions. [2022-04-08 08:42:30,287 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 583 transitions. [2022-04-08 08:42:30,695 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 583 edges. 583 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:42:30,700 INFO L225 Difference]: With dead ends: 461 [2022-04-08 08:42:30,700 INFO L226 Difference]: Without dead ends: 296 [2022-04-08 08:42:30,701 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:42:30,702 INFO L913 BasicCegarLoop]: 123 mSDtfsCounter, 117 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-04-08 08:42:30,702 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 350 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-04-08 08:42:30,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-04-08 08:42:30,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 220. [2022-04-08 08:42:30,714 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:42:30,714 INFO L82 GeneralOperation]: Start isEquivalent. First operand 296 states. Second operand has 220 states, 215 states have (on average 1.6465116279069767) internal successors, (354), 215 states have internal predecessors, (354), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:30,715 INFO L74 IsIncluded]: Start isIncluded. First operand 296 states. Second operand has 220 states, 215 states have (on average 1.6465116279069767) internal successors, (354), 215 states have internal predecessors, (354), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:30,715 INFO L87 Difference]: Start difference. First operand 296 states. Second operand has 220 states, 215 states have (on average 1.6465116279069767) internal successors, (354), 215 states have internal predecessors, (354), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:30,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:42:30,722 INFO L93 Difference]: Finished difference Result 296 states and 463 transitions. [2022-04-08 08:42:30,722 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 463 transitions. [2022-04-08 08:42:30,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:42:30,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:42:30,723 INFO L74 IsIncluded]: Start isIncluded. First operand has 220 states, 215 states have (on average 1.6465116279069767) internal successors, (354), 215 states have internal predecessors, (354), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 296 states. [2022-04-08 08:42:30,724 INFO L87 Difference]: Start difference. First operand has 220 states, 215 states have (on average 1.6465116279069767) internal successors, (354), 215 states have internal predecessors, (354), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 296 states. [2022-04-08 08:42:30,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:42:30,730 INFO L93 Difference]: Finished difference Result 296 states and 463 transitions. [2022-04-08 08:42:30,730 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 463 transitions. [2022-04-08 08:42:30,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:42:30,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:42:30,731 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:42:30,731 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:42:30,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 215 states have (on average 1.6465116279069767) internal successors, (354), 215 states have internal predecessors, (354), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:30,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 358 transitions. [2022-04-08 08:42:30,736 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 358 transitions. Word has length 50 [2022-04-08 08:42:30,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:42:30,737 INFO L478 AbstractCegarLoop]: Abstraction has 220 states and 358 transitions. [2022-04-08 08:42:30,737 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:30,737 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 220 states and 358 transitions. [2022-04-08 08:42:30,991 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 358 edges. 358 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:42:30,991 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 358 transitions. [2022-04-08 08:42:30,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-08 08:42:30,992 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:42:30,993 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:30,993 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 08:42:30,993 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:42:30,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:42:30,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1284051237, now seen corresponding path program 1 times [2022-04-08 08:42:30,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:42:30,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1149917269] [2022-04-08 08:42:31,048 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:42:31,048 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:42:31,048 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:42:31,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1284051237, now seen corresponding path program 2 times [2022-04-08 08:42:31,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:42:31,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858849165] [2022-04-08 08:42:31,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:42:31,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:42:31,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:42:31,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:42:31,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:42:31,185 INFO L290 TraceCheckUtils]: 0: Hoare triple {3866#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {3859#true} is VALID [2022-04-08 08:42:31,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {3859#true} assume true; {3859#true} is VALID [2022-04-08 08:42:31,186 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3859#true} {3859#true} #678#return; {3859#true} is VALID [2022-04-08 08:42:31,186 INFO L272 TraceCheckUtils]: 0: Hoare triple {3859#true} call ULTIMATE.init(); {3866#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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:42:31,187 INFO L290 TraceCheckUtils]: 1: Hoare triple {3866#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {3859#true} is VALID [2022-04-08 08:42:31,187 INFO L290 TraceCheckUtils]: 2: Hoare triple {3859#true} assume true; {3859#true} is VALID [2022-04-08 08:42:31,187 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3859#true} {3859#true} #678#return; {3859#true} is VALID [2022-04-08 08:42:31,187 INFO L272 TraceCheckUtils]: 4: Hoare triple {3859#true} call #t~ret161 := main(); {3859#true} is VALID [2022-04-08 08:42:31,187 INFO L290 TraceCheckUtils]: 5: Hoare triple {3859#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {3859#true} is VALID [2022-04-08 08:42:31,187 INFO L290 TraceCheckUtils]: 6: Hoare triple {3859#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {3859#true} is VALID [2022-04-08 08:42:31,187 INFO L272 TraceCheckUtils]: 7: Hoare triple {3859#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {3859#true} is VALID [2022-04-08 08:42:31,189 INFO L290 TraceCheckUtils]: 8: Hoare triple {3859#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {3864#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:31,189 INFO L290 TraceCheckUtils]: 9: Hoare triple {3864#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {3864#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:31,190 INFO L290 TraceCheckUtils]: 10: Hoare triple {3864#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {3864#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:31,191 INFO L290 TraceCheckUtils]: 11: Hoare triple {3864#(= 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)))); {3864#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:31,191 INFO L290 TraceCheckUtils]: 12: Hoare triple {3864#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {3864#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:31,191 INFO L290 TraceCheckUtils]: 13: Hoare triple {3864#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {3864#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:31,192 INFO L290 TraceCheckUtils]: 14: Hoare triple {3864#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {3864#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:31,192 INFO L290 TraceCheckUtils]: 15: Hoare triple {3864#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {3864#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:31,192 INFO L290 TraceCheckUtils]: 16: Hoare triple {3864#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {3864#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:31,193 INFO L290 TraceCheckUtils]: 17: Hoare triple {3864#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {3864#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:31,193 INFO L290 TraceCheckUtils]: 18: Hoare triple {3864#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {3864#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:31,194 INFO L290 TraceCheckUtils]: 19: Hoare triple {3864#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {3864#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:31,194 INFO L290 TraceCheckUtils]: 20: Hoare triple {3864#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {3864#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:31,194 INFO L290 TraceCheckUtils]: 21: Hoare triple {3864#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {3864#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:31,195 INFO L290 TraceCheckUtils]: 22: Hoare triple {3864#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {3864#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:31,195 INFO L290 TraceCheckUtils]: 23: Hoare triple {3864#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {3865#(= 8464 |ssl3_accept_#t~mem55|)} is VALID [2022-04-08 08:42:31,195 INFO L290 TraceCheckUtils]: 24: Hoare triple {3865#(= 8464 |ssl3_accept_#t~mem55|)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-08 08:42:31,196 INFO L290 TraceCheckUtils]: 25: Hoare triple {3860#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-08 08:42:31,196 INFO L290 TraceCheckUtils]: 26: Hoare triple {3860#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-08 08:42:31,196 INFO L290 TraceCheckUtils]: 27: Hoare triple {3860#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-08 08:42:31,196 INFO L290 TraceCheckUtils]: 28: Hoare triple {3860#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-08 08:42:31,196 INFO L290 TraceCheckUtils]: 29: Hoare triple {3860#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-08 08:42:31,196 INFO L290 TraceCheckUtils]: 30: Hoare triple {3860#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-08 08:42:31,196 INFO L290 TraceCheckUtils]: 31: Hoare triple {3860#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-08 08:42:31,196 INFO L290 TraceCheckUtils]: 32: Hoare triple {3860#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-08 08:42:31,196 INFO L290 TraceCheckUtils]: 33: Hoare triple {3860#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-08 08:42:31,197 INFO L290 TraceCheckUtils]: 34: Hoare triple {3860#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-08 08:42:31,197 INFO L290 TraceCheckUtils]: 35: Hoare triple {3860#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-08 08:42:31,197 INFO L290 TraceCheckUtils]: 36: Hoare triple {3860#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-08 08:42:31,197 INFO L290 TraceCheckUtils]: 37: Hoare triple {3860#false} assume 8448 == #t~mem68;havoc #t~mem68; {3860#false} is VALID [2022-04-08 08:42:31,197 INFO L290 TraceCheckUtils]: 38: Hoare triple {3860#false} assume !(~num1~0 > 0); {3860#false} is VALID [2022-04-08 08:42:31,197 INFO L290 TraceCheckUtils]: 39: Hoare triple {3860#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {3860#false} is VALID [2022-04-08 08:42:31,197 INFO L290 TraceCheckUtils]: 40: Hoare triple {3860#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {3860#false} is VALID [2022-04-08 08:42:31,197 INFO L290 TraceCheckUtils]: 41: Hoare triple {3860#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {3860#false} is VALID [2022-04-08 08:42:31,197 INFO L290 TraceCheckUtils]: 42: Hoare triple {3860#false} ~skip~0 := 0; {3860#false} is VALID [2022-04-08 08:42:31,198 INFO L290 TraceCheckUtils]: 43: Hoare triple {3860#false} assume !false; {3860#false} is VALID [2022-04-08 08:42:31,198 INFO L290 TraceCheckUtils]: 44: Hoare triple {3860#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-08 08:42:31,198 INFO L290 TraceCheckUtils]: 45: Hoare triple {3860#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-08 08:42:31,198 INFO L290 TraceCheckUtils]: 46: Hoare triple {3860#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-08 08:42:31,198 INFO L290 TraceCheckUtils]: 47: Hoare triple {3860#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-08 08:42:31,198 INFO L290 TraceCheckUtils]: 48: Hoare triple {3860#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-08 08:42:31,198 INFO L290 TraceCheckUtils]: 49: Hoare triple {3860#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-08 08:42:31,198 INFO L290 TraceCheckUtils]: 50: Hoare triple {3860#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-08 08:42:31,198 INFO L290 TraceCheckUtils]: 51: Hoare triple {3860#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-08 08:42:31,199 INFO L290 TraceCheckUtils]: 52: Hoare triple {3860#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-08 08:42:31,199 INFO L290 TraceCheckUtils]: 53: Hoare triple {3860#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-08 08:42:31,199 INFO L290 TraceCheckUtils]: 54: Hoare triple {3860#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-08 08:42:31,199 INFO L290 TraceCheckUtils]: 55: Hoare triple {3860#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-08 08:42:31,199 INFO L290 TraceCheckUtils]: 56: Hoare triple {3860#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-08 08:42:31,199 INFO L290 TraceCheckUtils]: 57: Hoare triple {3860#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-08 08:42:31,199 INFO L290 TraceCheckUtils]: 58: Hoare triple {3860#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-08 08:42:31,199 INFO L290 TraceCheckUtils]: 59: Hoare triple {3860#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-08 08:42:31,199 INFO L290 TraceCheckUtils]: 60: Hoare triple {3860#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-08 08:42:31,199 INFO L290 TraceCheckUtils]: 61: Hoare triple {3860#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-08 08:42:31,200 INFO L290 TraceCheckUtils]: 62: Hoare triple {3860#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-08 08:42:31,200 INFO L290 TraceCheckUtils]: 63: Hoare triple {3860#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-08 08:42:31,200 INFO L290 TraceCheckUtils]: 64: Hoare triple {3860#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-08 08:42:31,200 INFO L290 TraceCheckUtils]: 65: Hoare triple {3860#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-08 08:42:31,200 INFO L290 TraceCheckUtils]: 66: Hoare triple {3860#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-08 08:42:31,200 INFO L290 TraceCheckUtils]: 67: Hoare triple {3860#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-08 08:42:31,200 INFO L290 TraceCheckUtils]: 68: Hoare triple {3860#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-08 08:42:31,200 INFO L290 TraceCheckUtils]: 69: Hoare triple {3860#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-08 08:42:31,200 INFO L290 TraceCheckUtils]: 70: Hoare triple {3860#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-08 08:42:31,200 INFO L290 TraceCheckUtils]: 71: Hoare triple {3860#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-08 08:42:31,200 INFO L290 TraceCheckUtils]: 72: Hoare triple {3860#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {3860#false} is VALID [2022-04-08 08:42:31,201 INFO L290 TraceCheckUtils]: 73: Hoare triple {3860#false} assume 8640 == #t~mem75;havoc #t~mem75; {3860#false} is VALID [2022-04-08 08:42:31,201 INFO L290 TraceCheckUtils]: 74: Hoare triple {3860#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {3860#false} is VALID [2022-04-08 08:42:31,201 INFO L290 TraceCheckUtils]: 75: Hoare triple {3860#false} assume !(4 == ~blastFlag~0); {3860#false} is VALID [2022-04-08 08:42:31,201 INFO L290 TraceCheckUtils]: 76: Hoare triple {3860#false} assume 7 == ~blastFlag~0; {3860#false} is VALID [2022-04-08 08:42:31,201 INFO L290 TraceCheckUtils]: 77: Hoare triple {3860#false} assume !false; {3860#false} is VALID [2022-04-08 08:42:31,201 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-08 08:42:31,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:42:31,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858849165] [2022-04-08 08:42:31,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858849165] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:42:31,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:42:31,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:42:31,202 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:42:31,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1149917269] [2022-04-08 08:42:31,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1149917269] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:42:31,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:42:31,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:42:31,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550910393] [2022-04-08 08:42:31,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:42:31,203 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 78 [2022-04-08 08:42:31,203 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:42:31,203 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:42:31,248 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:42:31,248 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:42:31,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:42:31,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:42:31,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:42:31,249 INFO L87 Difference]: Start difference. First operand 220 states and 358 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:42:35,814 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:42:36,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:42:36,739 INFO L93 Difference]: Finished difference Result 453 states and 738 transitions. [2022-04-08 08:42:36,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:42:36,739 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 78 [2022-04-08 08:42:36,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:42:36,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:36,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 444 transitions. [2022-04-08 08:42:36,748 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:42:36,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 444 transitions. [2022-04-08 08:42:36,751 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 444 transitions. [2022-04-08 08:42:37,038 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 444 edges. 444 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:42:37,045 INFO L225 Difference]: With dead ends: 453 [2022-04-08 08:42:37,046 INFO L226 Difference]: Without dead ends: 248 [2022-04-08 08:42:37,046 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:42:37,047 INFO L913 BasicCegarLoop]: 182 mSDtfsCounter, 22 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-08 08:42:37,047 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 469 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-08 08:42:37,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-04-08 08:42:37,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 231. [2022-04-08 08:42:37,060 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:42:37,061 INFO L82 GeneralOperation]: Start isEquivalent. First operand 248 states. Second operand has 231 states, 226 states have (on average 1.6504424778761062) internal successors, (373), 226 states have internal predecessors, (373), 3 states have call successors, (3), 3 states have 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:42:37,061 INFO L74 IsIncluded]: Start isIncluded. First operand 248 states. Second operand has 231 states, 226 states have (on average 1.6504424778761062) internal successors, (373), 226 states have internal predecessors, (373), 3 states have call successors, (3), 3 states have 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:42:37,062 INFO L87 Difference]: Start difference. First operand 248 states. Second operand has 231 states, 226 states have (on average 1.6504424778761062) internal successors, (373), 226 states have internal predecessors, (373), 3 states have call successors, (3), 3 states have 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:42:37,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:42:37,068 INFO L93 Difference]: Finished difference Result 248 states and 398 transitions. [2022-04-08 08:42:37,069 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 398 transitions. [2022-04-08 08:42:37,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:42:37,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:42:37,070 INFO L74 IsIncluded]: Start isIncluded. First operand has 231 states, 226 states have (on average 1.6504424778761062) internal successors, (373), 226 states have internal predecessors, (373), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 248 states. [2022-04-08 08:42:37,071 INFO L87 Difference]: Start difference. First operand has 231 states, 226 states have (on average 1.6504424778761062) internal successors, (373), 226 states have internal predecessors, (373), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 248 states. [2022-04-08 08:42:37,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:42:37,075 INFO L93 Difference]: Finished difference Result 248 states and 398 transitions. [2022-04-08 08:42:37,075 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 398 transitions. [2022-04-08 08:42:37,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:42:37,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:42:37,076 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:42:37,076 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:42:37,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 226 states have (on average 1.6504424778761062) internal successors, (373), 226 states have internal predecessors, (373), 3 states have call successors, (3), 3 states have 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:42:37,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 377 transitions. [2022-04-08 08:42:37,081 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 377 transitions. Word has length 78 [2022-04-08 08:42:37,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:42:37,081 INFO L478 AbstractCegarLoop]: Abstraction has 231 states and 377 transitions. [2022-04-08 08:42:37,081 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:42:37,081 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 231 states and 377 transitions. [2022-04-08 08:42:37,325 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 377 edges. 377 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:42:37,325 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 377 transitions. [2022-04-08 08:42:37,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-08 08:42:37,326 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:42:37,326 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:42:37,326 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 08:42:37,326 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:42:37,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:42:37,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1385756996, now seen corresponding path program 1 times [2022-04-08 08:42:37,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:42:37,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [186449626] [2022-04-08 08:42:37,372 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:42:37,372 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:42:37,372 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:42:37,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1385756996, now seen corresponding path program 2 times [2022-04-08 08:42:37,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:42:37,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831338272] [2022-04-08 08:42:37,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:42:37,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:42:37,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:42:37,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:42:37,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:42:37,482 INFO L290 TraceCheckUtils]: 0: Hoare triple {5742#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {5735#true} is VALID [2022-04-08 08:42:37,483 INFO L290 TraceCheckUtils]: 1: Hoare triple {5735#true} assume true; {5735#true} is VALID [2022-04-08 08:42:37,483 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5735#true} {5735#true} #678#return; {5735#true} is VALID [2022-04-08 08:42:37,483 INFO L272 TraceCheckUtils]: 0: Hoare triple {5735#true} call ULTIMATE.init(); {5742#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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:42:37,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {5742#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {5735#true} is VALID [2022-04-08 08:42:37,484 INFO L290 TraceCheckUtils]: 2: Hoare triple {5735#true} assume true; {5735#true} is VALID [2022-04-08 08:42:37,484 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5735#true} {5735#true} #678#return; {5735#true} is VALID [2022-04-08 08:42:37,484 INFO L272 TraceCheckUtils]: 4: Hoare triple {5735#true} call #t~ret161 := main(); {5735#true} is VALID [2022-04-08 08:42:37,484 INFO L290 TraceCheckUtils]: 5: Hoare triple {5735#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {5735#true} is VALID [2022-04-08 08:42:37,484 INFO L290 TraceCheckUtils]: 6: Hoare triple {5735#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {5735#true} is VALID [2022-04-08 08:42:37,484 INFO L272 TraceCheckUtils]: 7: Hoare triple {5735#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {5735#true} is VALID [2022-04-08 08:42:37,486 INFO L290 TraceCheckUtils]: 8: Hoare triple {5735#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {5740#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:37,487 INFO L290 TraceCheckUtils]: 9: Hoare triple {5740#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {5740#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:37,487 INFO L290 TraceCheckUtils]: 10: Hoare triple {5740#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {5740#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:37,488 INFO L290 TraceCheckUtils]: 11: Hoare triple {5740#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {5740#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:37,488 INFO L290 TraceCheckUtils]: 12: Hoare triple {5740#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {5740#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:37,489 INFO L290 TraceCheckUtils]: 13: Hoare triple {5740#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {5740#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:37,489 INFO L290 TraceCheckUtils]: 14: Hoare triple {5740#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {5740#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:37,489 INFO L290 TraceCheckUtils]: 15: Hoare triple {5740#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {5740#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:37,490 INFO L290 TraceCheckUtils]: 16: Hoare triple {5740#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {5740#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:37,490 INFO L290 TraceCheckUtils]: 17: Hoare triple {5740#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {5740#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:37,490 INFO L290 TraceCheckUtils]: 18: Hoare triple {5740#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {5740#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:37,491 INFO L290 TraceCheckUtils]: 19: Hoare triple {5740#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {5740#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:42:37,491 INFO L290 TraceCheckUtils]: 20: Hoare triple {5740#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {5741#(not (= |ssl3_accept_#t~mem52| 8480))} is VALID [2022-04-08 08:42:37,491 INFO L290 TraceCheckUtils]: 21: Hoare triple {5741#(not (= |ssl3_accept_#t~mem52| 8480))} assume 8480 == #t~mem52;havoc #t~mem52; {5736#false} is VALID [2022-04-08 08:42:37,492 INFO L290 TraceCheckUtils]: 22: Hoare triple {5736#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {5736#false} is VALID [2022-04-08 08:42:37,492 INFO L290 TraceCheckUtils]: 23: Hoare triple {5736#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem91.base, 844 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {5736#false} is VALID [2022-04-08 08:42:37,492 INFO L290 TraceCheckUtils]: 24: Hoare triple {5736#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {5736#false} is VALID [2022-04-08 08:42:37,492 INFO L290 TraceCheckUtils]: 25: Hoare triple {5736#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {5736#false} is VALID [2022-04-08 08:42:37,492 INFO L290 TraceCheckUtils]: 26: Hoare triple {5736#false} ~skip~0 := 0; {5736#false} is VALID [2022-04-08 08:42:37,492 INFO L290 TraceCheckUtils]: 27: Hoare triple {5736#false} assume !false; {5736#false} is VALID [2022-04-08 08:42:37,492 INFO L290 TraceCheckUtils]: 28: Hoare triple {5736#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-08 08:42:37,492 INFO L290 TraceCheckUtils]: 29: Hoare triple {5736#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-08 08:42:37,492 INFO L290 TraceCheckUtils]: 30: Hoare triple {5736#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-08 08:42:37,493 INFO L290 TraceCheckUtils]: 31: Hoare triple {5736#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-08 08:42:37,493 INFO L290 TraceCheckUtils]: 32: Hoare triple {5736#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-08 08:42:37,493 INFO L290 TraceCheckUtils]: 33: Hoare triple {5736#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-08 08:42:37,493 INFO L290 TraceCheckUtils]: 34: Hoare triple {5736#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-08 08:42:37,493 INFO L290 TraceCheckUtils]: 35: Hoare triple {5736#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-08 08:42:37,493 INFO L290 TraceCheckUtils]: 36: Hoare triple {5736#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-08 08:42:37,493 INFO L290 TraceCheckUtils]: 37: Hoare triple {5736#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-08 08:42:37,493 INFO L290 TraceCheckUtils]: 38: Hoare triple {5736#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-08 08:42:37,493 INFO L290 TraceCheckUtils]: 39: Hoare triple {5736#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-08 08:42:37,493 INFO L290 TraceCheckUtils]: 40: Hoare triple {5736#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-08 08:42:37,493 INFO L290 TraceCheckUtils]: 41: Hoare triple {5736#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-08 08:42:37,494 INFO L290 TraceCheckUtils]: 42: Hoare triple {5736#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-08 08:42:37,494 INFO L290 TraceCheckUtils]: 43: Hoare triple {5736#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-08 08:42:37,494 INFO L290 TraceCheckUtils]: 44: Hoare triple {5736#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-08 08:42:37,494 INFO L290 TraceCheckUtils]: 45: Hoare triple {5736#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-08 08:42:37,494 INFO L290 TraceCheckUtils]: 46: Hoare triple {5736#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-08 08:42:37,494 INFO L290 TraceCheckUtils]: 47: Hoare triple {5736#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-08 08:42:37,494 INFO L290 TraceCheckUtils]: 48: Hoare triple {5736#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-08 08:42:37,494 INFO L290 TraceCheckUtils]: 49: Hoare triple {5736#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-08 08:42:37,494 INFO L290 TraceCheckUtils]: 50: Hoare triple {5736#false} assume 8448 == #t~mem68;havoc #t~mem68; {5736#false} is VALID [2022-04-08 08:42:37,494 INFO L290 TraceCheckUtils]: 51: Hoare triple {5736#false} assume !(~num1~0 > 0); {5736#false} is VALID [2022-04-08 08:42:37,494 INFO L290 TraceCheckUtils]: 52: Hoare triple {5736#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {5736#false} is VALID [2022-04-08 08:42:37,495 INFO L290 TraceCheckUtils]: 53: Hoare triple {5736#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {5736#false} is VALID [2022-04-08 08:42:37,495 INFO L290 TraceCheckUtils]: 54: Hoare triple {5736#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {5736#false} is VALID [2022-04-08 08:42:37,495 INFO L290 TraceCheckUtils]: 55: Hoare triple {5736#false} ~skip~0 := 0; {5736#false} is VALID [2022-04-08 08:42:37,495 INFO L290 TraceCheckUtils]: 56: Hoare triple {5736#false} assume !false; {5736#false} is VALID [2022-04-08 08:42:37,495 INFO L290 TraceCheckUtils]: 57: Hoare triple {5736#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-08 08:42:37,495 INFO L290 TraceCheckUtils]: 58: Hoare triple {5736#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-08 08:42:37,495 INFO L290 TraceCheckUtils]: 59: Hoare triple {5736#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-08 08:42:37,495 INFO L290 TraceCheckUtils]: 60: Hoare triple {5736#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-08 08:42:37,495 INFO L290 TraceCheckUtils]: 61: Hoare triple {5736#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-08 08:42:37,495 INFO L290 TraceCheckUtils]: 62: Hoare triple {5736#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-08 08:42:37,496 INFO L290 TraceCheckUtils]: 63: Hoare triple {5736#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-08 08:42:37,496 INFO L290 TraceCheckUtils]: 64: Hoare triple {5736#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-08 08:42:37,496 INFO L290 TraceCheckUtils]: 65: Hoare triple {5736#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-08 08:42:37,496 INFO L290 TraceCheckUtils]: 66: Hoare triple {5736#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-08 08:42:37,496 INFO L290 TraceCheckUtils]: 67: Hoare triple {5736#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-08 08:42:37,496 INFO L290 TraceCheckUtils]: 68: Hoare triple {5736#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-08 08:42:37,496 INFO L290 TraceCheckUtils]: 69: Hoare triple {5736#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-08 08:42:37,496 INFO L290 TraceCheckUtils]: 70: Hoare triple {5736#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-08 08:42:37,496 INFO L290 TraceCheckUtils]: 71: Hoare triple {5736#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-08 08:42:37,496 INFO L290 TraceCheckUtils]: 72: Hoare triple {5736#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-08 08:42:37,496 INFO L290 TraceCheckUtils]: 73: Hoare triple {5736#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-08 08:42:37,497 INFO L290 TraceCheckUtils]: 74: Hoare triple {5736#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-08 08:42:37,497 INFO L290 TraceCheckUtils]: 75: Hoare triple {5736#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-08 08:42:37,497 INFO L290 TraceCheckUtils]: 76: Hoare triple {5736#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-08 08:42:37,497 INFO L290 TraceCheckUtils]: 77: Hoare triple {5736#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-08 08:42:37,497 INFO L290 TraceCheckUtils]: 78: Hoare triple {5736#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-08 08:42:37,497 INFO L290 TraceCheckUtils]: 79: Hoare triple {5736#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-08 08:42:37,497 INFO L290 TraceCheckUtils]: 80: Hoare triple {5736#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-08 08:42:37,497 INFO L290 TraceCheckUtils]: 81: Hoare triple {5736#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-08 08:42:37,497 INFO L290 TraceCheckUtils]: 82: Hoare triple {5736#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-08 08:42:37,497 INFO L290 TraceCheckUtils]: 83: Hoare triple {5736#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-08 08:42:37,497 INFO L290 TraceCheckUtils]: 84: Hoare triple {5736#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-08 08:42:37,498 INFO L290 TraceCheckUtils]: 85: Hoare triple {5736#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {5736#false} is VALID [2022-04-08 08:42:37,498 INFO L290 TraceCheckUtils]: 86: Hoare triple {5736#false} assume 8640 == #t~mem75;havoc #t~mem75; {5736#false} is VALID [2022-04-08 08:42:37,498 INFO L290 TraceCheckUtils]: 87: Hoare triple {5736#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {5736#false} is VALID [2022-04-08 08:42:37,498 INFO L290 TraceCheckUtils]: 88: Hoare triple {5736#false} assume !(4 == ~blastFlag~0); {5736#false} is VALID [2022-04-08 08:42:37,498 INFO L290 TraceCheckUtils]: 89: Hoare triple {5736#false} assume 7 == ~blastFlag~0; {5736#false} is VALID [2022-04-08 08:42:37,498 INFO L290 TraceCheckUtils]: 90: Hoare triple {5736#false} assume !false; {5736#false} is VALID [2022-04-08 08:42:37,498 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-08 08:42:37,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:42:37,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831338272] [2022-04-08 08:42:37,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831338272] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:42:37,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:42:37,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:42:37,499 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:42:37,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [186449626] [2022-04-08 08:42:37,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [186449626] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:42:37,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:42:37,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:42:37,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615741808] [2022-04-08 08:42:37,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:42:37,500 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 91 [2022-04-08 08:42:37,500 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:42:37,500 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:42:37,560 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:42:37,560 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:42:37,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:42:37,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:42:37,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:42:37,561 INFO L87 Difference]: Start difference. First operand 231 states and 377 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:42:44,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:42:44,366 INFO L93 Difference]: Finished difference Result 552 states and 894 transitions. [2022-04-08 08:42:44,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:42:44,367 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 91 [2022-04-08 08:42:44,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:42:44,367 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:42:44,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 582 transitions. [2022-04-08 08:42:44,370 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:42:44,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 582 transitions. [2022-04-08 08:42:44,372 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 582 transitions. [2022-04-08 08:42:44,767 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 582 edges. 582 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:42:44,773 INFO L225 Difference]: With dead ends: 552 [2022-04-08 08:42:44,773 INFO L226 Difference]: Without dead ends: 347 [2022-04-08 08:42:44,774 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:42:44,774 INFO L913 BasicCegarLoop]: 252 mSDtfsCounter, 140 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:42:44,774 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 608 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-04-08 08:42:44,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2022-04-08 08:42:44,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 247. [2022-04-08 08:42:44,787 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:42:44,788 INFO L82 GeneralOperation]: Start isEquivalent. First operand 347 states. Second operand has 247 states, 242 states have (on average 1.640495867768595) internal successors, (397), 242 states have internal predecessors, (397), 3 states have call successors, (3), 3 states have 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:42:44,788 INFO L74 IsIncluded]: Start isIncluded. First operand 347 states. Second operand has 247 states, 242 states have (on average 1.640495867768595) internal successors, (397), 242 states have internal predecessors, (397), 3 states have call successors, (3), 3 states have 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:42:44,789 INFO L87 Difference]: Start difference. First operand 347 states. Second operand has 247 states, 242 states have (on average 1.640495867768595) internal successors, (397), 242 states have internal predecessors, (397), 3 states have call successors, (3), 3 states have 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:42:44,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:42:44,795 INFO L93 Difference]: Finished difference Result 347 states and 552 transitions. [2022-04-08 08:42:44,795 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 552 transitions. [2022-04-08 08:42:44,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:42:44,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:42:44,796 INFO L74 IsIncluded]: Start isIncluded. First operand has 247 states, 242 states have (on average 1.640495867768595) internal successors, (397), 242 states have internal predecessors, (397), 3 states have call successors, (3), 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 347 states. [2022-04-08 08:42:44,797 INFO L87 Difference]: Start difference. First operand has 247 states, 242 states have (on average 1.640495867768595) internal successors, (397), 242 states have internal predecessors, (397), 3 states have call successors, (3), 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 347 states. [2022-04-08 08:42:44,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:42:44,803 INFO L93 Difference]: Finished difference Result 347 states and 552 transitions. [2022-04-08 08:42:44,803 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 552 transitions. [2022-04-08 08:42:44,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:42:44,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:42:44,804 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:42:44,804 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:42:44,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 242 states have (on average 1.640495867768595) internal successors, (397), 242 states have internal predecessors, (397), 3 states have call successors, (3), 3 states have 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:42:44,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 401 transitions. [2022-04-08 08:42:44,814 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 401 transitions. Word has length 91 [2022-04-08 08:42:44,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:42:44,815 INFO L478 AbstractCegarLoop]: Abstraction has 247 states and 401 transitions. [2022-04-08 08:42:44,815 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:42:44,815 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 247 states and 401 transitions. [2022-04-08 08:42:45,086 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 401 edges. 401 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:42:45,087 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 401 transitions. [2022-04-08 08:42:45,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-04-08 08:42:45,088 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:42:45,089 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:42:45,089 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 08:42:45,089 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:42:45,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:42:45,089 INFO L85 PathProgramCache]: Analyzing trace with hash 754171252, now seen corresponding path program 1 times [2022-04-08 08:42:45,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:42:45,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1354666475] [2022-04-08 08:42:45,161 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:42:45,161 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:42:45,161 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:42:45,161 INFO L85 PathProgramCache]: Analyzing trace with hash 754171252, now seen corresponding path program 2 times [2022-04-08 08:42:45,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:42:45,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329104677] [2022-04-08 08:42:45,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:42:45,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:42:45,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:42:45,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:42:45,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:42:45,300 INFO L290 TraceCheckUtils]: 0: Hoare triple {8046#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {8039#true} is VALID [2022-04-08 08:42:45,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {8039#true} assume true; {8039#true} is VALID [2022-04-08 08:42:45,300 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8039#true} {8039#true} #678#return; {8039#true} is VALID [2022-04-08 08:42:45,301 INFO L272 TraceCheckUtils]: 0: Hoare triple {8039#true} call ULTIMATE.init(); {8046#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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:42:45,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {8046#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {8039#true} is VALID [2022-04-08 08:42:45,301 INFO L290 TraceCheckUtils]: 2: Hoare triple {8039#true} assume true; {8039#true} is VALID [2022-04-08 08:42:45,301 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8039#true} {8039#true} #678#return; {8039#true} is VALID [2022-04-08 08:42:45,301 INFO L272 TraceCheckUtils]: 4: Hoare triple {8039#true} call #t~ret161 := main(); {8039#true} is VALID [2022-04-08 08:42:45,301 INFO L290 TraceCheckUtils]: 5: Hoare triple {8039#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {8039#true} is VALID [2022-04-08 08:42:45,302 INFO L290 TraceCheckUtils]: 6: Hoare triple {8039#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {8039#true} is VALID [2022-04-08 08:42:45,302 INFO L272 TraceCheckUtils]: 7: Hoare triple {8039#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {8039#true} is VALID [2022-04-08 08:42:45,303 INFO L290 TraceCheckUtils]: 8: Hoare triple {8039#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {8044#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:45,304 INFO L290 TraceCheckUtils]: 9: Hoare triple {8044#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {8044#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:45,304 INFO L290 TraceCheckUtils]: 10: Hoare triple {8044#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {8044#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:45,305 INFO L290 TraceCheckUtils]: 11: Hoare triple {8044#(= 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)))); {8044#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:45,305 INFO L290 TraceCheckUtils]: 12: Hoare triple {8044#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {8044#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:45,306 INFO L290 TraceCheckUtils]: 13: Hoare triple {8044#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {8044#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:45,306 INFO L290 TraceCheckUtils]: 14: Hoare triple {8044#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {8044#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:42:45,306 INFO L290 TraceCheckUtils]: 15: Hoare triple {8044#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {8045#(= 8464 |ssl3_accept_#t~mem47|)} is VALID [2022-04-08 08:42:45,307 INFO L290 TraceCheckUtils]: 16: Hoare triple {8045#(= 8464 |ssl3_accept_#t~mem47|)} assume 12292 == #t~mem47;havoc #t~mem47; {8040#false} is VALID [2022-04-08 08:42:45,307 INFO L290 TraceCheckUtils]: 17: Hoare triple {8040#false} call write~int(1, ~s.base, 40 + ~s.offset, 4); {8040#false} is VALID [2022-04-08 08:42:45,307 INFO L290 TraceCheckUtils]: 18: Hoare triple {8040#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {8040#false} is VALID [2022-04-08 08:42:45,307 INFO L290 TraceCheckUtils]: 19: Hoare triple {8040#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {8040#false} is VALID [2022-04-08 08:42:45,307 INFO L290 TraceCheckUtils]: 20: Hoare triple {8040#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {8040#false} is VALID [2022-04-08 08:42:45,307 INFO L290 TraceCheckUtils]: 21: Hoare triple {8040#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {8040#false} is VALID [2022-04-08 08:42:45,308 INFO L290 TraceCheckUtils]: 22: Hoare triple {8040#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {8040#false} is VALID [2022-04-08 08:42:45,308 INFO L290 TraceCheckUtils]: 23: Hoare triple {8040#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-08 08:42:45,308 INFO L290 TraceCheckUtils]: 24: Hoare triple {8040#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem89 := read~int(#t~mem88.base, 76 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 76 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-08 08:42:45,308 INFO L290 TraceCheckUtils]: 25: Hoare triple {8040#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {8040#false} is VALID [2022-04-08 08:42:45,308 INFO L290 TraceCheckUtils]: 26: Hoare triple {8040#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {8040#false} is VALID [2022-04-08 08:42:45,309 INFO L290 TraceCheckUtils]: 27: Hoare triple {8040#false} ~skip~0 := 0; {8040#false} is VALID [2022-04-08 08:42:45,309 INFO L290 TraceCheckUtils]: 28: Hoare triple {8040#false} assume !false; {8040#false} is VALID [2022-04-08 08:42:45,309 INFO L290 TraceCheckUtils]: 29: Hoare triple {8040#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-08 08:42:45,309 INFO L290 TraceCheckUtils]: 30: Hoare triple {8040#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-08 08:42:45,309 INFO L290 TraceCheckUtils]: 31: Hoare triple {8040#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-08 08:42:45,309 INFO L290 TraceCheckUtils]: 32: Hoare triple {8040#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-08 08:42:45,309 INFO L290 TraceCheckUtils]: 33: Hoare triple {8040#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-08 08:42:45,309 INFO L290 TraceCheckUtils]: 34: Hoare triple {8040#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-08 08:42:45,309 INFO L290 TraceCheckUtils]: 35: Hoare triple {8040#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-08 08:42:45,309 INFO L290 TraceCheckUtils]: 36: Hoare triple {8040#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-08 08:42:45,309 INFO L290 TraceCheckUtils]: 37: Hoare triple {8040#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-08 08:42:45,310 INFO L290 TraceCheckUtils]: 38: Hoare triple {8040#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-08 08:42:45,310 INFO L290 TraceCheckUtils]: 39: Hoare triple {8040#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-08 08:42:45,310 INFO L290 TraceCheckUtils]: 40: Hoare triple {8040#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-08 08:42:45,310 INFO L290 TraceCheckUtils]: 41: Hoare triple {8040#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-08 08:42:45,310 INFO L290 TraceCheckUtils]: 42: Hoare triple {8040#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-08 08:42:45,310 INFO L290 TraceCheckUtils]: 43: Hoare triple {8040#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-08 08:42:45,310 INFO L290 TraceCheckUtils]: 44: Hoare triple {8040#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-08 08:42:45,310 INFO L290 TraceCheckUtils]: 45: Hoare triple {8040#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-08 08:42:45,310 INFO L290 TraceCheckUtils]: 46: Hoare triple {8040#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-08 08:42:45,310 INFO L290 TraceCheckUtils]: 47: Hoare triple {8040#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-08 08:42:45,310 INFO L290 TraceCheckUtils]: 48: Hoare triple {8040#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-08 08:42:45,310 INFO L290 TraceCheckUtils]: 49: Hoare triple {8040#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-08 08:42:45,311 INFO L290 TraceCheckUtils]: 50: Hoare triple {8040#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-08 08:42:45,311 INFO L290 TraceCheckUtils]: 51: Hoare triple {8040#false} assume 8448 == #t~mem68;havoc #t~mem68; {8040#false} is VALID [2022-04-08 08:42:45,311 INFO L290 TraceCheckUtils]: 52: Hoare triple {8040#false} assume !(~num1~0 > 0); {8040#false} is VALID [2022-04-08 08:42:45,311 INFO L290 TraceCheckUtils]: 53: Hoare triple {8040#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {8040#false} is VALID [2022-04-08 08:42:45,311 INFO L290 TraceCheckUtils]: 54: Hoare triple {8040#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {8040#false} is VALID [2022-04-08 08:42:45,315 INFO L290 TraceCheckUtils]: 55: Hoare triple {8040#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {8040#false} is VALID [2022-04-08 08:42:45,315 INFO L290 TraceCheckUtils]: 56: Hoare triple {8040#false} ~skip~0 := 0; {8040#false} is VALID [2022-04-08 08:42:45,315 INFO L290 TraceCheckUtils]: 57: Hoare triple {8040#false} assume !false; {8040#false} is VALID [2022-04-08 08:42:45,315 INFO L290 TraceCheckUtils]: 58: Hoare triple {8040#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-08 08:42:45,315 INFO L290 TraceCheckUtils]: 59: Hoare triple {8040#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-08 08:42:45,316 INFO L290 TraceCheckUtils]: 60: Hoare triple {8040#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-08 08:42:45,316 INFO L290 TraceCheckUtils]: 61: Hoare triple {8040#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-08 08:42:45,316 INFO L290 TraceCheckUtils]: 62: Hoare triple {8040#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-08 08:42:45,316 INFO L290 TraceCheckUtils]: 63: Hoare triple {8040#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-08 08:42:45,316 INFO L290 TraceCheckUtils]: 64: Hoare triple {8040#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-08 08:42:45,316 INFO L290 TraceCheckUtils]: 65: Hoare triple {8040#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-08 08:42:45,316 INFO L290 TraceCheckUtils]: 66: Hoare triple {8040#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-08 08:42:45,316 INFO L290 TraceCheckUtils]: 67: Hoare triple {8040#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-08 08:42:45,316 INFO L290 TraceCheckUtils]: 68: Hoare triple {8040#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-08 08:42:45,316 INFO L290 TraceCheckUtils]: 69: Hoare triple {8040#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-08 08:42:45,316 INFO L290 TraceCheckUtils]: 70: Hoare triple {8040#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-08 08:42:45,317 INFO L290 TraceCheckUtils]: 71: Hoare triple {8040#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-08 08:42:45,317 INFO L290 TraceCheckUtils]: 72: Hoare triple {8040#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-08 08:42:45,317 INFO L290 TraceCheckUtils]: 73: Hoare triple {8040#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-08 08:42:45,317 INFO L290 TraceCheckUtils]: 74: Hoare triple {8040#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-08 08:42:45,317 INFO L290 TraceCheckUtils]: 75: Hoare triple {8040#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-08 08:42:45,317 INFO L290 TraceCheckUtils]: 76: Hoare triple {8040#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-08 08:42:45,317 INFO L290 TraceCheckUtils]: 77: Hoare triple {8040#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-08 08:42:45,317 INFO L290 TraceCheckUtils]: 78: Hoare triple {8040#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-08 08:42:45,317 INFO L290 TraceCheckUtils]: 79: Hoare triple {8040#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-08 08:42:45,317 INFO L290 TraceCheckUtils]: 80: Hoare triple {8040#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-08 08:42:45,317 INFO L290 TraceCheckUtils]: 81: Hoare triple {8040#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-08 08:42:45,318 INFO L290 TraceCheckUtils]: 82: Hoare triple {8040#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-08 08:42:45,318 INFO L290 TraceCheckUtils]: 83: Hoare triple {8040#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-08 08:42:45,318 INFO L290 TraceCheckUtils]: 84: Hoare triple {8040#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-08 08:42:45,318 INFO L290 TraceCheckUtils]: 85: Hoare triple {8040#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-08 08:42:45,318 INFO L290 TraceCheckUtils]: 86: Hoare triple {8040#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {8040#false} is VALID [2022-04-08 08:42:45,318 INFO L290 TraceCheckUtils]: 87: Hoare triple {8040#false} assume 8640 == #t~mem75;havoc #t~mem75; {8040#false} is VALID [2022-04-08 08:42:45,319 INFO L290 TraceCheckUtils]: 88: Hoare triple {8040#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {8040#false} is VALID [2022-04-08 08:42:45,319 INFO L290 TraceCheckUtils]: 89: Hoare triple {8040#false} assume !(4 == ~blastFlag~0); {8040#false} is VALID [2022-04-08 08:42:45,319 INFO L290 TraceCheckUtils]: 90: Hoare triple {8040#false} assume 7 == ~blastFlag~0; {8040#false} is VALID [2022-04-08 08:42:45,319 INFO L290 TraceCheckUtils]: 91: Hoare triple {8040#false} assume !false; {8040#false} is VALID [2022-04-08 08:42:45,320 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-08 08:42:45,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:42:45,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329104677] [2022-04-08 08:42:45,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329104677] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:42:45,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:42:45,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:42:45,322 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:42:45,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1354666475] [2022-04-08 08:42:45,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1354666475] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:42:45,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:42:45,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:42:45,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827367279] [2022-04-08 08:42:45,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:42:45,323 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 92 [2022-04-08 08:42:45,323 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:42:45,323 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:42:45,370 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:42:45,370 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:42:45,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:42:45,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:42:45,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:42:45,371 INFO L87 Difference]: Start difference. First operand 247 states and 401 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:42:47,828 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:42:53,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:42:53,824 INFO L93 Difference]: Finished difference Result 484 states and 785 transitions. [2022-04-08 08:42:53,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:42:53,824 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 92 [2022-04-08 08:42:53,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:42:53,825 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:42:53,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 441 transitions. [2022-04-08 08:42:53,839 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:42:53,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 441 transitions. [2022-04-08 08:42:53,842 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 441 transitions. [2022-04-08 08:42:54,106 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 441 edges. 441 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:42:54,111 INFO L225 Difference]: With dead ends: 484 [2022-04-08 08:42:54,111 INFO L226 Difference]: Without dead ends: 263 [2022-04-08 08:42:54,112 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:42:54,112 INFO L913 BasicCegarLoop]: 184 mSDtfsCounter, 28 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-04-08 08:42:54,113 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 473 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-04-08 08:42:54,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-04-08 08:42:54,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 247. [2022-04-08 08:42:54,123 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:42:54,124 INFO L82 GeneralOperation]: Start isEquivalent. First operand 263 states. Second operand has 247 states, 242 states have (on average 1.6363636363636365) internal successors, (396), 242 states have internal predecessors, (396), 3 states have call successors, (3), 3 states have 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:42:54,124 INFO L74 IsIncluded]: Start isIncluded. First operand 263 states. Second operand has 247 states, 242 states have (on average 1.6363636363636365) internal successors, (396), 242 states have internal predecessors, (396), 3 states have call successors, (3), 3 states have 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:42:54,125 INFO L87 Difference]: Start difference. First operand 263 states. Second operand has 247 states, 242 states have (on average 1.6363636363636365) internal successors, (396), 242 states have internal predecessors, (396), 3 states have call successors, (3), 3 states have 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:42:54,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:42:54,131 INFO L93 Difference]: Finished difference Result 263 states and 420 transitions. [2022-04-08 08:42:54,131 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 420 transitions. [2022-04-08 08:42:54,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:42:54,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:42:54,132 INFO L74 IsIncluded]: Start isIncluded. First operand has 247 states, 242 states have (on average 1.6363636363636365) internal successors, (396), 242 states have internal predecessors, (396), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 263 states. [2022-04-08 08:42:54,133 INFO L87 Difference]: Start difference. First operand has 247 states, 242 states have (on average 1.6363636363636365) internal successors, (396), 242 states have internal predecessors, (396), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 263 states. [2022-04-08 08:42:54,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:42:54,139 INFO L93 Difference]: Finished difference Result 263 states and 420 transitions. [2022-04-08 08:42:54,139 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 420 transitions. [2022-04-08 08:42:54,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:42:54,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:42:54,140 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:42:54,140 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:42:54,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 242 states have (on average 1.6363636363636365) internal successors, (396), 242 states have internal predecessors, (396), 3 states have call successors, (3), 3 states have 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:42:54,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 400 transitions. [2022-04-08 08:42:54,146 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 400 transitions. Word has length 92 [2022-04-08 08:42:54,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:42:54,146 INFO L478 AbstractCegarLoop]: Abstraction has 247 states and 400 transitions. [2022-04-08 08:42:54,146 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:42:54,146 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 247 states and 400 transitions. [2022-04-08 08:42:54,427 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 400 edges. 400 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:42:54,428 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 400 transitions. [2022-04-08 08:42:54,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-04-08 08:42:54,429 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:42:54,429 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:42:54,429 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-08 08:42:54,429 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:42:54,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:42:54,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1601811464, now seen corresponding path program 1 times [2022-04-08 08:42:54,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:42:54,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [282214997] [2022-04-08 08:42:54,616 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 18 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 08:42:54,617 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:42:54,617 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:42:54,618 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 08:42:54,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1961708251, now seen corresponding path program 1 times [2022-04-08 08:42:54,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:42:54,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201879333] [2022-04-08 08:42:54,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:42:54,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:42:54,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:42:54,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:42:54,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:42:54,745 INFO L290 TraceCheckUtils]: 0: Hoare triple {10045#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {10039#true} is VALID [2022-04-08 08:42:54,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {10039#true} assume true; {10039#true} is VALID [2022-04-08 08:42:54,747 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10039#true} {10039#true} #678#return; {10039#true} is VALID [2022-04-08 08:42:54,749 INFO L272 TraceCheckUtils]: 0: Hoare triple {10039#true} call ULTIMATE.init(); {10045#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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:42:54,753 INFO L290 TraceCheckUtils]: 1: Hoare triple {10045#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {10039#true} is VALID [2022-04-08 08:42:54,754 INFO L290 TraceCheckUtils]: 2: Hoare triple {10039#true} assume true; {10039#true} is VALID [2022-04-08 08:42:54,755 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10039#true} {10039#true} #678#return; {10039#true} is VALID [2022-04-08 08:42:54,756 INFO L272 TraceCheckUtils]: 4: Hoare triple {10039#true} call #t~ret161 := main(); {10039#true} is VALID [2022-04-08 08:42:54,758 INFO L290 TraceCheckUtils]: 5: Hoare triple {10039#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {10039#true} is VALID [2022-04-08 08:42:54,758 INFO L290 TraceCheckUtils]: 6: Hoare triple {10039#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {10039#true} is VALID [2022-04-08 08:42:54,758 INFO L272 TraceCheckUtils]: 7: Hoare triple {10039#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {10039#true} is VALID [2022-04-08 08:42:54,758 INFO L290 TraceCheckUtils]: 8: Hoare triple {10039#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:42:54,759 INFO L290 TraceCheckUtils]: 9: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:42:54,759 INFO L290 TraceCheckUtils]: 10: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:42:54,759 INFO L290 TraceCheckUtils]: 11: Hoare triple {10044#(= 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)))); {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:42:54,760 INFO L290 TraceCheckUtils]: 12: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:42:54,760 INFO L290 TraceCheckUtils]: 13: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:42:54,760 INFO L290 TraceCheckUtils]: 14: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} [684] L1167-2-->L1168_primed: Formula: true InVars {} OutVars{ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_8|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_268|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_8|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_8|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_16|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_14|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_4|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_8|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_14|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_14|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_16|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_8|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_18, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_4|, #memory_int=|v_#memory_int_269|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_4|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_268|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_10} AuxVars[] AssignedVars[ssl3_accept_#t~mem83.base, #memory_$Pointer$.base, ssl3_accept_#t~mem82, ssl3_accept_#t~mem85, ssl3_accept_#t~mem151, ssl3_accept_#t~mem150.base, ssl3_accept_#t~mem88.base, ssl3_accept_#t~mem83.offset, ssl3_accept_#t~mem48, ssl3_accept_#t~mem150.offset, ssl3_accept_#t~mem47, ssl3_accept_#t~mem46, ssl3_accept_~skip~0, ssl3_accept_#t~mem88.offset, #memory_int, ssl3_accept_#t~mem89, #memory_$Pointer$.offset, ssl3_accept_~state~0] {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:42:54,760 INFO L290 TraceCheckUtils]: 15: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} [685] L1168_primed-->L1167-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:42:54,761 INFO L290 TraceCheckUtils]: 16: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} [686] L1167-2-->L1168_primed: Formula: (or (and (= |v_#memory_$Pointer$.base_275| |v_#memory_$Pointer$.base_274|) (= |v_#memory_$Pointer$.offset_275| |v_#memory_$Pointer$.offset_274|) (= v_ssl3_accept_~s.base_108 v_ssl3_accept_~s.base_108) (= v_ssl3_accept_~s.offset_108 v_ssl3_accept_~s.offset_108) (= |v_#memory_int_275| |v_#memory_int_274|) (= v_ssl3_accept_~num1~0_10 v_ssl3_accept_~num1~0_10)) (let ((.cse0 (select |v_#memory_int_275| v_ssl3_accept_~s.base_108)) (.cse1 (+ 52 v_ssl3_accept_~s.offset_108))) (let ((.cse4 (select |v_#memory_$Pointer$.offset_275| v_ssl3_accept_~s.base_108)) (.cse6 (select |v_#memory_$Pointer$.offset_274| v_ssl3_accept_~s.base_108)) (.cse3 (+ 84 v_ssl3_accept_~s.offset_108)) (.cse2 (select |v_#memory_$Pointer$.base_275| v_ssl3_accept_~s.base_108)) (.cse7 (select |v_#memory_$Pointer$.base_274| v_ssl3_accept_~s.base_108)) (.cse5 (select .cse0 .cse1))) (and (= (store |v_#memory_int_275| v_ssl3_accept_~s.base_108 (store .cse0 .cse1 (select (select |v_#memory_int_275| (select .cse2 .cse3)) (+ (select .cse4 .cse3) 844)))) |v_#memory_int_274|) (not (= 8560 .cse5)) (= |v_#memory_$Pointer$.offset_274| (store |v_#memory_$Pointer$.offset_275| v_ssl3_accept_~s.base_108 (store .cse4 .cse1 (select .cse6 .cse1)))) (= v_ssl3_accept_~skip~0_19 0) (not (< 0 v_ssl3_accept_~num1~0_10)) (not (= .cse5 8195)) (not (= 8497 .cse5)) (not (= .cse5 8529)) (not (= .cse5 8482)) (not (= 8496 .cse5)) (= 8448 .cse5) (not (= .cse5 8544)) (not (= .cse5 8528)) (not (= 8466 .cse5)) (= .cse5 v_ssl3_accept_~state~0_11) (not (= .cse5 8545)) (not (= 8513 .cse5)) (not (= (select (select |v_#memory_int_274| (select .cse7 .cse3)) (+ (select .cse6 .cse3) 848)) 0)) (= (store |v_#memory_$Pointer$.base_275| v_ssl3_accept_~s.base_108 (store .cse2 .cse1 (select .cse7 .cse1))) |v_#memory_$Pointer$.base_274|) (not (= 8464 .cse5)) (not (= 24576 .cse5)) (not (= 12292 .cse5)) (not (= .cse5 8512)) (not (= .cse5 8480)) (not (= .cse5 8481)) (not (= 8192 .cse5)) (not (= .cse5 8465)) (not (= .cse5 16384)) (not (= .cse5 8561)))))) InVars {ssl3_accept_~s.offset=v_ssl3_accept_~s.offset_108, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_275|, ssl3_accept_~num1~0=v_ssl3_accept_~num1~0_10, #memory_int=|v_#memory_int_275|, ssl3_accept_~s.base=v_ssl3_accept_~s.base_108, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_275|} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_274|, ssl3_accept_~num1~0=v_ssl3_accept_~num1~0_10, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_18|, ssl3_accept_#t~mem52=|v_ssl3_accept_#t~mem52_14|, ssl3_accept_#t~mem51=|v_ssl3_accept_#t~mem51_14|, ssl3_accept_#t~mem50=|v_ssl3_accept_#t~mem50_14|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_16|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_19, ssl3_accept_#t~mem53=|v_ssl3_accept_#t~mem53_12|, ssl3_accept_#t~mem54=|v_ssl3_accept_#t~mem54_12|, ssl3_accept_#t~mem55=|v_ssl3_accept_#t~mem55_12|, ssl3_accept_#t~mem133=|v_ssl3_accept_#t~mem133_6|, ssl3_accept_#t~mem56=|v_ssl3_accept_#t~mem56_12|, ssl3_accept_#t~mem57=|v_ssl3_accept_#t~mem57_12|, ssl3_accept_#t~mem132.offset=|v_ssl3_accept_#t~mem132.offset_6|, ssl3_accept_#t~mem58=|v_ssl3_accept_#t~mem58_12|, ssl3_accept_#t~mem59=|v_ssl3_accept_#t~mem59_12|, ssl3_accept_~s.offset=v_ssl3_accept_~s.offset_108, ssl3_accept_#t~mem60=|v_ssl3_accept_#t~mem60_12|, ssl3_accept_#t~mem61=|v_ssl3_accept_#t~mem61_12|, ssl3_accept_#t~mem62=|v_ssl3_accept_#t~mem62_12|, ssl3_accept_#t~mem132.base=|v_ssl3_accept_#t~mem132.base_6|, ssl3_accept_#t~mem63=|v_ssl3_accept_#t~mem63_12|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_16|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_14|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_16|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_18|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_9|, #memory_int=|v_#memory_int_274|, ssl3_accept_#t~mem64=|v_ssl3_accept_#t~mem64_12|, ssl3_accept_#t~mem65=|v_ssl3_accept_#t~mem65_12|, ssl3_accept_#t~mem66=|v_ssl3_accept_#t~mem66_12|, ssl3_accept_#t~mem67=|v_ssl3_accept_#t~mem67_12|, ssl3_accept_#t~mem68=|v_ssl3_accept_#t~mem68_12|, ssl3_accept_~s.base=v_ssl3_accept_~s.base_108, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_274|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_11} AuxVars[] AssignedVars[#memory_$Pointer$.base, ssl3_accept_#t~mem151, ssl3_accept_#t~mem52, ssl3_accept_#t~mem51, ssl3_accept_#t~mem50, ssl3_accept_#t~mem150.offset, ssl3_accept_~skip~0, ssl3_accept_#t~mem53, ssl3_accept_#t~mem54, ssl3_accept_#t~mem55, ssl3_accept_#t~mem133, ssl3_accept_#t~mem56, ssl3_accept_#t~mem57, ssl3_accept_#t~mem132.offset, ssl3_accept_#t~mem58, ssl3_accept_#t~mem59, ssl3_accept_#t~mem60, ssl3_accept_#t~mem61, ssl3_accept_#t~mem62, ssl3_accept_#t~mem132.base, ssl3_accept_#t~mem63, ssl3_accept_#t~mem150.base, ssl3_accept_#t~mem49, ssl3_accept_#t~mem48, ssl3_accept_#t~mem47, ssl3_accept_#t~mem46, #memory_int, ssl3_accept_#t~mem64, ssl3_accept_#t~mem65, ssl3_accept_#t~mem66, ssl3_accept_#t~mem67, ssl3_accept_#t~mem68, #memory_$Pointer$.offset, ssl3_accept_~state~0] {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:42:54,761 INFO L290 TraceCheckUtils]: 17: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} [683] L1168_primed-->L1168: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:42:54,762 INFO L290 TraceCheckUtils]: 18: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:42:54,762 INFO L290 TraceCheckUtils]: 19: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:42:54,762 INFO L290 TraceCheckUtils]: 20: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:42:54,762 INFO L290 TraceCheckUtils]: 21: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:42:54,763 INFO L290 TraceCheckUtils]: 22: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:42:54,763 INFO L290 TraceCheckUtils]: 23: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:42:54,763 INFO L290 TraceCheckUtils]: 24: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:42:54,763 INFO L290 TraceCheckUtils]: 25: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:42:54,764 INFO L290 TraceCheckUtils]: 26: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:42:54,764 INFO L290 TraceCheckUtils]: 27: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:42:54,764 INFO L290 TraceCheckUtils]: 28: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:42:54,764 INFO L290 TraceCheckUtils]: 29: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:42:54,765 INFO L290 TraceCheckUtils]: 30: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:42:54,765 INFO L290 TraceCheckUtils]: 31: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:42:54,765 INFO L290 TraceCheckUtils]: 32: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:42:54,765 INFO L290 TraceCheckUtils]: 33: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:42:54,766 INFO L290 TraceCheckUtils]: 34: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:42:54,766 INFO L290 TraceCheckUtils]: 35: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:42:54,766 INFO L290 TraceCheckUtils]: 36: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:42:54,767 INFO L290 TraceCheckUtils]: 37: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:42:54,767 INFO L290 TraceCheckUtils]: 38: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:42:54,767 INFO L290 TraceCheckUtils]: 39: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:42:54,767 INFO L290 TraceCheckUtils]: 40: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:42:54,768 INFO L290 TraceCheckUtils]: 41: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:42:54,768 INFO L290 TraceCheckUtils]: 42: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:42:54,768 INFO L290 TraceCheckUtils]: 43: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:42:54,768 INFO L290 TraceCheckUtils]: 44: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:42:54,769 INFO L290 TraceCheckUtils]: 45: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:42:54,769 INFO L290 TraceCheckUtils]: 46: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:42:54,769 INFO L290 TraceCheckUtils]: 47: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} assume 8640 == #t~mem75;havoc #t~mem75; {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:42:54,770 INFO L290 TraceCheckUtils]: 48: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:42:54,770 INFO L290 TraceCheckUtils]: 49: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} assume !(4 == ~blastFlag~0); {10044#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:42:54,770 INFO L290 TraceCheckUtils]: 50: Hoare triple {10044#(= ssl3_accept_~blastFlag~0 0)} assume 7 == ~blastFlag~0; {10040#false} is VALID [2022-04-08 08:42:54,770 INFO L290 TraceCheckUtils]: 51: Hoare triple {10040#false} assume !false; {10040#false} is VALID [2022-04-08 08:42:54,772 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 08:42:54,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:42:54,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201879333] [2022-04-08 08:42:54,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201879333] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:42:54,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:42:54,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:42:58,840 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:42:58,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [282214997] [2022-04-08 08:42:58,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [282214997] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:42:58,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:42:58,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 08:42:58,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499638895] [2022-04-08 08:42:58,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:42:58,841 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 12 states have internal predecessors, (85), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2022-04-08 08:42:58,841 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:42:58,841 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 12 states have internal predecessors, (85), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:58,923 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:42:58,923 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 08:42:58,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:42:58,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 08:42:58,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=107, Unknown=1, NotChecked=0, Total=156 [2022-04-08 08:42:58,924 INFO L87 Difference]: Start difference. First operand 247 states and 400 transitions. Second operand has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 12 states have internal predecessors, (85), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:05,553 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:43:08,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:08,154 INFO L93 Difference]: Finished difference Result 671 states and 1101 transitions. [2022-04-08 08:43:08,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 08:43:08,154 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 12 states have internal predecessors, (85), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2022-04-08 08:43:08,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:43:08,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 12 states have internal predecessors, (85), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:08,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 595 transitions. [2022-04-08 08:43:08,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 12 states have internal predecessors, (85), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:08,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 595 transitions. [2022-04-08 08:43:08,160 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 595 transitions. [2022-04-08 08:43:08,563 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 595 edges. 595 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:43:08,573 INFO L225 Difference]: With dead ends: 671 [2022-04-08 08:43:08,574 INFO L226 Difference]: Without dead ends: 450 [2022-04-08 08:43:08,574 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=48, Invalid=107, Unknown=1, NotChecked=0, Total=156 [2022-04-08 08:43:08,575 INFO L913 BasicCegarLoop]: 336 mSDtfsCounter, 142 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 972 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 1132 SdHoareTripleChecker+Invalid, 1203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 972 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 220 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:43:08,575 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 1132 Invalid, 1203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 972 Invalid, 0 Unknown, 220 Unchecked, 5.1s Time] [2022-04-08 08:43:08,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2022-04-08 08:43:08,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 445. [2022-04-08 08:43:08,590 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:43:08,591 INFO L82 GeneralOperation]: Start isEquivalent. First operand 450 states. Second operand has 445 states, 440 states have (on average 1.6318181818181818) internal successors, (718), 440 states have internal predecessors, (718), 3 states have call successors, (3), 3 states have 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:43:08,592 INFO L74 IsIncluded]: Start isIncluded. First operand 450 states. Second operand has 445 states, 440 states have (on average 1.6318181818181818) internal successors, (718), 440 states have internal predecessors, (718), 3 states have call successors, (3), 3 states have 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:43:08,592 INFO L87 Difference]: Start difference. First operand 450 states. Second operand has 445 states, 440 states have (on average 1.6318181818181818) internal successors, (718), 440 states have internal predecessors, (718), 3 states have call successors, (3), 3 states have 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:43:08,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:08,602 INFO L93 Difference]: Finished difference Result 450 states and 728 transitions. [2022-04-08 08:43:08,602 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 728 transitions. [2022-04-08 08:43:08,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:43:08,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:43:08,604 INFO L74 IsIncluded]: Start isIncluded. First operand has 445 states, 440 states have (on average 1.6318181818181818) internal successors, (718), 440 states have internal predecessors, (718), 3 states have call successors, (3), 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 450 states. [2022-04-08 08:43:08,605 INFO L87 Difference]: Start difference. First operand has 445 states, 440 states have (on average 1.6318181818181818) internal successors, (718), 440 states have internal predecessors, (718), 3 states have call successors, (3), 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 450 states. [2022-04-08 08:43:08,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:08,614 INFO L93 Difference]: Finished difference Result 450 states and 728 transitions. [2022-04-08 08:43:08,614 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 728 transitions. [2022-04-08 08:43:08,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:43:08,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:43:08,615 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:43:08,615 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:43:08,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 440 states have (on average 1.6318181818181818) internal successors, (718), 440 states have internal predecessors, (718), 3 states have call successors, (3), 3 states have 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:43:08,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 722 transitions. [2022-04-08 08:43:08,628 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 722 transitions. Word has length 92 [2022-04-08 08:43:08,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:43:08,628 INFO L478 AbstractCegarLoop]: Abstraction has 445 states and 722 transitions. [2022-04-08 08:43:08,628 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 12 states have internal predecessors, (85), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:08,628 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 445 states and 722 transitions. [2022-04-08 08:43:09,188 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 722 edges. 722 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:43:09,188 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 722 transitions. [2022-04-08 08:43:09,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-04-08 08:43:09,195 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:43:09,195 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:43:09,195 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-08 08:43:09,195 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:43:09,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:43:09,196 INFO L85 PathProgramCache]: Analyzing trace with hash -309231094, now seen corresponding path program 1 times [2022-04-08 08:43:09,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:43:09,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [70207592] [2022-04-08 08:43:09,277 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:43:09,277 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:43:09,277 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:43:09,277 INFO L85 PathProgramCache]: Analyzing trace with hash -309231094, now seen corresponding path program 2 times [2022-04-08 08:43:09,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:43:09,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665003095] [2022-04-08 08:43:09,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:43:09,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:43:09,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:43:09,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:43:09,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:43:09,386 INFO L290 TraceCheckUtils]: 0: Hoare triple {13196#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {13189#true} is VALID [2022-04-08 08:43:09,386 INFO L290 TraceCheckUtils]: 1: Hoare triple {13189#true} assume true; {13189#true} is VALID [2022-04-08 08:43:09,386 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13189#true} {13189#true} #678#return; {13189#true} is VALID [2022-04-08 08:43:09,387 INFO L272 TraceCheckUtils]: 0: Hoare triple {13189#true} call ULTIMATE.init(); {13196#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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:43:09,387 INFO L290 TraceCheckUtils]: 1: Hoare triple {13196#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {13189#true} is VALID [2022-04-08 08:43:09,387 INFO L290 TraceCheckUtils]: 2: Hoare triple {13189#true} assume true; {13189#true} is VALID [2022-04-08 08:43:09,387 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13189#true} {13189#true} #678#return; {13189#true} is VALID [2022-04-08 08:43:09,387 INFO L272 TraceCheckUtils]: 4: Hoare triple {13189#true} call #t~ret161 := main(); {13189#true} is VALID [2022-04-08 08:43:09,387 INFO L290 TraceCheckUtils]: 5: Hoare triple {13189#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {13189#true} is VALID [2022-04-08 08:43:09,387 INFO L290 TraceCheckUtils]: 6: Hoare triple {13189#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {13189#true} is VALID [2022-04-08 08:43:09,387 INFO L272 TraceCheckUtils]: 7: Hoare triple {13189#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {13189#true} is VALID [2022-04-08 08:43:09,389 INFO L290 TraceCheckUtils]: 8: Hoare triple {13189#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {13194#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:43:09,390 INFO L290 TraceCheckUtils]: 9: Hoare triple {13194#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {13194#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:43:09,390 INFO L290 TraceCheckUtils]: 10: Hoare triple {13194#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {13194#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:43:09,391 INFO L290 TraceCheckUtils]: 11: Hoare triple {13194#(= 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)))); {13194#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:43:09,391 INFO L290 TraceCheckUtils]: 12: Hoare triple {13194#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {13194#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:43:09,391 INFO L290 TraceCheckUtils]: 13: Hoare triple {13194#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {13194#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:43:09,392 INFO L290 TraceCheckUtils]: 14: Hoare triple {13194#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {13194#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:43:09,392 INFO L290 TraceCheckUtils]: 15: Hoare triple {13194#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {13194#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:43:09,392 INFO L290 TraceCheckUtils]: 16: Hoare triple {13194#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {13195#(= 8464 |ssl3_accept_#t~mem48|)} is VALID [2022-04-08 08:43:09,393 INFO L290 TraceCheckUtils]: 17: Hoare triple {13195#(= 8464 |ssl3_accept_#t~mem48|)} assume 16384 == #t~mem48;havoc #t~mem48; {13190#false} is VALID [2022-04-08 08:43:09,393 INFO L290 TraceCheckUtils]: 18: Hoare triple {13190#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {13190#false} is VALID [2022-04-08 08:43:09,393 INFO L290 TraceCheckUtils]: 19: Hoare triple {13190#false} assume !(0 != (~cb~0.base + ~cb~0.offset) % 4294967296); {13190#false} is VALID [2022-04-08 08:43:09,393 INFO L290 TraceCheckUtils]: 20: Hoare triple {13190#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {13190#false} is VALID [2022-04-08 08:43:09,393 INFO L290 TraceCheckUtils]: 21: Hoare triple {13190#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {13190#false} is VALID [2022-04-08 08:43:09,393 INFO L290 TraceCheckUtils]: 22: Hoare triple {13190#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {13190#false} is VALID [2022-04-08 08:43:09,393 INFO L290 TraceCheckUtils]: 23: Hoare triple {13190#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-08 08:43:09,393 INFO L290 TraceCheckUtils]: 24: Hoare triple {13190#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem89 := read~int(#t~mem88.base, 76 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 76 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-08 08:43:09,393 INFO L290 TraceCheckUtils]: 25: Hoare triple {13190#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {13190#false} is VALID [2022-04-08 08:43:09,393 INFO L290 TraceCheckUtils]: 26: Hoare triple {13190#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {13190#false} is VALID [2022-04-08 08:43:09,393 INFO L290 TraceCheckUtils]: 27: Hoare triple {13190#false} ~skip~0 := 0; {13190#false} is VALID [2022-04-08 08:43:09,393 INFO L290 TraceCheckUtils]: 28: Hoare triple {13190#false} assume !false; {13190#false} is VALID [2022-04-08 08:43:09,394 INFO L290 TraceCheckUtils]: 29: Hoare triple {13190#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-08 08:43:09,394 INFO L290 TraceCheckUtils]: 30: Hoare triple {13190#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-08 08:43:09,394 INFO L290 TraceCheckUtils]: 31: Hoare triple {13190#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-08 08:43:09,394 INFO L290 TraceCheckUtils]: 32: Hoare triple {13190#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-08 08:43:09,394 INFO L290 TraceCheckUtils]: 33: Hoare triple {13190#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-08 08:43:09,394 INFO L290 TraceCheckUtils]: 34: Hoare triple {13190#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-08 08:43:09,394 INFO L290 TraceCheckUtils]: 35: Hoare triple {13190#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-08 08:43:09,394 INFO L290 TraceCheckUtils]: 36: Hoare triple {13190#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-08 08:43:09,394 INFO L290 TraceCheckUtils]: 37: Hoare triple {13190#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-08 08:43:09,394 INFO L290 TraceCheckUtils]: 38: Hoare triple {13190#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-08 08:43:09,394 INFO L290 TraceCheckUtils]: 39: Hoare triple {13190#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-08 08:43:09,394 INFO L290 TraceCheckUtils]: 40: Hoare triple {13190#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-08 08:43:09,394 INFO L290 TraceCheckUtils]: 41: Hoare triple {13190#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-08 08:43:09,395 INFO L290 TraceCheckUtils]: 42: Hoare triple {13190#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-08 08:43:09,395 INFO L290 TraceCheckUtils]: 43: Hoare triple {13190#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-08 08:43:09,395 INFO L290 TraceCheckUtils]: 44: Hoare triple {13190#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-08 08:43:09,395 INFO L290 TraceCheckUtils]: 45: Hoare triple {13190#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-08 08:43:09,395 INFO L290 TraceCheckUtils]: 46: Hoare triple {13190#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-08 08:43:09,395 INFO L290 TraceCheckUtils]: 47: Hoare triple {13190#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-08 08:43:09,395 INFO L290 TraceCheckUtils]: 48: Hoare triple {13190#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-08 08:43:09,395 INFO L290 TraceCheckUtils]: 49: Hoare triple {13190#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-08 08:43:09,395 INFO L290 TraceCheckUtils]: 50: Hoare triple {13190#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-08 08:43:09,395 INFO L290 TraceCheckUtils]: 51: Hoare triple {13190#false} assume 8448 == #t~mem68;havoc #t~mem68; {13190#false} is VALID [2022-04-08 08:43:09,395 INFO L290 TraceCheckUtils]: 52: Hoare triple {13190#false} assume !(~num1~0 > 0); {13190#false} is VALID [2022-04-08 08:43:09,395 INFO L290 TraceCheckUtils]: 53: Hoare triple {13190#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {13190#false} is VALID [2022-04-08 08:43:09,395 INFO L290 TraceCheckUtils]: 54: Hoare triple {13190#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {13190#false} is VALID [2022-04-08 08:43:09,396 INFO L290 TraceCheckUtils]: 55: Hoare triple {13190#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {13190#false} is VALID [2022-04-08 08:43:09,396 INFO L290 TraceCheckUtils]: 56: Hoare triple {13190#false} ~skip~0 := 0; {13190#false} is VALID [2022-04-08 08:43:09,396 INFO L290 TraceCheckUtils]: 57: Hoare triple {13190#false} assume !false; {13190#false} is VALID [2022-04-08 08:43:09,396 INFO L290 TraceCheckUtils]: 58: Hoare triple {13190#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-08 08:43:09,396 INFO L290 TraceCheckUtils]: 59: Hoare triple {13190#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-08 08:43:09,396 INFO L290 TraceCheckUtils]: 60: Hoare triple {13190#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-08 08:43:09,396 INFO L290 TraceCheckUtils]: 61: Hoare triple {13190#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-08 08:43:09,396 INFO L290 TraceCheckUtils]: 62: Hoare triple {13190#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-08 08:43:09,396 INFO L290 TraceCheckUtils]: 63: Hoare triple {13190#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-08 08:43:09,396 INFO L290 TraceCheckUtils]: 64: Hoare triple {13190#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-08 08:43:09,396 INFO L290 TraceCheckUtils]: 65: Hoare triple {13190#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-08 08:43:09,396 INFO L290 TraceCheckUtils]: 66: Hoare triple {13190#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-08 08:43:09,396 INFO L290 TraceCheckUtils]: 67: Hoare triple {13190#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-08 08:43:09,397 INFO L290 TraceCheckUtils]: 68: Hoare triple {13190#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-08 08:43:09,397 INFO L290 TraceCheckUtils]: 69: Hoare triple {13190#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-08 08:43:09,397 INFO L290 TraceCheckUtils]: 70: Hoare triple {13190#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-08 08:43:09,399 INFO L290 TraceCheckUtils]: 71: Hoare triple {13190#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-08 08:43:09,399 INFO L290 TraceCheckUtils]: 72: Hoare triple {13190#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-08 08:43:09,400 INFO L290 TraceCheckUtils]: 73: Hoare triple {13190#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-08 08:43:09,401 INFO L290 TraceCheckUtils]: 74: Hoare triple {13190#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-08 08:43:09,401 INFO L290 TraceCheckUtils]: 75: Hoare triple {13190#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-08 08:43:09,401 INFO L290 TraceCheckUtils]: 76: Hoare triple {13190#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-08 08:43:09,401 INFO L290 TraceCheckUtils]: 77: Hoare triple {13190#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-08 08:43:09,401 INFO L290 TraceCheckUtils]: 78: Hoare triple {13190#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-08 08:43:09,401 INFO L290 TraceCheckUtils]: 79: Hoare triple {13190#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-08 08:43:09,401 INFO L290 TraceCheckUtils]: 80: Hoare triple {13190#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-08 08:43:09,401 INFO L290 TraceCheckUtils]: 81: Hoare triple {13190#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-08 08:43:09,401 INFO L290 TraceCheckUtils]: 82: Hoare triple {13190#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-08 08:43:09,401 INFO L290 TraceCheckUtils]: 83: Hoare triple {13190#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-08 08:43:09,401 INFO L290 TraceCheckUtils]: 84: Hoare triple {13190#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-08 08:43:09,401 INFO L290 TraceCheckUtils]: 85: Hoare triple {13190#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-08 08:43:09,401 INFO L290 TraceCheckUtils]: 86: Hoare triple {13190#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {13190#false} is VALID [2022-04-08 08:43:09,402 INFO L290 TraceCheckUtils]: 87: Hoare triple {13190#false} assume 8640 == #t~mem75;havoc #t~mem75; {13190#false} is VALID [2022-04-08 08:43:09,402 INFO L290 TraceCheckUtils]: 88: Hoare triple {13190#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {13190#false} is VALID [2022-04-08 08:43:09,402 INFO L290 TraceCheckUtils]: 89: Hoare triple {13190#false} assume !(4 == ~blastFlag~0); {13190#false} is VALID [2022-04-08 08:43:09,402 INFO L290 TraceCheckUtils]: 90: Hoare triple {13190#false} assume 7 == ~blastFlag~0; {13190#false} is VALID [2022-04-08 08:43:09,402 INFO L290 TraceCheckUtils]: 91: Hoare triple {13190#false} assume !false; {13190#false} is VALID [2022-04-08 08:43:09,402 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-08 08:43:09,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:43:09,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665003095] [2022-04-08 08:43:09,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665003095] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:43:09,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:43:09,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:43:09,405 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:43:09,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [70207592] [2022-04-08 08:43:09,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [70207592] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:43:09,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:43:09,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:43:09,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949194435] [2022-04-08 08:43:09,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:43:09,406 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 92 [2022-04-08 08:43:09,406 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:43:09,407 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:43:09,452 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:43:09,452 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:43:09,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:43:09,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:43:09,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:43:09,453 INFO L87 Difference]: Start difference. First operand 445 states and 722 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:43:13,295 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:43:16,737 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:43:17,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:17,777 INFO L93 Difference]: Finished difference Result 689 states and 1114 transitions. [2022-04-08 08:43:17,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:43:17,777 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 92 [2022-04-08 08:43:17,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:43:17,777 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:43:17,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 439 transitions. [2022-04-08 08:43:17,780 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:43:17,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 439 transitions. [2022-04-08 08:43:17,781 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 439 transitions. [2022-04-08 08:43:18,065 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:43:18,074 INFO L225 Difference]: With dead ends: 689 [2022-04-08 08:43:18,075 INFO L226 Difference]: Without dead ends: 461 [2022-04-08 08:43:18,075 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:43:18,076 INFO L913 BasicCegarLoop]: 184 mSDtfsCounter, 25 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-04-08 08:43:18,076 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 473 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 357 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2022-04-08 08:43:18,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2022-04-08 08:43:18,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 445. [2022-04-08 08:43:18,089 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:43:18,089 INFO L82 GeneralOperation]: Start isEquivalent. First operand 461 states. Second operand has 445 states, 440 states have (on average 1.6295454545454546) internal successors, (717), 440 states have internal predecessors, (717), 3 states have call successors, (3), 3 states have 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:43:18,090 INFO L74 IsIncluded]: Start isIncluded. First operand 461 states. Second operand has 445 states, 440 states have (on average 1.6295454545454546) internal successors, (717), 440 states have internal predecessors, (717), 3 states have call successors, (3), 3 states have 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:43:18,091 INFO L87 Difference]: Start difference. First operand 461 states. Second operand has 445 states, 440 states have (on average 1.6295454545454546) internal successors, (717), 440 states have internal predecessors, (717), 3 states have call successors, (3), 3 states have 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:43:18,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:18,100 INFO L93 Difference]: Finished difference Result 461 states and 740 transitions. [2022-04-08 08:43:18,100 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 740 transitions. [2022-04-08 08:43:18,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:43:18,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:43:18,102 INFO L74 IsIncluded]: Start isIncluded. First operand has 445 states, 440 states have (on average 1.6295454545454546) internal successors, (717), 440 states have internal predecessors, (717), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 461 states. [2022-04-08 08:43:18,102 INFO L87 Difference]: Start difference. First operand has 445 states, 440 states have (on average 1.6295454545454546) internal successors, (717), 440 states have internal predecessors, (717), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 461 states. [2022-04-08 08:43:18,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:18,112 INFO L93 Difference]: Finished difference Result 461 states and 740 transitions. [2022-04-08 08:43:18,112 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 740 transitions. [2022-04-08 08:43:18,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:43:18,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:43:18,113 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:43:18,113 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:43:18,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 440 states have (on average 1.6295454545454546) internal successors, (717), 440 states have internal predecessors, (717), 3 states have call successors, (3), 3 states have 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:43:18,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 721 transitions. [2022-04-08 08:43:18,124 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 721 transitions. Word has length 92 [2022-04-08 08:43:18,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:43:18,124 INFO L478 AbstractCegarLoop]: Abstraction has 445 states and 721 transitions. [2022-04-08 08:43:18,124 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:43:18,124 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 445 states and 721 transitions. [2022-04-08 08:43:18,644 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 721 edges. 721 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:43:18,644 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 721 transitions. [2022-04-08 08:43:18,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-04-08 08:43:18,645 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:43:18,646 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:43:18,646 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-08 08:43:18,646 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:43:18,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:43:18,646 INFO L85 PathProgramCache]: Analyzing trace with hash -304912275, now seen corresponding path program 1 times [2022-04-08 08:43:18,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:43:18,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [250605621] [2022-04-08 08:43:18,687 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:43:18,687 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:43:18,687 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:43:18,687 INFO L85 PathProgramCache]: Analyzing trace with hash -304912275, now seen corresponding path program 2 times [2022-04-08 08:43:18,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:43:18,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091355919] [2022-04-08 08:43:18,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:43:18,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:43:18,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:43:18,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:43:18,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:43:18,790 INFO L290 TraceCheckUtils]: 0: Hoare triple {16398#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {16391#true} is VALID [2022-04-08 08:43:18,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {16391#true} assume true; {16391#true} is VALID [2022-04-08 08:43:18,791 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16391#true} {16391#true} #678#return; {16391#true} is VALID [2022-04-08 08:43:18,791 INFO L272 TraceCheckUtils]: 0: Hoare triple {16391#true} call ULTIMATE.init(); {16398#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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:43:18,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {16398#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {16391#true} is VALID [2022-04-08 08:43:18,792 INFO L290 TraceCheckUtils]: 2: Hoare triple {16391#true} assume true; {16391#true} is VALID [2022-04-08 08:43:18,792 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16391#true} {16391#true} #678#return; {16391#true} is VALID [2022-04-08 08:43:18,792 INFO L272 TraceCheckUtils]: 4: Hoare triple {16391#true} call #t~ret161 := main(); {16391#true} is VALID [2022-04-08 08:43:18,792 INFO L290 TraceCheckUtils]: 5: Hoare triple {16391#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {16391#true} is VALID [2022-04-08 08:43:18,792 INFO L290 TraceCheckUtils]: 6: Hoare triple {16391#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {16391#true} is VALID [2022-04-08 08:43:18,792 INFO L272 TraceCheckUtils]: 7: Hoare triple {16391#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {16391#true} is VALID [2022-04-08 08:43:18,794 INFO L290 TraceCheckUtils]: 8: Hoare triple {16391#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {16396#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:43:18,794 INFO L290 TraceCheckUtils]: 9: Hoare triple {16396#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {16396#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:43:18,795 INFO L290 TraceCheckUtils]: 10: Hoare triple {16396#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {16396#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:43:18,795 INFO L290 TraceCheckUtils]: 11: Hoare triple {16396#(= 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)))); {16396#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:43:18,796 INFO L290 TraceCheckUtils]: 12: Hoare triple {16396#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {16396#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:43:18,796 INFO L290 TraceCheckUtils]: 13: Hoare triple {16396#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {16396#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:43:18,796 INFO L290 TraceCheckUtils]: 14: Hoare triple {16396#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {16396#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:43:18,797 INFO L290 TraceCheckUtils]: 15: Hoare triple {16396#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {16396#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:43:18,797 INFO L290 TraceCheckUtils]: 16: Hoare triple {16396#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {16396#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:43:18,797 INFO L290 TraceCheckUtils]: 17: Hoare triple {16396#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {16397#(= 8464 |ssl3_accept_#t~mem49|)} is VALID [2022-04-08 08:43:18,798 INFO L290 TraceCheckUtils]: 18: Hoare triple {16397#(= 8464 |ssl3_accept_#t~mem49|)} assume 8192 == #t~mem49;havoc #t~mem49; {16392#false} is VALID [2022-04-08 08:43:18,798 INFO L290 TraceCheckUtils]: 19: Hoare triple {16392#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {16392#false} is VALID [2022-04-08 08:43:18,798 INFO L290 TraceCheckUtils]: 20: Hoare triple {16392#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {16392#false} is VALID [2022-04-08 08:43:18,798 INFO L290 TraceCheckUtils]: 21: Hoare triple {16392#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {16392#false} is VALID [2022-04-08 08:43:18,798 INFO L290 TraceCheckUtils]: 22: Hoare triple {16392#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {16392#false} is VALID [2022-04-08 08:43:18,798 INFO L290 TraceCheckUtils]: 23: Hoare triple {16392#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {16392#false} is VALID [2022-04-08 08:43:18,799 INFO L290 TraceCheckUtils]: 24: Hoare triple {16392#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-08 08:43:18,799 INFO L290 TraceCheckUtils]: 25: Hoare triple {16392#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem89 := read~int(#t~mem88.base, 76 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 76 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-08 08:43:18,799 INFO L290 TraceCheckUtils]: 26: Hoare triple {16392#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {16392#false} is VALID [2022-04-08 08:43:18,799 INFO L290 TraceCheckUtils]: 27: Hoare triple {16392#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {16392#false} is VALID [2022-04-08 08:43:18,799 INFO L290 TraceCheckUtils]: 28: Hoare triple {16392#false} ~skip~0 := 0; {16392#false} is VALID [2022-04-08 08:43:18,799 INFO L290 TraceCheckUtils]: 29: Hoare triple {16392#false} assume !false; {16392#false} is VALID [2022-04-08 08:43:18,799 INFO L290 TraceCheckUtils]: 30: Hoare triple {16392#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-08 08:43:18,799 INFO L290 TraceCheckUtils]: 31: Hoare triple {16392#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-08 08:43:18,799 INFO L290 TraceCheckUtils]: 32: Hoare triple {16392#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-08 08:43:18,799 INFO L290 TraceCheckUtils]: 33: Hoare triple {16392#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-08 08:43:18,799 INFO L290 TraceCheckUtils]: 34: Hoare triple {16392#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-08 08:43:18,800 INFO L290 TraceCheckUtils]: 35: Hoare triple {16392#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-08 08:43:18,800 INFO L290 TraceCheckUtils]: 36: Hoare triple {16392#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-08 08:43:18,800 INFO L290 TraceCheckUtils]: 37: Hoare triple {16392#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-08 08:43:18,800 INFO L290 TraceCheckUtils]: 38: Hoare triple {16392#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-08 08:43:18,800 INFO L290 TraceCheckUtils]: 39: Hoare triple {16392#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-08 08:43:18,800 INFO L290 TraceCheckUtils]: 40: Hoare triple {16392#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-08 08:43:18,800 INFO L290 TraceCheckUtils]: 41: Hoare triple {16392#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-08 08:43:18,800 INFO L290 TraceCheckUtils]: 42: Hoare triple {16392#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-08 08:43:18,800 INFO L290 TraceCheckUtils]: 43: Hoare triple {16392#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-08 08:43:18,800 INFO L290 TraceCheckUtils]: 44: Hoare triple {16392#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-08 08:43:18,800 INFO L290 TraceCheckUtils]: 45: Hoare triple {16392#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-08 08:43:18,800 INFO L290 TraceCheckUtils]: 46: Hoare triple {16392#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-08 08:43:18,800 INFO L290 TraceCheckUtils]: 47: Hoare triple {16392#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-08 08:43:18,800 INFO L290 TraceCheckUtils]: 48: Hoare triple {16392#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-08 08:43:18,801 INFO L290 TraceCheckUtils]: 49: Hoare triple {16392#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-08 08:43:18,801 INFO L290 TraceCheckUtils]: 50: Hoare triple {16392#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-08 08:43:18,801 INFO L290 TraceCheckUtils]: 51: Hoare triple {16392#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-08 08:43:18,801 INFO L290 TraceCheckUtils]: 52: Hoare triple {16392#false} assume 8448 == #t~mem68;havoc #t~mem68; {16392#false} is VALID [2022-04-08 08:43:18,801 INFO L290 TraceCheckUtils]: 53: Hoare triple {16392#false} assume !(~num1~0 > 0); {16392#false} is VALID [2022-04-08 08:43:18,801 INFO L290 TraceCheckUtils]: 54: Hoare triple {16392#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {16392#false} is VALID [2022-04-08 08:43:18,801 INFO L290 TraceCheckUtils]: 55: Hoare triple {16392#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {16392#false} is VALID [2022-04-08 08:43:18,801 INFO L290 TraceCheckUtils]: 56: Hoare triple {16392#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {16392#false} is VALID [2022-04-08 08:43:18,801 INFO L290 TraceCheckUtils]: 57: Hoare triple {16392#false} ~skip~0 := 0; {16392#false} is VALID [2022-04-08 08:43:18,801 INFO L290 TraceCheckUtils]: 58: Hoare triple {16392#false} assume !false; {16392#false} is VALID [2022-04-08 08:43:18,801 INFO L290 TraceCheckUtils]: 59: Hoare triple {16392#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-08 08:43:18,801 INFO L290 TraceCheckUtils]: 60: Hoare triple {16392#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-08 08:43:18,801 INFO L290 TraceCheckUtils]: 61: Hoare triple {16392#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-08 08:43:18,802 INFO L290 TraceCheckUtils]: 62: Hoare triple {16392#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-08 08:43:18,802 INFO L290 TraceCheckUtils]: 63: Hoare triple {16392#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-08 08:43:18,802 INFO L290 TraceCheckUtils]: 64: Hoare triple {16392#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-08 08:43:18,802 INFO L290 TraceCheckUtils]: 65: Hoare triple {16392#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-08 08:43:18,802 INFO L290 TraceCheckUtils]: 66: Hoare triple {16392#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-08 08:43:18,802 INFO L290 TraceCheckUtils]: 67: Hoare triple {16392#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-08 08:43:18,802 INFO L290 TraceCheckUtils]: 68: Hoare triple {16392#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-08 08:43:18,802 INFO L290 TraceCheckUtils]: 69: Hoare triple {16392#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-08 08:43:18,802 INFO L290 TraceCheckUtils]: 70: Hoare triple {16392#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-08 08:43:18,802 INFO L290 TraceCheckUtils]: 71: Hoare triple {16392#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-08 08:43:18,802 INFO L290 TraceCheckUtils]: 72: Hoare triple {16392#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-08 08:43:18,802 INFO L290 TraceCheckUtils]: 73: Hoare triple {16392#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-08 08:43:18,802 INFO L290 TraceCheckUtils]: 74: Hoare triple {16392#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-08 08:43:18,802 INFO L290 TraceCheckUtils]: 75: Hoare triple {16392#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-08 08:43:18,803 INFO L290 TraceCheckUtils]: 76: Hoare triple {16392#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-08 08:43:18,803 INFO L290 TraceCheckUtils]: 77: Hoare triple {16392#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-08 08:43:18,803 INFO L290 TraceCheckUtils]: 78: Hoare triple {16392#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-08 08:43:18,803 INFO L290 TraceCheckUtils]: 79: Hoare triple {16392#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-08 08:43:18,803 INFO L290 TraceCheckUtils]: 80: Hoare triple {16392#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-08 08:43:18,803 INFO L290 TraceCheckUtils]: 81: Hoare triple {16392#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-08 08:43:18,803 INFO L290 TraceCheckUtils]: 82: Hoare triple {16392#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-08 08:43:18,803 INFO L290 TraceCheckUtils]: 83: Hoare triple {16392#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-08 08:43:18,803 INFO L290 TraceCheckUtils]: 84: Hoare triple {16392#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-08 08:43:18,803 INFO L290 TraceCheckUtils]: 85: Hoare triple {16392#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-08 08:43:18,803 INFO L290 TraceCheckUtils]: 86: Hoare triple {16392#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-08 08:43:18,803 INFO L290 TraceCheckUtils]: 87: Hoare triple {16392#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {16392#false} is VALID [2022-04-08 08:43:18,803 INFO L290 TraceCheckUtils]: 88: Hoare triple {16392#false} assume 8640 == #t~mem75;havoc #t~mem75; {16392#false} is VALID [2022-04-08 08:43:18,803 INFO L290 TraceCheckUtils]: 89: Hoare triple {16392#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {16392#false} is VALID [2022-04-08 08:43:18,804 INFO L290 TraceCheckUtils]: 90: Hoare triple {16392#false} assume !(4 == ~blastFlag~0); {16392#false} is VALID [2022-04-08 08:43:18,804 INFO L290 TraceCheckUtils]: 91: Hoare triple {16392#false} assume 7 == ~blastFlag~0; {16392#false} is VALID [2022-04-08 08:43:18,804 INFO L290 TraceCheckUtils]: 92: Hoare triple {16392#false} assume !false; {16392#false} is VALID [2022-04-08 08:43:18,804 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-08 08:43:18,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:43:18,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091355919] [2022-04-08 08:43:18,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091355919] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:43:18,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:43:18,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:43:18,805 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:43:18,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [250605621] [2022-04-08 08:43:18,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [250605621] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:43:18,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:43:18,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:43:18,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778051859] [2022-04-08 08:43:18,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:43:18,805 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 93 [2022-04-08 08:43:18,805 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:43:18,806 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:43:18,855 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:43:18,855 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:43:18,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:43:18,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:43:18,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:43:18,856 INFO L87 Difference]: Start difference. First operand 445 states and 721 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:43:22,799 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:43:27,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:27,490 INFO L93 Difference]: Finished difference Result 682 states and 1104 transitions. [2022-04-08 08:43:27,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:43:27,490 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 93 [2022-04-08 08:43:27,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:43:27,491 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:43:27,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 438 transitions. [2022-04-08 08:43:27,493 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:43:27,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 438 transitions. [2022-04-08 08:43:27,497 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 438 transitions. [2022-04-08 08:43:27,779 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 438 edges. 438 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:43:27,790 INFO L225 Difference]: With dead ends: 682 [2022-04-08 08:43:27,790 INFO L226 Difference]: Without dead ends: 461 [2022-04-08 08:43:27,791 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:43:27,791 INFO L913 BasicCegarLoop]: 184 mSDtfsCounter, 23 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-04-08 08:43:27,791 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 473 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-04-08 08:43:27,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2022-04-08 08:43:27,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 445. [2022-04-08 08:43:27,805 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:43:27,806 INFO L82 GeneralOperation]: Start isEquivalent. First operand 461 states. Second operand has 445 states, 440 states have (on average 1.6272727272727272) internal successors, (716), 440 states have internal predecessors, (716), 3 states have call successors, (3), 3 states have 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:43:27,807 INFO L74 IsIncluded]: Start isIncluded. First operand 461 states. Second operand has 445 states, 440 states have (on average 1.6272727272727272) internal successors, (716), 440 states have internal predecessors, (716), 3 states have call successors, (3), 3 states have 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:43:27,808 INFO L87 Difference]: Start difference. First operand 461 states. Second operand has 445 states, 440 states have (on average 1.6272727272727272) internal successors, (716), 440 states have internal predecessors, (716), 3 states have call successors, (3), 3 states have 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:43:27,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:27,816 INFO L93 Difference]: Finished difference Result 461 states and 739 transitions. [2022-04-08 08:43:27,816 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 739 transitions. [2022-04-08 08:43:27,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:43:27,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:43:27,818 INFO L74 IsIncluded]: Start isIncluded. First operand has 445 states, 440 states have (on average 1.6272727272727272) internal successors, (716), 440 states have internal predecessors, (716), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 461 states. [2022-04-08 08:43:27,819 INFO L87 Difference]: Start difference. First operand has 445 states, 440 states have (on average 1.6272727272727272) internal successors, (716), 440 states have internal predecessors, (716), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 461 states. [2022-04-08 08:43:27,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:27,828 INFO L93 Difference]: Finished difference Result 461 states and 739 transitions. [2022-04-08 08:43:27,828 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 739 transitions. [2022-04-08 08:43:27,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:43:27,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:43:27,829 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:43:27,829 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:43:27,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 440 states have (on average 1.6272727272727272) internal successors, (716), 440 states have internal predecessors, (716), 3 states have call successors, (3), 3 states have 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:43:27,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 720 transitions. [2022-04-08 08:43:27,839 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 720 transitions. Word has length 93 [2022-04-08 08:43:27,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:43:27,839 INFO L478 AbstractCegarLoop]: Abstraction has 445 states and 720 transitions. [2022-04-08 08:43:27,839 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:43:27,839 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 445 states and 720 transitions. [2022-04-08 08:43:28,359 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 720 edges. 720 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:43:28,359 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 720 transitions. [2022-04-08 08:43:28,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-04-08 08:43:28,360 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:43:28,360 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:43:28,361 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-08 08:43:28,361 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:43:28,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:43:28,361 INFO L85 PathProgramCache]: Analyzing trace with hash 756487789, now seen corresponding path program 1 times [2022-04-08 08:43:28,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:43:28,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [431172381] [2022-04-08 08:43:28,540 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:43:28,540 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:43:28,541 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:43:28,541 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 08:43:28,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1254691877, now seen corresponding path program 1 times [2022-04-08 08:43:28,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:43:28,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436011682] [2022-04-08 08:43:28,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:43:28,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:43:28,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:43:28,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:43:28,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:43:28,666 INFO L290 TraceCheckUtils]: 0: Hoare triple {19585#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {19579#true} is VALID [2022-04-08 08:43:28,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {19579#true} assume true; {19579#true} is VALID [2022-04-08 08:43:28,666 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19579#true} {19579#true} #678#return; {19579#true} is VALID [2022-04-08 08:43:28,667 INFO L272 TraceCheckUtils]: 0: Hoare triple {19579#true} call ULTIMATE.init(); {19585#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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:43:28,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {19585#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {19579#true} is VALID [2022-04-08 08:43:28,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {19579#true} assume true; {19579#true} is VALID [2022-04-08 08:43:28,667 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19579#true} {19579#true} #678#return; {19579#true} is VALID [2022-04-08 08:43:28,667 INFO L272 TraceCheckUtils]: 4: Hoare triple {19579#true} call #t~ret161 := main(); {19579#true} is VALID [2022-04-08 08:43:28,667 INFO L290 TraceCheckUtils]: 5: Hoare triple {19579#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {19579#true} is VALID [2022-04-08 08:43:28,667 INFO L290 TraceCheckUtils]: 6: Hoare triple {19579#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {19579#true} is VALID [2022-04-08 08:43:28,667 INFO L272 TraceCheckUtils]: 7: Hoare triple {19579#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {19579#true} is VALID [2022-04-08 08:43:28,668 INFO L290 TraceCheckUtils]: 8: Hoare triple {19579#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {19584#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:28,668 INFO L290 TraceCheckUtils]: 9: Hoare triple {19584#(= ssl3_accept_~blastFlag~0 0)} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {19584#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:28,668 INFO L290 TraceCheckUtils]: 10: Hoare triple {19584#(= ssl3_accept_~blastFlag~0 0)} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {19584#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:28,668 INFO L290 TraceCheckUtils]: 11: Hoare triple {19584#(= 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)))); {19584#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:28,669 INFO L290 TraceCheckUtils]: 12: Hoare triple {19584#(= ssl3_accept_~blastFlag~0 0)} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {19584#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:28,669 INFO L290 TraceCheckUtils]: 13: Hoare triple {19584#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {19584#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:28,669 INFO L290 TraceCheckUtils]: 14: Hoare triple {19584#(= ssl3_accept_~blastFlag~0 0)} [688] L1167-2-->L1168_primed: Formula: true InVars {} OutVars{ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_18|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_320|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_18|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_18|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_31|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_29|, ssl3_accept_#t~mem50=|v_ssl3_accept_#t~mem50_20|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_10|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_18|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_22|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_30|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_29|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_32|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_17|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_27, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_10|, #memory_int=|v_#memory_int_316|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_10|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_320|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_19} AuxVars[] AssignedVars[ssl3_accept_#t~mem83.base, #memory_$Pointer$.base, ssl3_accept_#t~mem82, ssl3_accept_#t~mem85, ssl3_accept_#t~mem151, ssl3_accept_#t~mem150.base, ssl3_accept_#t~mem50, ssl3_accept_#t~mem88.base, ssl3_accept_#t~mem83.offset, ssl3_accept_#t~mem49, ssl3_accept_#t~mem48, ssl3_accept_#t~mem150.offset, ssl3_accept_#t~mem47, ssl3_accept_#t~mem46, ssl3_accept_~skip~0, ssl3_accept_#t~mem88.offset, #memory_int, ssl3_accept_#t~mem89, #memory_$Pointer$.offset, ssl3_accept_~state~0] {19584#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:28,669 INFO L290 TraceCheckUtils]: 15: Hoare triple {19584#(= ssl3_accept_~blastFlag~0 0)} [689] L1168_primed-->L1167-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19584#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:28,670 INFO L290 TraceCheckUtils]: 16: Hoare triple {19584#(= ssl3_accept_~blastFlag~0 0)} [690] L1167-2-->L1168_primed: Formula: (or (and (= |v_#memory_$Pointer$.base_327| |v_#memory_$Pointer$.base_326|) (= |v_#memory_$Pointer$.offset_327| |v_#memory_$Pointer$.offset_326|) (= v_ssl3_accept_~s.base_114 v_ssl3_accept_~s.base_114) (= |v_#memory_int_322| |v_#memory_int_321|) (= v_ssl3_accept_~s.offset_114 v_ssl3_accept_~s.offset_114) (= v_ssl3_accept_~num1~0_13 v_ssl3_accept_~num1~0_13)) (let ((.cse1 (select |v_#memory_int_322| v_ssl3_accept_~s.base_114)) (.cse2 (+ 52 v_ssl3_accept_~s.offset_114))) (let ((.cse5 (select |v_#memory_$Pointer$.offset_327| v_ssl3_accept_~s.base_114)) (.cse3 (select |v_#memory_$Pointer$.base_327| v_ssl3_accept_~s.base_114)) (.cse7 (select |v_#memory_$Pointer$.base_326| v_ssl3_accept_~s.base_114)) (.cse6 (select |v_#memory_$Pointer$.offset_326| v_ssl3_accept_~s.base_114)) (.cse4 (+ 84 v_ssl3_accept_~s.offset_114)) (.cse0 (select .cse1 .cse2))) (and (not (= .cse0 8496)) (not (= 8497 .cse0)) (= |v_#memory_int_321| (store |v_#memory_int_322| v_ssl3_accept_~s.base_114 (store .cse1 .cse2 (select (select |v_#memory_int_322| (select .cse3 .cse4)) (+ (select .cse5 .cse4) 844))))) (not (= .cse0 8195)) (not (= .cse0 8545)) (not (= 8466 .cse0)) (not (= .cse0 8481)) (= v_ssl3_accept_~skip~0_28 0) (not (= .cse0 24576)) (not (= .cse0 8544)) (not (= .cse0 8512)) (not (= 12292 .cse0)) (not (= .cse0 8480)) (not (= .cse0 8465)) (= |v_#memory_$Pointer$.offset_326| (store |v_#memory_$Pointer$.offset_327| v_ssl3_accept_~s.base_114 (store .cse5 .cse2 (select .cse6 .cse2)))) (not (= .cse0 8528)) (= (store |v_#memory_$Pointer$.base_327| v_ssl3_accept_~s.base_114 (store .cse3 .cse2 (select .cse7 .cse2))) |v_#memory_$Pointer$.base_326|) (not (< 0 v_ssl3_accept_~num1~0_13)) (not (= .cse0 8529)) (= 8448 .cse0) (not (= .cse0 8464)) (not (= 8513 .cse0)) (= .cse0 v_ssl3_accept_~state~0_20) (not (= (select (select |v_#memory_int_321| (select .cse7 .cse4)) (+ (select .cse6 .cse4) 848)) 0)) (not (= 8192 .cse0)) (not (= .cse0 16384)) (not (= 8560 .cse0)) (not (= .cse0 8482)) (not (= .cse0 8561)))))) InVars {ssl3_accept_~s.offset=v_ssl3_accept_~s.offset_114, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_327|, ssl3_accept_~num1~0=v_ssl3_accept_~num1~0_13, #memory_int=|v_#memory_int_322|, ssl3_accept_~s.base=v_ssl3_accept_~s.base_114, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_327|} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_326|, ssl3_accept_~num1~0=v_ssl3_accept_~num1~0_13, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_33|, ssl3_accept_#t~mem52=|v_ssl3_accept_#t~mem52_20|, ssl3_accept_#t~mem51=|v_ssl3_accept_#t~mem51_20|, ssl3_accept_#t~mem50=|v_ssl3_accept_#t~mem50_22|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_31|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_28, ssl3_accept_#t~mem53=|v_ssl3_accept_#t~mem53_18|, ssl3_accept_#t~mem54=|v_ssl3_accept_#t~mem54_18|, ssl3_accept_#t~mem55=|v_ssl3_accept_#t~mem55_18|, ssl3_accept_#t~mem133=|v_ssl3_accept_#t~mem133_9|, ssl3_accept_#t~mem56=|v_ssl3_accept_#t~mem56_18|, ssl3_accept_#t~mem57=|v_ssl3_accept_#t~mem57_18|, ssl3_accept_#t~mem132.offset=|v_ssl3_accept_#t~mem132.offset_9|, ssl3_accept_#t~mem58=|v_ssl3_accept_#t~mem58_18|, ssl3_accept_#t~mem59=|v_ssl3_accept_#t~mem59_18|, ssl3_accept_~s.offset=v_ssl3_accept_~s.offset_114, ssl3_accept_#t~mem60=|v_ssl3_accept_#t~mem60_18|, ssl3_accept_#t~mem61=|v_ssl3_accept_#t~mem61_18|, ssl3_accept_#t~mem62=|v_ssl3_accept_#t~mem62_18|, ssl3_accept_#t~mem132.base=|v_ssl3_accept_#t~mem132.base_9|, ssl3_accept_#t~mem63=|v_ssl3_accept_#t~mem63_18|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_31|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_24|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_32|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_34|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_18|, #memory_int=|v_#memory_int_321|, ssl3_accept_#t~mem64=|v_ssl3_accept_#t~mem64_18|, ssl3_accept_#t~mem65=|v_ssl3_accept_#t~mem65_18|, ssl3_accept_#t~mem66=|v_ssl3_accept_#t~mem66_18|, ssl3_accept_#t~mem67=|v_ssl3_accept_#t~mem67_18|, ssl3_accept_#t~mem68=|v_ssl3_accept_#t~mem68_18|, ssl3_accept_~s.base=v_ssl3_accept_~s.base_114, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_326|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_20} AuxVars[] AssignedVars[#memory_$Pointer$.base, ssl3_accept_#t~mem151, ssl3_accept_#t~mem52, ssl3_accept_#t~mem51, ssl3_accept_#t~mem50, ssl3_accept_#t~mem150.offset, ssl3_accept_~skip~0, ssl3_accept_#t~mem53, ssl3_accept_#t~mem54, ssl3_accept_#t~mem55, ssl3_accept_#t~mem133, ssl3_accept_#t~mem56, ssl3_accept_#t~mem57, ssl3_accept_#t~mem132.offset, ssl3_accept_#t~mem58, ssl3_accept_#t~mem59, ssl3_accept_#t~mem60, ssl3_accept_#t~mem61, ssl3_accept_#t~mem62, ssl3_accept_#t~mem132.base, ssl3_accept_#t~mem63, ssl3_accept_#t~mem150.base, ssl3_accept_#t~mem49, ssl3_accept_#t~mem48, ssl3_accept_#t~mem47, ssl3_accept_#t~mem46, #memory_int, ssl3_accept_#t~mem64, ssl3_accept_#t~mem65, ssl3_accept_#t~mem66, ssl3_accept_#t~mem67, ssl3_accept_#t~mem68, #memory_$Pointer$.offset, ssl3_accept_~state~0] {19584#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:28,670 INFO L290 TraceCheckUtils]: 17: Hoare triple {19584#(= ssl3_accept_~blastFlag~0 0)} [687] L1168_primed-->L1168: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19584#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:28,671 INFO L290 TraceCheckUtils]: 18: Hoare triple {19584#(= ssl3_accept_~blastFlag~0 0)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {19584#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:28,671 INFO L290 TraceCheckUtils]: 19: Hoare triple {19584#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {19584#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:28,671 INFO L290 TraceCheckUtils]: 20: Hoare triple {19584#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {19584#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:28,671 INFO L290 TraceCheckUtils]: 21: Hoare triple {19584#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {19584#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:28,672 INFO L290 TraceCheckUtils]: 22: Hoare triple {19584#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {19584#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:28,672 INFO L290 TraceCheckUtils]: 23: Hoare triple {19584#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {19584#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:28,672 INFO L290 TraceCheckUtils]: 24: Hoare triple {19584#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {19584#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:28,672 INFO L290 TraceCheckUtils]: 25: Hoare triple {19584#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {19584#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:28,673 INFO L290 TraceCheckUtils]: 26: Hoare triple {19584#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {19584#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:28,673 INFO L290 TraceCheckUtils]: 27: Hoare triple {19584#(= ssl3_accept_~blastFlag~0 0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {19584#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:28,673 INFO L290 TraceCheckUtils]: 28: Hoare triple {19584#(= ssl3_accept_~blastFlag~0 0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {19584#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:28,673 INFO L290 TraceCheckUtils]: 29: Hoare triple {19584#(= ssl3_accept_~blastFlag~0 0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {19584#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:28,673 INFO L290 TraceCheckUtils]: 30: Hoare triple {19584#(= ssl3_accept_~blastFlag~0 0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {19584#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:28,674 INFO L290 TraceCheckUtils]: 31: Hoare triple {19584#(= ssl3_accept_~blastFlag~0 0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {19584#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:28,674 INFO L290 TraceCheckUtils]: 32: Hoare triple {19584#(= ssl3_accept_~blastFlag~0 0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {19584#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:28,674 INFO L290 TraceCheckUtils]: 33: Hoare triple {19584#(= ssl3_accept_~blastFlag~0 0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {19584#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:28,674 INFO L290 TraceCheckUtils]: 34: Hoare triple {19584#(= ssl3_accept_~blastFlag~0 0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {19584#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:28,675 INFO L290 TraceCheckUtils]: 35: Hoare triple {19584#(= ssl3_accept_~blastFlag~0 0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {19584#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:28,675 INFO L290 TraceCheckUtils]: 36: Hoare triple {19584#(= ssl3_accept_~blastFlag~0 0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {19584#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:28,675 INFO L290 TraceCheckUtils]: 37: Hoare triple {19584#(= ssl3_accept_~blastFlag~0 0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {19584#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:28,675 INFO L290 TraceCheckUtils]: 38: Hoare triple {19584#(= ssl3_accept_~blastFlag~0 0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {19584#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:28,676 INFO L290 TraceCheckUtils]: 39: Hoare triple {19584#(= ssl3_accept_~blastFlag~0 0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {19584#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:28,676 INFO L290 TraceCheckUtils]: 40: Hoare triple {19584#(= ssl3_accept_~blastFlag~0 0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {19584#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:28,676 INFO L290 TraceCheckUtils]: 41: Hoare triple {19584#(= ssl3_accept_~blastFlag~0 0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {19584#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:28,676 INFO L290 TraceCheckUtils]: 42: Hoare triple {19584#(= ssl3_accept_~blastFlag~0 0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {19584#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:28,677 INFO L290 TraceCheckUtils]: 43: Hoare triple {19584#(= ssl3_accept_~blastFlag~0 0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {19584#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:28,677 INFO L290 TraceCheckUtils]: 44: Hoare triple {19584#(= ssl3_accept_~blastFlag~0 0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {19584#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:28,677 INFO L290 TraceCheckUtils]: 45: Hoare triple {19584#(= ssl3_accept_~blastFlag~0 0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {19584#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:28,677 INFO L290 TraceCheckUtils]: 46: Hoare triple {19584#(= ssl3_accept_~blastFlag~0 0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {19584#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:28,677 INFO L290 TraceCheckUtils]: 47: Hoare triple {19584#(= ssl3_accept_~blastFlag~0 0)} assume 8640 == #t~mem75;havoc #t~mem75; {19584#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:28,678 INFO L290 TraceCheckUtils]: 48: Hoare triple {19584#(= ssl3_accept_~blastFlag~0 0)} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {19584#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:28,678 INFO L290 TraceCheckUtils]: 49: Hoare triple {19584#(= ssl3_accept_~blastFlag~0 0)} assume !(4 == ~blastFlag~0); {19584#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:28,678 INFO L290 TraceCheckUtils]: 50: Hoare triple {19584#(= ssl3_accept_~blastFlag~0 0)} assume 7 == ~blastFlag~0; {19580#false} is VALID [2022-04-08 08:43:28,678 INFO L290 TraceCheckUtils]: 51: Hoare triple {19580#false} assume !false; {19580#false} is VALID [2022-04-08 08:43:28,679 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 08:43:28,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:43:28,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436011682] [2022-04-08 08:43:28,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436011682] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:43:28,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:43:28,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:43:31,805 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:43:31,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [431172381] [2022-04-08 08:43:31,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [431172381] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:43:31,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:43:31,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 08:43:31,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871665210] [2022-04-08 08:43:31,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:43:31,805 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.8) internal successors, (87), 14 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 94 [2022-04-08 08:43:31,806 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:43:31,807 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 5.8) internal successors, (87), 14 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:31,882 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:43:31,882 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 08:43:31,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:43:31,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 08:43:31,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=155, Unknown=1, NotChecked=0, Total=210 [2022-04-08 08:43:31,883 INFO L87 Difference]: Start difference. First operand 445 states and 720 transitions. Second operand has 15 states, 15 states have (on average 5.8) internal successors, (87), 14 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:34,111 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:43:36,555 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:43:38,613 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:43:39,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:39,902 INFO L93 Difference]: Finished difference Result 678 states and 1099 transitions. [2022-04-08 08:43:39,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 08:43:39,902 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.8) internal successors, (87), 14 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 94 [2022-04-08 08:43:39,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:43:39,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.8) internal successors, (87), 14 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:39,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 433 transitions. [2022-04-08 08:43:39,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.8) internal successors, (87), 14 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:39,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 433 transitions. [2022-04-08 08:43:39,905 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 433 transitions. [2022-04-08 08:43:40,201 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 433 edges. 433 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:43:40,210 INFO L225 Difference]: With dead ends: 678 [2022-04-08 08:43:40,210 INFO L226 Difference]: Without dead ends: 457 [2022-04-08 08:43:40,211 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=54, Invalid=155, Unknown=1, NotChecked=0, Total=210 [2022-04-08 08:43:40,211 INFO L913 BasicCegarLoop]: 196 mSDtfsCounter, 10 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 148 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:43:40,211 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 664 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 469 Invalid, 0 Unknown, 148 Unchecked, 5.0s Time] [2022-04-08 08:43:40,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2022-04-08 08:43:40,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 445. [2022-04-08 08:43:40,223 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:43:40,224 INFO L82 GeneralOperation]: Start isEquivalent. First operand 457 states. Second operand has 445 states, 440 states have (on average 1.6272727272727272) internal successors, (716), 440 states have internal predecessors, (716), 3 states have call successors, (3), 3 states have 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:43:40,224 INFO L74 IsIncluded]: Start isIncluded. First operand 457 states. Second operand has 445 states, 440 states have (on average 1.6272727272727272) internal successors, (716), 440 states have internal predecessors, (716), 3 states have call successors, (3), 3 states have 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:43:40,225 INFO L87 Difference]: Start difference. First operand 457 states. Second operand has 445 states, 440 states have (on average 1.6272727272727272) internal successors, (716), 440 states have internal predecessors, (716), 3 states have call successors, (3), 3 states have 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:43:40,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:40,233 INFO L93 Difference]: Finished difference Result 457 states and 734 transitions. [2022-04-08 08:43:40,233 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 734 transitions. [2022-04-08 08:43:40,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:43:40,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:43:40,234 INFO L74 IsIncluded]: Start isIncluded. First operand has 445 states, 440 states have (on average 1.6272727272727272) internal successors, (716), 440 states have internal predecessors, (716), 3 states have call successors, (3), 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 457 states. [2022-04-08 08:43:40,234 INFO L87 Difference]: Start difference. First operand has 445 states, 440 states have (on average 1.6272727272727272) internal successors, (716), 440 states have internal predecessors, (716), 3 states have call successors, (3), 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 457 states. [2022-04-08 08:43:40,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:40,243 INFO L93 Difference]: Finished difference Result 457 states and 734 transitions. [2022-04-08 08:43:40,243 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 734 transitions. [2022-04-08 08:43:40,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:43:40,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:43:40,244 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:43:40,244 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:43:40,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 440 states have (on average 1.6272727272727272) internal successors, (716), 440 states have internal predecessors, (716), 3 states have call successors, (3), 3 states have 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:43:40,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 720 transitions. [2022-04-08 08:43:40,253 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 720 transitions. Word has length 94 [2022-04-08 08:43:40,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:43:40,254 INFO L478 AbstractCegarLoop]: Abstraction has 445 states and 720 transitions. [2022-04-08 08:43:40,254 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.8) internal successors, (87), 14 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:40,254 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 445 states and 720 transitions. [2022-04-08 08:43:41,022 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 720 edges. 720 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:43:41,023 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 720 transitions. [2022-04-08 08:43:41,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-04-08 08:43:41,024 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:43:41,024 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:43:41,024 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-08 08:43:41,024 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:43:41,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:43:41,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1154554769, now seen corresponding path program 1 times [2022-04-08 08:43:41,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:43:41,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1453966235] [2022-04-08 08:43:41,198 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:43:41,199 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:43:41,199 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:43:41,200 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 08:43:41,200 INFO L85 PathProgramCache]: Analyzing trace with hash -176124709, now seen corresponding path program 1 times [2022-04-08 08:43:41,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:43:41,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90852919] [2022-04-08 08:43:41,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:43:41,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:43:41,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:43:41,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:43:41,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:43:41,326 INFO L290 TraceCheckUtils]: 0: Hoare triple {22765#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {22759#true} is VALID [2022-04-08 08:43:41,326 INFO L290 TraceCheckUtils]: 1: Hoare triple {22759#true} assume true; {22759#true} is VALID [2022-04-08 08:43:41,326 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22759#true} {22759#true} #678#return; {22759#true} is VALID [2022-04-08 08:43:41,327 INFO L272 TraceCheckUtils]: 0: Hoare triple {22759#true} call ULTIMATE.init(); {22765#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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:43:41,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {22765#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {22759#true} is VALID [2022-04-08 08:43:41,327 INFO L290 TraceCheckUtils]: 2: Hoare triple {22759#true} assume true; {22759#true} is VALID [2022-04-08 08:43:41,327 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22759#true} {22759#true} #678#return; {22759#true} is VALID [2022-04-08 08:43:41,327 INFO L272 TraceCheckUtils]: 4: Hoare triple {22759#true} call #t~ret161 := main(); {22759#true} is VALID [2022-04-08 08:43:41,327 INFO L290 TraceCheckUtils]: 5: Hoare triple {22759#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {22759#true} is VALID [2022-04-08 08:43:41,327 INFO L290 TraceCheckUtils]: 6: Hoare triple {22759#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {22759#true} is VALID [2022-04-08 08:43:41,327 INFO L272 TraceCheckUtils]: 7: Hoare triple {22759#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {22759#true} is VALID [2022-04-08 08:43:41,328 INFO L290 TraceCheckUtils]: 8: Hoare triple {22759#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {22764#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:41,328 INFO L290 TraceCheckUtils]: 9: Hoare triple {22764#(= ssl3_accept_~blastFlag~0 0)} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {22764#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:41,328 INFO L290 TraceCheckUtils]: 10: Hoare triple {22764#(= ssl3_accept_~blastFlag~0 0)} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {22764#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:41,329 INFO L290 TraceCheckUtils]: 11: Hoare triple {22764#(= 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)))); {22764#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:41,329 INFO L290 TraceCheckUtils]: 12: Hoare triple {22764#(= ssl3_accept_~blastFlag~0 0)} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {22764#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:41,329 INFO L290 TraceCheckUtils]: 13: Hoare triple {22764#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {22764#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:41,329 INFO L290 TraceCheckUtils]: 14: Hoare triple {22764#(= ssl3_accept_~blastFlag~0 0)} [692] L1167-2-->L1168_primed: Formula: true InVars {} OutVars{ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_24|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_342|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_24|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_24|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_38|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_36|, ssl3_accept_#t~mem50=|v_ssl3_accept_#t~mem50_28|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_14|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_24|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_30|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_38|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_36|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_40|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_22|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_32, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_14|, #memory_int=|v_#memory_int_337|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_14|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_342|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_24} AuxVars[] AssignedVars[ssl3_accept_#t~mem83.base, #memory_$Pointer$.base, ssl3_accept_#t~mem82, ssl3_accept_#t~mem85, ssl3_accept_#t~mem151, ssl3_accept_#t~mem150.base, ssl3_accept_#t~mem50, ssl3_accept_#t~mem88.base, ssl3_accept_#t~mem83.offset, ssl3_accept_#t~mem49, ssl3_accept_#t~mem48, ssl3_accept_#t~mem150.offset, ssl3_accept_#t~mem47, ssl3_accept_#t~mem46, ssl3_accept_~skip~0, ssl3_accept_#t~mem88.offset, #memory_int, ssl3_accept_#t~mem89, #memory_$Pointer$.offset, ssl3_accept_~state~0] {22764#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:41,330 INFO L290 TraceCheckUtils]: 15: Hoare triple {22764#(= ssl3_accept_~blastFlag~0 0)} [693] L1168_primed-->L1167-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22764#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:41,330 INFO L290 TraceCheckUtils]: 16: Hoare triple {22764#(= ssl3_accept_~blastFlag~0 0)} [694] L1167-2-->L1168_primed: Formula: (or (and (= |v_#memory_int_343| |v_#memory_int_342|) (= |v_#memory_$Pointer$.offset_349| |v_#memory_$Pointer$.offset_348|) (= v_ssl3_accept_~s.offset_116 v_ssl3_accept_~s.offset_116) (= |v_#memory_$Pointer$.base_349| |v_#memory_$Pointer$.base_348|) (= v_ssl3_accept_~num1~0_14 v_ssl3_accept_~num1~0_14) (= v_ssl3_accept_~s.base_116 v_ssl3_accept_~s.base_116)) (let ((.cse6 (select |v_#memory_int_343| v_ssl3_accept_~s.base_116)) (.cse2 (+ 52 v_ssl3_accept_~s.offset_116))) (let ((.cse3 (select |v_#memory_$Pointer$.offset_348| v_ssl3_accept_~s.base_116)) (.cse1 (select |v_#memory_$Pointer$.offset_349| v_ssl3_accept_~s.base_116)) (.cse5 (+ 84 v_ssl3_accept_~s.offset_116)) (.cse7 (select |v_#memory_$Pointer$.base_349| v_ssl3_accept_~s.base_116)) (.cse4 (select |v_#memory_$Pointer$.base_348| v_ssl3_accept_~s.base_116)) (.cse0 (select .cse6 .cse2))) (and (= 8448 .cse0) (not (= 8497 .cse0)) (not (= .cse0 8481)) (not (= 8482 .cse0)) (= |v_#memory_$Pointer$.offset_348| (store |v_#memory_$Pointer$.offset_349| v_ssl3_accept_~s.base_116 (store .cse1 .cse2 (select .cse3 .cse2)))) (not (= 8496 .cse0)) (not (= 8464 .cse0)) (not (= 8544 .cse0)) (not (= 8195 .cse0)) (not (= .cse0 8512)) (not (= 8480 .cse0)) (not (= 8465 .cse0)) (not (= 8561 .cse0)) (not (= 16384 .cse0)) (not (= 8192 .cse0)) (not (= 8560 .cse0)) (= v_ssl3_accept_~skip~0_33 0) (not (= (select (select |v_#memory_int_342| (select .cse4 .cse5)) (+ 848 (select .cse3 .cse5))) 0)) (not (= 8528 .cse0)) (not (= 8529 .cse0)) (not (= 8513 .cse0)) (= (store |v_#memory_int_343| v_ssl3_accept_~s.base_116 (store .cse6 .cse2 (select (select |v_#memory_int_343| (select .cse7 .cse5)) (+ 844 (select .cse1 .cse5))))) |v_#memory_int_342|) (not (= 8466 .cse0)) (not (< 0 v_ssl3_accept_~num1~0_14)) (= v_ssl3_accept_~state~0_25 .cse0) (not (= 8545 .cse0)) (= (store |v_#memory_$Pointer$.base_349| v_ssl3_accept_~s.base_116 (store .cse7 .cse2 (select .cse4 .cse2))) |v_#memory_$Pointer$.base_348|) (not (= 12292 .cse0)) (not (= 24576 .cse0)))))) InVars {ssl3_accept_~s.offset=v_ssl3_accept_~s.offset_116, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_349|, ssl3_accept_~num1~0=v_ssl3_accept_~num1~0_14, #memory_int=|v_#memory_int_343|, ssl3_accept_~s.base=v_ssl3_accept_~s.base_116, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_349|} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_348|, ssl3_accept_~num1~0=v_ssl3_accept_~num1~0_14, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_40|, ssl3_accept_#t~mem52=|v_ssl3_accept_#t~mem52_22|, ssl3_accept_#t~mem51=|v_ssl3_accept_#t~mem51_22|, ssl3_accept_#t~mem50=|v_ssl3_accept_#t~mem50_30|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_38|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_33, ssl3_accept_#t~mem53=|v_ssl3_accept_#t~mem53_20|, ssl3_accept_#t~mem54=|v_ssl3_accept_#t~mem54_20|, ssl3_accept_#t~mem55=|v_ssl3_accept_#t~mem55_20|, ssl3_accept_#t~mem133=|v_ssl3_accept_#t~mem133_10|, ssl3_accept_#t~mem56=|v_ssl3_accept_#t~mem56_20|, ssl3_accept_#t~mem57=|v_ssl3_accept_#t~mem57_20|, ssl3_accept_#t~mem132.offset=|v_ssl3_accept_#t~mem132.offset_10|, ssl3_accept_#t~mem58=|v_ssl3_accept_#t~mem58_20|, ssl3_accept_#t~mem59=|v_ssl3_accept_#t~mem59_20|, ssl3_accept_~s.offset=v_ssl3_accept_~s.offset_116, ssl3_accept_#t~mem60=|v_ssl3_accept_#t~mem60_20|, ssl3_accept_#t~mem61=|v_ssl3_accept_#t~mem61_20|, ssl3_accept_#t~mem62=|v_ssl3_accept_#t~mem62_20|, ssl3_accept_#t~mem132.base=|v_ssl3_accept_#t~mem132.base_10|, ssl3_accept_#t~mem63=|v_ssl3_accept_#t~mem63_20|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_38|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_32|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_40|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_42|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_23|, #memory_int=|v_#memory_int_342|, ssl3_accept_#t~mem64=|v_ssl3_accept_#t~mem64_20|, ssl3_accept_#t~mem65=|v_ssl3_accept_#t~mem65_20|, ssl3_accept_#t~mem66=|v_ssl3_accept_#t~mem66_20|, ssl3_accept_#t~mem67=|v_ssl3_accept_#t~mem67_20|, ssl3_accept_#t~mem68=|v_ssl3_accept_#t~mem68_20|, ssl3_accept_~s.base=v_ssl3_accept_~s.base_116, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_348|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_25} AuxVars[] AssignedVars[#memory_$Pointer$.base, ssl3_accept_#t~mem151, ssl3_accept_#t~mem52, ssl3_accept_#t~mem51, ssl3_accept_#t~mem50, ssl3_accept_#t~mem150.offset, ssl3_accept_~skip~0, ssl3_accept_#t~mem53, ssl3_accept_#t~mem54, ssl3_accept_#t~mem55, ssl3_accept_#t~mem133, ssl3_accept_#t~mem56, ssl3_accept_#t~mem57, ssl3_accept_#t~mem132.offset, ssl3_accept_#t~mem58, ssl3_accept_#t~mem59, ssl3_accept_#t~mem60, ssl3_accept_#t~mem61, ssl3_accept_#t~mem62, ssl3_accept_#t~mem132.base, ssl3_accept_#t~mem63, ssl3_accept_#t~mem150.base, ssl3_accept_#t~mem49, ssl3_accept_#t~mem48, ssl3_accept_#t~mem47, ssl3_accept_#t~mem46, #memory_int, ssl3_accept_#t~mem64, ssl3_accept_#t~mem65, ssl3_accept_#t~mem66, ssl3_accept_#t~mem67, ssl3_accept_#t~mem68, #memory_$Pointer$.offset, ssl3_accept_~state~0] {22764#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:41,330 INFO L290 TraceCheckUtils]: 17: Hoare triple {22764#(= ssl3_accept_~blastFlag~0 0)} [691] L1168_primed-->L1168: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22764#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:41,331 INFO L290 TraceCheckUtils]: 18: Hoare triple {22764#(= ssl3_accept_~blastFlag~0 0)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {22764#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:41,331 INFO L290 TraceCheckUtils]: 19: Hoare triple {22764#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {22764#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:41,331 INFO L290 TraceCheckUtils]: 20: Hoare triple {22764#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {22764#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:41,332 INFO L290 TraceCheckUtils]: 21: Hoare triple {22764#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {22764#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:41,332 INFO L290 TraceCheckUtils]: 22: Hoare triple {22764#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {22764#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:41,332 INFO L290 TraceCheckUtils]: 23: Hoare triple {22764#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {22764#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:41,332 INFO L290 TraceCheckUtils]: 24: Hoare triple {22764#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {22764#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:41,333 INFO L290 TraceCheckUtils]: 25: Hoare triple {22764#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {22764#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:41,333 INFO L290 TraceCheckUtils]: 26: Hoare triple {22764#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {22764#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:41,333 INFO L290 TraceCheckUtils]: 27: Hoare triple {22764#(= ssl3_accept_~blastFlag~0 0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {22764#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:41,333 INFO L290 TraceCheckUtils]: 28: Hoare triple {22764#(= ssl3_accept_~blastFlag~0 0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {22764#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:41,334 INFO L290 TraceCheckUtils]: 29: Hoare triple {22764#(= ssl3_accept_~blastFlag~0 0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {22764#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:41,334 INFO L290 TraceCheckUtils]: 30: Hoare triple {22764#(= ssl3_accept_~blastFlag~0 0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {22764#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:41,334 INFO L290 TraceCheckUtils]: 31: Hoare triple {22764#(= ssl3_accept_~blastFlag~0 0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {22764#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:41,334 INFO L290 TraceCheckUtils]: 32: Hoare triple {22764#(= ssl3_accept_~blastFlag~0 0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {22764#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:41,335 INFO L290 TraceCheckUtils]: 33: Hoare triple {22764#(= ssl3_accept_~blastFlag~0 0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {22764#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:41,335 INFO L290 TraceCheckUtils]: 34: Hoare triple {22764#(= ssl3_accept_~blastFlag~0 0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {22764#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:41,335 INFO L290 TraceCheckUtils]: 35: Hoare triple {22764#(= ssl3_accept_~blastFlag~0 0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {22764#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:41,336 INFO L290 TraceCheckUtils]: 36: Hoare triple {22764#(= ssl3_accept_~blastFlag~0 0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {22764#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:41,336 INFO L290 TraceCheckUtils]: 37: Hoare triple {22764#(= ssl3_accept_~blastFlag~0 0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {22764#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:41,336 INFO L290 TraceCheckUtils]: 38: Hoare triple {22764#(= ssl3_accept_~blastFlag~0 0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {22764#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:41,336 INFO L290 TraceCheckUtils]: 39: Hoare triple {22764#(= ssl3_accept_~blastFlag~0 0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {22764#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:41,337 INFO L290 TraceCheckUtils]: 40: Hoare triple {22764#(= ssl3_accept_~blastFlag~0 0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {22764#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:41,337 INFO L290 TraceCheckUtils]: 41: Hoare triple {22764#(= ssl3_accept_~blastFlag~0 0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {22764#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:41,337 INFO L290 TraceCheckUtils]: 42: Hoare triple {22764#(= ssl3_accept_~blastFlag~0 0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {22764#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:41,337 INFO L290 TraceCheckUtils]: 43: Hoare triple {22764#(= ssl3_accept_~blastFlag~0 0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {22764#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:41,338 INFO L290 TraceCheckUtils]: 44: Hoare triple {22764#(= ssl3_accept_~blastFlag~0 0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {22764#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:41,338 INFO L290 TraceCheckUtils]: 45: Hoare triple {22764#(= ssl3_accept_~blastFlag~0 0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {22764#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:41,338 INFO L290 TraceCheckUtils]: 46: Hoare triple {22764#(= ssl3_accept_~blastFlag~0 0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {22764#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:41,338 INFO L290 TraceCheckUtils]: 47: Hoare triple {22764#(= ssl3_accept_~blastFlag~0 0)} assume 8640 == #t~mem75;havoc #t~mem75; {22764#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:41,339 INFO L290 TraceCheckUtils]: 48: Hoare triple {22764#(= ssl3_accept_~blastFlag~0 0)} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {22764#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:41,339 INFO L290 TraceCheckUtils]: 49: Hoare triple {22764#(= ssl3_accept_~blastFlag~0 0)} assume !(4 == ~blastFlag~0); {22764#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:43:41,339 INFO L290 TraceCheckUtils]: 50: Hoare triple {22764#(= ssl3_accept_~blastFlag~0 0)} assume 7 == ~blastFlag~0; {22760#false} is VALID [2022-04-08 08:43:41,339 INFO L290 TraceCheckUtils]: 51: Hoare triple {22760#false} assume !false; {22760#false} is VALID [2022-04-08 08:43:41,340 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 08:43:41,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:43:41,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90852919] [2022-04-08 08:43:41,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90852919] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:43:41,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:43:41,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:43:44,325 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:43:44,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1453966235] [2022-04-08 08:43:44,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1453966235] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:43:44,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:43:44,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 08:43:44,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758569409] [2022-04-08 08:43:44,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:43:44,326 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.8) internal successors, (87), 14 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 94 [2022-04-08 08:43:44,326 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:43:44,326 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 5.8) internal successors, (87), 14 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:44,405 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:43:44,406 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 08:43:44,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:43:44,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 08:43:44,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=155, Unknown=1, NotChecked=0, Total=210 [2022-04-08 08:43:44,406 INFO L87 Difference]: Start difference. First operand 445 states and 720 transitions. Second operand has 15 states, 15 states have (on average 5.8) internal successors, (87), 14 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:48,383 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:43:50,399 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:43:52,424 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:43:56,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:56,698 INFO L93 Difference]: Finished difference Result 677 states and 1098 transitions. [2022-04-08 08:43:56,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 08:43:56,698 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.8) internal successors, (87), 14 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 94 [2022-04-08 08:43:56,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:43:56,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.8) internal successors, (87), 14 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:56,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 432 transitions. [2022-04-08 08:43:56,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.8) internal successors, (87), 14 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:56,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 432 transitions. [2022-04-08 08:43:56,701 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 432 transitions. [2022-04-08 08:43:56,982 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:43:56,990 INFO L225 Difference]: With dead ends: 677 [2022-04-08 08:43:56,990 INFO L226 Difference]: Without dead ends: 456 [2022-04-08 08:43:56,991 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=54, Invalid=155, Unknown=1, NotChecked=0, Total=210 [2022-04-08 08:43:56,991 INFO L913 BasicCegarLoop]: 202 mSDtfsCounter, 8 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 145 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2022-04-08 08:43:56,992 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 681 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 583 Invalid, 2 Unknown, 145 Unchecked, 7.7s Time] [2022-04-08 08:43:56,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2022-04-08 08:43:57,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 447. [2022-04-08 08:43:57,004 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:43:57,005 INFO L82 GeneralOperation]: Start isEquivalent. First operand 456 states. Second operand has 447 states, 442 states have (on average 1.6266968325791855) internal successors, (719), 442 states have internal predecessors, (719), 3 states have call successors, (3), 3 states have 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:43:57,005 INFO L74 IsIncluded]: Start isIncluded. First operand 456 states. Second operand has 447 states, 442 states have (on average 1.6266968325791855) internal successors, (719), 442 states have internal predecessors, (719), 3 states have call successors, (3), 3 states have 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:43:57,006 INFO L87 Difference]: Start difference. First operand 456 states. Second operand has 447 states, 442 states have (on average 1.6266968325791855) internal successors, (719), 442 states have internal predecessors, (719), 3 states have call successors, (3), 3 states have 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:43:57,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:57,013 INFO L93 Difference]: Finished difference Result 456 states and 733 transitions. [2022-04-08 08:43:57,013 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 733 transitions. [2022-04-08 08:43:57,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:43:57,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:43:57,015 INFO L74 IsIncluded]: Start isIncluded. First operand has 447 states, 442 states have (on average 1.6266968325791855) internal successors, (719), 442 states have internal predecessors, (719), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 456 states. [2022-04-08 08:43:57,016 INFO L87 Difference]: Start difference. First operand has 447 states, 442 states have (on average 1.6266968325791855) internal successors, (719), 442 states have internal predecessors, (719), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 456 states. [2022-04-08 08:43:57,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:57,024 INFO L93 Difference]: Finished difference Result 456 states and 733 transitions. [2022-04-08 08:43:57,024 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 733 transitions. [2022-04-08 08:43:57,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:43:57,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:43:57,024 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:43:57,024 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:43:57,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 442 states have (on average 1.6266968325791855) internal successors, (719), 442 states have internal predecessors, (719), 3 states have call successors, (3), 3 states have 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:43:57,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 723 transitions. [2022-04-08 08:43:57,034 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 723 transitions. Word has length 94 [2022-04-08 08:43:57,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:43:57,035 INFO L478 AbstractCegarLoop]: Abstraction has 447 states and 723 transitions. [2022-04-08 08:43:57,035 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.8) internal successors, (87), 14 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:57,035 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 447 states and 723 transitions. [2022-04-08 08:43:57,820 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 723 edges. 723 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:43:57,820 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 723 transitions. [2022-04-08 08:43:57,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-04-08 08:43:57,821 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:43:57,821 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:43:57,821 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-08 08:43:57,821 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:43:57,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:43:57,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1159089924, now seen corresponding path program 1 times [2022-04-08 08:43:57,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:43:57,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [806819678] [2022-04-08 08:43:57,883 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:43:57,883 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:43:57,883 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:43:57,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1159089924, now seen corresponding path program 2 times [2022-04-08 08:43:57,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:43:57,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167217836] [2022-04-08 08:43:57,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:43:57,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:43:57,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:43:57,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:43:57,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:43:57,994 INFO L290 TraceCheckUtils]: 0: Hoare triple {25946#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(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); {25939#true} is VALID [2022-04-08 08:43:57,995 INFO L290 TraceCheckUtils]: 1: Hoare triple {25939#true} assume true; {25939#true} is VALID [2022-04-08 08:43:57,995 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25939#true} {25939#true} #678#return; {25939#true} is VALID [2022-04-08 08:43:57,995 INFO L272 TraceCheckUtils]: 0: Hoare triple {25939#true} call ULTIMATE.init(); {25946#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:43:57,996 INFO L290 TraceCheckUtils]: 1: Hoare triple {25946#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(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); {25939#true} is VALID [2022-04-08 08:43:58,006 INFO L290 TraceCheckUtils]: 2: Hoare triple {25939#true} assume true; {25939#true} is VALID [2022-04-08 08:43:58,006 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25939#true} {25939#true} #678#return; {25939#true} is VALID [2022-04-08 08:43:58,006 INFO L272 TraceCheckUtils]: 4: Hoare triple {25939#true} call #t~ret161 := main(); {25939#true} is VALID [2022-04-08 08:43:58,006 INFO L290 TraceCheckUtils]: 5: Hoare triple {25939#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {25939#true} is VALID [2022-04-08 08:43:58,006 INFO L290 TraceCheckUtils]: 6: Hoare triple {25939#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {25939#true} is VALID [2022-04-08 08:43:58,007 INFO L272 TraceCheckUtils]: 7: Hoare triple {25939#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {25939#true} is VALID [2022-04-08 08:43:58,016 INFO L290 TraceCheckUtils]: 8: Hoare triple {25939#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {25944#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:58,017 INFO L290 TraceCheckUtils]: 9: Hoare triple {25944#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {25944#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:58,017 INFO L290 TraceCheckUtils]: 10: Hoare triple {25944#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {25944#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:58,018 INFO L290 TraceCheckUtils]: 11: Hoare triple {25944#(not (= 24576 (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)))); {25944#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:58,018 INFO L290 TraceCheckUtils]: 12: Hoare triple {25944#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {25944#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:58,019 INFO L290 TraceCheckUtils]: 13: Hoare triple {25944#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {25944#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:58,019 INFO L290 TraceCheckUtils]: 14: Hoare triple {25944#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {25944#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:58,020 INFO L290 TraceCheckUtils]: 15: Hoare triple {25944#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {25944#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:58,020 INFO L290 TraceCheckUtils]: 16: Hoare triple {25944#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {25944#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:58,020 INFO L290 TraceCheckUtils]: 17: Hoare triple {25944#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {25944#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:58,021 INFO L290 TraceCheckUtils]: 18: Hoare triple {25944#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {25945#(not (= 24576 |ssl3_accept_#t~mem50|))} is VALID [2022-04-08 08:43:58,021 INFO L290 TraceCheckUtils]: 19: Hoare triple {25945#(not (= 24576 |ssl3_accept_#t~mem50|))} assume 24576 == #t~mem50;havoc #t~mem50; {25940#false} is VALID [2022-04-08 08:43:58,021 INFO L290 TraceCheckUtils]: 20: Hoare triple {25940#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:43:58,022 INFO L290 TraceCheckUtils]: 21: Hoare triple {25940#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {25940#false} is VALID [2022-04-08 08:43:58,022 INFO L290 TraceCheckUtils]: 22: Hoare triple {25940#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:43:58,022 INFO L290 TraceCheckUtils]: 23: Hoare triple {25940#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:43:58,022 INFO L290 TraceCheckUtils]: 24: Hoare triple {25940#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {25940#false} is VALID [2022-04-08 08:43:58,022 INFO L290 TraceCheckUtils]: 25: Hoare triple {25940#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:43:58,022 INFO L290 TraceCheckUtils]: 26: Hoare triple {25940#false} assume 12292 != #t~mem85;havoc #t~mem85; {25940#false} is VALID [2022-04-08 08:43:58,022 INFO L290 TraceCheckUtils]: 27: Hoare triple {25940#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 52 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem87 := read~int(#t~mem86.base, 72 + #t~mem86.offset, 4);call write~int(1 + #t~mem87, #t~mem86.base, 72 + #t~mem86.offset, 4);havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87; {25940#false} is VALID [2022-04-08 08:43:58,022 INFO L290 TraceCheckUtils]: 28: Hoare triple {25940#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {25940#false} is VALID [2022-04-08 08:43:58,022 INFO L290 TraceCheckUtils]: 29: Hoare triple {25940#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {25940#false} is VALID [2022-04-08 08:43:58,023 INFO L290 TraceCheckUtils]: 30: Hoare triple {25940#false} ~skip~0 := 0; {25940#false} is VALID [2022-04-08 08:43:58,023 INFO L290 TraceCheckUtils]: 31: Hoare triple {25940#false} assume !false; {25940#false} is VALID [2022-04-08 08:43:58,023 INFO L290 TraceCheckUtils]: 32: Hoare triple {25940#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:43:58,023 INFO L290 TraceCheckUtils]: 33: Hoare triple {25940#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:43:58,023 INFO L290 TraceCheckUtils]: 34: Hoare triple {25940#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:43:58,023 INFO L290 TraceCheckUtils]: 35: Hoare triple {25940#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:43:58,023 INFO L290 TraceCheckUtils]: 36: Hoare triple {25940#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:43:58,023 INFO L290 TraceCheckUtils]: 37: Hoare triple {25940#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:43:58,023 INFO L290 TraceCheckUtils]: 38: Hoare triple {25940#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:43:58,023 INFO L290 TraceCheckUtils]: 39: Hoare triple {25940#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:43:58,024 INFO L290 TraceCheckUtils]: 40: Hoare triple {25940#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:43:58,024 INFO L290 TraceCheckUtils]: 41: Hoare triple {25940#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:43:58,024 INFO L290 TraceCheckUtils]: 42: Hoare triple {25940#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:43:58,024 INFO L290 TraceCheckUtils]: 43: Hoare triple {25940#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:43:58,024 INFO L290 TraceCheckUtils]: 44: Hoare triple {25940#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:43:58,024 INFO L290 TraceCheckUtils]: 45: Hoare triple {25940#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:43:58,024 INFO L290 TraceCheckUtils]: 46: Hoare triple {25940#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:43:58,024 INFO L290 TraceCheckUtils]: 47: Hoare triple {25940#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:43:58,024 INFO L290 TraceCheckUtils]: 48: Hoare triple {25940#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:43:58,024 INFO L290 TraceCheckUtils]: 49: Hoare triple {25940#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:43:58,025 INFO L290 TraceCheckUtils]: 50: Hoare triple {25940#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:43:58,025 INFO L290 TraceCheckUtils]: 51: Hoare triple {25940#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:43:58,025 INFO L290 TraceCheckUtils]: 52: Hoare triple {25940#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:43:58,025 INFO L290 TraceCheckUtils]: 53: Hoare triple {25940#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:43:58,025 INFO L290 TraceCheckUtils]: 54: Hoare triple {25940#false} assume 8448 == #t~mem68;havoc #t~mem68; {25940#false} is VALID [2022-04-08 08:43:58,025 INFO L290 TraceCheckUtils]: 55: Hoare triple {25940#false} assume !(~num1~0 > 0); {25940#false} is VALID [2022-04-08 08:43:58,025 INFO L290 TraceCheckUtils]: 56: Hoare triple {25940#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {25940#false} is VALID [2022-04-08 08:43:58,025 INFO L290 TraceCheckUtils]: 57: Hoare triple {25940#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {25940#false} is VALID [2022-04-08 08:43:58,025 INFO L290 TraceCheckUtils]: 58: Hoare triple {25940#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {25940#false} is VALID [2022-04-08 08:43:58,025 INFO L290 TraceCheckUtils]: 59: Hoare triple {25940#false} ~skip~0 := 0; {25940#false} is VALID [2022-04-08 08:43:58,026 INFO L290 TraceCheckUtils]: 60: Hoare triple {25940#false} assume !false; {25940#false} is VALID [2022-04-08 08:43:58,026 INFO L290 TraceCheckUtils]: 61: Hoare triple {25940#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:43:58,026 INFO L290 TraceCheckUtils]: 62: Hoare triple {25940#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:43:58,026 INFO L290 TraceCheckUtils]: 63: Hoare triple {25940#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:43:58,026 INFO L290 TraceCheckUtils]: 64: Hoare triple {25940#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:43:58,026 INFO L290 TraceCheckUtils]: 65: Hoare triple {25940#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:43:58,026 INFO L290 TraceCheckUtils]: 66: Hoare triple {25940#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:43:58,026 INFO L290 TraceCheckUtils]: 67: Hoare triple {25940#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:43:58,026 INFO L290 TraceCheckUtils]: 68: Hoare triple {25940#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:43:58,026 INFO L290 TraceCheckUtils]: 69: Hoare triple {25940#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:43:58,027 INFO L290 TraceCheckUtils]: 70: Hoare triple {25940#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:43:58,027 INFO L290 TraceCheckUtils]: 71: Hoare triple {25940#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:43:58,027 INFO L290 TraceCheckUtils]: 72: Hoare triple {25940#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:43:58,027 INFO L290 TraceCheckUtils]: 73: Hoare triple {25940#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:43:58,027 INFO L290 TraceCheckUtils]: 74: Hoare triple {25940#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:43:58,027 INFO L290 TraceCheckUtils]: 75: Hoare triple {25940#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:43:58,027 INFO L290 TraceCheckUtils]: 76: Hoare triple {25940#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:43:58,027 INFO L290 TraceCheckUtils]: 77: Hoare triple {25940#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:43:58,027 INFO L290 TraceCheckUtils]: 78: Hoare triple {25940#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:43:58,027 INFO L290 TraceCheckUtils]: 79: Hoare triple {25940#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:43:58,028 INFO L290 TraceCheckUtils]: 80: Hoare triple {25940#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:43:58,028 INFO L290 TraceCheckUtils]: 81: Hoare triple {25940#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:43:58,028 INFO L290 TraceCheckUtils]: 82: Hoare triple {25940#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:43:58,028 INFO L290 TraceCheckUtils]: 83: Hoare triple {25940#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:43:58,028 INFO L290 TraceCheckUtils]: 84: Hoare triple {25940#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:43:58,028 INFO L290 TraceCheckUtils]: 85: Hoare triple {25940#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:43:58,028 INFO L290 TraceCheckUtils]: 86: Hoare triple {25940#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:43:58,028 INFO L290 TraceCheckUtils]: 87: Hoare triple {25940#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:43:58,028 INFO L290 TraceCheckUtils]: 88: Hoare triple {25940#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:43:58,028 INFO L290 TraceCheckUtils]: 89: Hoare triple {25940#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {25940#false} is VALID [2022-04-08 08:43:58,028 INFO L290 TraceCheckUtils]: 90: Hoare triple {25940#false} assume 8640 == #t~mem75;havoc #t~mem75; {25940#false} is VALID [2022-04-08 08:43:58,029 INFO L290 TraceCheckUtils]: 91: Hoare triple {25940#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {25940#false} is VALID [2022-04-08 08:43:58,029 INFO L290 TraceCheckUtils]: 92: Hoare triple {25940#false} assume !(4 == ~blastFlag~0); {25940#false} is VALID [2022-04-08 08:43:58,029 INFO L290 TraceCheckUtils]: 93: Hoare triple {25940#false} assume 7 == ~blastFlag~0; {25940#false} is VALID [2022-04-08 08:43:58,029 INFO L290 TraceCheckUtils]: 94: Hoare triple {25940#false} assume !false; {25940#false} is VALID [2022-04-08 08:43:58,029 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-08 08:43:58,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:43:58,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167217836] [2022-04-08 08:43:58,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167217836] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:43:58,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:43:58,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:43:58,030 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:43:58,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [806819678] [2022-04-08 08:43:58,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [806819678] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:43:58,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:43:58,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:43:58,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135198925] [2022-04-08 08:43:58,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:43:58,031 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 95 [2022-04-08 08:43:58,031 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:43:58,031 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:43:58,092 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:43:58,092 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:43:58,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:43:58,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:43:58,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:43:58,093 INFO L87 Difference]: Start difference. First operand 447 states and 723 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:44:00,073 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:44:06,553 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:44:08,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:08,050 INFO L93 Difference]: Finished difference Result 818 states and 1290 transitions. [2022-04-08 08:44:08,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:44:08,051 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 95 [2022-04-08 08:44:08,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:44:08,051 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:44:08,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 582 transitions. [2022-04-08 08:44:08,053 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:44:08,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 582 transitions. [2022-04-08 08:44:08,055 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 582 transitions. [2022-04-08 08:44:08,423 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 582 edges. 582 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:44:08,437 INFO L225 Difference]: With dead ends: 818 [2022-04-08 08:44:08,437 INFO L226 Difference]: Without dead ends: 590 [2022-04-08 08:44:08,438 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:44:08,438 INFO L913 BasicCegarLoop]: 123 mSDtfsCounter, 142 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 62 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-04-08 08:44:08,438 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 350 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 482 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2022-04-08 08:44:08,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2022-04-08 08:44:08,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 445. [2022-04-08 08:44:08,454 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:44:08,454 INFO L82 GeneralOperation]: Start isEquivalent. First operand 590 states. Second operand has 445 states, 440 states have (on average 1.6136363636363635) internal successors, (710), 440 states have internal predecessors, (710), 3 states have call successors, (3), 3 states have 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:44:08,455 INFO L74 IsIncluded]: Start isIncluded. First operand 590 states. Second operand has 445 states, 440 states have (on average 1.6136363636363635) internal successors, (710), 440 states have internal predecessors, (710), 3 states have call successors, (3), 3 states have 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:44:08,455 INFO L87 Difference]: Start difference. First operand 590 states. Second operand has 445 states, 440 states have (on average 1.6136363636363635) internal successors, (710), 440 states have internal predecessors, (710), 3 states have call successors, (3), 3 states have 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:44:08,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:08,467 INFO L93 Difference]: Finished difference Result 590 states and 911 transitions. [2022-04-08 08:44:08,468 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 911 transitions. [2022-04-08 08:44:08,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:44:08,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:44:08,469 INFO L74 IsIncluded]: Start isIncluded. First operand has 445 states, 440 states have (on average 1.6136363636363635) internal successors, (710), 440 states have internal predecessors, (710), 3 states have call successors, (3), 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 590 states. [2022-04-08 08:44:08,469 INFO L87 Difference]: Start difference. First operand has 445 states, 440 states have (on average 1.6136363636363635) internal successors, (710), 440 states have internal predecessors, (710), 3 states have call successors, (3), 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 590 states. [2022-04-08 08:44:08,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:08,482 INFO L93 Difference]: Finished difference Result 590 states and 911 transitions. [2022-04-08 08:44:08,482 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 911 transitions. [2022-04-08 08:44:08,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:44:08,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:44:08,483 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:44:08,483 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:44:08,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 440 states have (on average 1.6136363636363635) internal successors, (710), 440 states have internal predecessors, (710), 3 states have call successors, (3), 3 states have 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:44:08,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 714 transitions. [2022-04-08 08:44:08,499 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 714 transitions. Word has length 95 [2022-04-08 08:44:08,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:44:08,499 INFO L478 AbstractCegarLoop]: Abstraction has 445 states and 714 transitions. [2022-04-08 08:44:08,500 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:44:08,500 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 445 states and 714 transitions. [2022-04-08 08:44:09,625 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 714 edges. 714 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:44:09,625 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 714 transitions. [2022-04-08 08:44:09,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-04-08 08:44:09,626 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:44:09,626 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:44:09,626 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-08 08:44:09,626 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:44:09,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:44:09,627 INFO L85 PathProgramCache]: Analyzing trace with hash -659554766, now seen corresponding path program 1 times [2022-04-08 08:44:09,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:44:09,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [307717650] [2022-04-08 08:44:09,812 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:44:09,813 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:44:09,813 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:44:09,814 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 08:44:09,815 INFO L85 PathProgramCache]: Analyzing trace with hash 902442459, now seen corresponding path program 1 times [2022-04-08 08:44:09,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:44:09,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519547542] [2022-04-08 08:44:09,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:44:09,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:44:09,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:44:09,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:44:09,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:44:09,926 INFO L290 TraceCheckUtils]: 0: Hoare triple {29663#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {29657#true} is VALID [2022-04-08 08:44:09,926 INFO L290 TraceCheckUtils]: 1: Hoare triple {29657#true} assume true; {29657#true} is VALID [2022-04-08 08:44:09,926 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29657#true} {29657#true} #678#return; {29657#true} is VALID [2022-04-08 08:44:09,927 INFO L272 TraceCheckUtils]: 0: Hoare triple {29657#true} call ULTIMATE.init(); {29663#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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:44:09,928 INFO L290 TraceCheckUtils]: 1: Hoare triple {29663#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {29657#true} is VALID [2022-04-08 08:44:09,928 INFO L290 TraceCheckUtils]: 2: Hoare triple {29657#true} assume true; {29657#true} is VALID [2022-04-08 08:44:09,928 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29657#true} {29657#true} #678#return; {29657#true} is VALID [2022-04-08 08:44:09,928 INFO L272 TraceCheckUtils]: 4: Hoare triple {29657#true} call #t~ret161 := main(); {29657#true} is VALID [2022-04-08 08:44:09,928 INFO L290 TraceCheckUtils]: 5: Hoare triple {29657#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {29657#true} is VALID [2022-04-08 08:44:09,928 INFO L290 TraceCheckUtils]: 6: Hoare triple {29657#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {29657#true} is VALID [2022-04-08 08:44:09,928 INFO L272 TraceCheckUtils]: 7: Hoare triple {29657#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {29657#true} is VALID [2022-04-08 08:44:09,929 INFO L290 TraceCheckUtils]: 8: Hoare triple {29657#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {29662#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:09,929 INFO L290 TraceCheckUtils]: 9: Hoare triple {29662#(= ssl3_accept_~blastFlag~0 0)} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {29662#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:09,929 INFO L290 TraceCheckUtils]: 10: Hoare triple {29662#(= ssl3_accept_~blastFlag~0 0)} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {29662#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:09,930 INFO L290 TraceCheckUtils]: 11: Hoare triple {29662#(= 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)))); {29662#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:09,930 INFO L290 TraceCheckUtils]: 12: Hoare triple {29662#(= ssl3_accept_~blastFlag~0 0)} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {29662#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:09,930 INFO L290 TraceCheckUtils]: 13: Hoare triple {29662#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {29662#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:09,931 INFO L290 TraceCheckUtils]: 14: Hoare triple {29662#(= ssl3_accept_~blastFlag~0 0)} [696] L1167-2-->L1168_primed: Formula: true InVars {} OutVars{ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_32|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_387|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_32|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_32|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_49|, ssl3_accept_#t~mem51=|v_ssl3_accept_#t~mem51_26|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_47|, ssl3_accept_#t~mem50=|v_ssl3_accept_#t~mem50_40|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_18|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_32|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_42|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_50|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_47|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_52|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_29|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_39, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_18|, #memory_int=|v_#memory_int_371|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_18|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_387|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_31} AuxVars[] AssignedVars[ssl3_accept_#t~mem83.base, #memory_$Pointer$.base, ssl3_accept_#t~mem82, ssl3_accept_#t~mem85, ssl3_accept_#t~mem151, ssl3_accept_#t~mem51, ssl3_accept_#t~mem150.base, ssl3_accept_#t~mem50, ssl3_accept_#t~mem88.base, ssl3_accept_#t~mem83.offset, ssl3_accept_#t~mem49, ssl3_accept_#t~mem48, ssl3_accept_#t~mem150.offset, ssl3_accept_#t~mem47, ssl3_accept_#t~mem46, ssl3_accept_~skip~0, ssl3_accept_#t~mem88.offset, #memory_int, ssl3_accept_#t~mem89, #memory_$Pointer$.offset, ssl3_accept_~state~0] {29662#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:09,931 INFO L290 TraceCheckUtils]: 15: Hoare triple {29662#(= ssl3_accept_~blastFlag~0 0)} [697] L1168_primed-->L1167-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29662#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:09,931 INFO L290 TraceCheckUtils]: 16: Hoare triple {29662#(= ssl3_accept_~blastFlag~0 0)} [698] L1167-2-->L1168_primed: Formula: (or (let ((.cse1 (select |v_#memory_int_377| v_ssl3_accept_~s.base_120)) (.cse2 (+ 52 v_ssl3_accept_~s.offset_120))) (let ((.cse5 (select |v_#memory_$Pointer$.offset_394| v_ssl3_accept_~s.base_120)) (.cse3 (select |v_#memory_$Pointer$.base_394| v_ssl3_accept_~s.base_120)) (.cse7 (select |v_#memory_$Pointer$.base_393| v_ssl3_accept_~s.base_120)) (.cse6 (select |v_#memory_$Pointer$.offset_393| v_ssl3_accept_~s.base_120)) (.cse4 (+ 84 v_ssl3_accept_~s.offset_120)) (.cse0 (select .cse1 .cse2))) (and (not (= 8513 .cse0)) (not (= 24576 .cse0)) (= v_ssl3_accept_~skip~0_40 0) (not (= 8464 .cse0)) (= 8448 .cse0) (not (= .cse0 8545)) (not (= 8466 .cse0)) (not (= 12292 .cse0)) (not (= .cse0 8561)) (not (= .cse0 8481)) (not (= .cse0 8529)) (not (< 0 v_ssl3_accept_~num1~0_16)) (= (store |v_#memory_int_377| v_ssl3_accept_~s.base_120 (store .cse1 .cse2 (select (select |v_#memory_int_377| (select .cse3 .cse4)) (+ (select .cse5 .cse4) 844)))) |v_#memory_int_376|) (not (= 8560 .cse0)) (not (= .cse0 8480)) (= (store |v_#memory_$Pointer$.offset_394| v_ssl3_accept_~s.base_120 (store .cse5 .cse2 (select .cse6 .cse2))) |v_#memory_$Pointer$.offset_393|) (not (= .cse0 8512)) (not (= .cse0 8544)) (not (= 8192 .cse0)) (= |v_#memory_$Pointer$.base_393| (store |v_#memory_$Pointer$.base_394| v_ssl3_accept_~s.base_120 (store .cse3 .cse2 (select .cse7 .cse2)))) (= .cse0 v_ssl3_accept_~state~0_32) (not (= .cse0 8482)) (not (= .cse0 8528)) (not (= 8497 .cse0)) (not (= 8496 .cse0)) (not (= .cse0 8465)) (not (= (select (select |v_#memory_int_376| (select .cse7 .cse4)) (+ (select .cse6 .cse4) 848)) 0)) (not (= .cse0 8195)) (not (= .cse0 16384))))) (and (= v_ssl3_accept_~s.base_120 v_ssl3_accept_~s.base_120) (= v_ssl3_accept_~num1~0_16 v_ssl3_accept_~num1~0_16) (= |v_#memory_int_377| |v_#memory_int_376|) (= v_ssl3_accept_~s.offset_120 v_ssl3_accept_~s.offset_120) (= |v_#memory_$Pointer$.base_394| |v_#memory_$Pointer$.base_393|) (= |v_#memory_$Pointer$.offset_394| |v_#memory_$Pointer$.offset_393|))) InVars {ssl3_accept_~s.offset=v_ssl3_accept_~s.offset_120, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_394|, ssl3_accept_~num1~0=v_ssl3_accept_~num1~0_16, #memory_int=|v_#memory_int_377|, ssl3_accept_~s.base=v_ssl3_accept_~s.base_120, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_394|} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_393|, ssl3_accept_~num1~0=v_ssl3_accept_~num1~0_16, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_51|, ssl3_accept_#t~mem52=|v_ssl3_accept_#t~mem52_26|, ssl3_accept_#t~mem51=|v_ssl3_accept_#t~mem51_28|, ssl3_accept_#t~mem50=|v_ssl3_accept_#t~mem50_42|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_49|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_40, ssl3_accept_#t~mem53=|v_ssl3_accept_#t~mem53_24|, ssl3_accept_#t~mem54=|v_ssl3_accept_#t~mem54_24|, ssl3_accept_#t~mem55=|v_ssl3_accept_#t~mem55_24|, ssl3_accept_#t~mem133=|v_ssl3_accept_#t~mem133_12|, ssl3_accept_#t~mem56=|v_ssl3_accept_#t~mem56_24|, ssl3_accept_#t~mem57=|v_ssl3_accept_#t~mem57_24|, ssl3_accept_#t~mem132.offset=|v_ssl3_accept_#t~mem132.offset_12|, ssl3_accept_#t~mem58=|v_ssl3_accept_#t~mem58_24|, ssl3_accept_#t~mem59=|v_ssl3_accept_#t~mem59_24|, ssl3_accept_~s.offset=v_ssl3_accept_~s.offset_120, ssl3_accept_#t~mem60=|v_ssl3_accept_#t~mem60_24|, ssl3_accept_#t~mem61=|v_ssl3_accept_#t~mem61_24|, ssl3_accept_#t~mem62=|v_ssl3_accept_#t~mem62_24|, ssl3_accept_#t~mem132.base=|v_ssl3_accept_#t~mem132.base_12|, ssl3_accept_#t~mem63=|v_ssl3_accept_#t~mem63_24|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_49|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_44|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_52|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_54|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_30|, #memory_int=|v_#memory_int_376|, ssl3_accept_#t~mem64=|v_ssl3_accept_#t~mem64_24|, ssl3_accept_#t~mem65=|v_ssl3_accept_#t~mem65_24|, ssl3_accept_#t~mem66=|v_ssl3_accept_#t~mem66_24|, ssl3_accept_#t~mem67=|v_ssl3_accept_#t~mem67_24|, ssl3_accept_#t~mem68=|v_ssl3_accept_#t~mem68_24|, ssl3_accept_~s.base=v_ssl3_accept_~s.base_120, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_393|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_32} AuxVars[] AssignedVars[#memory_$Pointer$.base, ssl3_accept_#t~mem151, ssl3_accept_#t~mem52, ssl3_accept_#t~mem51, ssl3_accept_#t~mem50, ssl3_accept_#t~mem150.offset, ssl3_accept_~skip~0, ssl3_accept_#t~mem53, ssl3_accept_#t~mem54, ssl3_accept_#t~mem55, ssl3_accept_#t~mem133, ssl3_accept_#t~mem56, ssl3_accept_#t~mem57, ssl3_accept_#t~mem132.offset, ssl3_accept_#t~mem58, ssl3_accept_#t~mem59, ssl3_accept_#t~mem60, ssl3_accept_#t~mem61, ssl3_accept_#t~mem62, ssl3_accept_#t~mem132.base, ssl3_accept_#t~mem63, ssl3_accept_#t~mem150.base, ssl3_accept_#t~mem49, ssl3_accept_#t~mem48, ssl3_accept_#t~mem47, ssl3_accept_#t~mem46, #memory_int, ssl3_accept_#t~mem64, ssl3_accept_#t~mem65, ssl3_accept_#t~mem66, ssl3_accept_#t~mem67, ssl3_accept_#t~mem68, #memory_$Pointer$.offset, ssl3_accept_~state~0] {29662#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:09,932 INFO L290 TraceCheckUtils]: 17: Hoare triple {29662#(= ssl3_accept_~blastFlag~0 0)} [695] L1168_primed-->L1168: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29662#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:09,932 INFO L290 TraceCheckUtils]: 18: Hoare triple {29662#(= ssl3_accept_~blastFlag~0 0)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {29662#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:09,932 INFO L290 TraceCheckUtils]: 19: Hoare triple {29662#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {29662#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:09,933 INFO L290 TraceCheckUtils]: 20: Hoare triple {29662#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {29662#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:09,933 INFO L290 TraceCheckUtils]: 21: Hoare triple {29662#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {29662#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:09,933 INFO L290 TraceCheckUtils]: 22: Hoare triple {29662#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {29662#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:09,934 INFO L290 TraceCheckUtils]: 23: Hoare triple {29662#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {29662#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:09,934 INFO L290 TraceCheckUtils]: 24: Hoare triple {29662#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {29662#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:09,934 INFO L290 TraceCheckUtils]: 25: Hoare triple {29662#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {29662#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:09,935 INFO L290 TraceCheckUtils]: 26: Hoare triple {29662#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {29662#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:09,935 INFO L290 TraceCheckUtils]: 27: Hoare triple {29662#(= ssl3_accept_~blastFlag~0 0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {29662#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:09,935 INFO L290 TraceCheckUtils]: 28: Hoare triple {29662#(= ssl3_accept_~blastFlag~0 0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {29662#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:09,936 INFO L290 TraceCheckUtils]: 29: Hoare triple {29662#(= ssl3_accept_~blastFlag~0 0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {29662#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:09,936 INFO L290 TraceCheckUtils]: 30: Hoare triple {29662#(= ssl3_accept_~blastFlag~0 0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {29662#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:09,936 INFO L290 TraceCheckUtils]: 31: Hoare triple {29662#(= ssl3_accept_~blastFlag~0 0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {29662#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:09,937 INFO L290 TraceCheckUtils]: 32: Hoare triple {29662#(= ssl3_accept_~blastFlag~0 0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {29662#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:09,937 INFO L290 TraceCheckUtils]: 33: Hoare triple {29662#(= ssl3_accept_~blastFlag~0 0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {29662#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:09,938 INFO L290 TraceCheckUtils]: 34: Hoare triple {29662#(= ssl3_accept_~blastFlag~0 0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {29662#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:09,938 INFO L290 TraceCheckUtils]: 35: Hoare triple {29662#(= ssl3_accept_~blastFlag~0 0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {29662#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:09,938 INFO L290 TraceCheckUtils]: 36: Hoare triple {29662#(= ssl3_accept_~blastFlag~0 0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {29662#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:09,939 INFO L290 TraceCheckUtils]: 37: Hoare triple {29662#(= ssl3_accept_~blastFlag~0 0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {29662#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:09,939 INFO L290 TraceCheckUtils]: 38: Hoare triple {29662#(= ssl3_accept_~blastFlag~0 0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {29662#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:09,940 INFO L290 TraceCheckUtils]: 39: Hoare triple {29662#(= ssl3_accept_~blastFlag~0 0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {29662#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:09,940 INFO L290 TraceCheckUtils]: 40: Hoare triple {29662#(= ssl3_accept_~blastFlag~0 0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {29662#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:09,940 INFO L290 TraceCheckUtils]: 41: Hoare triple {29662#(= ssl3_accept_~blastFlag~0 0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {29662#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:09,941 INFO L290 TraceCheckUtils]: 42: Hoare triple {29662#(= ssl3_accept_~blastFlag~0 0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {29662#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:09,942 INFO L290 TraceCheckUtils]: 43: Hoare triple {29662#(= ssl3_accept_~blastFlag~0 0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {29662#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:09,942 INFO L290 TraceCheckUtils]: 44: Hoare triple {29662#(= ssl3_accept_~blastFlag~0 0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {29662#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:09,942 INFO L290 TraceCheckUtils]: 45: Hoare triple {29662#(= ssl3_accept_~blastFlag~0 0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {29662#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:09,943 INFO L290 TraceCheckUtils]: 46: Hoare triple {29662#(= ssl3_accept_~blastFlag~0 0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {29662#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:09,943 INFO L290 TraceCheckUtils]: 47: Hoare triple {29662#(= ssl3_accept_~blastFlag~0 0)} assume 8640 == #t~mem75;havoc #t~mem75; {29662#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:09,944 INFO L290 TraceCheckUtils]: 48: Hoare triple {29662#(= ssl3_accept_~blastFlag~0 0)} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {29662#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:09,944 INFO L290 TraceCheckUtils]: 49: Hoare triple {29662#(= ssl3_accept_~blastFlag~0 0)} assume !(4 == ~blastFlag~0); {29662#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:09,944 INFO L290 TraceCheckUtils]: 50: Hoare triple {29662#(= ssl3_accept_~blastFlag~0 0)} assume 7 == ~blastFlag~0; {29658#false} is VALID [2022-04-08 08:44:09,945 INFO L290 TraceCheckUtils]: 51: Hoare triple {29658#false} assume !false; {29658#false} is VALID [2022-04-08 08:44:09,945 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 08:44:09,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:44:09,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519547542] [2022-04-08 08:44:09,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519547542] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:44:09,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:44:09,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:44:13,567 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:44:13,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [307717650] [2022-04-08 08:44:13,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [307717650] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:44:13,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:44:13,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 08:44:13,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355053200] [2022-04-08 08:44:13,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:44:13,568 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 1 states have call successors, (3), 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 95 [2022-04-08 08:44:13,568 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:44:13,568 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have 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:44:13,644 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:44:13,644 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 08:44:13,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:44:13,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 08:44:13,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=182, Unknown=1, NotChecked=0, Total=240 [2022-04-08 08:44:13,645 INFO L87 Difference]: Start difference. First operand 445 states and 714 transitions. Second operand has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have 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:44:17,483 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:44:25,014 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:44:26,934 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:44:29,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:29,901 INFO L93 Difference]: Finished difference Result 676 states and 1088 transitions. [2022-04-08 08:44:29,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 08:44:29,901 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 1 states have call successors, (3), 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 95 [2022-04-08 08:44:29,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:44:29,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have 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:44:29,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 584 transitions. [2022-04-08 08:44:29,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have 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:44:29,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 584 transitions. [2022-04-08 08:44:29,905 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 584 transitions. [2022-04-08 08:44:30,277 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 584 edges. 584 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:44:30,287 INFO L225 Difference]: With dead ends: 676 [2022-04-08 08:44:30,287 INFO L226 Difference]: Without dead ends: 455 [2022-04-08 08:44:30,287 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=57, Invalid=182, Unknown=1, NotChecked=0, Total=240 [2022-04-08 08:44:30,288 INFO L913 BasicCegarLoop]: 184 mSDtfsCounter, 136 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 138 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:44:30,288 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 962 Invalid, 964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 819 Invalid, 1 Unknown, 138 Unchecked, 8.0s Time] [2022-04-08 08:44:30,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2022-04-08 08:44:30,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 445. [2022-04-08 08:44:30,303 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:44:30,303 INFO L82 GeneralOperation]: Start isEquivalent. First operand 455 states. Second operand has 445 states, 440 states have (on average 1.6136363636363635) internal successors, (710), 440 states have internal predecessors, (710), 3 states have call successors, (3), 3 states have 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:44:30,304 INFO L74 IsIncluded]: Start isIncluded. First operand 455 states. Second operand has 445 states, 440 states have (on average 1.6136363636363635) internal successors, (710), 440 states have internal predecessors, (710), 3 states have call successors, (3), 3 states have 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:44:30,304 INFO L87 Difference]: Start difference. First operand 455 states. Second operand has 445 states, 440 states have (on average 1.6136363636363635) internal successors, (710), 440 states have internal predecessors, (710), 3 states have call successors, (3), 3 states have 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:44:30,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:30,312 INFO L93 Difference]: Finished difference Result 455 states and 726 transitions. [2022-04-08 08:44:30,312 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 726 transitions. [2022-04-08 08:44:30,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:44:30,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:44:30,313 INFO L74 IsIncluded]: Start isIncluded. First operand has 445 states, 440 states have (on average 1.6136363636363635) internal successors, (710), 440 states have internal predecessors, (710), 3 states have call successors, (3), 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 455 states. [2022-04-08 08:44:30,314 INFO L87 Difference]: Start difference. First operand has 445 states, 440 states have (on average 1.6136363636363635) internal successors, (710), 440 states have internal predecessors, (710), 3 states have call successors, (3), 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 455 states. [2022-04-08 08:44:30,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:30,322 INFO L93 Difference]: Finished difference Result 455 states and 726 transitions. [2022-04-08 08:44:30,322 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 726 transitions. [2022-04-08 08:44:30,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:44:30,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:44:30,322 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:44:30,322 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:44:30,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 440 states have (on average 1.6136363636363635) internal successors, (710), 440 states have internal predecessors, (710), 3 states have call successors, (3), 3 states have 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:44:30,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 714 transitions. [2022-04-08 08:44:30,332 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 714 transitions. Word has length 95 [2022-04-08 08:44:30,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:44:30,332 INFO L478 AbstractCegarLoop]: Abstraction has 445 states and 714 transitions. [2022-04-08 08:44:30,333 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have 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:44:30,333 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 445 states and 714 transitions. [2022-04-08 08:44:31,694 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 714 edges. 714 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:44:31,694 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 714 transitions. [2022-04-08 08:44:31,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-04-08 08:44:31,704 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:44:31,705 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:44:31,705 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-08 08:44:31,705 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:44:31,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:44:31,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1724369972, now seen corresponding path program 1 times [2022-04-08 08:44:31,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:44:31,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1902775424] [2022-04-08 08:44:31,945 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:44:31,945 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:44:31,945 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:44:31,946 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 08:44:31,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1981009627, now seen corresponding path program 1 times [2022-04-08 08:44:31,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:44:31,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295061897] [2022-04-08 08:44:31,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:44:31,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:44:32,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:44:32,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:44:32,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:44:32,076 INFO L290 TraceCheckUtils]: 0: Hoare triple {32836#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {32830#true} is VALID [2022-04-08 08:44:32,076 INFO L290 TraceCheckUtils]: 1: Hoare triple {32830#true} assume true; {32830#true} is VALID [2022-04-08 08:44:32,076 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32830#true} {32830#true} #678#return; {32830#true} is VALID [2022-04-08 08:44:32,077 INFO L272 TraceCheckUtils]: 0: Hoare triple {32830#true} call ULTIMATE.init(); {32836#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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:44:32,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {32836#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {32830#true} is VALID [2022-04-08 08:44:32,077 INFO L290 TraceCheckUtils]: 2: Hoare triple {32830#true} assume true; {32830#true} is VALID [2022-04-08 08:44:32,077 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32830#true} {32830#true} #678#return; {32830#true} is VALID [2022-04-08 08:44:32,077 INFO L272 TraceCheckUtils]: 4: Hoare triple {32830#true} call #t~ret161 := main(); {32830#true} is VALID [2022-04-08 08:44:32,077 INFO L290 TraceCheckUtils]: 5: Hoare triple {32830#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {32830#true} is VALID [2022-04-08 08:44:32,078 INFO L290 TraceCheckUtils]: 6: Hoare triple {32830#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {32830#true} is VALID [2022-04-08 08:44:32,078 INFO L272 TraceCheckUtils]: 7: Hoare triple {32830#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {32830#true} is VALID [2022-04-08 08:44:32,078 INFO L290 TraceCheckUtils]: 8: Hoare triple {32830#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {32835#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:32,078 INFO L290 TraceCheckUtils]: 9: Hoare triple {32835#(= ssl3_accept_~blastFlag~0 0)} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {32835#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:32,078 INFO L290 TraceCheckUtils]: 10: Hoare triple {32835#(= ssl3_accept_~blastFlag~0 0)} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {32835#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:32,079 INFO L290 TraceCheckUtils]: 11: Hoare triple {32835#(= 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)))); {32835#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:32,079 INFO L290 TraceCheckUtils]: 12: Hoare triple {32835#(= ssl3_accept_~blastFlag~0 0)} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {32835#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:32,079 INFO L290 TraceCheckUtils]: 13: Hoare triple {32835#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {32835#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:32,080 INFO L290 TraceCheckUtils]: 14: Hoare triple {32835#(= ssl3_accept_~blastFlag~0 0)} [700] L1167-2-->L1168_primed: Formula: true InVars {} OutVars{ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_38|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_409|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_38|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_38|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_56|, ssl3_accept_#t~mem51=|v_ssl3_accept_#t~mem51_34|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_54|, ssl3_accept_#t~mem50=|v_ssl3_accept_#t~mem50_48|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_22|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_38|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_50|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_58|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_54|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_60|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_34|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_44, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_22|, #memory_int=|v_#memory_int_392|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_22|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_409|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_36} AuxVars[] AssignedVars[ssl3_accept_#t~mem83.base, #memory_$Pointer$.base, ssl3_accept_#t~mem82, ssl3_accept_#t~mem85, ssl3_accept_#t~mem151, ssl3_accept_#t~mem51, ssl3_accept_#t~mem150.base, ssl3_accept_#t~mem50, ssl3_accept_#t~mem88.base, ssl3_accept_#t~mem83.offset, ssl3_accept_#t~mem49, ssl3_accept_#t~mem48, ssl3_accept_#t~mem150.offset, ssl3_accept_#t~mem47, ssl3_accept_#t~mem46, ssl3_accept_~skip~0, ssl3_accept_#t~mem88.offset, #memory_int, ssl3_accept_#t~mem89, #memory_$Pointer$.offset, ssl3_accept_~state~0] {32835#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:32,080 INFO L290 TraceCheckUtils]: 15: Hoare triple {32835#(= ssl3_accept_~blastFlag~0 0)} [701] L1168_primed-->L1167-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32835#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:32,080 INFO L290 TraceCheckUtils]: 16: Hoare triple {32835#(= ssl3_accept_~blastFlag~0 0)} [702] L1167-2-->L1168_primed: Formula: (or (and (= v_ssl3_accept_~s.base_122 v_ssl3_accept_~s.base_122) (= |v_#memory_$Pointer$.base_416| |v_#memory_$Pointer$.base_415|) (= |v_#memory_$Pointer$.offset_416| |v_#memory_$Pointer$.offset_415|) (= v_ssl3_accept_~num1~0_17 v_ssl3_accept_~num1~0_17) (= v_ssl3_accept_~s.offset_122 v_ssl3_accept_~s.offset_122) (= |v_#memory_int_398| |v_#memory_int_397|)) (let ((.cse6 (select |v_#memory_int_398| v_ssl3_accept_~s.base_122)) (.cse2 (+ 52 v_ssl3_accept_~s.offset_122))) (let ((.cse1 (select |v_#memory_$Pointer$.base_416| v_ssl3_accept_~s.base_122)) (.cse4 (select |v_#memory_$Pointer$.offset_416| v_ssl3_accept_~s.base_122)) (.cse0 (select .cse6 .cse2)) (.cse3 (select |v_#memory_$Pointer$.base_415| v_ssl3_accept_~s.base_122)) (.cse5 (select |v_#memory_$Pointer$.offset_415| v_ssl3_accept_~s.base_122)) (.cse7 (+ 84 v_ssl3_accept_~s.offset_122))) (and (not (= 8497 .cse0)) (= (store |v_#memory_$Pointer$.base_416| v_ssl3_accept_~s.base_122 (store .cse1 .cse2 (select .cse3 .cse2))) |v_#memory_$Pointer$.base_415|) (= 8448 .cse0) (not (= 24576 .cse0)) (= .cse0 v_ssl3_accept_~state~0_37) (not (= .cse0 8544)) (not (= .cse0 8496)) (not (= 8466 .cse0)) (not (= .cse0 8195)) (not (< 0 v_ssl3_accept_~num1~0_17)) (not (= .cse0 8480)) (not (= .cse0 8545)) (= (store |v_#memory_$Pointer$.offset_416| v_ssl3_accept_~s.base_122 (store .cse4 .cse2 (select .cse5 .cse2))) |v_#memory_$Pointer$.offset_415|) (= (store |v_#memory_int_398| v_ssl3_accept_~s.base_122 (store .cse6 .cse2 (select (select |v_#memory_int_398| (select .cse1 .cse7)) (+ (select .cse4 .cse7) 844)))) |v_#memory_int_397|) (not (= .cse0 8529)) (not (= .cse0 8481)) (not (= 12292 .cse0)) (not (= .cse0 8465)) (not (= .cse0 8528)) (not (= .cse0 8512)) (not (= .cse0 8561)) (not (= 8192 .cse0)) (not (= .cse0 8482)) (not (= 8560 .cse0)) (= v_ssl3_accept_~skip~0_45 0) (not (= 8513 .cse0)) (not (= 8464 .cse0)) (not (= .cse0 16384)) (not (= (select (select |v_#memory_int_397| (select .cse3 .cse7)) (+ 848 (select .cse5 .cse7))) 0)))))) InVars {ssl3_accept_~s.offset=v_ssl3_accept_~s.offset_122, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_416|, ssl3_accept_~num1~0=v_ssl3_accept_~num1~0_17, #memory_int=|v_#memory_int_398|, ssl3_accept_~s.base=v_ssl3_accept_~s.base_122, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_416|} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_415|, ssl3_accept_~num1~0=v_ssl3_accept_~num1~0_17, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_58|, ssl3_accept_#t~mem52=|v_ssl3_accept_#t~mem52_28|, ssl3_accept_#t~mem51=|v_ssl3_accept_#t~mem51_36|, ssl3_accept_#t~mem50=|v_ssl3_accept_#t~mem50_50|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_56|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_45, ssl3_accept_#t~mem53=|v_ssl3_accept_#t~mem53_26|, ssl3_accept_#t~mem54=|v_ssl3_accept_#t~mem54_26|, ssl3_accept_#t~mem55=|v_ssl3_accept_#t~mem55_26|, ssl3_accept_#t~mem133=|v_ssl3_accept_#t~mem133_13|, ssl3_accept_#t~mem56=|v_ssl3_accept_#t~mem56_26|, ssl3_accept_#t~mem57=|v_ssl3_accept_#t~mem57_26|, ssl3_accept_#t~mem132.offset=|v_ssl3_accept_#t~mem132.offset_13|, ssl3_accept_#t~mem58=|v_ssl3_accept_#t~mem58_26|, ssl3_accept_#t~mem59=|v_ssl3_accept_#t~mem59_26|, ssl3_accept_~s.offset=v_ssl3_accept_~s.offset_122, ssl3_accept_#t~mem60=|v_ssl3_accept_#t~mem60_26|, ssl3_accept_#t~mem61=|v_ssl3_accept_#t~mem61_26|, ssl3_accept_#t~mem62=|v_ssl3_accept_#t~mem62_26|, ssl3_accept_#t~mem132.base=|v_ssl3_accept_#t~mem132.base_13|, ssl3_accept_#t~mem63=|v_ssl3_accept_#t~mem63_26|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_56|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_52|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_60|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_62|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_35|, #memory_int=|v_#memory_int_397|, ssl3_accept_#t~mem64=|v_ssl3_accept_#t~mem64_26|, ssl3_accept_#t~mem65=|v_ssl3_accept_#t~mem65_26|, ssl3_accept_#t~mem66=|v_ssl3_accept_#t~mem66_26|, ssl3_accept_#t~mem67=|v_ssl3_accept_#t~mem67_26|, ssl3_accept_#t~mem68=|v_ssl3_accept_#t~mem68_26|, ssl3_accept_~s.base=v_ssl3_accept_~s.base_122, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_415|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_37} AuxVars[] AssignedVars[#memory_$Pointer$.base, ssl3_accept_#t~mem151, ssl3_accept_#t~mem52, ssl3_accept_#t~mem51, ssl3_accept_#t~mem50, ssl3_accept_#t~mem150.offset, ssl3_accept_~skip~0, ssl3_accept_#t~mem53, ssl3_accept_#t~mem54, ssl3_accept_#t~mem55, ssl3_accept_#t~mem133, ssl3_accept_#t~mem56, ssl3_accept_#t~mem57, ssl3_accept_#t~mem132.offset, ssl3_accept_#t~mem58, ssl3_accept_#t~mem59, ssl3_accept_#t~mem60, ssl3_accept_#t~mem61, ssl3_accept_#t~mem62, ssl3_accept_#t~mem132.base, ssl3_accept_#t~mem63, ssl3_accept_#t~mem150.base, ssl3_accept_#t~mem49, ssl3_accept_#t~mem48, ssl3_accept_#t~mem47, ssl3_accept_#t~mem46, #memory_int, ssl3_accept_#t~mem64, ssl3_accept_#t~mem65, ssl3_accept_#t~mem66, ssl3_accept_#t~mem67, ssl3_accept_#t~mem68, #memory_$Pointer$.offset, ssl3_accept_~state~0] {32835#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:32,081 INFO L290 TraceCheckUtils]: 17: Hoare triple {32835#(= ssl3_accept_~blastFlag~0 0)} [699] L1168_primed-->L1168: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32835#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:32,081 INFO L290 TraceCheckUtils]: 18: Hoare triple {32835#(= ssl3_accept_~blastFlag~0 0)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {32835#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:32,081 INFO L290 TraceCheckUtils]: 19: Hoare triple {32835#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {32835#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:32,081 INFO L290 TraceCheckUtils]: 20: Hoare triple {32835#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {32835#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:32,082 INFO L290 TraceCheckUtils]: 21: Hoare triple {32835#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {32835#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:32,082 INFO L290 TraceCheckUtils]: 22: Hoare triple {32835#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {32835#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:32,082 INFO L290 TraceCheckUtils]: 23: Hoare triple {32835#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {32835#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:32,083 INFO L290 TraceCheckUtils]: 24: Hoare triple {32835#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {32835#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:32,083 INFO L290 TraceCheckUtils]: 25: Hoare triple {32835#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {32835#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:32,083 INFO L290 TraceCheckUtils]: 26: Hoare triple {32835#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {32835#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:32,083 INFO L290 TraceCheckUtils]: 27: Hoare triple {32835#(= ssl3_accept_~blastFlag~0 0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {32835#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:32,084 INFO L290 TraceCheckUtils]: 28: Hoare triple {32835#(= ssl3_accept_~blastFlag~0 0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {32835#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:32,084 INFO L290 TraceCheckUtils]: 29: Hoare triple {32835#(= ssl3_accept_~blastFlag~0 0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {32835#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:32,084 INFO L290 TraceCheckUtils]: 30: Hoare triple {32835#(= ssl3_accept_~blastFlag~0 0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {32835#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:32,084 INFO L290 TraceCheckUtils]: 31: Hoare triple {32835#(= ssl3_accept_~blastFlag~0 0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {32835#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:32,085 INFO L290 TraceCheckUtils]: 32: Hoare triple {32835#(= ssl3_accept_~blastFlag~0 0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {32835#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:32,085 INFO L290 TraceCheckUtils]: 33: Hoare triple {32835#(= ssl3_accept_~blastFlag~0 0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {32835#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:32,085 INFO L290 TraceCheckUtils]: 34: Hoare triple {32835#(= ssl3_accept_~blastFlag~0 0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {32835#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:32,086 INFO L290 TraceCheckUtils]: 35: Hoare triple {32835#(= ssl3_accept_~blastFlag~0 0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {32835#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:32,086 INFO L290 TraceCheckUtils]: 36: Hoare triple {32835#(= ssl3_accept_~blastFlag~0 0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {32835#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:32,086 INFO L290 TraceCheckUtils]: 37: Hoare triple {32835#(= ssl3_accept_~blastFlag~0 0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {32835#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:32,086 INFO L290 TraceCheckUtils]: 38: Hoare triple {32835#(= ssl3_accept_~blastFlag~0 0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {32835#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:32,087 INFO L290 TraceCheckUtils]: 39: Hoare triple {32835#(= ssl3_accept_~blastFlag~0 0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {32835#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:32,087 INFO L290 TraceCheckUtils]: 40: Hoare triple {32835#(= ssl3_accept_~blastFlag~0 0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {32835#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:32,087 INFO L290 TraceCheckUtils]: 41: Hoare triple {32835#(= ssl3_accept_~blastFlag~0 0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {32835#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:32,087 INFO L290 TraceCheckUtils]: 42: Hoare triple {32835#(= ssl3_accept_~blastFlag~0 0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {32835#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:32,088 INFO L290 TraceCheckUtils]: 43: Hoare triple {32835#(= ssl3_accept_~blastFlag~0 0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {32835#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:32,088 INFO L290 TraceCheckUtils]: 44: Hoare triple {32835#(= ssl3_accept_~blastFlag~0 0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {32835#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:32,088 INFO L290 TraceCheckUtils]: 45: Hoare triple {32835#(= ssl3_accept_~blastFlag~0 0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {32835#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:32,088 INFO L290 TraceCheckUtils]: 46: Hoare triple {32835#(= ssl3_accept_~blastFlag~0 0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {32835#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:32,089 INFO L290 TraceCheckUtils]: 47: Hoare triple {32835#(= ssl3_accept_~blastFlag~0 0)} assume 8640 == #t~mem75;havoc #t~mem75; {32835#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:32,089 INFO L290 TraceCheckUtils]: 48: Hoare triple {32835#(= ssl3_accept_~blastFlag~0 0)} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {32835#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:32,089 INFO L290 TraceCheckUtils]: 49: Hoare triple {32835#(= ssl3_accept_~blastFlag~0 0)} assume !(4 == ~blastFlag~0); {32835#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:32,090 INFO L290 TraceCheckUtils]: 50: Hoare triple {32835#(= ssl3_accept_~blastFlag~0 0)} assume 7 == ~blastFlag~0; {32831#false} is VALID [2022-04-08 08:44:32,090 INFO L290 TraceCheckUtils]: 51: Hoare triple {32831#false} assume !false; {32831#false} is VALID [2022-04-08 08:44:32,090 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 08:44:32,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:44:32,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295061897] [2022-04-08 08:44:32,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295061897] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:44:32,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:44:32,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:44:35,452 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:44:35,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1902775424] [2022-04-08 08:44:35,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1902775424] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:44:35,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:44:35,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 08:44:35,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963552310] [2022-04-08 08:44:35,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:44:35,453 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 1 states have call successors, (3), 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 95 [2022-04-08 08:44:35,453 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:44:35,454 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have 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:44:35,532 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:44:35,532 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 08:44:35,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:44:35,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 08:44:35,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=182, Unknown=1, NotChecked=0, Total=240 [2022-04-08 08:44:35,533 INFO L87 Difference]: Start difference. First operand 445 states and 714 transitions. Second operand has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have 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:44:39,334 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:44:41,701 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:44:46,026 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:44:48,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:48,923 INFO L93 Difference]: Finished difference Result 676 states and 1088 transitions. [2022-04-08 08:44:48,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 08:44:48,923 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 1 states have call successors, (3), 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 95 [2022-04-08 08:44:48,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:44:48,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have 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:44:48,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 430 transitions. [2022-04-08 08:44:48,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have 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:44:48,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 430 transitions. [2022-04-08 08:44:48,926 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 430 transitions. [2022-04-08 08:44:49,196 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:44:49,205 INFO L225 Difference]: With dead ends: 676 [2022-04-08 08:44:49,205 INFO L226 Difference]: Without dead ends: 455 [2022-04-08 08:44:49,206 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=57, Invalid=182, Unknown=1, NotChecked=0, Total=240 [2022-04-08 08:44:49,206 INFO L913 BasicCegarLoop]: 201 mSDtfsCounter, 8 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 171 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-04-08 08:44:49,206 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 773 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 597 Invalid, 0 Unknown, 171 Unchecked, 6.6s Time] [2022-04-08 08:44:49,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2022-04-08 08:44:49,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 447. [2022-04-08 08:44:49,221 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:44:49,222 INFO L82 GeneralOperation]: Start isEquivalent. First operand 455 states. Second operand has 447 states, 442 states have (on average 1.6131221719457014) internal successors, (713), 442 states have internal predecessors, (713), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:49,222 INFO L74 IsIncluded]: Start isIncluded. First operand 455 states. Second operand has 447 states, 442 states have (on average 1.6131221719457014) internal successors, (713), 442 states have internal predecessors, (713), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:49,223 INFO L87 Difference]: Start difference. First operand 455 states. Second operand has 447 states, 442 states have (on average 1.6131221719457014) internal successors, (713), 442 states have internal predecessors, (713), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:49,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:49,231 INFO L93 Difference]: Finished difference Result 455 states and 726 transitions. [2022-04-08 08:44:49,231 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 726 transitions. [2022-04-08 08:44:49,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:44:49,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:44:49,233 INFO L74 IsIncluded]: Start isIncluded. First operand has 447 states, 442 states have (on average 1.6131221719457014) internal successors, (713), 442 states have internal predecessors, (713), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 455 states. [2022-04-08 08:44:49,233 INFO L87 Difference]: Start difference. First operand has 447 states, 442 states have (on average 1.6131221719457014) internal successors, (713), 442 states have internal predecessors, (713), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 455 states. [2022-04-08 08:44:49,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:49,241 INFO L93 Difference]: Finished difference Result 455 states and 726 transitions. [2022-04-08 08:44:49,241 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 726 transitions. [2022-04-08 08:44:49,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:44:49,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:44:49,242 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:44:49,242 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:44:49,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 442 states have (on average 1.6131221719457014) internal successors, (713), 442 states have internal predecessors, (713), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:49,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 717 transitions. [2022-04-08 08:44:49,252 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 717 transitions. Word has length 95 [2022-04-08 08:44:49,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:44:49,252 INFO L478 AbstractCegarLoop]: Abstraction has 447 states and 717 transitions. [2022-04-08 08:44:49,252 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have 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:44:49,252 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 447 states and 717 transitions. [2022-04-08 08:44:51,043 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 717 edges. 717 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:44:51,043 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 717 transitions. [2022-04-08 08:44:51,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-04-08 08:44:51,044 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:44:51,044 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:44:51,044 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-08 08:44:51,045 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:44:51,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:44:51,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1613927131, now seen corresponding path program 1 times [2022-04-08 08:44:51,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:44:51,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1009754802] [2022-04-08 08:44:51,086 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:44:51,087 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:44:51,087 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:44:51,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1613927131, now seen corresponding path program 2 times [2022-04-08 08:44:51,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:44:51,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662954287] [2022-04-08 08:44:51,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:44:51,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:44:51,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:44:51,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:44:51,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:44:51,226 INFO L290 TraceCheckUtils]: 0: Hoare triple {36014#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {36007#true} is VALID [2022-04-08 08:44:51,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {36007#true} assume true; {36007#true} is VALID [2022-04-08 08:44:51,227 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36007#true} {36007#true} #678#return; {36007#true} is VALID [2022-04-08 08:44:51,228 INFO L272 TraceCheckUtils]: 0: Hoare triple {36007#true} call ULTIMATE.init(); {36014#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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:44:51,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {36014#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {36007#true} is VALID [2022-04-08 08:44:51,228 INFO L290 TraceCheckUtils]: 2: Hoare triple {36007#true} assume true; {36007#true} is VALID [2022-04-08 08:44:51,228 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36007#true} {36007#true} #678#return; {36007#true} is VALID [2022-04-08 08:44:51,228 INFO L272 TraceCheckUtils]: 4: Hoare triple {36007#true} call #t~ret161 := main(); {36007#true} is VALID [2022-04-08 08:44:51,228 INFO L290 TraceCheckUtils]: 5: Hoare triple {36007#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {36007#true} is VALID [2022-04-08 08:44:51,228 INFO L290 TraceCheckUtils]: 6: Hoare triple {36007#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {36007#true} is VALID [2022-04-08 08:44:51,228 INFO L272 TraceCheckUtils]: 7: Hoare triple {36007#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {36007#true} is VALID [2022-04-08 08:44:51,228 INFO L290 TraceCheckUtils]: 8: Hoare triple {36007#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {36007#true} is VALID [2022-04-08 08:44:51,228 INFO L290 TraceCheckUtils]: 9: Hoare triple {36007#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {36007#true} is VALID [2022-04-08 08:44:51,228 INFO L290 TraceCheckUtils]: 10: Hoare triple {36007#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {36007#true} is VALID [2022-04-08 08:44:51,228 INFO L290 TraceCheckUtils]: 11: Hoare triple {36007#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {36007#true} is VALID [2022-04-08 08:44:51,228 INFO L290 TraceCheckUtils]: 12: Hoare triple {36007#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {36007#true} is VALID [2022-04-08 08:44:51,229 INFO L290 TraceCheckUtils]: 13: Hoare triple {36007#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {36007#true} is VALID [2022-04-08 08:44:51,229 INFO L290 TraceCheckUtils]: 14: Hoare triple {36007#true} assume !false; {36007#true} is VALID [2022-04-08 08:44:51,229 INFO L290 TraceCheckUtils]: 15: Hoare triple {36007#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {36007#true} is VALID [2022-04-08 08:44:51,229 INFO L290 TraceCheckUtils]: 16: Hoare triple {36007#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {36007#true} is VALID [2022-04-08 08:44:51,229 INFO L290 TraceCheckUtils]: 17: Hoare triple {36007#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {36007#true} is VALID [2022-04-08 08:44:51,229 INFO L290 TraceCheckUtils]: 18: Hoare triple {36007#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {36007#true} is VALID [2022-04-08 08:44:51,229 INFO L290 TraceCheckUtils]: 19: Hoare triple {36007#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {36007#true} is VALID [2022-04-08 08:44:51,229 INFO L290 TraceCheckUtils]: 20: Hoare triple {36007#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {36007#true} is VALID [2022-04-08 08:44:51,229 INFO L290 TraceCheckUtils]: 21: Hoare triple {36007#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {36007#true} is VALID [2022-04-08 08:44:51,229 INFO L290 TraceCheckUtils]: 22: Hoare triple {36007#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {36007#true} is VALID [2022-04-08 08:44:51,229 INFO L290 TraceCheckUtils]: 23: Hoare triple {36007#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {36007#true} is VALID [2022-04-08 08:44:51,229 INFO L290 TraceCheckUtils]: 24: Hoare triple {36007#true} assume 8464 == #t~mem55;havoc #t~mem55; {36007#true} is VALID [2022-04-08 08:44:51,229 INFO L290 TraceCheckUtils]: 25: Hoare triple {36007#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {36007#true} is VALID [2022-04-08 08:44:51,230 INFO L290 TraceCheckUtils]: 26: Hoare triple {36007#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {36007#true} is VALID [2022-04-08 08:44:51,231 INFO L290 TraceCheckUtils]: 27: Hoare triple {36007#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); {36012#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:51,231 INFO L290 TraceCheckUtils]: 28: Hoare triple {36012#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {36012#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:51,231 INFO L290 TraceCheckUtils]: 29: Hoare triple {36012#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {36012#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:51,232 INFO L290 TraceCheckUtils]: 30: Hoare triple {36012#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {36012#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:51,232 INFO L290 TraceCheckUtils]: 31: Hoare triple {36012#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {36012#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:51,232 INFO L290 TraceCheckUtils]: 32: Hoare triple {36012#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {36012#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:51,233 INFO L290 TraceCheckUtils]: 33: Hoare triple {36012#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {36012#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:51,233 INFO L290 TraceCheckUtils]: 34: Hoare triple {36012#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {36012#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:51,234 INFO L290 TraceCheckUtils]: 35: Hoare triple {36012#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {36012#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:51,234 INFO L290 TraceCheckUtils]: 36: Hoare triple {36012#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {36012#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:51,234 INFO L290 TraceCheckUtils]: 37: Hoare triple {36012#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {36012#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:51,235 INFO L290 TraceCheckUtils]: 38: Hoare triple {36012#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {36012#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:51,235 INFO L290 TraceCheckUtils]: 39: Hoare triple {36012#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {36012#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:51,235 INFO L290 TraceCheckUtils]: 40: Hoare triple {36012#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {36012#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:51,236 INFO L290 TraceCheckUtils]: 41: Hoare triple {36012#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {36012#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:51,236 INFO L290 TraceCheckUtils]: 42: Hoare triple {36012#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {36012#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:51,237 INFO L290 TraceCheckUtils]: 43: Hoare triple {36012#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {36012#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:51,237 INFO L290 TraceCheckUtils]: 44: Hoare triple {36012#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {36012#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:51,237 INFO L290 TraceCheckUtils]: 45: Hoare triple {36012#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {36012#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:51,238 INFO L290 TraceCheckUtils]: 46: Hoare triple {36012#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {36012#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:51,238 INFO L290 TraceCheckUtils]: 47: Hoare triple {36012#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {36012#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:51,238 INFO L290 TraceCheckUtils]: 48: Hoare triple {36012#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {36012#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:51,239 INFO L290 TraceCheckUtils]: 49: Hoare triple {36012#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {36012#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:51,239 INFO L290 TraceCheckUtils]: 50: Hoare triple {36012#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {36012#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:51,239 INFO L290 TraceCheckUtils]: 51: Hoare triple {36012#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {36012#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:51,240 INFO L290 TraceCheckUtils]: 52: Hoare triple {36012#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {36012#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:51,240 INFO L290 TraceCheckUtils]: 53: Hoare triple {36012#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {36013#(not (= 8448 |ssl3_accept_#t~mem68|))} is VALID [2022-04-08 08:44:51,240 INFO L290 TraceCheckUtils]: 54: Hoare triple {36013#(not (= 8448 |ssl3_accept_#t~mem68|))} assume 8448 == #t~mem68;havoc #t~mem68; {36008#false} is VALID [2022-04-08 08:44:51,241 INFO L290 TraceCheckUtils]: 55: Hoare triple {36008#false} assume !(~num1~0 > 0); {36008#false} is VALID [2022-04-08 08:44:51,241 INFO L290 TraceCheckUtils]: 56: Hoare triple {36008#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {36008#false} is VALID [2022-04-08 08:44:51,241 INFO L290 TraceCheckUtils]: 57: Hoare triple {36008#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {36008#false} is VALID [2022-04-08 08:44:51,241 INFO L290 TraceCheckUtils]: 58: Hoare triple {36008#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {36008#false} is VALID [2022-04-08 08:44:51,241 INFO L290 TraceCheckUtils]: 59: Hoare triple {36008#false} ~skip~0 := 0; {36008#false} is VALID [2022-04-08 08:44:51,241 INFO L290 TraceCheckUtils]: 60: Hoare triple {36008#false} assume !false; {36008#false} is VALID [2022-04-08 08:44:51,241 INFO L290 TraceCheckUtils]: 61: Hoare triple {36008#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {36008#false} is VALID [2022-04-08 08:44:51,241 INFO L290 TraceCheckUtils]: 62: Hoare triple {36008#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {36008#false} is VALID [2022-04-08 08:44:51,241 INFO L290 TraceCheckUtils]: 63: Hoare triple {36008#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {36008#false} is VALID [2022-04-08 08:44:51,241 INFO L290 TraceCheckUtils]: 64: Hoare triple {36008#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {36008#false} is VALID [2022-04-08 08:44:51,241 INFO L290 TraceCheckUtils]: 65: Hoare triple {36008#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {36008#false} is VALID [2022-04-08 08:44:51,241 INFO L290 TraceCheckUtils]: 66: Hoare triple {36008#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {36008#false} is VALID [2022-04-08 08:44:51,241 INFO L290 TraceCheckUtils]: 67: Hoare triple {36008#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {36008#false} is VALID [2022-04-08 08:44:51,241 INFO L290 TraceCheckUtils]: 68: Hoare triple {36008#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {36008#false} is VALID [2022-04-08 08:44:51,242 INFO L290 TraceCheckUtils]: 69: Hoare triple {36008#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {36008#false} is VALID [2022-04-08 08:44:51,242 INFO L290 TraceCheckUtils]: 70: Hoare triple {36008#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {36008#false} is VALID [2022-04-08 08:44:51,242 INFO L290 TraceCheckUtils]: 71: Hoare triple {36008#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {36008#false} is VALID [2022-04-08 08:44:51,242 INFO L290 TraceCheckUtils]: 72: Hoare triple {36008#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {36008#false} is VALID [2022-04-08 08:44:51,242 INFO L290 TraceCheckUtils]: 73: Hoare triple {36008#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {36008#false} is VALID [2022-04-08 08:44:51,242 INFO L290 TraceCheckUtils]: 74: Hoare triple {36008#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {36008#false} is VALID [2022-04-08 08:44:51,242 INFO L290 TraceCheckUtils]: 75: Hoare triple {36008#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {36008#false} is VALID [2022-04-08 08:44:51,242 INFO L290 TraceCheckUtils]: 76: Hoare triple {36008#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {36008#false} is VALID [2022-04-08 08:44:51,242 INFO L290 TraceCheckUtils]: 77: Hoare triple {36008#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {36008#false} is VALID [2022-04-08 08:44:51,242 INFO L290 TraceCheckUtils]: 78: Hoare triple {36008#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {36008#false} is VALID [2022-04-08 08:44:51,242 INFO L290 TraceCheckUtils]: 79: Hoare triple {36008#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {36008#false} is VALID [2022-04-08 08:44:51,242 INFO L290 TraceCheckUtils]: 80: Hoare triple {36008#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {36008#false} is VALID [2022-04-08 08:44:51,242 INFO L290 TraceCheckUtils]: 81: Hoare triple {36008#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {36008#false} is VALID [2022-04-08 08:44:51,242 INFO L290 TraceCheckUtils]: 82: Hoare triple {36008#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {36008#false} is VALID [2022-04-08 08:44:51,243 INFO L290 TraceCheckUtils]: 83: Hoare triple {36008#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {36008#false} is VALID [2022-04-08 08:44:51,243 INFO L290 TraceCheckUtils]: 84: Hoare triple {36008#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {36008#false} is VALID [2022-04-08 08:44:51,243 INFO L290 TraceCheckUtils]: 85: Hoare triple {36008#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {36008#false} is VALID [2022-04-08 08:44:51,243 INFO L290 TraceCheckUtils]: 86: Hoare triple {36008#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {36008#false} is VALID [2022-04-08 08:44:51,243 INFO L290 TraceCheckUtils]: 87: Hoare triple {36008#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {36008#false} is VALID [2022-04-08 08:44:51,243 INFO L290 TraceCheckUtils]: 88: Hoare triple {36008#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {36008#false} is VALID [2022-04-08 08:44:51,243 INFO L290 TraceCheckUtils]: 89: Hoare triple {36008#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {36008#false} is VALID [2022-04-08 08:44:51,243 INFO L290 TraceCheckUtils]: 90: Hoare triple {36008#false} assume 8640 == #t~mem75;havoc #t~mem75; {36008#false} is VALID [2022-04-08 08:44:51,243 INFO L290 TraceCheckUtils]: 91: Hoare triple {36008#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {36008#false} is VALID [2022-04-08 08:44:51,243 INFO L290 TraceCheckUtils]: 92: Hoare triple {36008#false} assume !(4 == ~blastFlag~0); {36008#false} is VALID [2022-04-08 08:44:51,243 INFO L290 TraceCheckUtils]: 93: Hoare triple {36008#false} assume 7 == ~blastFlag~0; {36008#false} is VALID [2022-04-08 08:44:51,243 INFO L290 TraceCheckUtils]: 94: Hoare triple {36008#false} assume !false; {36008#false} is VALID [2022-04-08 08:44:51,244 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:44:51,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:44:51,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662954287] [2022-04-08 08:44:51,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662954287] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:44:51,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:44:51,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:44:51,244 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:44:51,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1009754802] [2022-04-08 08:44:51,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1009754802] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:44:51,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:44:51,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:44:51,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775110852] [2022-04-08 08:44:51,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:44:51,245 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 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 95 [2022-04-08 08:44:51,245 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:44:51,245 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have 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:44:51,310 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:44:51,310 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:44:51,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:44:51,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:44:51,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:44:51,311 INFO L87 Difference]: Start difference. First operand 447 states and 717 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have 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:45:00,765 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:45:04,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:45:04,707 INFO L93 Difference]: Finished difference Result 1163 states and 1871 transitions. [2022-04-08 08:45:04,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:45:04,707 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 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 95 [2022-04-08 08:45:04,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:45:04,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have 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:45:04,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 577 transitions. [2022-04-08 08:45:04,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have 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:45:04,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 577 transitions. [2022-04-08 08:45:04,711 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 577 transitions. [2022-04-08 08:45:05,104 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 577 edges. 577 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:45:05,124 INFO L225 Difference]: With dead ends: 1163 [2022-04-08 08:45:05,124 INFO L226 Difference]: Without dead ends: 744 [2022-04-08 08:45:05,125 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:45:05,125 INFO L913 BasicCegarLoop]: 251 mSDtfsCounter, 123 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-04-08 08:45:05,125 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 604 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-04-08 08:45:05,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2022-04-08 08:45:05,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 575. [2022-04-08 08:45:05,146 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:45:05,147 INFO L82 GeneralOperation]: Start isEquivalent. First operand 744 states. Second operand has 575 states, 570 states have (on average 1.643859649122807) internal successors, (937), 570 states have internal predecessors, (937), 3 states have call successors, (3), 3 states have 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:45:05,147 INFO L74 IsIncluded]: Start isIncluded. First operand 744 states. Second operand has 575 states, 570 states have (on average 1.643859649122807) internal successors, (937), 570 states have internal predecessors, (937), 3 states have call successors, (3), 3 states have 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:45:05,148 INFO L87 Difference]: Start difference. First operand 744 states. Second operand has 575 states, 570 states have (on average 1.643859649122807) internal successors, (937), 570 states have internal predecessors, (937), 3 states have call successors, (3), 3 states have 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:45:05,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:45:05,164 INFO L93 Difference]: Finished difference Result 744 states and 1186 transitions. [2022-04-08 08:45:05,164 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1186 transitions. [2022-04-08 08:45:05,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:45:05,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:45:05,166 INFO L74 IsIncluded]: Start isIncluded. First operand has 575 states, 570 states have (on average 1.643859649122807) internal successors, (937), 570 states have internal predecessors, (937), 3 states have call successors, (3), 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 744 states. [2022-04-08 08:45:05,166 INFO L87 Difference]: Start difference. First operand has 575 states, 570 states have (on average 1.643859649122807) internal successors, (937), 570 states have internal predecessors, (937), 3 states have call successors, (3), 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 744 states. [2022-04-08 08:45:05,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:45:05,183 INFO L93 Difference]: Finished difference Result 744 states and 1186 transitions. [2022-04-08 08:45:05,183 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1186 transitions. [2022-04-08 08:45:05,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:45:05,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:45:05,184 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:45:05,184 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:45:05,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 570 states have (on average 1.643859649122807) internal successors, (937), 570 states have internal predecessors, (937), 3 states have call successors, (3), 3 states have 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:45:05,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 941 transitions. [2022-04-08 08:45:05,199 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 941 transitions. Word has length 95 [2022-04-08 08:45:05,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:45:05,199 INFO L478 AbstractCegarLoop]: Abstraction has 575 states and 941 transitions. [2022-04-08 08:45:05,199 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have 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:45:05,200 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 575 states and 941 transitions. [2022-04-08 08:45:08,088 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 941 edges. 940 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:45:08,088 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 941 transitions. [2022-04-08 08:45:08,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-04-08 08:45:08,089 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:45:08,089 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-04-08 08:45:08,089 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-08 08:45:08,090 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:45:08,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:45:08,090 INFO L85 PathProgramCache]: Analyzing trace with hash -343569407, now seen corresponding path program 1 times [2022-04-08 08:45:08,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:45:08,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [524125672] [2022-04-08 08:45:08,165 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:45:08,165 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:45:08,165 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:45:08,165 INFO L85 PathProgramCache]: Analyzing trace with hash -343569407, now seen corresponding path program 2 times [2022-04-08 08:45:08,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:45:08,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870286678] [2022-04-08 08:45:08,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:45:08,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:45:08,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:45:08,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:45:08,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:45:08,305 INFO L290 TraceCheckUtils]: 0: Hoare triple {40990#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {40983#true} is VALID [2022-04-08 08:45:08,305 INFO L290 TraceCheckUtils]: 1: Hoare triple {40983#true} assume true; {40983#true} is VALID [2022-04-08 08:45:08,306 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40983#true} {40983#true} #678#return; {40983#true} is VALID [2022-04-08 08:45:08,306 INFO L272 TraceCheckUtils]: 0: Hoare triple {40983#true} call ULTIMATE.init(); {40990#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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:45:08,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {40990#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {40983#true} is VALID [2022-04-08 08:45:08,306 INFO L290 TraceCheckUtils]: 2: Hoare triple {40983#true} assume true; {40983#true} is VALID [2022-04-08 08:45:08,307 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40983#true} {40983#true} #678#return; {40983#true} is VALID [2022-04-08 08:45:08,307 INFO L272 TraceCheckUtils]: 4: Hoare triple {40983#true} call #t~ret161 := main(); {40983#true} is VALID [2022-04-08 08:45:08,307 INFO L290 TraceCheckUtils]: 5: Hoare triple {40983#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {40983#true} is VALID [2022-04-08 08:45:08,307 INFO L290 TraceCheckUtils]: 6: Hoare triple {40983#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {40983#true} is VALID [2022-04-08 08:45:08,307 INFO L272 TraceCheckUtils]: 7: Hoare triple {40983#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {40983#true} is VALID [2022-04-08 08:45:08,307 INFO L290 TraceCheckUtils]: 8: Hoare triple {40983#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {40983#true} is VALID [2022-04-08 08:45:08,307 INFO L290 TraceCheckUtils]: 9: Hoare triple {40983#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {40983#true} is VALID [2022-04-08 08:45:08,307 INFO L290 TraceCheckUtils]: 10: Hoare triple {40983#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {40983#true} is VALID [2022-04-08 08:45:08,307 INFO L290 TraceCheckUtils]: 11: Hoare triple {40983#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {40983#true} is VALID [2022-04-08 08:45:08,307 INFO L290 TraceCheckUtils]: 12: Hoare triple {40983#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {40983#true} is VALID [2022-04-08 08:45:08,307 INFO L290 TraceCheckUtils]: 13: Hoare triple {40983#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {40983#true} is VALID [2022-04-08 08:45:08,307 INFO L290 TraceCheckUtils]: 14: Hoare triple {40983#true} assume !false; {40983#true} is VALID [2022-04-08 08:45:08,307 INFO L290 TraceCheckUtils]: 15: Hoare triple {40983#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {40983#true} is VALID [2022-04-08 08:45:08,307 INFO L290 TraceCheckUtils]: 16: Hoare triple {40983#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {40983#true} is VALID [2022-04-08 08:45:08,308 INFO L290 TraceCheckUtils]: 17: Hoare triple {40983#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {40983#true} is VALID [2022-04-08 08:45:08,308 INFO L290 TraceCheckUtils]: 18: Hoare triple {40983#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {40983#true} is VALID [2022-04-08 08:45:08,308 INFO L290 TraceCheckUtils]: 19: Hoare triple {40983#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {40983#true} is VALID [2022-04-08 08:45:08,308 INFO L290 TraceCheckUtils]: 20: Hoare triple {40983#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {40983#true} is VALID [2022-04-08 08:45:08,308 INFO L290 TraceCheckUtils]: 21: Hoare triple {40983#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {40983#true} is VALID [2022-04-08 08:45:08,308 INFO L290 TraceCheckUtils]: 22: Hoare triple {40983#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {40983#true} is VALID [2022-04-08 08:45:08,308 INFO L290 TraceCheckUtils]: 23: Hoare triple {40983#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {40983#true} is VALID [2022-04-08 08:45:08,308 INFO L290 TraceCheckUtils]: 24: Hoare triple {40983#true} assume 8464 == #t~mem55;havoc #t~mem55; {40983#true} is VALID [2022-04-08 08:45:08,308 INFO L290 TraceCheckUtils]: 25: Hoare triple {40983#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {40983#true} is VALID [2022-04-08 08:45:08,308 INFO L290 TraceCheckUtils]: 26: Hoare triple {40983#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {40983#true} is VALID [2022-04-08 08:45:08,309 INFO L290 TraceCheckUtils]: 27: Hoare triple {40983#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); {40988#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:08,310 INFO L290 TraceCheckUtils]: 28: Hoare triple {40988#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {40988#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:08,310 INFO L290 TraceCheckUtils]: 29: Hoare triple {40988#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {40988#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:08,310 INFO L290 TraceCheckUtils]: 30: Hoare triple {40988#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {40988#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:08,311 INFO L290 TraceCheckUtils]: 31: Hoare triple {40988#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {40988#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:08,311 INFO L290 TraceCheckUtils]: 32: Hoare triple {40988#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {40988#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:08,311 INFO L290 TraceCheckUtils]: 33: Hoare triple {40988#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {40988#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:08,312 INFO L290 TraceCheckUtils]: 34: Hoare triple {40988#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {40988#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:08,312 INFO L290 TraceCheckUtils]: 35: Hoare triple {40988#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {40988#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:08,312 INFO L290 TraceCheckUtils]: 36: Hoare triple {40988#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {40988#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:08,313 INFO L290 TraceCheckUtils]: 37: Hoare triple {40988#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {40988#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:08,313 INFO L290 TraceCheckUtils]: 38: Hoare triple {40988#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {40988#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:08,313 INFO L290 TraceCheckUtils]: 39: Hoare triple {40988#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {40988#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:08,314 INFO L290 TraceCheckUtils]: 40: Hoare triple {40988#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {40988#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:08,314 INFO L290 TraceCheckUtils]: 41: Hoare triple {40988#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {40988#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:08,314 INFO L290 TraceCheckUtils]: 42: Hoare triple {40988#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {40988#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:08,315 INFO L290 TraceCheckUtils]: 43: Hoare triple {40988#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {40989#(= |ssl3_accept_#t~mem58| 8496)} is VALID [2022-04-08 08:45:08,315 INFO L290 TraceCheckUtils]: 44: Hoare triple {40989#(= |ssl3_accept_#t~mem58| 8496)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {40984#false} is VALID [2022-04-08 08:45:08,315 INFO L290 TraceCheckUtils]: 45: Hoare triple {40984#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {40984#false} is VALID [2022-04-08 08:45:08,315 INFO L290 TraceCheckUtils]: 46: Hoare triple {40984#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {40984#false} is VALID [2022-04-08 08:45:08,315 INFO L290 TraceCheckUtils]: 47: Hoare triple {40984#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {40984#false} is VALID [2022-04-08 08:45:08,315 INFO L290 TraceCheckUtils]: 48: Hoare triple {40984#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {40984#false} is VALID [2022-04-08 08:45:08,315 INFO L290 TraceCheckUtils]: 49: Hoare triple {40984#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {40984#false} is VALID [2022-04-08 08:45:08,315 INFO L290 TraceCheckUtils]: 50: Hoare triple {40984#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {40984#false} is VALID [2022-04-08 08:45:08,315 INFO L290 TraceCheckUtils]: 51: Hoare triple {40984#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {40984#false} is VALID [2022-04-08 08:45:08,315 INFO L290 TraceCheckUtils]: 52: Hoare triple {40984#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {40984#false} is VALID [2022-04-08 08:45:08,316 INFO L290 TraceCheckUtils]: 53: Hoare triple {40984#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {40984#false} is VALID [2022-04-08 08:45:08,316 INFO L290 TraceCheckUtils]: 54: Hoare triple {40984#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {40984#false} is VALID [2022-04-08 08:45:08,316 INFO L290 TraceCheckUtils]: 55: Hoare triple {40984#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {40984#false} is VALID [2022-04-08 08:45:08,316 INFO L290 TraceCheckUtils]: 56: Hoare triple {40984#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {40984#false} is VALID [2022-04-08 08:45:08,316 INFO L290 TraceCheckUtils]: 57: Hoare triple {40984#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {40984#false} is VALID [2022-04-08 08:45:08,316 INFO L290 TraceCheckUtils]: 58: Hoare triple {40984#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {40984#false} is VALID [2022-04-08 08:45:08,316 INFO L290 TraceCheckUtils]: 59: Hoare triple {40984#false} assume 8608 == #t~mem73;havoc #t~mem73; {40984#false} is VALID [2022-04-08 08:45:08,316 INFO L290 TraceCheckUtils]: 60: Hoare triple {40984#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {40984#false} is VALID [2022-04-08 08:45:08,316 INFO L290 TraceCheckUtils]: 61: Hoare triple {40984#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {40984#false} is VALID [2022-04-08 08:45:08,316 INFO L290 TraceCheckUtils]: 62: Hoare triple {40984#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {40984#false} is VALID [2022-04-08 08:45:08,316 INFO L290 TraceCheckUtils]: 63: Hoare triple {40984#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {40984#false} is VALID [2022-04-08 08:45:08,316 INFO L290 TraceCheckUtils]: 64: Hoare triple {40984#false} ~skip~0 := 0; {40984#false} is VALID [2022-04-08 08:45:08,316 INFO L290 TraceCheckUtils]: 65: Hoare triple {40984#false} assume !false; {40984#false} is VALID [2022-04-08 08:45:08,317 INFO L290 TraceCheckUtils]: 66: Hoare triple {40984#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {40984#false} is VALID [2022-04-08 08:45:08,317 INFO L290 TraceCheckUtils]: 67: Hoare triple {40984#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {40984#false} is VALID [2022-04-08 08:45:08,317 INFO L290 TraceCheckUtils]: 68: Hoare triple {40984#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {40984#false} is VALID [2022-04-08 08:45:08,317 INFO L290 TraceCheckUtils]: 69: Hoare triple {40984#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {40984#false} is VALID [2022-04-08 08:45:08,317 INFO L290 TraceCheckUtils]: 70: Hoare triple {40984#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {40984#false} is VALID [2022-04-08 08:45:08,317 INFO L290 TraceCheckUtils]: 71: Hoare triple {40984#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {40984#false} is VALID [2022-04-08 08:45:08,317 INFO L290 TraceCheckUtils]: 72: Hoare triple {40984#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {40984#false} is VALID [2022-04-08 08:45:08,317 INFO L290 TraceCheckUtils]: 73: Hoare triple {40984#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {40984#false} is VALID [2022-04-08 08:45:08,317 INFO L290 TraceCheckUtils]: 74: Hoare triple {40984#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {40984#false} is VALID [2022-04-08 08:45:08,317 INFO L290 TraceCheckUtils]: 75: Hoare triple {40984#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {40984#false} is VALID [2022-04-08 08:45:08,317 INFO L290 TraceCheckUtils]: 76: Hoare triple {40984#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {40984#false} is VALID [2022-04-08 08:45:08,317 INFO L290 TraceCheckUtils]: 77: Hoare triple {40984#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {40984#false} is VALID [2022-04-08 08:45:08,317 INFO L290 TraceCheckUtils]: 78: Hoare triple {40984#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {40984#false} is VALID [2022-04-08 08:45:08,317 INFO L290 TraceCheckUtils]: 79: Hoare triple {40984#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {40984#false} is VALID [2022-04-08 08:45:08,318 INFO L290 TraceCheckUtils]: 80: Hoare triple {40984#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {40984#false} is VALID [2022-04-08 08:45:08,318 INFO L290 TraceCheckUtils]: 81: Hoare triple {40984#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {40984#false} is VALID [2022-04-08 08:45:08,318 INFO L290 TraceCheckUtils]: 82: Hoare triple {40984#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {40984#false} is VALID [2022-04-08 08:45:08,318 INFO L290 TraceCheckUtils]: 83: Hoare triple {40984#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {40984#false} is VALID [2022-04-08 08:45:08,318 INFO L290 TraceCheckUtils]: 84: Hoare triple {40984#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {40984#false} is VALID [2022-04-08 08:45:08,318 INFO L290 TraceCheckUtils]: 85: Hoare triple {40984#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {40984#false} is VALID [2022-04-08 08:45:08,318 INFO L290 TraceCheckUtils]: 86: Hoare triple {40984#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {40984#false} is VALID [2022-04-08 08:45:08,318 INFO L290 TraceCheckUtils]: 87: Hoare triple {40984#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {40984#false} is VALID [2022-04-08 08:45:08,318 INFO L290 TraceCheckUtils]: 88: Hoare triple {40984#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {40984#false} is VALID [2022-04-08 08:45:08,318 INFO L290 TraceCheckUtils]: 89: Hoare triple {40984#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {40984#false} is VALID [2022-04-08 08:45:08,318 INFO L290 TraceCheckUtils]: 90: Hoare triple {40984#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {40984#false} is VALID [2022-04-08 08:45:08,318 INFO L290 TraceCheckUtils]: 91: Hoare triple {40984#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {40984#false} is VALID [2022-04-08 08:45:08,318 INFO L290 TraceCheckUtils]: 92: Hoare triple {40984#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {40984#false} is VALID [2022-04-08 08:45:08,318 INFO L290 TraceCheckUtils]: 93: Hoare triple {40984#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {40984#false} is VALID [2022-04-08 08:45:08,319 INFO L290 TraceCheckUtils]: 94: Hoare triple {40984#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {40984#false} is VALID [2022-04-08 08:45:08,319 INFO L290 TraceCheckUtils]: 95: Hoare triple {40984#false} assume 8640 == #t~mem75;havoc #t~mem75; {40984#false} is VALID [2022-04-08 08:45:08,319 INFO L290 TraceCheckUtils]: 96: Hoare triple {40984#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {40984#false} is VALID [2022-04-08 08:45:08,334 INFO L290 TraceCheckUtils]: 97: Hoare triple {40984#false} assume !(4 == ~blastFlag~0); {40984#false} is VALID [2022-04-08 08:45:08,334 INFO L290 TraceCheckUtils]: 98: Hoare triple {40984#false} assume 7 == ~blastFlag~0; {40984#false} is VALID [2022-04-08 08:45:08,334 INFO L290 TraceCheckUtils]: 99: Hoare triple {40984#false} assume !false; {40984#false} is VALID [2022-04-08 08:45:08,335 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-08 08:45:08,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:45:08,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870286678] [2022-04-08 08:45:08,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870286678] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:45:08,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:45:08,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:45:08,335 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:45:08,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [524125672] [2022-04-08 08:45:08,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [524125672] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:45:08,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:45:08,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:45:08,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995012833] [2022-04-08 08:45:08,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:45:08,336 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 100 [2022-04-08 08:45:08,336 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:45:08,336 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:08,394 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:45:08,395 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:45:08,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:45:08,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:45:08,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:45:08,396 INFO L87 Difference]: Start difference. First operand 575 states and 941 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:10,308 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:45:12,313 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:45:15,831 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:45:20,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:45:20,609 INFO L93 Difference]: Finished difference Result 903 states and 1478 transitions. [2022-04-08 08:45:20,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:45:20,609 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 100 [2022-04-08 08:45:20,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:45:20,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:20,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 467 transitions. [2022-04-08 08:45:20,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:20,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 467 transitions. [2022-04-08 08:45:20,613 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 467 transitions. [2022-04-08 08:45:20,905 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 467 edges. 467 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:45:20,919 INFO L225 Difference]: With dead ends: 903 [2022-04-08 08:45:20,919 INFO L226 Difference]: Without dead ends: 618 [2022-04-08 08:45:20,920 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:45:20,920 INFO L913 BasicCegarLoop]: 236 mSDtfsCounter, 32 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-04-08 08:45:20,920 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 581 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 446 Invalid, 1 Unknown, 0 Unchecked, 6.7s Time] [2022-04-08 08:45:20,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2022-04-08 08:45:20,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 597. [2022-04-08 08:45:20,940 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:45:20,941 INFO L82 GeneralOperation]: Start isEquivalent. First operand 618 states. Second operand has 597 states, 592 states have (on average 1.6435810810810811) internal successors, (973), 592 states have internal predecessors, (973), 3 states have call successors, (3), 3 states have 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:45:20,942 INFO L74 IsIncluded]: Start isIncluded. First operand 618 states. Second operand has 597 states, 592 states have (on average 1.6435810810810811) internal successors, (973), 592 states have internal predecessors, (973), 3 states have call successors, (3), 3 states have 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:45:20,942 INFO L87 Difference]: Start difference. First operand 618 states. Second operand has 597 states, 592 states have (on average 1.6435810810810811) internal successors, (973), 592 states have internal predecessors, (973), 3 states have call successors, (3), 3 states have 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:45:20,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:45:20,954 INFO L93 Difference]: Finished difference Result 618 states and 1004 transitions. [2022-04-08 08:45:20,955 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 1004 transitions. [2022-04-08 08:45:20,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:45:20,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:45:20,956 INFO L74 IsIncluded]: Start isIncluded. First operand has 597 states, 592 states have (on average 1.6435810810810811) internal successors, (973), 592 states have internal predecessors, (973), 3 states have call successors, (3), 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 618 states. [2022-04-08 08:45:20,957 INFO L87 Difference]: Start difference. First operand has 597 states, 592 states have (on average 1.6435810810810811) internal successors, (973), 592 states have internal predecessors, (973), 3 states have call successors, (3), 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 618 states. [2022-04-08 08:45:20,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:45:20,969 INFO L93 Difference]: Finished difference Result 618 states and 1004 transitions. [2022-04-08 08:45:20,969 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 1004 transitions. [2022-04-08 08:45:20,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:45:20,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:45:20,970 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:45:20,970 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:45:20,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 592 states have (on average 1.6435810810810811) internal successors, (973), 592 states have internal predecessors, (973), 3 states have call successors, (3), 3 states have 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:45:20,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 977 transitions. [2022-04-08 08:45:20,984 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 977 transitions. Word has length 100 [2022-04-08 08:45:20,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:45:20,985 INFO L478 AbstractCegarLoop]: Abstraction has 597 states and 977 transitions. [2022-04-08 08:45:20,985 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:20,985 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 597 states and 977 transitions. [2022-04-08 08:45:23,865 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 977 edges. 976 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:45:23,865 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 977 transitions. [2022-04-08 08:45:23,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-08 08:45:23,866 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:45:23,866 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:45:23,867 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-08 08:45:23,867 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:45:23,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:45:23,867 INFO L85 PathProgramCache]: Analyzing trace with hash 589060741, now seen corresponding path program 1 times [2022-04-08 08:45:23,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:45:23,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [379059935] [2022-04-08 08:45:23,912 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:45:23,912 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:45:23,912 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:45:23,912 INFO L85 PathProgramCache]: Analyzing trace with hash 589060741, now seen corresponding path program 2 times [2022-04-08 08:45:23,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:45:23,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153213598] [2022-04-08 08:45:23,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:45:23,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:45:23,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:45:24,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:45:24,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:45:24,051 INFO L290 TraceCheckUtils]: 0: Hoare triple {45238#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {45231#true} is VALID [2022-04-08 08:45:24,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {45231#true} assume true; {45231#true} is VALID [2022-04-08 08:45:24,052 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45231#true} {45231#true} #678#return; {45231#true} is VALID [2022-04-08 08:45:24,052 INFO L272 TraceCheckUtils]: 0: Hoare triple {45231#true} call ULTIMATE.init(); {45238#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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:45:24,053 INFO L290 TraceCheckUtils]: 1: Hoare triple {45238#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {45231#true} is VALID [2022-04-08 08:45:24,053 INFO L290 TraceCheckUtils]: 2: Hoare triple {45231#true} assume true; {45231#true} is VALID [2022-04-08 08:45:24,053 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45231#true} {45231#true} #678#return; {45231#true} is VALID [2022-04-08 08:45:24,053 INFO L272 TraceCheckUtils]: 4: Hoare triple {45231#true} call #t~ret161 := main(); {45231#true} is VALID [2022-04-08 08:45:24,053 INFO L290 TraceCheckUtils]: 5: Hoare triple {45231#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {45231#true} is VALID [2022-04-08 08:45:24,053 INFO L290 TraceCheckUtils]: 6: Hoare triple {45231#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {45231#true} is VALID [2022-04-08 08:45:24,053 INFO L272 TraceCheckUtils]: 7: Hoare triple {45231#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {45231#true} is VALID [2022-04-08 08:45:24,055 INFO L290 TraceCheckUtils]: 8: Hoare triple {45231#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {45236#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:24,056 INFO L290 TraceCheckUtils]: 9: Hoare triple {45236#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {45236#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:24,057 INFO L290 TraceCheckUtils]: 10: Hoare triple {45236#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {45236#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:24,057 INFO L290 TraceCheckUtils]: 11: Hoare triple {45236#(= 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)))); {45236#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:24,057 INFO L290 TraceCheckUtils]: 12: Hoare triple {45236#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {45236#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:24,058 INFO L290 TraceCheckUtils]: 13: Hoare triple {45236#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {45236#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:24,058 INFO L290 TraceCheckUtils]: 14: Hoare triple {45236#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {45236#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:24,058 INFO L290 TraceCheckUtils]: 15: Hoare triple {45236#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {45236#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:24,059 INFO L290 TraceCheckUtils]: 16: Hoare triple {45236#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {45236#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:24,059 INFO L290 TraceCheckUtils]: 17: Hoare triple {45236#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {45236#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:24,060 INFO L290 TraceCheckUtils]: 18: Hoare triple {45236#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {45236#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:24,060 INFO L290 TraceCheckUtils]: 19: Hoare triple {45236#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {45237#(= 8464 |ssl3_accept_#t~mem51|)} is VALID [2022-04-08 08:45:24,060 INFO L290 TraceCheckUtils]: 20: Hoare triple {45237#(= 8464 |ssl3_accept_#t~mem51|)} assume 8195 == #t~mem51;havoc #t~mem51; {45232#false} is VALID [2022-04-08 08:45:24,060 INFO L290 TraceCheckUtils]: 21: Hoare triple {45232#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {45232#false} is VALID [2022-04-08 08:45:24,060 INFO L290 TraceCheckUtils]: 22: Hoare triple {45232#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {45232#false} is VALID [2022-04-08 08:45:24,060 INFO L290 TraceCheckUtils]: 23: Hoare triple {45232#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {45232#false} is VALID [2022-04-08 08:45:24,061 INFO L290 TraceCheckUtils]: 24: Hoare triple {45232#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {45232#false} is VALID [2022-04-08 08:45:24,061 INFO L290 TraceCheckUtils]: 25: Hoare triple {45232#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {45232#false} is VALID [2022-04-08 08:45:24,061 INFO L290 TraceCheckUtils]: 26: Hoare triple {45232#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {45232#false} is VALID [2022-04-08 08:45:24,061 INFO L290 TraceCheckUtils]: 27: Hoare triple {45232#false} assume 12292 != #t~mem85;havoc #t~mem85; {45232#false} is VALID [2022-04-08 08:45:24,061 INFO L290 TraceCheckUtils]: 28: Hoare triple {45232#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 52 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem87 := read~int(#t~mem86.base, 72 + #t~mem86.offset, 4);call write~int(1 + #t~mem87, #t~mem86.base, 72 + #t~mem86.offset, 4);havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87; {45232#false} is VALID [2022-04-08 08:45:24,061 INFO L290 TraceCheckUtils]: 29: Hoare triple {45232#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {45232#false} is VALID [2022-04-08 08:45:24,061 INFO L290 TraceCheckUtils]: 30: Hoare triple {45232#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {45232#false} is VALID [2022-04-08 08:45:24,061 INFO L290 TraceCheckUtils]: 31: Hoare triple {45232#false} ~skip~0 := 0; {45232#false} is VALID [2022-04-08 08:45:24,061 INFO L290 TraceCheckUtils]: 32: Hoare triple {45232#false} assume !false; {45232#false} is VALID [2022-04-08 08:45:24,061 INFO L290 TraceCheckUtils]: 33: Hoare triple {45232#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {45232#false} is VALID [2022-04-08 08:45:24,061 INFO L290 TraceCheckUtils]: 34: Hoare triple {45232#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {45232#false} is VALID [2022-04-08 08:45:24,061 INFO L290 TraceCheckUtils]: 35: Hoare triple {45232#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {45232#false} is VALID [2022-04-08 08:45:24,061 INFO L290 TraceCheckUtils]: 36: Hoare triple {45232#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {45232#false} is VALID [2022-04-08 08:45:24,061 INFO L290 TraceCheckUtils]: 37: Hoare triple {45232#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {45232#false} is VALID [2022-04-08 08:45:24,062 INFO L290 TraceCheckUtils]: 38: Hoare triple {45232#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {45232#false} is VALID [2022-04-08 08:45:24,062 INFO L290 TraceCheckUtils]: 39: Hoare triple {45232#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {45232#false} is VALID [2022-04-08 08:45:24,062 INFO L290 TraceCheckUtils]: 40: Hoare triple {45232#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {45232#false} is VALID [2022-04-08 08:45:24,062 INFO L290 TraceCheckUtils]: 41: Hoare triple {45232#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {45232#false} is VALID [2022-04-08 08:45:24,062 INFO L290 TraceCheckUtils]: 42: Hoare triple {45232#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {45232#false} is VALID [2022-04-08 08:45:24,062 INFO L290 TraceCheckUtils]: 43: Hoare triple {45232#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {45232#false} is VALID [2022-04-08 08:45:24,062 INFO L290 TraceCheckUtils]: 44: Hoare triple {45232#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {45232#false} is VALID [2022-04-08 08:45:24,062 INFO L290 TraceCheckUtils]: 45: Hoare triple {45232#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {45232#false} is VALID [2022-04-08 08:45:24,062 INFO L290 TraceCheckUtils]: 46: Hoare triple {45232#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {45232#false} is VALID [2022-04-08 08:45:24,062 INFO L290 TraceCheckUtils]: 47: Hoare triple {45232#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {45232#false} is VALID [2022-04-08 08:45:24,062 INFO L290 TraceCheckUtils]: 48: Hoare triple {45232#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {45232#false} is VALID [2022-04-08 08:45:24,062 INFO L290 TraceCheckUtils]: 49: Hoare triple {45232#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {45232#false} is VALID [2022-04-08 08:45:24,062 INFO L290 TraceCheckUtils]: 50: Hoare triple {45232#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {45232#false} is VALID [2022-04-08 08:45:24,062 INFO L290 TraceCheckUtils]: 51: Hoare triple {45232#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {45232#false} is VALID [2022-04-08 08:45:24,063 INFO L290 TraceCheckUtils]: 52: Hoare triple {45232#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {45232#false} is VALID [2022-04-08 08:45:24,063 INFO L290 TraceCheckUtils]: 53: Hoare triple {45232#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {45232#false} is VALID [2022-04-08 08:45:24,063 INFO L290 TraceCheckUtils]: 54: Hoare triple {45232#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {45232#false} is VALID [2022-04-08 08:45:24,063 INFO L290 TraceCheckUtils]: 55: Hoare triple {45232#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {45232#false} is VALID [2022-04-08 08:45:24,063 INFO L290 TraceCheckUtils]: 56: Hoare triple {45232#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {45232#false} is VALID [2022-04-08 08:45:24,063 INFO L290 TraceCheckUtils]: 57: Hoare triple {45232#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {45232#false} is VALID [2022-04-08 08:45:24,063 INFO L290 TraceCheckUtils]: 58: Hoare triple {45232#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {45232#false} is VALID [2022-04-08 08:45:24,063 INFO L290 TraceCheckUtils]: 59: Hoare triple {45232#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {45232#false} is VALID [2022-04-08 08:45:24,063 INFO L290 TraceCheckUtils]: 60: Hoare triple {45232#false} assume 8608 == #t~mem73;havoc #t~mem73; {45232#false} is VALID [2022-04-08 08:45:24,063 INFO L290 TraceCheckUtils]: 61: Hoare triple {45232#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {45232#false} is VALID [2022-04-08 08:45:24,063 INFO L290 TraceCheckUtils]: 62: Hoare triple {45232#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {45232#false} is VALID [2022-04-08 08:45:24,063 INFO L290 TraceCheckUtils]: 63: Hoare triple {45232#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {45232#false} is VALID [2022-04-08 08:45:24,063 INFO L290 TraceCheckUtils]: 64: Hoare triple {45232#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {45232#false} is VALID [2022-04-08 08:45:24,063 INFO L290 TraceCheckUtils]: 65: Hoare triple {45232#false} ~skip~0 := 0; {45232#false} is VALID [2022-04-08 08:45:24,064 INFO L290 TraceCheckUtils]: 66: Hoare triple {45232#false} assume !false; {45232#false} is VALID [2022-04-08 08:45:24,064 INFO L290 TraceCheckUtils]: 67: Hoare triple {45232#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {45232#false} is VALID [2022-04-08 08:45:24,064 INFO L290 TraceCheckUtils]: 68: Hoare triple {45232#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {45232#false} is VALID [2022-04-08 08:45:24,064 INFO L290 TraceCheckUtils]: 69: Hoare triple {45232#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {45232#false} is VALID [2022-04-08 08:45:24,064 INFO L290 TraceCheckUtils]: 70: Hoare triple {45232#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {45232#false} is VALID [2022-04-08 08:45:24,064 INFO L290 TraceCheckUtils]: 71: Hoare triple {45232#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {45232#false} is VALID [2022-04-08 08:45:24,064 INFO L290 TraceCheckUtils]: 72: Hoare triple {45232#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {45232#false} is VALID [2022-04-08 08:45:24,064 INFO L290 TraceCheckUtils]: 73: Hoare triple {45232#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {45232#false} is VALID [2022-04-08 08:45:24,064 INFO L290 TraceCheckUtils]: 74: Hoare triple {45232#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {45232#false} is VALID [2022-04-08 08:45:24,064 INFO L290 TraceCheckUtils]: 75: Hoare triple {45232#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {45232#false} is VALID [2022-04-08 08:45:24,064 INFO L290 TraceCheckUtils]: 76: Hoare triple {45232#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {45232#false} is VALID [2022-04-08 08:45:24,064 INFO L290 TraceCheckUtils]: 77: Hoare triple {45232#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {45232#false} is VALID [2022-04-08 08:45:24,064 INFO L290 TraceCheckUtils]: 78: Hoare triple {45232#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {45232#false} is VALID [2022-04-08 08:45:24,064 INFO L290 TraceCheckUtils]: 79: Hoare triple {45232#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {45232#false} is VALID [2022-04-08 08:45:24,064 INFO L290 TraceCheckUtils]: 80: Hoare triple {45232#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {45232#false} is VALID [2022-04-08 08:45:24,065 INFO L290 TraceCheckUtils]: 81: Hoare triple {45232#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {45232#false} is VALID [2022-04-08 08:45:24,065 INFO L290 TraceCheckUtils]: 82: Hoare triple {45232#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {45232#false} is VALID [2022-04-08 08:45:24,065 INFO L290 TraceCheckUtils]: 83: Hoare triple {45232#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {45232#false} is VALID [2022-04-08 08:45:24,065 INFO L290 TraceCheckUtils]: 84: Hoare triple {45232#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {45232#false} is VALID [2022-04-08 08:45:24,065 INFO L290 TraceCheckUtils]: 85: Hoare triple {45232#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {45232#false} is VALID [2022-04-08 08:45:24,065 INFO L290 TraceCheckUtils]: 86: Hoare triple {45232#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {45232#false} is VALID [2022-04-08 08:45:24,065 INFO L290 TraceCheckUtils]: 87: Hoare triple {45232#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {45232#false} is VALID [2022-04-08 08:45:24,065 INFO L290 TraceCheckUtils]: 88: Hoare triple {45232#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {45232#false} is VALID [2022-04-08 08:45:24,065 INFO L290 TraceCheckUtils]: 89: Hoare triple {45232#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {45232#false} is VALID [2022-04-08 08:45:24,065 INFO L290 TraceCheckUtils]: 90: Hoare triple {45232#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {45232#false} is VALID [2022-04-08 08:45:24,065 INFO L290 TraceCheckUtils]: 91: Hoare triple {45232#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {45232#false} is VALID [2022-04-08 08:45:24,065 INFO L290 TraceCheckUtils]: 92: Hoare triple {45232#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {45232#false} is VALID [2022-04-08 08:45:24,065 INFO L290 TraceCheckUtils]: 93: Hoare triple {45232#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {45232#false} is VALID [2022-04-08 08:45:24,065 INFO L290 TraceCheckUtils]: 94: Hoare triple {45232#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {45232#false} is VALID [2022-04-08 08:45:24,066 INFO L290 TraceCheckUtils]: 95: Hoare triple {45232#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {45232#false} is VALID [2022-04-08 08:45:24,066 INFO L290 TraceCheckUtils]: 96: Hoare triple {45232#false} assume 8640 == #t~mem75;havoc #t~mem75; {45232#false} is VALID [2022-04-08 08:45:24,066 INFO L290 TraceCheckUtils]: 97: Hoare triple {45232#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {45232#false} is VALID [2022-04-08 08:45:24,066 INFO L290 TraceCheckUtils]: 98: Hoare triple {45232#false} assume !(4 == ~blastFlag~0); {45232#false} is VALID [2022-04-08 08:45:24,066 INFO L290 TraceCheckUtils]: 99: Hoare triple {45232#false} assume 7 == ~blastFlag~0; {45232#false} is VALID [2022-04-08 08:45:24,066 INFO L290 TraceCheckUtils]: 100: Hoare triple {45232#false} assume !false; {45232#false} is VALID [2022-04-08 08:45:24,066 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-04-08 08:45:24,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:45:24,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153213598] [2022-04-08 08:45:24,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153213598] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:45:24,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:45:24,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:45:24,067 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:45:24,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [379059935] [2022-04-08 08:45:24,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [379059935] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:45:24,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:45:24,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:45:24,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422407983] [2022-04-08 08:45:24,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:45:24,068 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 101 [2022-04-08 08:45:24,068 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:45:24,068 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:24,123 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:45:24,123 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:45:24,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:45:24,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:45:24,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:45:24,124 INFO L87 Difference]: Start difference. First operand 597 states and 977 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:28,288 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:45:30,336 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:45:33,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:45:33,876 INFO L93 Difference]: Finished difference Result 915 states and 1498 transitions. [2022-04-08 08:45:33,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:45:33,876 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 101 [2022-04-08 08:45:33,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:45:33,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:33,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 423 transitions. [2022-04-08 08:45:33,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:33,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 423 transitions. [2022-04-08 08:45:33,880 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 423 transitions. [2022-04-08 08:45:34,148 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 423 edges. 423 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:45:34,162 INFO L225 Difference]: With dead ends: 915 [2022-04-08 08:45:34,162 INFO L226 Difference]: Without dead ends: 601 [2022-04-08 08:45:34,162 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:45:34,163 INFO L913 BasicCegarLoop]: 191 mSDtfsCounter, 12 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:45:34,163 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 487 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 342 Invalid, 2 Unknown, 0 Unchecked, 6.0s Time] [2022-04-08 08:45:34,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2022-04-08 08:45:34,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 595. [2022-04-08 08:45:34,183 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:45:34,184 INFO L82 GeneralOperation]: Start isEquivalent. First operand 601 states. Second operand has 595 states, 590 states have (on average 1.6423728813559322) internal successors, (969), 590 states have internal predecessors, (969), 3 states have call successors, (3), 3 states have 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:45:34,185 INFO L74 IsIncluded]: Start isIncluded. First operand 601 states. Second operand has 595 states, 590 states have (on average 1.6423728813559322) internal successors, (969), 590 states have internal predecessors, (969), 3 states have call successors, (3), 3 states have 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:45:34,185 INFO L87 Difference]: Start difference. First operand 601 states. Second operand has 595 states, 590 states have (on average 1.6423728813559322) internal successors, (969), 590 states have internal predecessors, (969), 3 states have call successors, (3), 3 states have 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:45:34,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:45:34,197 INFO L93 Difference]: Finished difference Result 601 states and 979 transitions. [2022-04-08 08:45:34,197 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 979 transitions. [2022-04-08 08:45:34,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:45:34,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:45:34,199 INFO L74 IsIncluded]: Start isIncluded. First operand has 595 states, 590 states have (on average 1.6423728813559322) internal successors, (969), 590 states have internal predecessors, (969), 3 states have call successors, (3), 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 601 states. [2022-04-08 08:45:34,199 INFO L87 Difference]: Start difference. First operand has 595 states, 590 states have (on average 1.6423728813559322) internal successors, (969), 590 states have internal predecessors, (969), 3 states have call successors, (3), 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 601 states. [2022-04-08 08:45:34,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:45:34,211 INFO L93 Difference]: Finished difference Result 601 states and 979 transitions. [2022-04-08 08:45:34,211 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 979 transitions. [2022-04-08 08:45:34,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:45:34,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:45:34,212 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:45:34,212 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:45:34,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 590 states have (on average 1.6423728813559322) internal successors, (969), 590 states have internal predecessors, (969), 3 states have call successors, (3), 3 states have 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:45:34,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 973 transitions. [2022-04-08 08:45:34,228 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 973 transitions. Word has length 101 [2022-04-08 08:45:34,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:45:34,228 INFO L478 AbstractCegarLoop]: Abstraction has 595 states and 973 transitions. [2022-04-08 08:45:34,228 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:34,228 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 595 states and 973 transitions. [2022-04-08 08:45:37,100 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 973 edges. 972 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:45:37,100 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 973 transitions. [2022-04-08 08:45:37,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-04-08 08:45:37,104 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:45:37,104 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:45:37,104 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-08 08:45:37,105 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:45:37,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:45:37,105 INFO L85 PathProgramCache]: Analyzing trace with hash -854368715, now seen corresponding path program 1 times [2022-04-08 08:45:37,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:45:37,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2053762799] [2022-04-08 08:45:37,158 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:45:37,158 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:45:37,158 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:45:37,159 INFO L85 PathProgramCache]: Analyzing trace with hash -854368715, now seen corresponding path program 2 times [2022-04-08 08:45:37,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:45:37,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421335775] [2022-04-08 08:45:37,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:45:37,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:45:37,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:45:37,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:45:37,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:45:37,309 INFO L290 TraceCheckUtils]: 0: Hoare triple {49472#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {49465#true} is VALID [2022-04-08 08:45:37,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {49465#true} assume true; {49465#true} is VALID [2022-04-08 08:45:37,309 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {49465#true} {49465#true} #678#return; {49465#true} is VALID [2022-04-08 08:45:37,310 INFO L272 TraceCheckUtils]: 0: Hoare triple {49465#true} call ULTIMATE.init(); {49472#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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:45:37,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {49472#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {49465#true} is VALID [2022-04-08 08:45:37,310 INFO L290 TraceCheckUtils]: 2: Hoare triple {49465#true} assume true; {49465#true} is VALID [2022-04-08 08:45:37,310 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49465#true} {49465#true} #678#return; {49465#true} is VALID [2022-04-08 08:45:37,310 INFO L272 TraceCheckUtils]: 4: Hoare triple {49465#true} call #t~ret161 := main(); {49465#true} is VALID [2022-04-08 08:45:37,311 INFO L290 TraceCheckUtils]: 5: Hoare triple {49465#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {49465#true} is VALID [2022-04-08 08:45:37,311 INFO L290 TraceCheckUtils]: 6: Hoare triple {49465#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {49465#true} is VALID [2022-04-08 08:45:37,311 INFO L272 TraceCheckUtils]: 7: Hoare triple {49465#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {49465#true} is VALID [2022-04-08 08:45:37,311 INFO L290 TraceCheckUtils]: 8: Hoare triple {49465#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {49465#true} is VALID [2022-04-08 08:45:37,311 INFO L290 TraceCheckUtils]: 9: Hoare triple {49465#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {49465#true} is VALID [2022-04-08 08:45:37,311 INFO L290 TraceCheckUtils]: 10: Hoare triple {49465#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {49465#true} is VALID [2022-04-08 08:45:37,311 INFO L290 TraceCheckUtils]: 11: Hoare triple {49465#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {49465#true} is VALID [2022-04-08 08:45:37,311 INFO L290 TraceCheckUtils]: 12: Hoare triple {49465#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {49465#true} is VALID [2022-04-08 08:45:37,311 INFO L290 TraceCheckUtils]: 13: Hoare triple {49465#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {49465#true} is VALID [2022-04-08 08:45:37,311 INFO L290 TraceCheckUtils]: 14: Hoare triple {49465#true} assume !false; {49465#true} is VALID [2022-04-08 08:45:37,311 INFO L290 TraceCheckUtils]: 15: Hoare triple {49465#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {49465#true} is VALID [2022-04-08 08:45:37,311 INFO L290 TraceCheckUtils]: 16: Hoare triple {49465#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {49465#true} is VALID [2022-04-08 08:45:37,311 INFO L290 TraceCheckUtils]: 17: Hoare triple {49465#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {49465#true} is VALID [2022-04-08 08:45:37,311 INFO L290 TraceCheckUtils]: 18: Hoare triple {49465#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {49465#true} is VALID [2022-04-08 08:45:37,312 INFO L290 TraceCheckUtils]: 19: Hoare triple {49465#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {49465#true} is VALID [2022-04-08 08:45:37,312 INFO L290 TraceCheckUtils]: 20: Hoare triple {49465#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {49465#true} is VALID [2022-04-08 08:45:37,312 INFO L290 TraceCheckUtils]: 21: Hoare triple {49465#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {49465#true} is VALID [2022-04-08 08:45:37,312 INFO L290 TraceCheckUtils]: 22: Hoare triple {49465#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {49465#true} is VALID [2022-04-08 08:45:37,312 INFO L290 TraceCheckUtils]: 23: Hoare triple {49465#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {49465#true} is VALID [2022-04-08 08:45:37,312 INFO L290 TraceCheckUtils]: 24: Hoare triple {49465#true} assume 8464 == #t~mem55;havoc #t~mem55; {49465#true} is VALID [2022-04-08 08:45:37,312 INFO L290 TraceCheckUtils]: 25: Hoare triple {49465#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {49465#true} is VALID [2022-04-08 08:45:37,312 INFO L290 TraceCheckUtils]: 26: Hoare triple {49465#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {49465#true} is VALID [2022-04-08 08:45:37,313 INFO L290 TraceCheckUtils]: 27: Hoare triple {49465#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); {49470#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:45:37,313 INFO L290 TraceCheckUtils]: 28: Hoare triple {49470#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {49470#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:45:37,314 INFO L290 TraceCheckUtils]: 29: Hoare triple {49470#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {49470#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:45:37,314 INFO L290 TraceCheckUtils]: 30: Hoare triple {49470#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} ~skip~0 := 0; {49470#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:45:37,315 INFO L290 TraceCheckUtils]: 31: Hoare triple {49470#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !false; {49470#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:45:37,315 INFO L290 TraceCheckUtils]: 32: Hoare triple {49470#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {49470#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:45:37,315 INFO L290 TraceCheckUtils]: 33: Hoare triple {49470#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {49470#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:45:37,316 INFO L290 TraceCheckUtils]: 34: Hoare triple {49470#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {49470#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:45:37,316 INFO L290 TraceCheckUtils]: 35: Hoare triple {49470#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {49470#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:45:37,316 INFO L290 TraceCheckUtils]: 36: Hoare triple {49470#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {49470#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:45:37,317 INFO L290 TraceCheckUtils]: 37: Hoare triple {49470#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {49470#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:45:37,317 INFO L290 TraceCheckUtils]: 38: Hoare triple {49470#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {49471#(not (= |ssl3_accept_#t~mem53| 8481))} is VALID [2022-04-08 08:45:37,317 INFO L290 TraceCheckUtils]: 39: Hoare triple {49471#(not (= |ssl3_accept_#t~mem53| 8481))} assume 8481 == #t~mem53;havoc #t~mem53; {49466#false} is VALID [2022-04-08 08:45:37,318 INFO L290 TraceCheckUtils]: 40: Hoare triple {49466#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {49466#false} is VALID [2022-04-08 08:45:37,318 INFO L290 TraceCheckUtils]: 41: Hoare triple {49466#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem91.base, 844 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {49466#false} is VALID [2022-04-08 08:45:37,318 INFO L290 TraceCheckUtils]: 42: Hoare triple {49466#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {49466#false} is VALID [2022-04-08 08:45:37,318 INFO L290 TraceCheckUtils]: 43: Hoare triple {49466#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {49466#false} is VALID [2022-04-08 08:45:37,318 INFO L290 TraceCheckUtils]: 44: Hoare triple {49466#false} ~skip~0 := 0; {49466#false} is VALID [2022-04-08 08:45:37,318 INFO L290 TraceCheckUtils]: 45: Hoare triple {49466#false} assume !false; {49466#false} is VALID [2022-04-08 08:45:37,318 INFO L290 TraceCheckUtils]: 46: Hoare triple {49466#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {49466#false} is VALID [2022-04-08 08:45:37,318 INFO L290 TraceCheckUtils]: 47: Hoare triple {49466#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {49466#false} is VALID [2022-04-08 08:45:37,318 INFO L290 TraceCheckUtils]: 48: Hoare triple {49466#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {49466#false} is VALID [2022-04-08 08:45:37,318 INFO L290 TraceCheckUtils]: 49: Hoare triple {49466#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {49466#false} is VALID [2022-04-08 08:45:37,318 INFO L290 TraceCheckUtils]: 50: Hoare triple {49466#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {49466#false} is VALID [2022-04-08 08:45:37,318 INFO L290 TraceCheckUtils]: 51: Hoare triple {49466#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {49466#false} is VALID [2022-04-08 08:45:37,318 INFO L290 TraceCheckUtils]: 52: Hoare triple {49466#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {49466#false} is VALID [2022-04-08 08:45:37,318 INFO L290 TraceCheckUtils]: 53: Hoare triple {49466#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {49466#false} is VALID [2022-04-08 08:45:37,319 INFO L290 TraceCheckUtils]: 54: Hoare triple {49466#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {49466#false} is VALID [2022-04-08 08:45:37,319 INFO L290 TraceCheckUtils]: 55: Hoare triple {49466#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {49466#false} is VALID [2022-04-08 08:45:37,319 INFO L290 TraceCheckUtils]: 56: Hoare triple {49466#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {49466#false} is VALID [2022-04-08 08:45:37,319 INFO L290 TraceCheckUtils]: 57: Hoare triple {49466#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {49466#false} is VALID [2022-04-08 08:45:37,319 INFO L290 TraceCheckUtils]: 58: Hoare triple {49466#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {49466#false} is VALID [2022-04-08 08:45:37,319 INFO L290 TraceCheckUtils]: 59: Hoare triple {49466#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {49466#false} is VALID [2022-04-08 08:45:37,319 INFO L290 TraceCheckUtils]: 60: Hoare triple {49466#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {49466#false} is VALID [2022-04-08 08:45:37,319 INFO L290 TraceCheckUtils]: 61: Hoare triple {49466#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {49466#false} is VALID [2022-04-08 08:45:37,319 INFO L290 TraceCheckUtils]: 62: Hoare triple {49466#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {49466#false} is VALID [2022-04-08 08:45:37,319 INFO L290 TraceCheckUtils]: 63: Hoare triple {49466#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {49466#false} is VALID [2022-04-08 08:45:37,319 INFO L290 TraceCheckUtils]: 64: Hoare triple {49466#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {49466#false} is VALID [2022-04-08 08:45:37,319 INFO L290 TraceCheckUtils]: 65: Hoare triple {49466#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {49466#false} is VALID [2022-04-08 08:45:37,319 INFO L290 TraceCheckUtils]: 66: Hoare triple {49466#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {49466#false} is VALID [2022-04-08 08:45:37,320 INFO L290 TraceCheckUtils]: 67: Hoare triple {49466#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {49466#false} is VALID [2022-04-08 08:45:37,320 INFO L290 TraceCheckUtils]: 68: Hoare triple {49466#false} assume 8448 == #t~mem68;havoc #t~mem68; {49466#false} is VALID [2022-04-08 08:45:37,320 INFO L290 TraceCheckUtils]: 69: Hoare triple {49466#false} assume !(~num1~0 > 0); {49466#false} is VALID [2022-04-08 08:45:37,320 INFO L290 TraceCheckUtils]: 70: Hoare triple {49466#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {49466#false} is VALID [2022-04-08 08:45:37,320 INFO L290 TraceCheckUtils]: 71: Hoare triple {49466#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {49466#false} is VALID [2022-04-08 08:45:37,320 INFO L290 TraceCheckUtils]: 72: Hoare triple {49466#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {49466#false} is VALID [2022-04-08 08:45:37,320 INFO L290 TraceCheckUtils]: 73: Hoare triple {49466#false} ~skip~0 := 0; {49466#false} is VALID [2022-04-08 08:45:37,320 INFO L290 TraceCheckUtils]: 74: Hoare triple {49466#false} assume !false; {49466#false} is VALID [2022-04-08 08:45:37,320 INFO L290 TraceCheckUtils]: 75: Hoare triple {49466#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {49466#false} is VALID [2022-04-08 08:45:37,320 INFO L290 TraceCheckUtils]: 76: Hoare triple {49466#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {49466#false} is VALID [2022-04-08 08:45:37,320 INFO L290 TraceCheckUtils]: 77: Hoare triple {49466#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {49466#false} is VALID [2022-04-08 08:45:37,320 INFO L290 TraceCheckUtils]: 78: Hoare triple {49466#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {49466#false} is VALID [2022-04-08 08:45:37,320 INFO L290 TraceCheckUtils]: 79: Hoare triple {49466#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {49466#false} is VALID [2022-04-08 08:45:37,320 INFO L290 TraceCheckUtils]: 80: Hoare triple {49466#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {49466#false} is VALID [2022-04-08 08:45:37,321 INFO L290 TraceCheckUtils]: 81: Hoare triple {49466#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {49466#false} is VALID [2022-04-08 08:45:37,321 INFO L290 TraceCheckUtils]: 82: Hoare triple {49466#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {49466#false} is VALID [2022-04-08 08:45:37,321 INFO L290 TraceCheckUtils]: 83: Hoare triple {49466#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {49466#false} is VALID [2022-04-08 08:45:37,321 INFO L290 TraceCheckUtils]: 84: Hoare triple {49466#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {49466#false} is VALID [2022-04-08 08:45:37,321 INFO L290 TraceCheckUtils]: 85: Hoare triple {49466#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {49466#false} is VALID [2022-04-08 08:45:37,321 INFO L290 TraceCheckUtils]: 86: Hoare triple {49466#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {49466#false} is VALID [2022-04-08 08:45:37,321 INFO L290 TraceCheckUtils]: 87: Hoare triple {49466#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {49466#false} is VALID [2022-04-08 08:45:37,321 INFO L290 TraceCheckUtils]: 88: Hoare triple {49466#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {49466#false} is VALID [2022-04-08 08:45:37,321 INFO L290 TraceCheckUtils]: 89: Hoare triple {49466#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {49466#false} is VALID [2022-04-08 08:45:37,321 INFO L290 TraceCheckUtils]: 90: Hoare triple {49466#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {49466#false} is VALID [2022-04-08 08:45:37,321 INFO L290 TraceCheckUtils]: 91: Hoare triple {49466#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {49466#false} is VALID [2022-04-08 08:45:37,321 INFO L290 TraceCheckUtils]: 92: Hoare triple {49466#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {49466#false} is VALID [2022-04-08 08:45:37,321 INFO L290 TraceCheckUtils]: 93: Hoare triple {49466#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {49466#false} is VALID [2022-04-08 08:45:37,321 INFO L290 TraceCheckUtils]: 94: Hoare triple {49466#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {49466#false} is VALID [2022-04-08 08:45:37,322 INFO L290 TraceCheckUtils]: 95: Hoare triple {49466#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {49466#false} is VALID [2022-04-08 08:45:37,322 INFO L290 TraceCheckUtils]: 96: Hoare triple {49466#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {49466#false} is VALID [2022-04-08 08:45:37,322 INFO L290 TraceCheckUtils]: 97: Hoare triple {49466#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {49466#false} is VALID [2022-04-08 08:45:37,322 INFO L290 TraceCheckUtils]: 98: Hoare triple {49466#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {49466#false} is VALID [2022-04-08 08:45:37,322 INFO L290 TraceCheckUtils]: 99: Hoare triple {49466#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {49466#false} is VALID [2022-04-08 08:45:37,322 INFO L290 TraceCheckUtils]: 100: Hoare triple {49466#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {49466#false} is VALID [2022-04-08 08:45:37,322 INFO L290 TraceCheckUtils]: 101: Hoare triple {49466#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {49466#false} is VALID [2022-04-08 08:45:37,322 INFO L290 TraceCheckUtils]: 102: Hoare triple {49466#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {49466#false} is VALID [2022-04-08 08:45:37,322 INFO L290 TraceCheckUtils]: 103: Hoare triple {49466#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {49466#false} is VALID [2022-04-08 08:45:37,322 INFO L290 TraceCheckUtils]: 104: Hoare triple {49466#false} assume 8640 == #t~mem75;havoc #t~mem75; {49466#false} is VALID [2022-04-08 08:45:37,322 INFO L290 TraceCheckUtils]: 105: Hoare triple {49466#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {49466#false} is VALID [2022-04-08 08:45:37,322 INFO L290 TraceCheckUtils]: 106: Hoare triple {49466#false} assume !(4 == ~blastFlag~0); {49466#false} is VALID [2022-04-08 08:45:37,322 INFO L290 TraceCheckUtils]: 107: Hoare triple {49466#false} assume 7 == ~blastFlag~0; {49466#false} is VALID [2022-04-08 08:45:37,322 INFO L290 TraceCheckUtils]: 108: Hoare triple {49466#false} assume !false; {49466#false} is VALID [2022-04-08 08:45:37,323 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-08 08:45:37,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:45:37,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421335775] [2022-04-08 08:45:37,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421335775] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:45:37,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:45:37,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:45:37,323 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:45:37,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2053762799] [2022-04-08 08:45:37,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2053762799] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:45:37,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:45:37,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:45:37,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081233593] [2022-04-08 08:45:37,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:45:37,324 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 109 [2022-04-08 08:45:37,324 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:45:37,324 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:45:37,387 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:45:37,387 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:45:37,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:45:37,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:45:37,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:45:37,388 INFO L87 Difference]: Start difference. First operand 595 states and 973 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:45:39,442 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:45:42,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:45:42,433 INFO L93 Difference]: Finished difference Result 1307 states and 2109 transitions. [2022-04-08 08:45:42,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:45:42,434 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 109 [2022-04-08 08:45:42,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:45:42,434 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:45:42,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 581 transitions. [2022-04-08 08:45:42,436 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:45:42,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 581 transitions. [2022-04-08 08:45:42,438 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 581 transitions. [2022-04-08 08:45:42,815 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 581 edges. 581 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:45:42,835 INFO L225 Difference]: With dead ends: 1307 [2022-04-08 08:45:42,835 INFO L226 Difference]: Without dead ends: 738 [2022-04-08 08:45:42,836 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:45:42,836 INFO L913 BasicCegarLoop]: 113 mSDtfsCounter, 139 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 64 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:45:42,836 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 330 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 469 Invalid, 1 Unknown, 0 Unchecked, 3.1s Time] [2022-04-08 08:45:42,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2022-04-08 08:45:42,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 595. [2022-04-08 08:45:42,859 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:45:42,860 INFO L82 GeneralOperation]: Start isEquivalent. First operand 738 states. Second operand has 595 states, 590 states have (on average 1.6254237288135593) internal successors, (959), 590 states have internal predecessors, (959), 3 states have call successors, (3), 3 states have 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:45:42,860 INFO L74 IsIncluded]: Start isIncluded. First operand 738 states. Second operand has 595 states, 590 states have (on average 1.6254237288135593) internal successors, (959), 590 states have internal predecessors, (959), 3 states have call successors, (3), 3 states have 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:45:42,861 INFO L87 Difference]: Start difference. First operand 738 states. Second operand has 595 states, 590 states have (on average 1.6254237288135593) internal successors, (959), 590 states have internal predecessors, (959), 3 states have call successors, (3), 3 states have 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:45:42,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:45:42,876 INFO L93 Difference]: Finished difference Result 738 states and 1158 transitions. [2022-04-08 08:45:42,876 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1158 transitions. [2022-04-08 08:45:42,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:45:42,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:45:42,878 INFO L74 IsIncluded]: Start isIncluded. First operand has 595 states, 590 states have (on average 1.6254237288135593) internal successors, (959), 590 states have internal predecessors, (959), 3 states have call successors, (3), 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 738 states. [2022-04-08 08:45:42,878 INFO L87 Difference]: Start difference. First operand has 595 states, 590 states have (on average 1.6254237288135593) internal successors, (959), 590 states have internal predecessors, (959), 3 states have call successors, (3), 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 738 states. [2022-04-08 08:45:42,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:45:42,896 INFO L93 Difference]: Finished difference Result 738 states and 1158 transitions. [2022-04-08 08:45:42,896 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1158 transitions. [2022-04-08 08:45:42,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:45:42,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:45:42,897 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:45:42,897 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:45:42,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 590 states have (on average 1.6254237288135593) internal successors, (959), 590 states have internal predecessors, (959), 3 states have call successors, (3), 3 states have 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:45:42,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 963 transitions. [2022-04-08 08:45:42,911 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 963 transitions. Word has length 109 [2022-04-08 08:45:42,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:45:42,911 INFO L478 AbstractCegarLoop]: Abstraction has 595 states and 963 transitions. [2022-04-08 08:45:42,912 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:45:42,912 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 595 states and 963 transitions. [2022-04-08 08:45:45,991 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 963 edges. 962 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:45:45,991 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 963 transitions. [2022-04-08 08:45:45,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-04-08 08:45:45,992 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:45:45,992 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:45:45,993 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-08 08:45:45,993 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:45:45,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:45:45,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1904606349, now seen corresponding path program 1 times [2022-04-08 08:45:45,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:45:45,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1045526965] [2022-04-08 08:45:46,052 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:45:46,052 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:45:46,052 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:45:46,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1904606349, now seen corresponding path program 2 times [2022-04-08 08:45:46,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:45:46,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284483071] [2022-04-08 08:45:46,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:45:46,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:45:46,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:45:46,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:45:46,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:45:46,203 INFO L290 TraceCheckUtils]: 0: Hoare triple {54764#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {54757#true} is VALID [2022-04-08 08:45:46,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {54757#true} assume true; {54757#true} is VALID [2022-04-08 08:45:46,204 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {54757#true} {54757#true} #678#return; {54757#true} is VALID [2022-04-08 08:45:46,204 INFO L272 TraceCheckUtils]: 0: Hoare triple {54757#true} call ULTIMATE.init(); {54764#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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:45:46,205 INFO L290 TraceCheckUtils]: 1: Hoare triple {54764#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {54757#true} is VALID [2022-04-08 08:45:46,205 INFO L290 TraceCheckUtils]: 2: Hoare triple {54757#true} assume true; {54757#true} is VALID [2022-04-08 08:45:46,205 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54757#true} {54757#true} #678#return; {54757#true} is VALID [2022-04-08 08:45:46,205 INFO L272 TraceCheckUtils]: 4: Hoare triple {54757#true} call #t~ret161 := main(); {54757#true} is VALID [2022-04-08 08:45:46,205 INFO L290 TraceCheckUtils]: 5: Hoare triple {54757#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {54757#true} is VALID [2022-04-08 08:45:46,205 INFO L290 TraceCheckUtils]: 6: Hoare triple {54757#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {54757#true} is VALID [2022-04-08 08:45:46,205 INFO L272 TraceCheckUtils]: 7: Hoare triple {54757#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {54757#true} is VALID [2022-04-08 08:45:46,207 INFO L290 TraceCheckUtils]: 8: Hoare triple {54757#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {54762#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:46,208 INFO L290 TraceCheckUtils]: 9: Hoare triple {54762#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {54762#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:46,209 INFO L290 TraceCheckUtils]: 10: Hoare triple {54762#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {54762#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:46,209 INFO L290 TraceCheckUtils]: 11: Hoare triple {54762#(not (= 8482 (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)))); {54762#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:46,209 INFO L290 TraceCheckUtils]: 12: Hoare triple {54762#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {54762#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:46,210 INFO L290 TraceCheckUtils]: 13: Hoare triple {54762#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {54762#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:46,210 INFO L290 TraceCheckUtils]: 14: Hoare triple {54762#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {54762#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:46,211 INFO L290 TraceCheckUtils]: 15: Hoare triple {54762#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {54762#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:46,211 INFO L290 TraceCheckUtils]: 16: Hoare triple {54762#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {54762#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:46,211 INFO L290 TraceCheckUtils]: 17: Hoare triple {54762#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {54762#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:46,212 INFO L290 TraceCheckUtils]: 18: Hoare triple {54762#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {54762#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:46,212 INFO L290 TraceCheckUtils]: 19: Hoare triple {54762#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {54762#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:46,212 INFO L290 TraceCheckUtils]: 20: Hoare triple {54762#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {54762#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:46,213 INFO L290 TraceCheckUtils]: 21: Hoare triple {54762#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {54762#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:46,213 INFO L290 TraceCheckUtils]: 22: Hoare triple {54762#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {54763#(not (= |ssl3_accept_#t~mem54| 8482))} is VALID [2022-04-08 08:45:46,213 INFO L290 TraceCheckUtils]: 23: Hoare triple {54763#(not (= |ssl3_accept_#t~mem54| 8482))} assume 8482 == #t~mem54;havoc #t~mem54; {54758#false} is VALID [2022-04-08 08:45:46,214 INFO L290 TraceCheckUtils]: 24: Hoare triple {54758#false} call write~int(3, ~s.base, 52 + ~s.offset, 4); {54758#false} is VALID [2022-04-08 08:45:46,214 INFO L290 TraceCheckUtils]: 25: Hoare triple {54758#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {54758#false} is VALID [2022-04-08 08:45:46,214 INFO L290 TraceCheckUtils]: 26: Hoare triple {54758#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {54758#false} is VALID [2022-04-08 08:45:46,214 INFO L290 TraceCheckUtils]: 27: Hoare triple {54758#false} ~skip~0 := 0; {54758#false} is VALID [2022-04-08 08:45:46,214 INFO L290 TraceCheckUtils]: 28: Hoare triple {54758#false} assume !false; {54758#false} is VALID [2022-04-08 08:45:46,214 INFO L290 TraceCheckUtils]: 29: Hoare triple {54758#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {54758#false} is VALID [2022-04-08 08:45:46,214 INFO L290 TraceCheckUtils]: 30: Hoare triple {54758#false} assume 12292 == #t~mem47;havoc #t~mem47; {54758#false} is VALID [2022-04-08 08:45:46,214 INFO L290 TraceCheckUtils]: 31: Hoare triple {54758#false} call write~int(1, ~s.base, 40 + ~s.offset, 4); {54758#false} is VALID [2022-04-08 08:45:46,214 INFO L290 TraceCheckUtils]: 32: Hoare triple {54758#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {54758#false} is VALID [2022-04-08 08:45:46,214 INFO L290 TraceCheckUtils]: 33: Hoare triple {54758#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {54758#false} is VALID [2022-04-08 08:45:46,214 INFO L290 TraceCheckUtils]: 34: Hoare triple {54758#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {54758#false} is VALID [2022-04-08 08:45:46,214 INFO L290 TraceCheckUtils]: 35: Hoare triple {54758#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {54758#false} is VALID [2022-04-08 08:45:46,214 INFO L290 TraceCheckUtils]: 36: Hoare triple {54758#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {54758#false} is VALID [2022-04-08 08:45:46,214 INFO L290 TraceCheckUtils]: 37: Hoare triple {54758#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {54758#false} is VALID [2022-04-08 08:45:46,215 INFO L290 TraceCheckUtils]: 38: Hoare triple {54758#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem89 := read~int(#t~mem88.base, 76 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 76 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {54758#false} is VALID [2022-04-08 08:45:46,215 INFO L290 TraceCheckUtils]: 39: Hoare triple {54758#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {54758#false} is VALID [2022-04-08 08:45:46,215 INFO L290 TraceCheckUtils]: 40: Hoare triple {54758#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {54758#false} is VALID [2022-04-08 08:45:46,215 INFO L290 TraceCheckUtils]: 41: Hoare triple {54758#false} ~skip~0 := 0; {54758#false} is VALID [2022-04-08 08:45:46,215 INFO L290 TraceCheckUtils]: 42: Hoare triple {54758#false} assume !false; {54758#false} is VALID [2022-04-08 08:45:46,215 INFO L290 TraceCheckUtils]: 43: Hoare triple {54758#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {54758#false} is VALID [2022-04-08 08:45:46,234 INFO L290 TraceCheckUtils]: 44: Hoare triple {54758#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {54758#false} is VALID [2022-04-08 08:45:46,234 INFO L290 TraceCheckUtils]: 45: Hoare triple {54758#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {54758#false} is VALID [2022-04-08 08:45:46,234 INFO L290 TraceCheckUtils]: 46: Hoare triple {54758#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {54758#false} is VALID [2022-04-08 08:45:46,234 INFO L290 TraceCheckUtils]: 47: Hoare triple {54758#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {54758#false} is VALID [2022-04-08 08:45:46,234 INFO L290 TraceCheckUtils]: 48: Hoare triple {54758#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {54758#false} is VALID [2022-04-08 08:45:46,234 INFO L290 TraceCheckUtils]: 49: Hoare triple {54758#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {54758#false} is VALID [2022-04-08 08:45:46,234 INFO L290 TraceCheckUtils]: 50: Hoare triple {54758#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {54758#false} is VALID [2022-04-08 08:45:46,234 INFO L290 TraceCheckUtils]: 51: Hoare triple {54758#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {54758#false} is VALID [2022-04-08 08:45:46,234 INFO L290 TraceCheckUtils]: 52: Hoare triple {54758#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {54758#false} is VALID [2022-04-08 08:45:46,234 INFO L290 TraceCheckUtils]: 53: Hoare triple {54758#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {54758#false} is VALID [2022-04-08 08:45:46,234 INFO L290 TraceCheckUtils]: 54: Hoare triple {54758#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {54758#false} is VALID [2022-04-08 08:45:46,234 INFO L290 TraceCheckUtils]: 55: Hoare triple {54758#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {54758#false} is VALID [2022-04-08 08:45:46,235 INFO L290 TraceCheckUtils]: 56: Hoare triple {54758#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {54758#false} is VALID [2022-04-08 08:45:46,235 INFO L290 TraceCheckUtils]: 57: Hoare triple {54758#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {54758#false} is VALID [2022-04-08 08:45:46,235 INFO L290 TraceCheckUtils]: 58: Hoare triple {54758#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {54758#false} is VALID [2022-04-08 08:45:46,235 INFO L290 TraceCheckUtils]: 59: Hoare triple {54758#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {54758#false} is VALID [2022-04-08 08:45:46,235 INFO L290 TraceCheckUtils]: 60: Hoare triple {54758#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {54758#false} is VALID [2022-04-08 08:45:46,235 INFO L290 TraceCheckUtils]: 61: Hoare triple {54758#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {54758#false} is VALID [2022-04-08 08:45:46,235 INFO L290 TraceCheckUtils]: 62: Hoare triple {54758#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {54758#false} is VALID [2022-04-08 08:45:46,235 INFO L290 TraceCheckUtils]: 63: Hoare triple {54758#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {54758#false} is VALID [2022-04-08 08:45:46,235 INFO L290 TraceCheckUtils]: 64: Hoare triple {54758#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {54758#false} is VALID [2022-04-08 08:45:46,235 INFO L290 TraceCheckUtils]: 65: Hoare triple {54758#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {54758#false} is VALID [2022-04-08 08:45:46,235 INFO L290 TraceCheckUtils]: 66: Hoare triple {54758#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {54758#false} is VALID [2022-04-08 08:45:46,235 INFO L290 TraceCheckUtils]: 67: Hoare triple {54758#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {54758#false} is VALID [2022-04-08 08:45:46,235 INFO L290 TraceCheckUtils]: 68: Hoare triple {54758#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {54758#false} is VALID [2022-04-08 08:45:46,235 INFO L290 TraceCheckUtils]: 69: Hoare triple {54758#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {54758#false} is VALID [2022-04-08 08:45:46,235 INFO L290 TraceCheckUtils]: 70: Hoare triple {54758#false} assume 8608 == #t~mem73;havoc #t~mem73; {54758#false} is VALID [2022-04-08 08:45:46,236 INFO L290 TraceCheckUtils]: 71: Hoare triple {54758#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {54758#false} is VALID [2022-04-08 08:45:46,236 INFO L290 TraceCheckUtils]: 72: Hoare triple {54758#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {54758#false} is VALID [2022-04-08 08:45:46,236 INFO L290 TraceCheckUtils]: 73: Hoare triple {54758#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {54758#false} is VALID [2022-04-08 08:45:46,236 INFO L290 TraceCheckUtils]: 74: Hoare triple {54758#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {54758#false} is VALID [2022-04-08 08:45:46,236 INFO L290 TraceCheckUtils]: 75: Hoare triple {54758#false} ~skip~0 := 0; {54758#false} is VALID [2022-04-08 08:45:46,236 INFO L290 TraceCheckUtils]: 76: Hoare triple {54758#false} assume !false; {54758#false} is VALID [2022-04-08 08:45:46,236 INFO L290 TraceCheckUtils]: 77: Hoare triple {54758#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {54758#false} is VALID [2022-04-08 08:45:46,236 INFO L290 TraceCheckUtils]: 78: Hoare triple {54758#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {54758#false} is VALID [2022-04-08 08:45:46,236 INFO L290 TraceCheckUtils]: 79: Hoare triple {54758#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {54758#false} is VALID [2022-04-08 08:45:46,236 INFO L290 TraceCheckUtils]: 80: Hoare triple {54758#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {54758#false} is VALID [2022-04-08 08:45:46,236 INFO L290 TraceCheckUtils]: 81: Hoare triple {54758#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {54758#false} is VALID [2022-04-08 08:45:46,236 INFO L290 TraceCheckUtils]: 82: Hoare triple {54758#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {54758#false} is VALID [2022-04-08 08:45:46,236 INFO L290 TraceCheckUtils]: 83: Hoare triple {54758#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {54758#false} is VALID [2022-04-08 08:45:46,237 INFO L290 TraceCheckUtils]: 84: Hoare triple {54758#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {54758#false} is VALID [2022-04-08 08:45:46,237 INFO L290 TraceCheckUtils]: 85: Hoare triple {54758#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {54758#false} is VALID [2022-04-08 08:45:46,237 INFO L290 TraceCheckUtils]: 86: Hoare triple {54758#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {54758#false} is VALID [2022-04-08 08:45:46,237 INFO L290 TraceCheckUtils]: 87: Hoare triple {54758#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {54758#false} is VALID [2022-04-08 08:45:46,237 INFO L290 TraceCheckUtils]: 88: Hoare triple {54758#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {54758#false} is VALID [2022-04-08 08:45:46,237 INFO L290 TraceCheckUtils]: 89: Hoare triple {54758#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {54758#false} is VALID [2022-04-08 08:45:46,237 INFO L290 TraceCheckUtils]: 90: Hoare triple {54758#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {54758#false} is VALID [2022-04-08 08:45:46,237 INFO L290 TraceCheckUtils]: 91: Hoare triple {54758#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {54758#false} is VALID [2022-04-08 08:45:46,237 INFO L290 TraceCheckUtils]: 92: Hoare triple {54758#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {54758#false} is VALID [2022-04-08 08:45:46,237 INFO L290 TraceCheckUtils]: 93: Hoare triple {54758#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {54758#false} is VALID [2022-04-08 08:45:46,237 INFO L290 TraceCheckUtils]: 94: Hoare triple {54758#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {54758#false} is VALID [2022-04-08 08:45:46,237 INFO L290 TraceCheckUtils]: 95: Hoare triple {54758#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {54758#false} is VALID [2022-04-08 08:45:46,237 INFO L290 TraceCheckUtils]: 96: Hoare triple {54758#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {54758#false} is VALID [2022-04-08 08:45:46,237 INFO L290 TraceCheckUtils]: 97: Hoare triple {54758#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {54758#false} is VALID [2022-04-08 08:45:46,238 INFO L290 TraceCheckUtils]: 98: Hoare triple {54758#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {54758#false} is VALID [2022-04-08 08:45:46,238 INFO L290 TraceCheckUtils]: 99: Hoare triple {54758#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {54758#false} is VALID [2022-04-08 08:45:46,238 INFO L290 TraceCheckUtils]: 100: Hoare triple {54758#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {54758#false} is VALID [2022-04-08 08:45:46,238 INFO L290 TraceCheckUtils]: 101: Hoare triple {54758#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {54758#false} is VALID [2022-04-08 08:45:46,238 INFO L290 TraceCheckUtils]: 102: Hoare triple {54758#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {54758#false} is VALID [2022-04-08 08:45:46,238 INFO L290 TraceCheckUtils]: 103: Hoare triple {54758#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {54758#false} is VALID [2022-04-08 08:45:46,238 INFO L290 TraceCheckUtils]: 104: Hoare triple {54758#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {54758#false} is VALID [2022-04-08 08:45:46,238 INFO L290 TraceCheckUtils]: 105: Hoare triple {54758#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {54758#false} is VALID [2022-04-08 08:45:46,238 INFO L290 TraceCheckUtils]: 106: Hoare triple {54758#false} assume 8640 == #t~mem75;havoc #t~mem75; {54758#false} is VALID [2022-04-08 08:45:46,238 INFO L290 TraceCheckUtils]: 107: Hoare triple {54758#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {54758#false} is VALID [2022-04-08 08:45:46,238 INFO L290 TraceCheckUtils]: 108: Hoare triple {54758#false} assume !(4 == ~blastFlag~0); {54758#false} is VALID [2022-04-08 08:45:46,238 INFO L290 TraceCheckUtils]: 109: Hoare triple {54758#false} assume 7 == ~blastFlag~0; {54758#false} is VALID [2022-04-08 08:45:46,238 INFO L290 TraceCheckUtils]: 110: Hoare triple {54758#false} assume !false; {54758#false} is VALID [2022-04-08 08:45:46,239 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-08 08:45:46,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:45:46,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284483071] [2022-04-08 08:45:46,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284483071] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:45:46,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:45:46,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:45:46,239 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:45:46,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1045526965] [2022-04-08 08:45:46,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1045526965] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:45:46,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:45:46,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:45:46,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576657332] [2022-04-08 08:45:46,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:45:46,240 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (3), 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 111 [2022-04-08 08:45:46,241 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:45:46,241 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have 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:45:46,294 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:45:46,294 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:45:46,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:45:46,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:45:46,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:45:46,294 INFO L87 Difference]: Start difference. First operand 595 states and 963 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have 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:45:50,537 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:45:53,635 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:45:55,517 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:45:58,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:45:58,388 INFO L93 Difference]: Finished difference Result 979 states and 1573 transitions. [2022-04-08 08:45:58,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:45:58,388 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (3), 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 111 [2022-04-08 08:45:58,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:45:58,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have 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:45:58,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 579 transitions. [2022-04-08 08:45:58,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have 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:45:58,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 579 transitions. [2022-04-08 08:45:58,393 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 579 transitions. [2022-04-08 08:45:58,774 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 579 edges. 579 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:45:58,781 INFO L225 Difference]: With dead ends: 979 [2022-04-08 08:45:58,781 INFO L226 Difference]: Without dead ends: 410 [2022-04-08 08:45:58,782 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:45:58,782 INFO L913 BasicCegarLoop]: 114 mSDtfsCounter, 136 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-04-08 08:45:58,783 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 332 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 470 Invalid, 1 Unknown, 0 Unchecked, 6.7s Time] [2022-04-08 08:45:58,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2022-04-08 08:45:58,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 335. [2022-04-08 08:45:58,793 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:45:58,793 INFO L82 GeneralOperation]: Start isEquivalent. First operand 410 states. Second operand has 335 states, 330 states have (on average 1.596969696969697) internal successors, (527), 330 states have internal predecessors, (527), 3 states have call successors, (3), 3 states have 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:45:58,794 INFO L74 IsIncluded]: Start isIncluded. First operand 410 states. Second operand has 335 states, 330 states have (on average 1.596969696969697) internal successors, (527), 330 states have internal predecessors, (527), 3 states have call successors, (3), 3 states have 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:45:58,794 INFO L87 Difference]: Start difference. First operand 410 states. Second operand has 335 states, 330 states have (on average 1.596969696969697) internal successors, (527), 330 states have internal predecessors, (527), 3 states have call successors, (3), 3 states have 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:45:58,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:45:58,800 INFO L93 Difference]: Finished difference Result 410 states and 635 transitions. [2022-04-08 08:45:58,800 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 635 transitions. [2022-04-08 08:45:58,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:45:58,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:45:58,801 INFO L74 IsIncluded]: Start isIncluded. First operand has 335 states, 330 states have (on average 1.596969696969697) internal successors, (527), 330 states have internal predecessors, (527), 3 states have call successors, (3), 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 410 states. [2022-04-08 08:45:58,801 INFO L87 Difference]: Start difference. First operand has 335 states, 330 states have (on average 1.596969696969697) internal successors, (527), 330 states have internal predecessors, (527), 3 states have call successors, (3), 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 410 states. [2022-04-08 08:45:58,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:45:58,808 INFO L93 Difference]: Finished difference Result 410 states and 635 transitions. [2022-04-08 08:45:58,808 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 635 transitions. [2022-04-08 08:45:58,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:45:58,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:45:58,808 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:45:58,808 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:45:58,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 330 states have (on average 1.596969696969697) internal successors, (527), 330 states have internal predecessors, (527), 3 states have call successors, (3), 3 states have 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:45:58,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 531 transitions. [2022-04-08 08:45:58,814 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 531 transitions. Word has length 111 [2022-04-08 08:45:58,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:45:58,814 INFO L478 AbstractCegarLoop]: Abstraction has 335 states and 531 transitions. [2022-04-08 08:45:58,814 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have 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:45:58,814 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 335 states and 531 transitions. [2022-04-08 08:45:59,221 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 531 edges. 531 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:45:59,221 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 531 transitions. [2022-04-08 08:45:59,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-04-08 08:45:59,221 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:45:59,223 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:45:59,223 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-08 08:45:59,223 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:45:59,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:45:59,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1808752530, now seen corresponding path program 1 times [2022-04-08 08:45:59,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:45:59,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [285128546] [2022-04-08 08:45:59,276 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:45:59,277 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:45:59,277 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:45:59,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1808752530, now seen corresponding path program 2 times [2022-04-08 08:45:59,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:45:59,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74933105] [2022-04-08 08:45:59,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:45:59,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:45:59,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:45:59,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:45:59,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:45:59,430 INFO L290 TraceCheckUtils]: 0: Hoare triple {58224#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {58217#true} is VALID [2022-04-08 08:45:59,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {58217#true} assume true; {58217#true} is VALID [2022-04-08 08:45:59,431 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {58217#true} {58217#true} #678#return; {58217#true} is VALID [2022-04-08 08:45:59,431 INFO L272 TraceCheckUtils]: 0: Hoare triple {58217#true} call ULTIMATE.init(); {58224#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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:45:59,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {58224#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {58217#true} is VALID [2022-04-08 08:45:59,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {58217#true} assume true; {58217#true} is VALID [2022-04-08 08:45:59,432 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58217#true} {58217#true} #678#return; {58217#true} is VALID [2022-04-08 08:45:59,432 INFO L272 TraceCheckUtils]: 4: Hoare triple {58217#true} call #t~ret161 := main(); {58217#true} is VALID [2022-04-08 08:45:59,432 INFO L290 TraceCheckUtils]: 5: Hoare triple {58217#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {58217#true} is VALID [2022-04-08 08:45:59,432 INFO L290 TraceCheckUtils]: 6: Hoare triple {58217#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {58217#true} is VALID [2022-04-08 08:45:59,432 INFO L272 TraceCheckUtils]: 7: Hoare triple {58217#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {58217#true} is VALID [2022-04-08 08:45:59,432 INFO L290 TraceCheckUtils]: 8: Hoare triple {58217#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {58217#true} is VALID [2022-04-08 08:45:59,432 INFO L290 TraceCheckUtils]: 9: Hoare triple {58217#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {58217#true} is VALID [2022-04-08 08:45:59,432 INFO L290 TraceCheckUtils]: 10: Hoare triple {58217#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {58217#true} is VALID [2022-04-08 08:45:59,432 INFO L290 TraceCheckUtils]: 11: Hoare triple {58217#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {58217#true} is VALID [2022-04-08 08:45:59,432 INFO L290 TraceCheckUtils]: 12: Hoare triple {58217#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {58217#true} is VALID [2022-04-08 08:45:59,432 INFO L290 TraceCheckUtils]: 13: Hoare triple {58217#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {58217#true} is VALID [2022-04-08 08:45:59,433 INFO L290 TraceCheckUtils]: 14: Hoare triple {58217#true} assume !false; {58217#true} is VALID [2022-04-08 08:45:59,433 INFO L290 TraceCheckUtils]: 15: Hoare triple {58217#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {58217#true} is VALID [2022-04-08 08:45:59,433 INFO L290 TraceCheckUtils]: 16: Hoare triple {58217#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {58217#true} is VALID [2022-04-08 08:45:59,433 INFO L290 TraceCheckUtils]: 17: Hoare triple {58217#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {58217#true} is VALID [2022-04-08 08:45:59,433 INFO L290 TraceCheckUtils]: 18: Hoare triple {58217#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {58217#true} is VALID [2022-04-08 08:45:59,433 INFO L290 TraceCheckUtils]: 19: Hoare triple {58217#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {58217#true} is VALID [2022-04-08 08:45:59,433 INFO L290 TraceCheckUtils]: 20: Hoare triple {58217#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {58217#true} is VALID [2022-04-08 08:45:59,434 INFO L290 TraceCheckUtils]: 21: Hoare triple {58217#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {58217#true} is VALID [2022-04-08 08:45:59,434 INFO L290 TraceCheckUtils]: 22: Hoare triple {58217#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {58217#true} is VALID [2022-04-08 08:45:59,434 INFO L290 TraceCheckUtils]: 23: Hoare triple {58217#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {58217#true} is VALID [2022-04-08 08:45:59,434 INFO L290 TraceCheckUtils]: 24: Hoare triple {58217#true} assume 8464 == #t~mem55;havoc #t~mem55; {58217#true} is VALID [2022-04-08 08:45:59,435 INFO L290 TraceCheckUtils]: 25: Hoare triple {58217#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {58217#true} is VALID [2022-04-08 08:45:59,435 INFO L290 TraceCheckUtils]: 26: Hoare triple {58217#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {58217#true} is VALID [2022-04-08 08:45:59,435 INFO L290 TraceCheckUtils]: 27: Hoare triple {58217#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); {58217#true} is VALID [2022-04-08 08:45:59,435 INFO L290 TraceCheckUtils]: 28: Hoare triple {58217#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {58217#true} is VALID [2022-04-08 08:45:59,435 INFO L290 TraceCheckUtils]: 29: Hoare triple {58217#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {58217#true} is VALID [2022-04-08 08:45:59,435 INFO L290 TraceCheckUtils]: 30: Hoare triple {58217#true} ~skip~0 := 0; {58217#true} is VALID [2022-04-08 08:45:59,435 INFO L290 TraceCheckUtils]: 31: Hoare triple {58217#true} assume !false; {58217#true} is VALID [2022-04-08 08:45:59,435 INFO L290 TraceCheckUtils]: 32: Hoare triple {58217#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {58217#true} is VALID [2022-04-08 08:45:59,435 INFO L290 TraceCheckUtils]: 33: Hoare triple {58217#true} assume 12292 == #t~mem47;havoc #t~mem47; {58217#true} is VALID [2022-04-08 08:45:59,435 INFO L290 TraceCheckUtils]: 34: Hoare triple {58217#true} call write~int(1, ~s.base, 40 + ~s.offset, 4); {58217#true} is VALID [2022-04-08 08:45:59,435 INFO L290 TraceCheckUtils]: 35: Hoare triple {58217#true} call write~int(1, ~s.base, 36 + ~s.offset, 4); {58217#true} is VALID [2022-04-08 08:45:59,435 INFO L290 TraceCheckUtils]: 36: Hoare triple {58217#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {58217#true} is VALID [2022-04-08 08:45:59,435 INFO L290 TraceCheckUtils]: 37: Hoare triple {58217#true} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {58217#true} is VALID [2022-04-08 08:45:59,435 INFO L290 TraceCheckUtils]: 38: Hoare triple {58217#true} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {58217#true} is VALID [2022-04-08 08:45:59,436 INFO L290 TraceCheckUtils]: 39: Hoare triple {58217#true} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {58217#true} is VALID [2022-04-08 08:45:59,436 INFO L290 TraceCheckUtils]: 40: Hoare triple {58217#true} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {58217#true} is VALID [2022-04-08 08:45:59,437 INFO L290 TraceCheckUtils]: 41: Hoare triple {58217#true} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem89 := read~int(#t~mem88.base, 76 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 76 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {58222#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:59,437 INFO L290 TraceCheckUtils]: 42: Hoare triple {58222#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {58222#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:59,437 INFO L290 TraceCheckUtils]: 43: Hoare triple {58222#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {58222#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:59,438 INFO L290 TraceCheckUtils]: 44: Hoare triple {58222#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {58222#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:59,438 INFO L290 TraceCheckUtils]: 45: Hoare triple {58222#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {58222#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:59,438 INFO L290 TraceCheckUtils]: 46: Hoare triple {58222#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {58222#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:59,439 INFO L290 TraceCheckUtils]: 47: Hoare triple {58222#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {58222#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:59,439 INFO L290 TraceCheckUtils]: 48: Hoare triple {58222#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {58222#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:59,439 INFO L290 TraceCheckUtils]: 49: Hoare triple {58222#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {58222#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:59,440 INFO L290 TraceCheckUtils]: 50: Hoare triple {58222#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {58222#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:59,440 INFO L290 TraceCheckUtils]: 51: Hoare triple {58222#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {58223#(= |ssl3_accept_#t~mem52| 8480)} is VALID [2022-04-08 08:45:59,440 INFO L290 TraceCheckUtils]: 52: Hoare triple {58223#(= |ssl3_accept_#t~mem52| 8480)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {58218#false} is VALID [2022-04-08 08:45:59,441 INFO L290 TraceCheckUtils]: 53: Hoare triple {58218#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {58218#false} is VALID [2022-04-08 08:45:59,441 INFO L290 TraceCheckUtils]: 54: Hoare triple {58218#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {58218#false} is VALID [2022-04-08 08:45:59,441 INFO L290 TraceCheckUtils]: 55: Hoare triple {58218#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {58218#false} is VALID [2022-04-08 08:45:59,441 INFO L290 TraceCheckUtils]: 56: Hoare triple {58218#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {58218#false} is VALID [2022-04-08 08:45:59,441 INFO L290 TraceCheckUtils]: 57: Hoare triple {58218#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {58218#false} is VALID [2022-04-08 08:45:59,441 INFO L290 TraceCheckUtils]: 58: Hoare triple {58218#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {58218#false} is VALID [2022-04-08 08:45:59,441 INFO L290 TraceCheckUtils]: 59: Hoare triple {58218#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {58218#false} is VALID [2022-04-08 08:45:59,441 INFO L290 TraceCheckUtils]: 60: Hoare triple {58218#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {58218#false} is VALID [2022-04-08 08:45:59,441 INFO L290 TraceCheckUtils]: 61: Hoare triple {58218#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {58218#false} is VALID [2022-04-08 08:45:59,441 INFO L290 TraceCheckUtils]: 62: Hoare triple {58218#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {58218#false} is VALID [2022-04-08 08:45:59,441 INFO L290 TraceCheckUtils]: 63: Hoare triple {58218#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {58218#false} is VALID [2022-04-08 08:45:59,441 INFO L290 TraceCheckUtils]: 64: Hoare triple {58218#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {58218#false} is VALID [2022-04-08 08:45:59,441 INFO L290 TraceCheckUtils]: 65: Hoare triple {58218#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {58218#false} is VALID [2022-04-08 08:45:59,441 INFO L290 TraceCheckUtils]: 66: Hoare triple {58218#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {58218#false} is VALID [2022-04-08 08:45:59,442 INFO L290 TraceCheckUtils]: 67: Hoare triple {58218#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {58218#false} is VALID [2022-04-08 08:45:59,442 INFO L290 TraceCheckUtils]: 68: Hoare triple {58218#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {58218#false} is VALID [2022-04-08 08:45:59,442 INFO L290 TraceCheckUtils]: 69: Hoare triple {58218#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {58218#false} is VALID [2022-04-08 08:45:59,442 INFO L290 TraceCheckUtils]: 70: Hoare triple {58218#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {58218#false} is VALID [2022-04-08 08:45:59,442 INFO L290 TraceCheckUtils]: 71: Hoare triple {58218#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {58218#false} is VALID [2022-04-08 08:45:59,442 INFO L290 TraceCheckUtils]: 72: Hoare triple {58218#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {58218#false} is VALID [2022-04-08 08:45:59,442 INFO L290 TraceCheckUtils]: 73: Hoare triple {58218#false} assume 8608 == #t~mem73;havoc #t~mem73; {58218#false} is VALID [2022-04-08 08:45:59,442 INFO L290 TraceCheckUtils]: 74: Hoare triple {58218#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {58218#false} is VALID [2022-04-08 08:45:59,442 INFO L290 TraceCheckUtils]: 75: Hoare triple {58218#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {58218#false} is VALID [2022-04-08 08:45:59,442 INFO L290 TraceCheckUtils]: 76: Hoare triple {58218#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {58218#false} is VALID [2022-04-08 08:45:59,442 INFO L290 TraceCheckUtils]: 77: Hoare triple {58218#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {58218#false} is VALID [2022-04-08 08:45:59,442 INFO L290 TraceCheckUtils]: 78: Hoare triple {58218#false} ~skip~0 := 0; {58218#false} is VALID [2022-04-08 08:45:59,442 INFO L290 TraceCheckUtils]: 79: Hoare triple {58218#false} assume !false; {58218#false} is VALID [2022-04-08 08:45:59,442 INFO L290 TraceCheckUtils]: 80: Hoare triple {58218#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {58218#false} is VALID [2022-04-08 08:45:59,443 INFO L290 TraceCheckUtils]: 81: Hoare triple {58218#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {58218#false} is VALID [2022-04-08 08:45:59,443 INFO L290 TraceCheckUtils]: 82: Hoare triple {58218#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {58218#false} is VALID [2022-04-08 08:45:59,443 INFO L290 TraceCheckUtils]: 83: Hoare triple {58218#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {58218#false} is VALID [2022-04-08 08:45:59,443 INFO L290 TraceCheckUtils]: 84: Hoare triple {58218#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {58218#false} is VALID [2022-04-08 08:45:59,443 INFO L290 TraceCheckUtils]: 85: Hoare triple {58218#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {58218#false} is VALID [2022-04-08 08:45:59,443 INFO L290 TraceCheckUtils]: 86: Hoare triple {58218#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {58218#false} is VALID [2022-04-08 08:45:59,443 INFO L290 TraceCheckUtils]: 87: Hoare triple {58218#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {58218#false} is VALID [2022-04-08 08:45:59,443 INFO L290 TraceCheckUtils]: 88: Hoare triple {58218#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {58218#false} is VALID [2022-04-08 08:45:59,443 INFO L290 TraceCheckUtils]: 89: Hoare triple {58218#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {58218#false} is VALID [2022-04-08 08:45:59,444 INFO L290 TraceCheckUtils]: 90: Hoare triple {58218#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {58218#false} is VALID [2022-04-08 08:45:59,444 INFO L290 TraceCheckUtils]: 91: Hoare triple {58218#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {58218#false} is VALID [2022-04-08 08:45:59,444 INFO L290 TraceCheckUtils]: 92: Hoare triple {58218#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {58218#false} is VALID [2022-04-08 08:45:59,444 INFO L290 TraceCheckUtils]: 93: Hoare triple {58218#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {58218#false} is VALID [2022-04-08 08:45:59,444 INFO L290 TraceCheckUtils]: 94: Hoare triple {58218#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {58218#false} is VALID [2022-04-08 08:45:59,444 INFO L290 TraceCheckUtils]: 95: Hoare triple {58218#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {58218#false} is VALID [2022-04-08 08:45:59,444 INFO L290 TraceCheckUtils]: 96: Hoare triple {58218#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {58218#false} is VALID [2022-04-08 08:45:59,444 INFO L290 TraceCheckUtils]: 97: Hoare triple {58218#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {58218#false} is VALID [2022-04-08 08:45:59,444 INFO L290 TraceCheckUtils]: 98: Hoare triple {58218#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {58218#false} is VALID [2022-04-08 08:45:59,444 INFO L290 TraceCheckUtils]: 99: Hoare triple {58218#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {58218#false} is VALID [2022-04-08 08:45:59,444 INFO L290 TraceCheckUtils]: 100: Hoare triple {58218#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {58218#false} is VALID [2022-04-08 08:45:59,444 INFO L290 TraceCheckUtils]: 101: Hoare triple {58218#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {58218#false} is VALID [2022-04-08 08:45:59,444 INFO L290 TraceCheckUtils]: 102: Hoare triple {58218#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {58218#false} is VALID [2022-04-08 08:45:59,444 INFO L290 TraceCheckUtils]: 103: Hoare triple {58218#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {58218#false} is VALID [2022-04-08 08:45:59,444 INFO L290 TraceCheckUtils]: 104: Hoare triple {58218#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {58218#false} is VALID [2022-04-08 08:45:59,445 INFO L290 TraceCheckUtils]: 105: Hoare triple {58218#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {58218#false} is VALID [2022-04-08 08:45:59,445 INFO L290 TraceCheckUtils]: 106: Hoare triple {58218#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {58218#false} is VALID [2022-04-08 08:45:59,445 INFO L290 TraceCheckUtils]: 107: Hoare triple {58218#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {58218#false} is VALID [2022-04-08 08:45:59,445 INFO L290 TraceCheckUtils]: 108: Hoare triple {58218#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {58218#false} is VALID [2022-04-08 08:45:59,445 INFO L290 TraceCheckUtils]: 109: Hoare triple {58218#false} assume 8640 == #t~mem75;havoc #t~mem75; {58218#false} is VALID [2022-04-08 08:45:59,445 INFO L290 TraceCheckUtils]: 110: Hoare triple {58218#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {58218#false} is VALID [2022-04-08 08:45:59,445 INFO L290 TraceCheckUtils]: 111: Hoare triple {58218#false} assume !(4 == ~blastFlag~0); {58218#false} is VALID [2022-04-08 08:45:59,445 INFO L290 TraceCheckUtils]: 112: Hoare triple {58218#false} assume 7 == ~blastFlag~0; {58218#false} is VALID [2022-04-08 08:45:59,445 INFO L290 TraceCheckUtils]: 113: Hoare triple {58218#false} assume !false; {58218#false} is VALID [2022-04-08 08:45:59,446 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 08:45:59,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:45:59,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74933105] [2022-04-08 08:45:59,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74933105] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:45:59,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:45:59,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:45:59,446 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:45:59,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [285128546] [2022-04-08 08:45:59,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [285128546] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:45:59,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:45:59,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:45:59,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092790646] [2022-04-08 08:45:59,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:45:59,447 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (3), 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 114 [2022-04-08 08:45:59,447 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:45:59,447 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have 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:45:59,506 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:45:59,507 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:45:59,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:45:59,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:45:59,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:45:59,507 INFO L87 Difference]: Start difference. First operand 335 states and 531 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have 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:46:01,553 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:46:04,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:04,372 INFO L93 Difference]: Finished difference Result 655 states and 1046 transitions. [2022-04-08 08:46:04,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:46:04,372 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (3), 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 114 [2022-04-08 08:46:04,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:46:04,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have 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:46:04,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 445 transitions. [2022-04-08 08:46:04,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have 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:46:04,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 445 transitions. [2022-04-08 08:46:04,375 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 445 transitions. [2022-04-08 08:46:04,656 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 445 edges. 445 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:04,661 INFO L225 Difference]: With dead ends: 655 [2022-04-08 08:46:04,661 INFO L226 Difference]: Without dead ends: 348 [2022-04-08 08:46:04,662 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:46:04,662 INFO L913 BasicCegarLoop]: 225 mSDtfsCounter, 21 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-04-08 08:46:04,662 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 560 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 390 Invalid, 1 Unknown, 0 Unchecked, 2.9s Time] [2022-04-08 08:46:04,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2022-04-08 08:46:04,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 335. [2022-04-08 08:46:04,672 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:46:04,673 INFO L82 GeneralOperation]: Start isEquivalent. First operand 348 states. Second operand has 335 states, 330 states have (on average 1.593939393939394) internal successors, (526), 330 states have internal predecessors, (526), 3 states have call successors, (3), 3 states have 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:46:04,673 INFO L74 IsIncluded]: Start isIncluded. First operand 348 states. Second operand has 335 states, 330 states have (on average 1.593939393939394) internal successors, (526), 330 states have internal predecessors, (526), 3 states have call successors, (3), 3 states have 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:46:04,673 INFO L87 Difference]: Start difference. First operand 348 states. Second operand has 335 states, 330 states have (on average 1.593939393939394) internal successors, (526), 330 states have internal predecessors, (526), 3 states have call successors, (3), 3 states have 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:46:04,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:04,678 INFO L93 Difference]: Finished difference Result 348 states and 546 transitions. [2022-04-08 08:46:04,678 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 546 transitions. [2022-04-08 08:46:04,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:46:04,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:46:04,679 INFO L74 IsIncluded]: Start isIncluded. First operand has 335 states, 330 states have (on average 1.593939393939394) internal successors, (526), 330 states have internal predecessors, (526), 3 states have call successors, (3), 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 348 states. [2022-04-08 08:46:04,679 INFO L87 Difference]: Start difference. First operand has 335 states, 330 states have (on average 1.593939393939394) internal successors, (526), 330 states have internal predecessors, (526), 3 states have call successors, (3), 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 348 states. [2022-04-08 08:46:04,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:04,683 INFO L93 Difference]: Finished difference Result 348 states and 546 transitions. [2022-04-08 08:46:04,683 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 546 transitions. [2022-04-08 08:46:04,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:46:04,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:46:04,684 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:46:04,684 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:46:04,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 330 states have (on average 1.593939393939394) internal successors, (526), 330 states have internal predecessors, (526), 3 states have call successors, (3), 3 states have 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:46:04,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 530 transitions. [2022-04-08 08:46:04,689 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 530 transitions. Word has length 114 [2022-04-08 08:46:04,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:46:04,689 INFO L478 AbstractCegarLoop]: Abstraction has 335 states and 530 transitions. [2022-04-08 08:46:04,689 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have 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:46:04,689 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 335 states and 530 transitions. [2022-04-08 08:46:05,084 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 530 edges. 530 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:05,084 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 530 transitions. [2022-04-08 08:46:05,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-04-08 08:46:05,085 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:46:05,085 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:46:05,085 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-08 08:46:05,085 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:46:05,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:46:05,086 INFO L85 PathProgramCache]: Analyzing trace with hash 273525501, now seen corresponding path program 1 times [2022-04-08 08:46:05,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:46:05,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [116594671] [2022-04-08 08:46:05,142 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:46:05,142 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:46:05,142 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:46:05,142 INFO L85 PathProgramCache]: Analyzing trace with hash 273525501, now seen corresponding path program 2 times [2022-04-08 08:46:05,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:46:05,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374548833] [2022-04-08 08:46:05,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:46:05,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:46:05,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:46:05,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:46:05,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:46:05,377 INFO L290 TraceCheckUtils]: 0: Hoare triple {60913#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {60905#true} is VALID [2022-04-08 08:46:05,377 INFO L290 TraceCheckUtils]: 1: Hoare triple {60905#true} assume true; {60905#true} is VALID [2022-04-08 08:46:05,377 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {60905#true} {60905#true} #678#return; {60905#true} is VALID [2022-04-08 08:46:05,378 INFO L272 TraceCheckUtils]: 0: Hoare triple {60905#true} call ULTIMATE.init(); {60913#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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:46:05,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {60913#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {60905#true} is VALID [2022-04-08 08:46:05,378 INFO L290 TraceCheckUtils]: 2: Hoare triple {60905#true} assume true; {60905#true} is VALID [2022-04-08 08:46:05,378 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60905#true} {60905#true} #678#return; {60905#true} is VALID [2022-04-08 08:46:05,378 INFO L272 TraceCheckUtils]: 4: Hoare triple {60905#true} call #t~ret161 := main(); {60905#true} is VALID [2022-04-08 08:46:05,378 INFO L290 TraceCheckUtils]: 5: Hoare triple {60905#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {60905#true} is VALID [2022-04-08 08:46:05,378 INFO L290 TraceCheckUtils]: 6: Hoare triple {60905#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {60905#true} is VALID [2022-04-08 08:46:05,378 INFO L272 TraceCheckUtils]: 7: Hoare triple {60905#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {60905#true} is VALID [2022-04-08 08:46:05,379 INFO L290 TraceCheckUtils]: 8: Hoare triple {60905#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {60905#true} is VALID [2022-04-08 08:46:05,379 INFO L290 TraceCheckUtils]: 9: Hoare triple {60905#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {60905#true} is VALID [2022-04-08 08:46:05,379 INFO L290 TraceCheckUtils]: 10: Hoare triple {60905#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {60905#true} is VALID [2022-04-08 08:46:05,379 INFO L290 TraceCheckUtils]: 11: Hoare triple {60905#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {60905#true} is VALID [2022-04-08 08:46:05,379 INFO L290 TraceCheckUtils]: 12: Hoare triple {60905#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {60905#true} is VALID [2022-04-08 08:46:05,379 INFO L290 TraceCheckUtils]: 13: Hoare triple {60905#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {60905#true} is VALID [2022-04-08 08:46:05,379 INFO L290 TraceCheckUtils]: 14: Hoare triple {60905#true} assume !false; {60905#true} is VALID [2022-04-08 08:46:05,379 INFO L290 TraceCheckUtils]: 15: Hoare triple {60905#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {60905#true} is VALID [2022-04-08 08:46:05,379 INFO L290 TraceCheckUtils]: 16: Hoare triple {60905#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {60905#true} is VALID [2022-04-08 08:46:05,379 INFO L290 TraceCheckUtils]: 17: Hoare triple {60905#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {60905#true} is VALID [2022-04-08 08:46:05,379 INFO L290 TraceCheckUtils]: 18: Hoare triple {60905#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {60905#true} is VALID [2022-04-08 08:46:05,379 INFO L290 TraceCheckUtils]: 19: Hoare triple {60905#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {60905#true} is VALID [2022-04-08 08:46:05,379 INFO L290 TraceCheckUtils]: 20: Hoare triple {60905#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {60905#true} is VALID [2022-04-08 08:46:05,379 INFO L290 TraceCheckUtils]: 21: Hoare triple {60905#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {60905#true} is VALID [2022-04-08 08:46:05,380 INFO L290 TraceCheckUtils]: 22: Hoare triple {60905#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {60905#true} is VALID [2022-04-08 08:46:05,380 INFO L290 TraceCheckUtils]: 23: Hoare triple {60905#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {60905#true} is VALID [2022-04-08 08:46:05,380 INFO L290 TraceCheckUtils]: 24: Hoare triple {60905#true} assume 8464 == #t~mem55;havoc #t~mem55; {60905#true} is VALID [2022-04-08 08:46:05,380 INFO L290 TraceCheckUtils]: 25: Hoare triple {60905#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {60905#true} is VALID [2022-04-08 08:46:05,380 INFO L290 TraceCheckUtils]: 26: Hoare triple {60905#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {60905#true} is VALID [2022-04-08 08:46:05,380 INFO L290 TraceCheckUtils]: 27: Hoare triple {60905#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); {60905#true} is VALID [2022-04-08 08:46:05,380 INFO L290 TraceCheckUtils]: 28: Hoare triple {60905#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {60905#true} is VALID [2022-04-08 08:46:05,380 INFO L290 TraceCheckUtils]: 29: Hoare triple {60905#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {60905#true} is VALID [2022-04-08 08:46:05,380 INFO L290 TraceCheckUtils]: 30: Hoare triple {60905#true} ~skip~0 := 0; {60905#true} is VALID [2022-04-08 08:46:05,380 INFO L290 TraceCheckUtils]: 31: Hoare triple {60905#true} assume !false; {60905#true} is VALID [2022-04-08 08:46:05,381 INFO L290 TraceCheckUtils]: 32: Hoare triple {60905#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {60910#(= |ssl3_accept_#t~mem47| (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:05,381 INFO L290 TraceCheckUtils]: 33: Hoare triple {60910#(= |ssl3_accept_#t~mem47| (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 12292 == #t~mem47;havoc #t~mem47; {60911#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:05,382 INFO L290 TraceCheckUtils]: 34: Hoare triple {60911#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(1, ~s.base, 40 + ~s.offset, 4); {60911#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:05,382 INFO L290 TraceCheckUtils]: 35: Hoare triple {60911#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(1, ~s.base, 36 + ~s.offset, 4); {60911#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:05,383 INFO L290 TraceCheckUtils]: 36: Hoare triple {60911#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {60911#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:05,383 INFO L290 TraceCheckUtils]: 37: Hoare triple {60911#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {60911#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:05,384 INFO L290 TraceCheckUtils]: 38: Hoare triple {60911#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {60911#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:05,385 INFO L290 TraceCheckUtils]: 39: Hoare triple {60911#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {60911#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:05,385 INFO L290 TraceCheckUtils]: 40: Hoare triple {60911#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {60912#(= 12292 |ssl3_accept_#t~mem85|)} is VALID [2022-04-08 08:46:05,386 INFO L290 TraceCheckUtils]: 41: Hoare triple {60912#(= 12292 |ssl3_accept_#t~mem85|)} assume 12292 != #t~mem85;havoc #t~mem85; {60906#false} is VALID [2022-04-08 08:46:05,386 INFO L290 TraceCheckUtils]: 42: Hoare triple {60906#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 52 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem87 := read~int(#t~mem86.base, 72 + #t~mem86.offset, 4);call write~int(1 + #t~mem87, #t~mem86.base, 72 + #t~mem86.offset, 4);havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87; {60906#false} is VALID [2022-04-08 08:46:05,386 INFO L290 TraceCheckUtils]: 43: Hoare triple {60906#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {60906#false} is VALID [2022-04-08 08:46:05,386 INFO L290 TraceCheckUtils]: 44: Hoare triple {60906#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {60906#false} is VALID [2022-04-08 08:46:05,386 INFO L290 TraceCheckUtils]: 45: Hoare triple {60906#false} ~skip~0 := 0; {60906#false} is VALID [2022-04-08 08:46:05,386 INFO L290 TraceCheckUtils]: 46: Hoare triple {60906#false} assume !false; {60906#false} is VALID [2022-04-08 08:46:05,386 INFO L290 TraceCheckUtils]: 47: Hoare triple {60906#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {60906#false} is VALID [2022-04-08 08:46:05,386 INFO L290 TraceCheckUtils]: 48: Hoare triple {60906#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {60906#false} is VALID [2022-04-08 08:46:05,386 INFO L290 TraceCheckUtils]: 49: Hoare triple {60906#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {60906#false} is VALID [2022-04-08 08:46:05,386 INFO L290 TraceCheckUtils]: 50: Hoare triple {60906#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {60906#false} is VALID [2022-04-08 08:46:05,386 INFO L290 TraceCheckUtils]: 51: Hoare triple {60906#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {60906#false} is VALID [2022-04-08 08:46:05,386 INFO L290 TraceCheckUtils]: 52: Hoare triple {60906#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {60906#false} is VALID [2022-04-08 08:46:05,386 INFO L290 TraceCheckUtils]: 53: Hoare triple {60906#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {60906#false} is VALID [2022-04-08 08:46:05,386 INFO L290 TraceCheckUtils]: 54: Hoare triple {60906#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {60906#false} is VALID [2022-04-08 08:46:05,387 INFO L290 TraceCheckUtils]: 55: Hoare triple {60906#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {60906#false} is VALID [2022-04-08 08:46:05,387 INFO L290 TraceCheckUtils]: 56: Hoare triple {60906#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {60906#false} is VALID [2022-04-08 08:46:05,387 INFO L290 TraceCheckUtils]: 57: Hoare triple {60906#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {60906#false} is VALID [2022-04-08 08:46:05,387 INFO L290 TraceCheckUtils]: 58: Hoare triple {60906#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {60906#false} is VALID [2022-04-08 08:46:05,387 INFO L290 TraceCheckUtils]: 59: Hoare triple {60906#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {60906#false} is VALID [2022-04-08 08:46:05,387 INFO L290 TraceCheckUtils]: 60: Hoare triple {60906#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {60906#false} is VALID [2022-04-08 08:46:05,387 INFO L290 TraceCheckUtils]: 61: Hoare triple {60906#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {60906#false} is VALID [2022-04-08 08:46:05,387 INFO L290 TraceCheckUtils]: 62: Hoare triple {60906#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {60906#false} is VALID [2022-04-08 08:46:05,387 INFO L290 TraceCheckUtils]: 63: Hoare triple {60906#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {60906#false} is VALID [2022-04-08 08:46:05,387 INFO L290 TraceCheckUtils]: 64: Hoare triple {60906#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {60906#false} is VALID [2022-04-08 08:46:05,387 INFO L290 TraceCheckUtils]: 65: Hoare triple {60906#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {60906#false} is VALID [2022-04-08 08:46:05,387 INFO L290 TraceCheckUtils]: 66: Hoare triple {60906#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {60906#false} is VALID [2022-04-08 08:46:05,387 INFO L290 TraceCheckUtils]: 67: Hoare triple {60906#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {60906#false} is VALID [2022-04-08 08:46:05,387 INFO L290 TraceCheckUtils]: 68: Hoare triple {60906#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {60906#false} is VALID [2022-04-08 08:46:05,388 INFO L290 TraceCheckUtils]: 69: Hoare triple {60906#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {60906#false} is VALID [2022-04-08 08:46:05,388 INFO L290 TraceCheckUtils]: 70: Hoare triple {60906#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {60906#false} is VALID [2022-04-08 08:46:05,388 INFO L290 TraceCheckUtils]: 71: Hoare triple {60906#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {60906#false} is VALID [2022-04-08 08:46:05,388 INFO L290 TraceCheckUtils]: 72: Hoare triple {60906#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {60906#false} is VALID [2022-04-08 08:46:05,388 INFO L290 TraceCheckUtils]: 73: Hoare triple {60906#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {60906#false} is VALID [2022-04-08 08:46:05,388 INFO L290 TraceCheckUtils]: 74: Hoare triple {60906#false} assume 8608 == #t~mem73;havoc #t~mem73; {60906#false} is VALID [2022-04-08 08:46:05,388 INFO L290 TraceCheckUtils]: 75: Hoare triple {60906#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {60906#false} is VALID [2022-04-08 08:46:05,388 INFO L290 TraceCheckUtils]: 76: Hoare triple {60906#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {60906#false} is VALID [2022-04-08 08:46:05,388 INFO L290 TraceCheckUtils]: 77: Hoare triple {60906#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {60906#false} is VALID [2022-04-08 08:46:05,388 INFO L290 TraceCheckUtils]: 78: Hoare triple {60906#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {60906#false} is VALID [2022-04-08 08:46:05,388 INFO L290 TraceCheckUtils]: 79: Hoare triple {60906#false} ~skip~0 := 0; {60906#false} is VALID [2022-04-08 08:46:05,388 INFO L290 TraceCheckUtils]: 80: Hoare triple {60906#false} assume !false; {60906#false} is VALID [2022-04-08 08:46:05,388 INFO L290 TraceCheckUtils]: 81: Hoare triple {60906#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {60906#false} is VALID [2022-04-08 08:46:05,388 INFO L290 TraceCheckUtils]: 82: Hoare triple {60906#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {60906#false} is VALID [2022-04-08 08:46:05,388 INFO L290 TraceCheckUtils]: 83: Hoare triple {60906#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {60906#false} is VALID [2022-04-08 08:46:05,389 INFO L290 TraceCheckUtils]: 84: Hoare triple {60906#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {60906#false} is VALID [2022-04-08 08:46:05,389 INFO L290 TraceCheckUtils]: 85: Hoare triple {60906#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {60906#false} is VALID [2022-04-08 08:46:05,389 INFO L290 TraceCheckUtils]: 86: Hoare triple {60906#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {60906#false} is VALID [2022-04-08 08:46:05,389 INFO L290 TraceCheckUtils]: 87: Hoare triple {60906#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {60906#false} is VALID [2022-04-08 08:46:05,389 INFO L290 TraceCheckUtils]: 88: Hoare triple {60906#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {60906#false} is VALID [2022-04-08 08:46:05,389 INFO L290 TraceCheckUtils]: 89: Hoare triple {60906#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {60906#false} is VALID [2022-04-08 08:46:05,389 INFO L290 TraceCheckUtils]: 90: Hoare triple {60906#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {60906#false} is VALID [2022-04-08 08:46:05,389 INFO L290 TraceCheckUtils]: 91: Hoare triple {60906#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {60906#false} is VALID [2022-04-08 08:46:05,389 INFO L290 TraceCheckUtils]: 92: Hoare triple {60906#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {60906#false} is VALID [2022-04-08 08:46:05,389 INFO L290 TraceCheckUtils]: 93: Hoare triple {60906#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {60906#false} is VALID [2022-04-08 08:46:05,389 INFO L290 TraceCheckUtils]: 94: Hoare triple {60906#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {60906#false} is VALID [2022-04-08 08:46:05,389 INFO L290 TraceCheckUtils]: 95: Hoare triple {60906#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {60906#false} is VALID [2022-04-08 08:46:05,389 INFO L290 TraceCheckUtils]: 96: Hoare triple {60906#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {60906#false} is VALID [2022-04-08 08:46:05,390 INFO L290 TraceCheckUtils]: 97: Hoare triple {60906#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {60906#false} is VALID [2022-04-08 08:46:05,390 INFO L290 TraceCheckUtils]: 98: Hoare triple {60906#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {60906#false} is VALID [2022-04-08 08:46:05,390 INFO L290 TraceCheckUtils]: 99: Hoare triple {60906#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {60906#false} is VALID [2022-04-08 08:46:05,390 INFO L290 TraceCheckUtils]: 100: Hoare triple {60906#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {60906#false} is VALID [2022-04-08 08:46:05,390 INFO L290 TraceCheckUtils]: 101: Hoare triple {60906#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {60906#false} is VALID [2022-04-08 08:46:05,390 INFO L290 TraceCheckUtils]: 102: Hoare triple {60906#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {60906#false} is VALID [2022-04-08 08:46:05,390 INFO L290 TraceCheckUtils]: 103: Hoare triple {60906#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {60906#false} is VALID [2022-04-08 08:46:05,390 INFO L290 TraceCheckUtils]: 104: Hoare triple {60906#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {60906#false} is VALID [2022-04-08 08:46:05,390 INFO L290 TraceCheckUtils]: 105: Hoare triple {60906#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {60906#false} is VALID [2022-04-08 08:46:05,390 INFO L290 TraceCheckUtils]: 106: Hoare triple {60906#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {60906#false} is VALID [2022-04-08 08:46:05,390 INFO L290 TraceCheckUtils]: 107: Hoare triple {60906#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {60906#false} is VALID [2022-04-08 08:46:05,390 INFO L290 TraceCheckUtils]: 108: Hoare triple {60906#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {60906#false} is VALID [2022-04-08 08:46:05,390 INFO L290 TraceCheckUtils]: 109: Hoare triple {60906#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {60906#false} is VALID [2022-04-08 08:46:05,390 INFO L290 TraceCheckUtils]: 110: Hoare triple {60906#false} assume 8640 == #t~mem75;havoc #t~mem75; {60906#false} is VALID [2022-04-08 08:46:05,391 INFO L290 TraceCheckUtils]: 111: Hoare triple {60906#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {60906#false} is VALID [2022-04-08 08:46:05,391 INFO L290 TraceCheckUtils]: 112: Hoare triple {60906#false} assume !(4 == ~blastFlag~0); {60906#false} is VALID [2022-04-08 08:46:05,391 INFO L290 TraceCheckUtils]: 113: Hoare triple {60906#false} assume 7 == ~blastFlag~0; {60906#false} is VALID [2022-04-08 08:46:05,391 INFO L290 TraceCheckUtils]: 114: Hoare triple {60906#false} assume !false; {60906#false} is VALID [2022-04-08 08:46:05,391 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-04-08 08:46:05,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:46:05,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374548833] [2022-04-08 08:46:05,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374548833] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:46:05,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:46:05,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 08:46:05,392 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:46:05,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [116594671] [2022-04-08 08:46:05,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [116594671] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:46:05,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:46:05,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 08:46:05,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955529656] [2022-04-08 08:46:05,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:46:05,392 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 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 115 [2022-04-08 08:46:05,392 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:46:05,393 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 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:46:05,454 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:05,454 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 08:46:05,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:46:05,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 08:46:05,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:46:05,454 INFO L87 Difference]: Start difference. First operand 335 states and 530 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 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:46:09,253 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:46:16,356 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:46:19,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:19,334 INFO L93 Difference]: Finished difference Result 651 states and 1040 transitions. [2022-04-08 08:46:19,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 08:46:19,335 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 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 115 [2022-04-08 08:46:19,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:46:19,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 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:46:19,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 415 transitions. [2022-04-08 08:46:19,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 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:46:19,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 415 transitions. [2022-04-08 08:46:19,338 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 415 transitions. [2022-04-08 08:46:19,591 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 415 edges. 415 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:19,596 INFO L225 Difference]: With dead ends: 651 [2022-04-08 08:46:19,596 INFO L226 Difference]: Without dead ends: 344 [2022-04-08 08:46:19,597 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-08 08:46:19,597 INFO L913 BasicCegarLoop]: 199 mSDtfsCounter, 3 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-04-08 08:46:19,597 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 617 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 431 Invalid, 1 Unknown, 0 Unchecked, 6.6s Time] [2022-04-08 08:46:19,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2022-04-08 08:46:19,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2022-04-08 08:46:19,608 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:46:19,608 INFO L82 GeneralOperation]: Start isEquivalent. First operand 344 states. Second operand has 344 states, 339 states have (on average 1.584070796460177) internal successors, (537), 339 states have internal predecessors, (537), 3 states have call successors, (3), 3 states have 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:46:19,608 INFO L74 IsIncluded]: Start isIncluded. First operand 344 states. Second operand has 344 states, 339 states have (on average 1.584070796460177) internal successors, (537), 339 states have internal predecessors, (537), 3 states have call successors, (3), 3 states have 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:46:19,609 INFO L87 Difference]: Start difference. First operand 344 states. Second operand has 344 states, 339 states have (on average 1.584070796460177) internal successors, (537), 339 states have internal predecessors, (537), 3 states have call successors, (3), 3 states have 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:46:19,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:19,613 INFO L93 Difference]: Finished difference Result 344 states and 541 transitions. [2022-04-08 08:46:19,613 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 541 transitions. [2022-04-08 08:46:19,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:46:19,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:46:19,614 INFO L74 IsIncluded]: Start isIncluded. First operand has 344 states, 339 states have (on average 1.584070796460177) internal successors, (537), 339 states have internal predecessors, (537), 3 states have call successors, (3), 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 344 states. [2022-04-08 08:46:19,614 INFO L87 Difference]: Start difference. First operand has 344 states, 339 states have (on average 1.584070796460177) internal successors, (537), 339 states have internal predecessors, (537), 3 states have call successors, (3), 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 344 states. [2022-04-08 08:46:19,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:19,619 INFO L93 Difference]: Finished difference Result 344 states and 541 transitions. [2022-04-08 08:46:19,619 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 541 transitions. [2022-04-08 08:46:19,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:46:19,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:46:19,619 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:46:19,619 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:46:19,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 339 states have (on average 1.584070796460177) internal successors, (537), 339 states have internal predecessors, (537), 3 states have call successors, (3), 3 states have 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:46:19,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 541 transitions. [2022-04-08 08:46:19,632 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 541 transitions. Word has length 115 [2022-04-08 08:46:19,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:46:19,633 INFO L478 AbstractCegarLoop]: Abstraction has 344 states and 541 transitions. [2022-04-08 08:46:19,633 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 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:46:19,633 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 344 states and 541 transitions. [2022-04-08 08:46:20,035 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 541 edges. 541 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:20,035 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 541 transitions. [2022-04-08 08:46:20,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-04-08 08:46:20,036 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:46:20,036 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:46:20,036 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-08 08:46:20,036 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:46:20,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:46:20,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1562206865, now seen corresponding path program 1 times [2022-04-08 08:46:20,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:46:20,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1768874177] [2022-04-08 08:46:20,088 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:46:20,088 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:46:20,088 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:46:20,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1562206865, now seen corresponding path program 2 times [2022-04-08 08:46:20,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:46:20,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173820020] [2022-04-08 08:46:20,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:46:20,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:46:20,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:46:20,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:46:20,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:46:20,230 INFO L290 TraceCheckUtils]: 0: Hoare triple {63603#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {63596#true} is VALID [2022-04-08 08:46:20,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {63596#true} assume true; {63596#true} is VALID [2022-04-08 08:46:20,230 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {63596#true} {63596#true} #678#return; {63596#true} is VALID [2022-04-08 08:46:20,231 INFO L272 TraceCheckUtils]: 0: Hoare triple {63596#true} call ULTIMATE.init(); {63603#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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:46:20,231 INFO L290 TraceCheckUtils]: 1: Hoare triple {63603#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {63596#true} is VALID [2022-04-08 08:46:20,231 INFO L290 TraceCheckUtils]: 2: Hoare triple {63596#true} assume true; {63596#true} is VALID [2022-04-08 08:46:20,231 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {63596#true} {63596#true} #678#return; {63596#true} is VALID [2022-04-08 08:46:20,231 INFO L272 TraceCheckUtils]: 4: Hoare triple {63596#true} call #t~ret161 := main(); {63596#true} is VALID [2022-04-08 08:46:20,231 INFO L290 TraceCheckUtils]: 5: Hoare triple {63596#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {63596#true} is VALID [2022-04-08 08:46:20,232 INFO L290 TraceCheckUtils]: 6: Hoare triple {63596#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {63596#true} is VALID [2022-04-08 08:46:20,232 INFO L272 TraceCheckUtils]: 7: Hoare triple {63596#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {63596#true} is VALID [2022-04-08 08:46:20,232 INFO L290 TraceCheckUtils]: 8: Hoare triple {63596#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {63596#true} is VALID [2022-04-08 08:46:20,232 INFO L290 TraceCheckUtils]: 9: Hoare triple {63596#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {63596#true} is VALID [2022-04-08 08:46:20,232 INFO L290 TraceCheckUtils]: 10: Hoare triple {63596#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {63596#true} is VALID [2022-04-08 08:46:20,232 INFO L290 TraceCheckUtils]: 11: Hoare triple {63596#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {63596#true} is VALID [2022-04-08 08:46:20,232 INFO L290 TraceCheckUtils]: 12: Hoare triple {63596#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {63596#true} is VALID [2022-04-08 08:46:20,232 INFO L290 TraceCheckUtils]: 13: Hoare triple {63596#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {63596#true} is VALID [2022-04-08 08:46:20,232 INFO L290 TraceCheckUtils]: 14: Hoare triple {63596#true} assume !false; {63596#true} is VALID [2022-04-08 08:46:20,232 INFO L290 TraceCheckUtils]: 15: Hoare triple {63596#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {63596#true} is VALID [2022-04-08 08:46:20,232 INFO L290 TraceCheckUtils]: 16: Hoare triple {63596#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {63596#true} is VALID [2022-04-08 08:46:20,232 INFO L290 TraceCheckUtils]: 17: Hoare triple {63596#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {63596#true} is VALID [2022-04-08 08:46:20,232 INFO L290 TraceCheckUtils]: 18: Hoare triple {63596#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {63596#true} is VALID [2022-04-08 08:46:20,232 INFO L290 TraceCheckUtils]: 19: Hoare triple {63596#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {63596#true} is VALID [2022-04-08 08:46:20,232 INFO L290 TraceCheckUtils]: 20: Hoare triple {63596#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {63596#true} is VALID [2022-04-08 08:46:20,233 INFO L290 TraceCheckUtils]: 21: Hoare triple {63596#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {63596#true} is VALID [2022-04-08 08:46:20,233 INFO L290 TraceCheckUtils]: 22: Hoare triple {63596#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {63596#true} is VALID [2022-04-08 08:46:20,233 INFO L290 TraceCheckUtils]: 23: Hoare triple {63596#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {63596#true} is VALID [2022-04-08 08:46:20,233 INFO L290 TraceCheckUtils]: 24: Hoare triple {63596#true} assume 8464 == #t~mem55;havoc #t~mem55; {63596#true} is VALID [2022-04-08 08:46:20,233 INFO L290 TraceCheckUtils]: 25: Hoare triple {63596#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {63596#true} is VALID [2022-04-08 08:46:20,233 INFO L290 TraceCheckUtils]: 26: Hoare triple {63596#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {63596#true} is VALID [2022-04-08 08:46:20,234 INFO L290 TraceCheckUtils]: 27: Hoare triple {63596#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); {63601#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:20,234 INFO L290 TraceCheckUtils]: 28: Hoare triple {63601#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {63601#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:20,235 INFO L290 TraceCheckUtils]: 29: Hoare triple {63601#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {63601#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:20,235 INFO L290 TraceCheckUtils]: 30: Hoare triple {63601#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {63601#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:20,235 INFO L290 TraceCheckUtils]: 31: Hoare triple {63601#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {63601#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:20,236 INFO L290 TraceCheckUtils]: 32: Hoare triple {63601#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {63601#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:20,236 INFO L290 TraceCheckUtils]: 33: Hoare triple {63601#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {63602#(= |ssl3_accept_#t~mem48| 8496)} is VALID [2022-04-08 08:46:20,236 INFO L290 TraceCheckUtils]: 34: Hoare triple {63602#(= |ssl3_accept_#t~mem48| 8496)} assume 16384 == #t~mem48;havoc #t~mem48; {63597#false} is VALID [2022-04-08 08:46:20,236 INFO L290 TraceCheckUtils]: 35: Hoare triple {63597#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {63597#false} is VALID [2022-04-08 08:46:20,237 INFO L290 TraceCheckUtils]: 36: Hoare triple {63597#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {63597#false} is VALID [2022-04-08 08:46:20,237 INFO L290 TraceCheckUtils]: 37: Hoare triple {63597#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {63597#false} is VALID [2022-04-08 08:46:20,237 INFO L290 TraceCheckUtils]: 38: Hoare triple {63597#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {63597#false} is VALID [2022-04-08 08:46:20,237 INFO L290 TraceCheckUtils]: 39: Hoare triple {63597#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {63597#false} is VALID [2022-04-08 08:46:20,237 INFO L290 TraceCheckUtils]: 40: Hoare triple {63597#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {63597#false} is VALID [2022-04-08 08:46:20,237 INFO L290 TraceCheckUtils]: 41: Hoare triple {63597#false} assume 12292 != #t~mem85;havoc #t~mem85; {63597#false} is VALID [2022-04-08 08:46:20,237 INFO L290 TraceCheckUtils]: 42: Hoare triple {63597#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 52 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem87 := read~int(#t~mem86.base, 72 + #t~mem86.offset, 4);call write~int(1 + #t~mem87, #t~mem86.base, 72 + #t~mem86.offset, 4);havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87; {63597#false} is VALID [2022-04-08 08:46:20,237 INFO L290 TraceCheckUtils]: 43: Hoare triple {63597#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {63597#false} is VALID [2022-04-08 08:46:20,237 INFO L290 TraceCheckUtils]: 44: Hoare triple {63597#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {63597#false} is VALID [2022-04-08 08:46:20,237 INFO L290 TraceCheckUtils]: 45: Hoare triple {63597#false} ~skip~0 := 0; {63597#false} is VALID [2022-04-08 08:46:20,237 INFO L290 TraceCheckUtils]: 46: Hoare triple {63597#false} assume !false; {63597#false} is VALID [2022-04-08 08:46:20,237 INFO L290 TraceCheckUtils]: 47: Hoare triple {63597#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {63597#false} is VALID [2022-04-08 08:46:20,237 INFO L290 TraceCheckUtils]: 48: Hoare triple {63597#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {63597#false} is VALID [2022-04-08 08:46:20,237 INFO L290 TraceCheckUtils]: 49: Hoare triple {63597#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {63597#false} is VALID [2022-04-08 08:46:20,238 INFO L290 TraceCheckUtils]: 50: Hoare triple {63597#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {63597#false} is VALID [2022-04-08 08:46:20,238 INFO L290 TraceCheckUtils]: 51: Hoare triple {63597#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {63597#false} is VALID [2022-04-08 08:46:20,238 INFO L290 TraceCheckUtils]: 52: Hoare triple {63597#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {63597#false} is VALID [2022-04-08 08:46:20,238 INFO L290 TraceCheckUtils]: 53: Hoare triple {63597#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {63597#false} is VALID [2022-04-08 08:46:20,238 INFO L290 TraceCheckUtils]: 54: Hoare triple {63597#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {63597#false} is VALID [2022-04-08 08:46:20,238 INFO L290 TraceCheckUtils]: 55: Hoare triple {63597#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {63597#false} is VALID [2022-04-08 08:46:20,238 INFO L290 TraceCheckUtils]: 56: Hoare triple {63597#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {63597#false} is VALID [2022-04-08 08:46:20,238 INFO L290 TraceCheckUtils]: 57: Hoare triple {63597#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {63597#false} is VALID [2022-04-08 08:46:20,238 INFO L290 TraceCheckUtils]: 58: Hoare triple {63597#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {63597#false} is VALID [2022-04-08 08:46:20,238 INFO L290 TraceCheckUtils]: 59: Hoare triple {63597#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {63597#false} is VALID [2022-04-08 08:46:20,238 INFO L290 TraceCheckUtils]: 60: Hoare triple {63597#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {63597#false} is VALID [2022-04-08 08:46:20,238 INFO L290 TraceCheckUtils]: 61: Hoare triple {63597#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {63597#false} is VALID [2022-04-08 08:46:20,238 INFO L290 TraceCheckUtils]: 62: Hoare triple {63597#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {63597#false} is VALID [2022-04-08 08:46:20,238 INFO L290 TraceCheckUtils]: 63: Hoare triple {63597#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {63597#false} is VALID [2022-04-08 08:46:20,238 INFO L290 TraceCheckUtils]: 64: Hoare triple {63597#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {63597#false} is VALID [2022-04-08 08:46:20,239 INFO L290 TraceCheckUtils]: 65: Hoare triple {63597#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {63597#false} is VALID [2022-04-08 08:46:20,239 INFO L290 TraceCheckUtils]: 66: Hoare triple {63597#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {63597#false} is VALID [2022-04-08 08:46:20,239 INFO L290 TraceCheckUtils]: 67: Hoare triple {63597#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {63597#false} is VALID [2022-04-08 08:46:20,239 INFO L290 TraceCheckUtils]: 68: Hoare triple {63597#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {63597#false} is VALID [2022-04-08 08:46:20,239 INFO L290 TraceCheckUtils]: 69: Hoare triple {63597#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {63597#false} is VALID [2022-04-08 08:46:20,239 INFO L290 TraceCheckUtils]: 70: Hoare triple {63597#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {63597#false} is VALID [2022-04-08 08:46:20,239 INFO L290 TraceCheckUtils]: 71: Hoare triple {63597#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {63597#false} is VALID [2022-04-08 08:46:20,239 INFO L290 TraceCheckUtils]: 72: Hoare triple {63597#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {63597#false} is VALID [2022-04-08 08:46:20,239 INFO L290 TraceCheckUtils]: 73: Hoare triple {63597#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {63597#false} is VALID [2022-04-08 08:46:20,239 INFO L290 TraceCheckUtils]: 74: Hoare triple {63597#false} assume 8608 == #t~mem73;havoc #t~mem73; {63597#false} is VALID [2022-04-08 08:46:20,239 INFO L290 TraceCheckUtils]: 75: Hoare triple {63597#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {63597#false} is VALID [2022-04-08 08:46:20,239 INFO L290 TraceCheckUtils]: 76: Hoare triple {63597#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {63597#false} is VALID [2022-04-08 08:46:20,239 INFO L290 TraceCheckUtils]: 77: Hoare triple {63597#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {63597#false} is VALID [2022-04-08 08:46:20,239 INFO L290 TraceCheckUtils]: 78: Hoare triple {63597#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {63597#false} is VALID [2022-04-08 08:46:20,240 INFO L290 TraceCheckUtils]: 79: Hoare triple {63597#false} ~skip~0 := 0; {63597#false} is VALID [2022-04-08 08:46:20,240 INFO L290 TraceCheckUtils]: 80: Hoare triple {63597#false} assume !false; {63597#false} is VALID [2022-04-08 08:46:20,240 INFO L290 TraceCheckUtils]: 81: Hoare triple {63597#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {63597#false} is VALID [2022-04-08 08:46:20,240 INFO L290 TraceCheckUtils]: 82: Hoare triple {63597#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {63597#false} is VALID [2022-04-08 08:46:20,240 INFO L290 TraceCheckUtils]: 83: Hoare triple {63597#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {63597#false} is VALID [2022-04-08 08:46:20,240 INFO L290 TraceCheckUtils]: 84: Hoare triple {63597#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {63597#false} is VALID [2022-04-08 08:46:20,240 INFO L290 TraceCheckUtils]: 85: Hoare triple {63597#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {63597#false} is VALID [2022-04-08 08:46:20,240 INFO L290 TraceCheckUtils]: 86: Hoare triple {63597#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {63597#false} is VALID [2022-04-08 08:46:20,240 INFO L290 TraceCheckUtils]: 87: Hoare triple {63597#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {63597#false} is VALID [2022-04-08 08:46:20,240 INFO L290 TraceCheckUtils]: 88: Hoare triple {63597#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {63597#false} is VALID [2022-04-08 08:46:20,240 INFO L290 TraceCheckUtils]: 89: Hoare triple {63597#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {63597#false} is VALID [2022-04-08 08:46:20,240 INFO L290 TraceCheckUtils]: 90: Hoare triple {63597#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {63597#false} is VALID [2022-04-08 08:46:20,240 INFO L290 TraceCheckUtils]: 91: Hoare triple {63597#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {63597#false} is VALID [2022-04-08 08:46:20,240 INFO L290 TraceCheckUtils]: 92: Hoare triple {63597#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {63597#false} is VALID [2022-04-08 08:46:20,241 INFO L290 TraceCheckUtils]: 93: Hoare triple {63597#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {63597#false} is VALID [2022-04-08 08:46:20,241 INFO L290 TraceCheckUtils]: 94: Hoare triple {63597#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {63597#false} is VALID [2022-04-08 08:46:20,241 INFO L290 TraceCheckUtils]: 95: Hoare triple {63597#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {63597#false} is VALID [2022-04-08 08:46:20,241 INFO L290 TraceCheckUtils]: 96: Hoare triple {63597#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {63597#false} is VALID [2022-04-08 08:46:20,241 INFO L290 TraceCheckUtils]: 97: Hoare triple {63597#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {63597#false} is VALID [2022-04-08 08:46:20,241 INFO L290 TraceCheckUtils]: 98: Hoare triple {63597#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {63597#false} is VALID [2022-04-08 08:46:20,241 INFO L290 TraceCheckUtils]: 99: Hoare triple {63597#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {63597#false} is VALID [2022-04-08 08:46:20,241 INFO L290 TraceCheckUtils]: 100: Hoare triple {63597#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {63597#false} is VALID [2022-04-08 08:46:20,241 INFO L290 TraceCheckUtils]: 101: Hoare triple {63597#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {63597#false} is VALID [2022-04-08 08:46:20,241 INFO L290 TraceCheckUtils]: 102: Hoare triple {63597#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {63597#false} is VALID [2022-04-08 08:46:20,241 INFO L290 TraceCheckUtils]: 103: Hoare triple {63597#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {63597#false} is VALID [2022-04-08 08:46:20,241 INFO L290 TraceCheckUtils]: 104: Hoare triple {63597#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {63597#false} is VALID [2022-04-08 08:46:20,241 INFO L290 TraceCheckUtils]: 105: Hoare triple {63597#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {63597#false} is VALID [2022-04-08 08:46:20,241 INFO L290 TraceCheckUtils]: 106: Hoare triple {63597#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {63597#false} is VALID [2022-04-08 08:46:20,241 INFO L290 TraceCheckUtils]: 107: Hoare triple {63597#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {63597#false} is VALID [2022-04-08 08:46:20,242 INFO L290 TraceCheckUtils]: 108: Hoare triple {63597#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {63597#false} is VALID [2022-04-08 08:46:20,242 INFO L290 TraceCheckUtils]: 109: Hoare triple {63597#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {63597#false} is VALID [2022-04-08 08:46:20,242 INFO L290 TraceCheckUtils]: 110: Hoare triple {63597#false} assume 8640 == #t~mem75;havoc #t~mem75; {63597#false} is VALID [2022-04-08 08:46:20,242 INFO L290 TraceCheckUtils]: 111: Hoare triple {63597#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {63597#false} is VALID [2022-04-08 08:46:20,242 INFO L290 TraceCheckUtils]: 112: Hoare triple {63597#false} assume !(4 == ~blastFlag~0); {63597#false} is VALID [2022-04-08 08:46:20,242 INFO L290 TraceCheckUtils]: 113: Hoare triple {63597#false} assume 7 == ~blastFlag~0; {63597#false} is VALID [2022-04-08 08:46:20,242 INFO L290 TraceCheckUtils]: 114: Hoare triple {63597#false} assume !false; {63597#false} is VALID [2022-04-08 08:46:20,242 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-04-08 08:46:20,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:46:20,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173820020] [2022-04-08 08:46:20,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173820020] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:46:20,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:46:20,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:46:20,243 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:46:20,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1768874177] [2022-04-08 08:46:20,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1768874177] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:46:20,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:46:20,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:46:20,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314801351] [2022-04-08 08:46:20,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:46:20,243 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 115 [2022-04-08 08:46:20,244 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:46:20,244 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:20,297 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:20,297 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:46:20,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:46:20,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:46:20,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:46:20,298 INFO L87 Difference]: Start difference. First operand 344 states and 541 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:23,909 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:46:25,977 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:46:28,402 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:46:33,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:33,204 INFO L93 Difference]: Finished difference Result 687 states and 1085 transitions. [2022-04-08 08:46:33,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:46:33,204 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 115 [2022-04-08 08:46:33,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:46:33,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:33,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 461 transitions. [2022-04-08 08:46:33,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:33,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 461 transitions. [2022-04-08 08:46:33,207 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 461 transitions. [2022-04-08 08:46:33,498 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:46:33,504 INFO L225 Difference]: With dead ends: 687 [2022-04-08 08:46:33,504 INFO L226 Difference]: Without dead ends: 371 [2022-04-08 08:46:33,504 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:46:33,505 INFO L913 BasicCegarLoop]: 193 mSDtfsCounter, 39 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-04-08 08:46:33,505 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 495 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2022-04-08 08:46:33,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2022-04-08 08:46:33,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 344. [2022-04-08 08:46:33,515 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:46:33,515 INFO L82 GeneralOperation]: Start isEquivalent. First operand 371 states. Second operand has 344 states, 339 states have (on average 1.5811209439528024) internal successors, (536), 339 states have internal predecessors, (536), 3 states have call successors, (3), 3 states have 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:46:33,516 INFO L74 IsIncluded]: Start isIncluded. First operand 371 states. Second operand has 344 states, 339 states have (on average 1.5811209439528024) internal successors, (536), 339 states have internal predecessors, (536), 3 states have call successors, (3), 3 states have 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:46:33,516 INFO L87 Difference]: Start difference. First operand 371 states. Second operand has 344 states, 339 states have (on average 1.5811209439528024) internal successors, (536), 339 states have internal predecessors, (536), 3 states have call successors, (3), 3 states have 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:46:33,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:33,521 INFO L93 Difference]: Finished difference Result 371 states and 575 transitions. [2022-04-08 08:46:33,521 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 575 transitions. [2022-04-08 08:46:33,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:46:33,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:46:33,521 INFO L74 IsIncluded]: Start isIncluded. First operand has 344 states, 339 states have (on average 1.5811209439528024) internal successors, (536), 339 states have internal predecessors, (536), 3 states have call successors, (3), 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 371 states. [2022-04-08 08:46:33,522 INFO L87 Difference]: Start difference. First operand has 344 states, 339 states have (on average 1.5811209439528024) internal successors, (536), 339 states have internal predecessors, (536), 3 states have call successors, (3), 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 371 states. [2022-04-08 08:46:33,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:33,527 INFO L93 Difference]: Finished difference Result 371 states and 575 transitions. [2022-04-08 08:46:33,527 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 575 transitions. [2022-04-08 08:46:33,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:46:33,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:46:33,527 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:46:33,527 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:46:33,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 339 states have (on average 1.5811209439528024) internal successors, (536), 339 states have internal predecessors, (536), 3 states have call successors, (3), 3 states have 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:46:33,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 540 transitions. [2022-04-08 08:46:33,532 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 540 transitions. Word has length 115 [2022-04-08 08:46:33,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:46:33,533 INFO L478 AbstractCegarLoop]: Abstraction has 344 states and 540 transitions. [2022-04-08 08:46:33,533 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:33,533 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 344 states and 540 transitions. [2022-04-08 08:46:33,930 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 540 edges. 540 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:33,931 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 540 transitions. [2022-04-08 08:46:33,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-04-08 08:46:33,931 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:46:33,938 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:46:33,938 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-08 08:46:33,938 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:46:33,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:46:33,938 INFO L85 PathProgramCache]: Analyzing trace with hash 497793162, now seen corresponding path program 1 times [2022-04-08 08:46:33,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:46:33,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [324023131] [2022-04-08 08:46:33,992 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:46:33,993 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:46:33,993 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:46:33,993 INFO L85 PathProgramCache]: Analyzing trace with hash 497793162, now seen corresponding path program 2 times [2022-04-08 08:46:33,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:46:33,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126659117] [2022-04-08 08:46:33,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:46:33,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:46:34,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:46:34,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:46:34,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:46:34,139 INFO L290 TraceCheckUtils]: 0: Hoare triple {66419#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {66412#true} is VALID [2022-04-08 08:46:34,139 INFO L290 TraceCheckUtils]: 1: Hoare triple {66412#true} assume true; {66412#true} is VALID [2022-04-08 08:46:34,139 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {66412#true} {66412#true} #678#return; {66412#true} is VALID [2022-04-08 08:46:34,140 INFO L272 TraceCheckUtils]: 0: Hoare triple {66412#true} call ULTIMATE.init(); {66419#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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:46:34,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {66419#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {66412#true} is VALID [2022-04-08 08:46:34,140 INFO L290 TraceCheckUtils]: 2: Hoare triple {66412#true} assume true; {66412#true} is VALID [2022-04-08 08:46:34,140 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66412#true} {66412#true} #678#return; {66412#true} is VALID [2022-04-08 08:46:34,140 INFO L272 TraceCheckUtils]: 4: Hoare triple {66412#true} call #t~ret161 := main(); {66412#true} is VALID [2022-04-08 08:46:34,140 INFO L290 TraceCheckUtils]: 5: Hoare triple {66412#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {66412#true} is VALID [2022-04-08 08:46:34,140 INFO L290 TraceCheckUtils]: 6: Hoare triple {66412#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {66412#true} is VALID [2022-04-08 08:46:34,140 INFO L272 TraceCheckUtils]: 7: Hoare triple {66412#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {66412#true} is VALID [2022-04-08 08:46:34,140 INFO L290 TraceCheckUtils]: 8: Hoare triple {66412#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {66412#true} is VALID [2022-04-08 08:46:34,141 INFO L290 TraceCheckUtils]: 9: Hoare triple {66412#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {66412#true} is VALID [2022-04-08 08:46:34,141 INFO L290 TraceCheckUtils]: 10: Hoare triple {66412#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {66412#true} is VALID [2022-04-08 08:46:34,141 INFO L290 TraceCheckUtils]: 11: Hoare triple {66412#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {66412#true} is VALID [2022-04-08 08:46:34,141 INFO L290 TraceCheckUtils]: 12: Hoare triple {66412#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {66412#true} is VALID [2022-04-08 08:46:34,141 INFO L290 TraceCheckUtils]: 13: Hoare triple {66412#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {66412#true} is VALID [2022-04-08 08:46:34,141 INFO L290 TraceCheckUtils]: 14: Hoare triple {66412#true} assume !false; {66412#true} is VALID [2022-04-08 08:46:34,141 INFO L290 TraceCheckUtils]: 15: Hoare triple {66412#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {66412#true} is VALID [2022-04-08 08:46:34,141 INFO L290 TraceCheckUtils]: 16: Hoare triple {66412#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {66412#true} is VALID [2022-04-08 08:46:34,141 INFO L290 TraceCheckUtils]: 17: Hoare triple {66412#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {66412#true} is VALID [2022-04-08 08:46:34,141 INFO L290 TraceCheckUtils]: 18: Hoare triple {66412#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {66412#true} is VALID [2022-04-08 08:46:34,141 INFO L290 TraceCheckUtils]: 19: Hoare triple {66412#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {66412#true} is VALID [2022-04-08 08:46:34,141 INFO L290 TraceCheckUtils]: 20: Hoare triple {66412#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {66412#true} is VALID [2022-04-08 08:46:34,141 INFO L290 TraceCheckUtils]: 21: Hoare triple {66412#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {66412#true} is VALID [2022-04-08 08:46:34,141 INFO L290 TraceCheckUtils]: 22: Hoare triple {66412#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {66412#true} is VALID [2022-04-08 08:46:34,142 INFO L290 TraceCheckUtils]: 23: Hoare triple {66412#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {66412#true} is VALID [2022-04-08 08:46:34,142 INFO L290 TraceCheckUtils]: 24: Hoare triple {66412#true} assume 8464 == #t~mem55;havoc #t~mem55; {66412#true} is VALID [2022-04-08 08:46:34,142 INFO L290 TraceCheckUtils]: 25: Hoare triple {66412#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {66412#true} is VALID [2022-04-08 08:46:34,142 INFO L290 TraceCheckUtils]: 26: Hoare triple {66412#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {66412#true} is VALID [2022-04-08 08:46:34,143 INFO L290 TraceCheckUtils]: 27: Hoare triple {66412#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); {66417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:34,143 INFO L290 TraceCheckUtils]: 28: Hoare triple {66417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {66417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:34,144 INFO L290 TraceCheckUtils]: 29: Hoare triple {66417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {66417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:34,144 INFO L290 TraceCheckUtils]: 30: Hoare triple {66417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {66417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:34,144 INFO L290 TraceCheckUtils]: 31: Hoare triple {66417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {66417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:34,145 INFO L290 TraceCheckUtils]: 32: Hoare triple {66417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {66417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:34,145 INFO L290 TraceCheckUtils]: 33: Hoare triple {66417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {66417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:34,145 INFO L290 TraceCheckUtils]: 34: Hoare triple {66417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {66418#(= |ssl3_accept_#t~mem49| 8496)} is VALID [2022-04-08 08:46:34,146 INFO L290 TraceCheckUtils]: 35: Hoare triple {66418#(= |ssl3_accept_#t~mem49| 8496)} assume 8192 == #t~mem49;havoc #t~mem49; {66413#false} is VALID [2022-04-08 08:46:34,146 INFO L290 TraceCheckUtils]: 36: Hoare triple {66413#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {66413#false} is VALID [2022-04-08 08:46:34,146 INFO L290 TraceCheckUtils]: 37: Hoare triple {66413#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {66413#false} is VALID [2022-04-08 08:46:34,146 INFO L290 TraceCheckUtils]: 38: Hoare triple {66413#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {66413#false} is VALID [2022-04-08 08:46:34,146 INFO L290 TraceCheckUtils]: 39: Hoare triple {66413#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {66413#false} is VALID [2022-04-08 08:46:34,146 INFO L290 TraceCheckUtils]: 40: Hoare triple {66413#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {66413#false} is VALID [2022-04-08 08:46:34,146 INFO L290 TraceCheckUtils]: 41: Hoare triple {66413#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {66413#false} is VALID [2022-04-08 08:46:34,155 INFO L290 TraceCheckUtils]: 42: Hoare triple {66413#false} assume 12292 != #t~mem85;havoc #t~mem85; {66413#false} is VALID [2022-04-08 08:46:34,155 INFO L290 TraceCheckUtils]: 43: Hoare triple {66413#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 52 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem87 := read~int(#t~mem86.base, 72 + #t~mem86.offset, 4);call write~int(1 + #t~mem87, #t~mem86.base, 72 + #t~mem86.offset, 4);havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87; {66413#false} is VALID [2022-04-08 08:46:34,155 INFO L290 TraceCheckUtils]: 44: Hoare triple {66413#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {66413#false} is VALID [2022-04-08 08:46:34,155 INFO L290 TraceCheckUtils]: 45: Hoare triple {66413#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {66413#false} is VALID [2022-04-08 08:46:34,155 INFO L290 TraceCheckUtils]: 46: Hoare triple {66413#false} ~skip~0 := 0; {66413#false} is VALID [2022-04-08 08:46:34,155 INFO L290 TraceCheckUtils]: 47: Hoare triple {66413#false} assume !false; {66413#false} is VALID [2022-04-08 08:46:34,155 INFO L290 TraceCheckUtils]: 48: Hoare triple {66413#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {66413#false} is VALID [2022-04-08 08:46:34,156 INFO L290 TraceCheckUtils]: 49: Hoare triple {66413#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {66413#false} is VALID [2022-04-08 08:46:34,156 INFO L290 TraceCheckUtils]: 50: Hoare triple {66413#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {66413#false} is VALID [2022-04-08 08:46:34,156 INFO L290 TraceCheckUtils]: 51: Hoare triple {66413#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {66413#false} is VALID [2022-04-08 08:46:34,156 INFO L290 TraceCheckUtils]: 52: Hoare triple {66413#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {66413#false} is VALID [2022-04-08 08:46:34,156 INFO L290 TraceCheckUtils]: 53: Hoare triple {66413#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {66413#false} is VALID [2022-04-08 08:46:34,156 INFO L290 TraceCheckUtils]: 54: Hoare triple {66413#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {66413#false} is VALID [2022-04-08 08:46:34,156 INFO L290 TraceCheckUtils]: 55: Hoare triple {66413#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {66413#false} is VALID [2022-04-08 08:46:34,156 INFO L290 TraceCheckUtils]: 56: Hoare triple {66413#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {66413#false} is VALID [2022-04-08 08:46:34,156 INFO L290 TraceCheckUtils]: 57: Hoare triple {66413#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {66413#false} is VALID [2022-04-08 08:46:34,156 INFO L290 TraceCheckUtils]: 58: Hoare triple {66413#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {66413#false} is VALID [2022-04-08 08:46:34,156 INFO L290 TraceCheckUtils]: 59: Hoare triple {66413#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {66413#false} is VALID [2022-04-08 08:46:34,156 INFO L290 TraceCheckUtils]: 60: Hoare triple {66413#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {66413#false} is VALID [2022-04-08 08:46:34,156 INFO L290 TraceCheckUtils]: 61: Hoare triple {66413#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {66413#false} is VALID [2022-04-08 08:46:34,156 INFO L290 TraceCheckUtils]: 62: Hoare triple {66413#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {66413#false} is VALID [2022-04-08 08:46:34,156 INFO L290 TraceCheckUtils]: 63: Hoare triple {66413#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {66413#false} is VALID [2022-04-08 08:46:34,157 INFO L290 TraceCheckUtils]: 64: Hoare triple {66413#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {66413#false} is VALID [2022-04-08 08:46:34,157 INFO L290 TraceCheckUtils]: 65: Hoare triple {66413#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {66413#false} is VALID [2022-04-08 08:46:34,157 INFO L290 TraceCheckUtils]: 66: Hoare triple {66413#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {66413#false} is VALID [2022-04-08 08:46:34,157 INFO L290 TraceCheckUtils]: 67: Hoare triple {66413#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {66413#false} is VALID [2022-04-08 08:46:34,157 INFO L290 TraceCheckUtils]: 68: Hoare triple {66413#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {66413#false} is VALID [2022-04-08 08:46:34,157 INFO L290 TraceCheckUtils]: 69: Hoare triple {66413#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {66413#false} is VALID [2022-04-08 08:46:34,157 INFO L290 TraceCheckUtils]: 70: Hoare triple {66413#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {66413#false} is VALID [2022-04-08 08:46:34,157 INFO L290 TraceCheckUtils]: 71: Hoare triple {66413#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {66413#false} is VALID [2022-04-08 08:46:34,157 INFO L290 TraceCheckUtils]: 72: Hoare triple {66413#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {66413#false} is VALID [2022-04-08 08:46:34,157 INFO L290 TraceCheckUtils]: 73: Hoare triple {66413#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {66413#false} is VALID [2022-04-08 08:46:34,157 INFO L290 TraceCheckUtils]: 74: Hoare triple {66413#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {66413#false} is VALID [2022-04-08 08:46:34,157 INFO L290 TraceCheckUtils]: 75: Hoare triple {66413#false} assume 8608 == #t~mem73;havoc #t~mem73; {66413#false} is VALID [2022-04-08 08:46:34,157 INFO L290 TraceCheckUtils]: 76: Hoare triple {66413#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {66413#false} is VALID [2022-04-08 08:46:34,157 INFO L290 TraceCheckUtils]: 77: Hoare triple {66413#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {66413#false} is VALID [2022-04-08 08:46:34,157 INFO L290 TraceCheckUtils]: 78: Hoare triple {66413#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {66413#false} is VALID [2022-04-08 08:46:34,158 INFO L290 TraceCheckUtils]: 79: Hoare triple {66413#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {66413#false} is VALID [2022-04-08 08:46:34,158 INFO L290 TraceCheckUtils]: 80: Hoare triple {66413#false} ~skip~0 := 0; {66413#false} is VALID [2022-04-08 08:46:34,158 INFO L290 TraceCheckUtils]: 81: Hoare triple {66413#false} assume !false; {66413#false} is VALID [2022-04-08 08:46:34,158 INFO L290 TraceCheckUtils]: 82: Hoare triple {66413#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {66413#false} is VALID [2022-04-08 08:46:34,158 INFO L290 TraceCheckUtils]: 83: Hoare triple {66413#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {66413#false} is VALID [2022-04-08 08:46:34,158 INFO L290 TraceCheckUtils]: 84: Hoare triple {66413#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {66413#false} is VALID [2022-04-08 08:46:34,158 INFO L290 TraceCheckUtils]: 85: Hoare triple {66413#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {66413#false} is VALID [2022-04-08 08:46:34,158 INFO L290 TraceCheckUtils]: 86: Hoare triple {66413#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {66413#false} is VALID [2022-04-08 08:46:34,158 INFO L290 TraceCheckUtils]: 87: Hoare triple {66413#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {66413#false} is VALID [2022-04-08 08:46:34,158 INFO L290 TraceCheckUtils]: 88: Hoare triple {66413#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {66413#false} is VALID [2022-04-08 08:46:34,158 INFO L290 TraceCheckUtils]: 89: Hoare triple {66413#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {66413#false} is VALID [2022-04-08 08:46:34,158 INFO L290 TraceCheckUtils]: 90: Hoare triple {66413#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {66413#false} is VALID [2022-04-08 08:46:34,158 INFO L290 TraceCheckUtils]: 91: Hoare triple {66413#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {66413#false} is VALID [2022-04-08 08:46:34,158 INFO L290 TraceCheckUtils]: 92: Hoare triple {66413#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {66413#false} is VALID [2022-04-08 08:46:34,159 INFO L290 TraceCheckUtils]: 93: Hoare triple {66413#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {66413#false} is VALID [2022-04-08 08:46:34,159 INFO L290 TraceCheckUtils]: 94: Hoare triple {66413#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {66413#false} is VALID [2022-04-08 08:46:34,159 INFO L290 TraceCheckUtils]: 95: Hoare triple {66413#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {66413#false} is VALID [2022-04-08 08:46:34,159 INFO L290 TraceCheckUtils]: 96: Hoare triple {66413#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {66413#false} is VALID [2022-04-08 08:46:34,159 INFO L290 TraceCheckUtils]: 97: Hoare triple {66413#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {66413#false} is VALID [2022-04-08 08:46:34,159 INFO L290 TraceCheckUtils]: 98: Hoare triple {66413#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {66413#false} is VALID [2022-04-08 08:46:34,159 INFO L290 TraceCheckUtils]: 99: Hoare triple {66413#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {66413#false} is VALID [2022-04-08 08:46:34,159 INFO L290 TraceCheckUtils]: 100: Hoare triple {66413#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {66413#false} is VALID [2022-04-08 08:46:34,159 INFO L290 TraceCheckUtils]: 101: Hoare triple {66413#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {66413#false} is VALID [2022-04-08 08:46:34,159 INFO L290 TraceCheckUtils]: 102: Hoare triple {66413#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {66413#false} is VALID [2022-04-08 08:46:34,159 INFO L290 TraceCheckUtils]: 103: Hoare triple {66413#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {66413#false} is VALID [2022-04-08 08:46:34,159 INFO L290 TraceCheckUtils]: 104: Hoare triple {66413#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {66413#false} is VALID [2022-04-08 08:46:34,159 INFO L290 TraceCheckUtils]: 105: Hoare triple {66413#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {66413#false} is VALID [2022-04-08 08:46:34,159 INFO L290 TraceCheckUtils]: 106: Hoare triple {66413#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {66413#false} is VALID [2022-04-08 08:46:34,159 INFO L290 TraceCheckUtils]: 107: Hoare triple {66413#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {66413#false} is VALID [2022-04-08 08:46:34,160 INFO L290 TraceCheckUtils]: 108: Hoare triple {66413#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {66413#false} is VALID [2022-04-08 08:46:34,160 INFO L290 TraceCheckUtils]: 109: Hoare triple {66413#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {66413#false} is VALID [2022-04-08 08:46:34,160 INFO L290 TraceCheckUtils]: 110: Hoare triple {66413#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {66413#false} is VALID [2022-04-08 08:46:34,160 INFO L290 TraceCheckUtils]: 111: Hoare triple {66413#false} assume 8640 == #t~mem75;havoc #t~mem75; {66413#false} is VALID [2022-04-08 08:46:34,160 INFO L290 TraceCheckUtils]: 112: Hoare triple {66413#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {66413#false} is VALID [2022-04-08 08:46:34,160 INFO L290 TraceCheckUtils]: 113: Hoare triple {66413#false} assume !(4 == ~blastFlag~0); {66413#false} is VALID [2022-04-08 08:46:34,160 INFO L290 TraceCheckUtils]: 114: Hoare triple {66413#false} assume 7 == ~blastFlag~0; {66413#false} is VALID [2022-04-08 08:46:34,160 INFO L290 TraceCheckUtils]: 115: Hoare triple {66413#false} assume !false; {66413#false} is VALID [2022-04-08 08:46:34,160 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-04-08 08:46:34,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:46:34,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126659117] [2022-04-08 08:46:34,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126659117] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:46:34,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:46:34,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:46:34,161 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:46:34,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [324023131] [2022-04-08 08:46:34,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [324023131] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:46:34,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:46:34,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:46:34,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678618673] [2022-04-08 08:46:34,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:46:34,162 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 116 [2022-04-08 08:46:34,162 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:46:34,162 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:34,219 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:34,220 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:46:34,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:46:34,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:46:34,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:46:34,220 INFO L87 Difference]: Start difference. First operand 344 states and 540 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:37,775 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:46:39,828 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:46:45,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:45,123 INFO L93 Difference]: Finished difference Result 687 states and 1083 transitions. [2022-04-08 08:46:45,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:46:45,123 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 116 [2022-04-08 08:46:45,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:46:45,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:45,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 460 transitions. [2022-04-08 08:46:45,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:45,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 460 transitions. [2022-04-08 08:46:45,127 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 460 transitions. [2022-04-08 08:46:45,427 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 460 edges. 460 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:45,433 INFO L225 Difference]: With dead ends: 687 [2022-04-08 08:46:45,433 INFO L226 Difference]: Without dead ends: 371 [2022-04-08 08:46:45,433 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:46:45,434 INFO L913 BasicCegarLoop]: 193 mSDtfsCounter, 37 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 10 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-04-08 08:46:45,434 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 495 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 384 Invalid, 2 Unknown, 0 Unchecked, 6.7s Time] [2022-04-08 08:46:45,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2022-04-08 08:46:45,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 344. [2022-04-08 08:46:45,445 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:46:45,445 INFO L82 GeneralOperation]: Start isEquivalent. First operand 371 states. Second operand has 344 states, 339 states have (on average 1.5781710914454277) internal successors, (535), 339 states have internal predecessors, (535), 3 states have call successors, (3), 3 states have 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:46:45,445 INFO L74 IsIncluded]: Start isIncluded. First operand 371 states. Second operand has 344 states, 339 states have (on average 1.5781710914454277) internal successors, (535), 339 states have internal predecessors, (535), 3 states have call successors, (3), 3 states have 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:46:45,446 INFO L87 Difference]: Start difference. First operand 371 states. Second operand has 344 states, 339 states have (on average 1.5781710914454277) internal successors, (535), 339 states have internal predecessors, (535), 3 states have call successors, (3), 3 states have 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:46:45,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:45,451 INFO L93 Difference]: Finished difference Result 371 states and 574 transitions. [2022-04-08 08:46:45,451 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 574 transitions. [2022-04-08 08:46:45,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:46:45,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:46:45,451 INFO L74 IsIncluded]: Start isIncluded. First operand has 344 states, 339 states have (on average 1.5781710914454277) internal successors, (535), 339 states have internal predecessors, (535), 3 states have call successors, (3), 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 371 states. [2022-04-08 08:46:45,452 INFO L87 Difference]: Start difference. First operand has 344 states, 339 states have (on average 1.5781710914454277) internal successors, (535), 339 states have internal predecessors, (535), 3 states have call successors, (3), 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 371 states. [2022-04-08 08:46:45,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:45,457 INFO L93 Difference]: Finished difference Result 371 states and 574 transitions. [2022-04-08 08:46:45,457 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 574 transitions. [2022-04-08 08:46:45,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:46:45,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:46:45,457 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:46:45,457 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:46:45,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 339 states have (on average 1.5781710914454277) internal successors, (535), 339 states have internal predecessors, (535), 3 states have call successors, (3), 3 states have 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:46:45,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 539 transitions. [2022-04-08 08:46:45,463 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 539 transitions. Word has length 116 [2022-04-08 08:46:45,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:46:45,463 INFO L478 AbstractCegarLoop]: Abstraction has 344 states and 539 transitions. [2022-04-08 08:46:45,463 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:45,463 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 344 states and 539 transitions. [2022-04-08 08:46:45,883 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 539 edges. 539 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:45,883 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 539 transitions. [2022-04-08 08:46:45,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-04-08 08:46:45,884 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:46:45,884 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:46:45,884 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-08 08:46:45,884 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:46:45,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:46:45,884 INFO L85 PathProgramCache]: Analyzing trace with hash -210940913, now seen corresponding path program 1 times [2022-04-08 08:46:45,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:46:45,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [417020219] [2022-04-08 08:46:45,943 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:46:45,943 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:46:45,943 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:46:45,944 INFO L85 PathProgramCache]: Analyzing trace with hash -210940913, now seen corresponding path program 2 times [2022-04-08 08:46:45,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:46:45,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030335857] [2022-04-08 08:46:45,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:46:45,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:46:46,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:46:46,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:46:46,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:46:46,103 INFO L290 TraceCheckUtils]: 0: Hoare triple {69235#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {69228#true} is VALID [2022-04-08 08:46:46,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {69228#true} assume true; {69228#true} is VALID [2022-04-08 08:46:46,103 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {69228#true} {69228#true} #678#return; {69228#true} is VALID [2022-04-08 08:46:46,104 INFO L272 TraceCheckUtils]: 0: Hoare triple {69228#true} call ULTIMATE.init(); {69235#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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:46:46,104 INFO L290 TraceCheckUtils]: 1: Hoare triple {69235#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {69228#true} is VALID [2022-04-08 08:46:46,104 INFO L290 TraceCheckUtils]: 2: Hoare triple {69228#true} assume true; {69228#true} is VALID [2022-04-08 08:46:46,104 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {69228#true} {69228#true} #678#return; {69228#true} is VALID [2022-04-08 08:46:46,104 INFO L272 TraceCheckUtils]: 4: Hoare triple {69228#true} call #t~ret161 := main(); {69228#true} is VALID [2022-04-08 08:46:46,104 INFO L290 TraceCheckUtils]: 5: Hoare triple {69228#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {69228#true} is VALID [2022-04-08 08:46:46,104 INFO L290 TraceCheckUtils]: 6: Hoare triple {69228#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {69228#true} is VALID [2022-04-08 08:46:46,105 INFO L272 TraceCheckUtils]: 7: Hoare triple {69228#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {69228#true} is VALID [2022-04-08 08:46:46,105 INFO L290 TraceCheckUtils]: 8: Hoare triple {69228#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {69228#true} is VALID [2022-04-08 08:46:46,105 INFO L290 TraceCheckUtils]: 9: Hoare triple {69228#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {69228#true} is VALID [2022-04-08 08:46:46,105 INFO L290 TraceCheckUtils]: 10: Hoare triple {69228#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {69228#true} is VALID [2022-04-08 08:46:46,105 INFO L290 TraceCheckUtils]: 11: Hoare triple {69228#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {69228#true} is VALID [2022-04-08 08:46:46,105 INFO L290 TraceCheckUtils]: 12: Hoare triple {69228#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {69228#true} is VALID [2022-04-08 08:46:46,105 INFO L290 TraceCheckUtils]: 13: Hoare triple {69228#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {69228#true} is VALID [2022-04-08 08:46:46,105 INFO L290 TraceCheckUtils]: 14: Hoare triple {69228#true} assume !false; {69228#true} is VALID [2022-04-08 08:46:46,105 INFO L290 TraceCheckUtils]: 15: Hoare triple {69228#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {69228#true} is VALID [2022-04-08 08:46:46,105 INFO L290 TraceCheckUtils]: 16: Hoare triple {69228#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {69228#true} is VALID [2022-04-08 08:46:46,105 INFO L290 TraceCheckUtils]: 17: Hoare triple {69228#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {69228#true} is VALID [2022-04-08 08:46:46,105 INFO L290 TraceCheckUtils]: 18: Hoare triple {69228#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {69228#true} is VALID [2022-04-08 08:46:46,105 INFO L290 TraceCheckUtils]: 19: Hoare triple {69228#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {69228#true} is VALID [2022-04-08 08:46:46,105 INFO L290 TraceCheckUtils]: 20: Hoare triple {69228#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {69228#true} is VALID [2022-04-08 08:46:46,105 INFO L290 TraceCheckUtils]: 21: Hoare triple {69228#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {69228#true} is VALID [2022-04-08 08:46:46,106 INFO L290 TraceCheckUtils]: 22: Hoare triple {69228#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {69228#true} is VALID [2022-04-08 08:46:46,106 INFO L290 TraceCheckUtils]: 23: Hoare triple {69228#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {69228#true} is VALID [2022-04-08 08:46:46,106 INFO L290 TraceCheckUtils]: 24: Hoare triple {69228#true} assume 8464 == #t~mem55;havoc #t~mem55; {69228#true} is VALID [2022-04-08 08:46:46,106 INFO L290 TraceCheckUtils]: 25: Hoare triple {69228#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {69228#true} is VALID [2022-04-08 08:46:46,106 INFO L290 TraceCheckUtils]: 26: Hoare triple {69228#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {69228#true} is VALID [2022-04-08 08:46:46,107 INFO L290 TraceCheckUtils]: 27: Hoare triple {69228#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); {69233#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:46,107 INFO L290 TraceCheckUtils]: 28: Hoare triple {69233#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {69233#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:46,108 INFO L290 TraceCheckUtils]: 29: Hoare triple {69233#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {69233#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:46,108 INFO L290 TraceCheckUtils]: 30: Hoare triple {69233#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {69233#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:46,108 INFO L290 TraceCheckUtils]: 31: Hoare triple {69233#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {69233#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:46,109 INFO L290 TraceCheckUtils]: 32: Hoare triple {69233#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {69233#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:46,109 INFO L290 TraceCheckUtils]: 33: Hoare triple {69233#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {69233#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:46,109 INFO L290 TraceCheckUtils]: 34: Hoare triple {69233#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {69233#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:46,110 INFO L290 TraceCheckUtils]: 35: Hoare triple {69233#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {69233#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:46,110 INFO L290 TraceCheckUtils]: 36: Hoare triple {69233#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {69234#(not (= |ssl3_accept_#t~mem51| 8195))} is VALID [2022-04-08 08:46:46,110 INFO L290 TraceCheckUtils]: 37: Hoare triple {69234#(not (= |ssl3_accept_#t~mem51| 8195))} assume 8195 == #t~mem51;havoc #t~mem51; {69229#false} is VALID [2022-04-08 08:46:46,110 INFO L290 TraceCheckUtils]: 38: Hoare triple {69229#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {69229#false} is VALID [2022-04-08 08:46:46,110 INFO L290 TraceCheckUtils]: 39: Hoare triple {69229#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {69229#false} is VALID [2022-04-08 08:46:46,111 INFO L290 TraceCheckUtils]: 40: Hoare triple {69229#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {69229#false} is VALID [2022-04-08 08:46:46,111 INFO L290 TraceCheckUtils]: 41: Hoare triple {69229#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {69229#false} is VALID [2022-04-08 08:46:46,111 INFO L290 TraceCheckUtils]: 42: Hoare triple {69229#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {69229#false} is VALID [2022-04-08 08:46:46,111 INFO L290 TraceCheckUtils]: 43: Hoare triple {69229#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {69229#false} is VALID [2022-04-08 08:46:46,111 INFO L290 TraceCheckUtils]: 44: Hoare triple {69229#false} assume 12292 != #t~mem85;havoc #t~mem85; {69229#false} is VALID [2022-04-08 08:46:46,111 INFO L290 TraceCheckUtils]: 45: Hoare triple {69229#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 52 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem87 := read~int(#t~mem86.base, 72 + #t~mem86.offset, 4);call write~int(1 + #t~mem87, #t~mem86.base, 72 + #t~mem86.offset, 4);havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87; {69229#false} is VALID [2022-04-08 08:46:46,111 INFO L290 TraceCheckUtils]: 46: Hoare triple {69229#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {69229#false} is VALID [2022-04-08 08:46:46,111 INFO L290 TraceCheckUtils]: 47: Hoare triple {69229#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {69229#false} is VALID [2022-04-08 08:46:46,111 INFO L290 TraceCheckUtils]: 48: Hoare triple {69229#false} ~skip~0 := 0; {69229#false} is VALID [2022-04-08 08:46:46,111 INFO L290 TraceCheckUtils]: 49: Hoare triple {69229#false} assume !false; {69229#false} is VALID [2022-04-08 08:46:46,111 INFO L290 TraceCheckUtils]: 50: Hoare triple {69229#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {69229#false} is VALID [2022-04-08 08:46:46,111 INFO L290 TraceCheckUtils]: 51: Hoare triple {69229#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {69229#false} is VALID [2022-04-08 08:46:46,111 INFO L290 TraceCheckUtils]: 52: Hoare triple {69229#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {69229#false} is VALID [2022-04-08 08:46:46,111 INFO L290 TraceCheckUtils]: 53: Hoare triple {69229#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {69229#false} is VALID [2022-04-08 08:46:46,112 INFO L290 TraceCheckUtils]: 54: Hoare triple {69229#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {69229#false} is VALID [2022-04-08 08:46:46,112 INFO L290 TraceCheckUtils]: 55: Hoare triple {69229#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {69229#false} is VALID [2022-04-08 08:46:46,112 INFO L290 TraceCheckUtils]: 56: Hoare triple {69229#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {69229#false} is VALID [2022-04-08 08:46:46,112 INFO L290 TraceCheckUtils]: 57: Hoare triple {69229#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {69229#false} is VALID [2022-04-08 08:46:46,112 INFO L290 TraceCheckUtils]: 58: Hoare triple {69229#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {69229#false} is VALID [2022-04-08 08:46:46,112 INFO L290 TraceCheckUtils]: 59: Hoare triple {69229#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {69229#false} is VALID [2022-04-08 08:46:46,112 INFO L290 TraceCheckUtils]: 60: Hoare triple {69229#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {69229#false} is VALID [2022-04-08 08:46:46,112 INFO L290 TraceCheckUtils]: 61: Hoare triple {69229#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {69229#false} is VALID [2022-04-08 08:46:46,112 INFO L290 TraceCheckUtils]: 62: Hoare triple {69229#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {69229#false} is VALID [2022-04-08 08:46:46,112 INFO L290 TraceCheckUtils]: 63: Hoare triple {69229#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {69229#false} is VALID [2022-04-08 08:46:46,112 INFO L290 TraceCheckUtils]: 64: Hoare triple {69229#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {69229#false} is VALID [2022-04-08 08:46:46,112 INFO L290 TraceCheckUtils]: 65: Hoare triple {69229#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {69229#false} is VALID [2022-04-08 08:46:46,112 INFO L290 TraceCheckUtils]: 66: Hoare triple {69229#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {69229#false} is VALID [2022-04-08 08:46:46,113 INFO L290 TraceCheckUtils]: 67: Hoare triple {69229#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {69229#false} is VALID [2022-04-08 08:46:46,113 INFO L290 TraceCheckUtils]: 68: Hoare triple {69229#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {69229#false} is VALID [2022-04-08 08:46:46,113 INFO L290 TraceCheckUtils]: 69: Hoare triple {69229#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {69229#false} is VALID [2022-04-08 08:46:46,113 INFO L290 TraceCheckUtils]: 70: Hoare triple {69229#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {69229#false} is VALID [2022-04-08 08:46:46,113 INFO L290 TraceCheckUtils]: 71: Hoare triple {69229#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {69229#false} is VALID [2022-04-08 08:46:46,113 INFO L290 TraceCheckUtils]: 72: Hoare triple {69229#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {69229#false} is VALID [2022-04-08 08:46:46,113 INFO L290 TraceCheckUtils]: 73: Hoare triple {69229#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {69229#false} is VALID [2022-04-08 08:46:46,113 INFO L290 TraceCheckUtils]: 74: Hoare triple {69229#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {69229#false} is VALID [2022-04-08 08:46:46,113 INFO L290 TraceCheckUtils]: 75: Hoare triple {69229#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {69229#false} is VALID [2022-04-08 08:46:46,113 INFO L290 TraceCheckUtils]: 76: Hoare triple {69229#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {69229#false} is VALID [2022-04-08 08:46:46,113 INFO L290 TraceCheckUtils]: 77: Hoare triple {69229#false} assume 8608 == #t~mem73;havoc #t~mem73; {69229#false} is VALID [2022-04-08 08:46:46,113 INFO L290 TraceCheckUtils]: 78: Hoare triple {69229#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {69229#false} is VALID [2022-04-08 08:46:46,113 INFO L290 TraceCheckUtils]: 79: Hoare triple {69229#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {69229#false} is VALID [2022-04-08 08:46:46,113 INFO L290 TraceCheckUtils]: 80: Hoare triple {69229#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {69229#false} is VALID [2022-04-08 08:46:46,114 INFO L290 TraceCheckUtils]: 81: Hoare triple {69229#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {69229#false} is VALID [2022-04-08 08:46:46,114 INFO L290 TraceCheckUtils]: 82: Hoare triple {69229#false} ~skip~0 := 0; {69229#false} is VALID [2022-04-08 08:46:46,114 INFO L290 TraceCheckUtils]: 83: Hoare triple {69229#false} assume !false; {69229#false} is VALID [2022-04-08 08:46:46,114 INFO L290 TraceCheckUtils]: 84: Hoare triple {69229#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {69229#false} is VALID [2022-04-08 08:46:46,114 INFO L290 TraceCheckUtils]: 85: Hoare triple {69229#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {69229#false} is VALID [2022-04-08 08:46:46,114 INFO L290 TraceCheckUtils]: 86: Hoare triple {69229#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {69229#false} is VALID [2022-04-08 08:46:46,114 INFO L290 TraceCheckUtils]: 87: Hoare triple {69229#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {69229#false} is VALID [2022-04-08 08:46:46,114 INFO L290 TraceCheckUtils]: 88: Hoare triple {69229#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {69229#false} is VALID [2022-04-08 08:46:46,114 INFO L290 TraceCheckUtils]: 89: Hoare triple {69229#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {69229#false} is VALID [2022-04-08 08:46:46,114 INFO L290 TraceCheckUtils]: 90: Hoare triple {69229#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {69229#false} is VALID [2022-04-08 08:46:46,114 INFO L290 TraceCheckUtils]: 91: Hoare triple {69229#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {69229#false} is VALID [2022-04-08 08:46:46,114 INFO L290 TraceCheckUtils]: 92: Hoare triple {69229#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {69229#false} is VALID [2022-04-08 08:46:46,114 INFO L290 TraceCheckUtils]: 93: Hoare triple {69229#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {69229#false} is VALID [2022-04-08 08:46:46,114 INFO L290 TraceCheckUtils]: 94: Hoare triple {69229#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {69229#false} is VALID [2022-04-08 08:46:46,115 INFO L290 TraceCheckUtils]: 95: Hoare triple {69229#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {69229#false} is VALID [2022-04-08 08:46:46,115 INFO L290 TraceCheckUtils]: 96: Hoare triple {69229#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {69229#false} is VALID [2022-04-08 08:46:46,115 INFO L290 TraceCheckUtils]: 97: Hoare triple {69229#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {69229#false} is VALID [2022-04-08 08:46:46,115 INFO L290 TraceCheckUtils]: 98: Hoare triple {69229#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {69229#false} is VALID [2022-04-08 08:46:46,115 INFO L290 TraceCheckUtils]: 99: Hoare triple {69229#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {69229#false} is VALID [2022-04-08 08:46:46,115 INFO L290 TraceCheckUtils]: 100: Hoare triple {69229#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {69229#false} is VALID [2022-04-08 08:46:46,115 INFO L290 TraceCheckUtils]: 101: Hoare triple {69229#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {69229#false} is VALID [2022-04-08 08:46:46,115 INFO L290 TraceCheckUtils]: 102: Hoare triple {69229#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {69229#false} is VALID [2022-04-08 08:46:46,115 INFO L290 TraceCheckUtils]: 103: Hoare triple {69229#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {69229#false} is VALID [2022-04-08 08:46:46,115 INFO L290 TraceCheckUtils]: 104: Hoare triple {69229#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {69229#false} is VALID [2022-04-08 08:46:46,115 INFO L290 TraceCheckUtils]: 105: Hoare triple {69229#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {69229#false} is VALID [2022-04-08 08:46:46,115 INFO L290 TraceCheckUtils]: 106: Hoare triple {69229#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {69229#false} is VALID [2022-04-08 08:46:46,115 INFO L290 TraceCheckUtils]: 107: Hoare triple {69229#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {69229#false} is VALID [2022-04-08 08:46:46,115 INFO L290 TraceCheckUtils]: 108: Hoare triple {69229#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {69229#false} is VALID [2022-04-08 08:46:46,116 INFO L290 TraceCheckUtils]: 109: Hoare triple {69229#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {69229#false} is VALID [2022-04-08 08:46:46,116 INFO L290 TraceCheckUtils]: 110: Hoare triple {69229#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {69229#false} is VALID [2022-04-08 08:46:46,116 INFO L290 TraceCheckUtils]: 111: Hoare triple {69229#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {69229#false} is VALID [2022-04-08 08:46:46,116 INFO L290 TraceCheckUtils]: 112: Hoare triple {69229#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {69229#false} is VALID [2022-04-08 08:46:46,116 INFO L290 TraceCheckUtils]: 113: Hoare triple {69229#false} assume 8640 == #t~mem75;havoc #t~mem75; {69229#false} is VALID [2022-04-08 08:46:46,116 INFO L290 TraceCheckUtils]: 114: Hoare triple {69229#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {69229#false} is VALID [2022-04-08 08:46:46,116 INFO L290 TraceCheckUtils]: 115: Hoare triple {69229#false} assume !(4 == ~blastFlag~0); {69229#false} is VALID [2022-04-08 08:46:46,116 INFO L290 TraceCheckUtils]: 116: Hoare triple {69229#false} assume 7 == ~blastFlag~0; {69229#false} is VALID [2022-04-08 08:46:46,116 INFO L290 TraceCheckUtils]: 117: Hoare triple {69229#false} assume !false; {69229#false} is VALID [2022-04-08 08:46:46,116 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-04-08 08:46:46,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:46:46,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030335857] [2022-04-08 08:46:46,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030335857] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:46:46,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:46:46,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:46:46,117 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:46:46,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [417020219] [2022-04-08 08:46:46,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [417020219] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:46:46,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:46:46,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:46:46,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781204401] [2022-04-08 08:46:46,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:46:46,118 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 118 [2022-04-08 08:46:46,118 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:46:46,118 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:46,190 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:46,190 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:46:46,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:46:46,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:46:46,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:46:46,191 INFO L87 Difference]: Start difference. First operand 344 states and 539 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:53,765 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:46:57,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:57,460 INFO L93 Difference]: Finished difference Result 744 states and 1161 transitions. [2022-04-08 08:46:57,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:46:57,460 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 118 [2022-04-08 08:46:57,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:46:57,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:57,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 578 transitions. [2022-04-08 08:46:57,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:57,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 578 transitions. [2022-04-08 08:46:57,464 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 578 transitions. [2022-04-08 08:46:57,830 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 578 edges. 578 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:57,838 INFO L225 Difference]: With dead ends: 744 [2022-04-08 08:46:57,838 INFO L226 Difference]: Without dead ends: 428 [2022-04-08 08:46:57,839 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:46:57,839 INFO L913 BasicCegarLoop]: 124 mSDtfsCounter, 139 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-04-08 08:46:57,839 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 352 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-04-08 08:46:57,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2022-04-08 08:46:57,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 344. [2022-04-08 08:46:57,850 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:46:57,851 INFO L82 GeneralOperation]: Start isEquivalent. First operand 428 states. Second operand has 344 states, 339 states have (on average 1.5604719764011798) internal successors, (529), 339 states have internal predecessors, (529), 3 states have call successors, (3), 3 states have 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:46:57,851 INFO L74 IsIncluded]: Start isIncluded. First operand 428 states. Second operand has 344 states, 339 states have (on average 1.5604719764011798) internal successors, (529), 339 states have internal predecessors, (529), 3 states have call successors, (3), 3 states have 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:46:57,851 INFO L87 Difference]: Start difference. First operand 428 states. Second operand has 344 states, 339 states have (on average 1.5604719764011798) internal successors, (529), 339 states have internal predecessors, (529), 3 states have call successors, (3), 3 states have 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:46:57,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:57,858 INFO L93 Difference]: Finished difference Result 428 states and 648 transitions. [2022-04-08 08:46:57,858 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 648 transitions. [2022-04-08 08:46:57,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:46:57,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:46:57,859 INFO L74 IsIncluded]: Start isIncluded. First operand has 344 states, 339 states have (on average 1.5604719764011798) internal successors, (529), 339 states have internal predecessors, (529), 3 states have call successors, (3), 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 428 states. [2022-04-08 08:46:57,859 INFO L87 Difference]: Start difference. First operand has 344 states, 339 states have (on average 1.5604719764011798) internal successors, (529), 339 states have internal predecessors, (529), 3 states have call successors, (3), 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 428 states. [2022-04-08 08:46:57,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:57,866 INFO L93 Difference]: Finished difference Result 428 states and 648 transitions. [2022-04-08 08:46:57,866 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 648 transitions. [2022-04-08 08:46:57,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:46:57,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:46:57,866 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:46:57,866 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:46:57,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 339 states have (on average 1.5604719764011798) internal successors, (529), 339 states have internal predecessors, (529), 3 states have call successors, (3), 3 states have 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:46:57,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 533 transitions. [2022-04-08 08:46:57,871 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 533 transitions. Word has length 118 [2022-04-08 08:46:57,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:46:57,872 INFO L478 AbstractCegarLoop]: Abstraction has 344 states and 533 transitions. [2022-04-08 08:46:57,872 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:57,872 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 344 states and 533 transitions. [2022-04-08 08:46:58,284 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 533 edges. 533 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:58,284 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 533 transitions. [2022-04-08 08:46:58,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-04-08 08:46:58,285 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:46:58,285 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:46:58,285 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-08 08:46:58,285 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:46:58,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:46:58,286 INFO L85 PathProgramCache]: Analyzing trace with hash 425730527, now seen corresponding path program 1 times [2022-04-08 08:46:58,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:46:58,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [905235990] [2022-04-08 08:46:58,363 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:46:58,363 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:46:58,363 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:46:58,363 INFO L85 PathProgramCache]: Analyzing trace with hash 425730527, now seen corresponding path program 2 times [2022-04-08 08:46:58,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:46:58,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036771552] [2022-04-08 08:46:58,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:46:58,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:46:58,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:46:58,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:46:58,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:46:58,507 INFO L290 TraceCheckUtils]: 0: Hoare triple {72279#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {72272#true} is VALID [2022-04-08 08:46:58,507 INFO L290 TraceCheckUtils]: 1: Hoare triple {72272#true} assume true; {72272#true} is VALID [2022-04-08 08:46:58,507 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {72272#true} {72272#true} #678#return; {72272#true} is VALID [2022-04-08 08:46:58,508 INFO L272 TraceCheckUtils]: 0: Hoare triple {72272#true} call ULTIMATE.init(); {72279#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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:46:58,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {72279#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {72272#true} is VALID [2022-04-08 08:46:58,508 INFO L290 TraceCheckUtils]: 2: Hoare triple {72272#true} assume true; {72272#true} is VALID [2022-04-08 08:46:58,508 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {72272#true} {72272#true} #678#return; {72272#true} is VALID [2022-04-08 08:46:58,508 INFO L272 TraceCheckUtils]: 4: Hoare triple {72272#true} call #t~ret161 := main(); {72272#true} is VALID [2022-04-08 08:46:58,508 INFO L290 TraceCheckUtils]: 5: Hoare triple {72272#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {72272#true} is VALID [2022-04-08 08:46:58,508 INFO L290 TraceCheckUtils]: 6: Hoare triple {72272#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {72272#true} is VALID [2022-04-08 08:46:58,508 INFO L272 TraceCheckUtils]: 7: Hoare triple {72272#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {72272#true} is VALID [2022-04-08 08:46:58,508 INFO L290 TraceCheckUtils]: 8: Hoare triple {72272#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {72272#true} is VALID [2022-04-08 08:46:58,508 INFO L290 TraceCheckUtils]: 9: Hoare triple {72272#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {72272#true} is VALID [2022-04-08 08:46:58,508 INFO L290 TraceCheckUtils]: 10: Hoare triple {72272#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {72272#true} is VALID [2022-04-08 08:46:58,508 INFO L290 TraceCheckUtils]: 11: Hoare triple {72272#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {72272#true} is VALID [2022-04-08 08:46:58,509 INFO L290 TraceCheckUtils]: 12: Hoare triple {72272#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {72272#true} is VALID [2022-04-08 08:46:58,509 INFO L290 TraceCheckUtils]: 13: Hoare triple {72272#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {72272#true} is VALID [2022-04-08 08:46:58,509 INFO L290 TraceCheckUtils]: 14: Hoare triple {72272#true} assume !false; {72272#true} is VALID [2022-04-08 08:46:58,509 INFO L290 TraceCheckUtils]: 15: Hoare triple {72272#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {72272#true} is VALID [2022-04-08 08:46:58,509 INFO L290 TraceCheckUtils]: 16: Hoare triple {72272#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {72272#true} is VALID [2022-04-08 08:46:58,509 INFO L290 TraceCheckUtils]: 17: Hoare triple {72272#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {72272#true} is VALID [2022-04-08 08:46:58,509 INFO L290 TraceCheckUtils]: 18: Hoare triple {72272#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {72272#true} is VALID [2022-04-08 08:46:58,509 INFO L290 TraceCheckUtils]: 19: Hoare triple {72272#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {72272#true} is VALID [2022-04-08 08:46:58,509 INFO L290 TraceCheckUtils]: 20: Hoare triple {72272#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {72272#true} is VALID [2022-04-08 08:46:58,509 INFO L290 TraceCheckUtils]: 21: Hoare triple {72272#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {72272#true} is VALID [2022-04-08 08:46:58,509 INFO L290 TraceCheckUtils]: 22: Hoare triple {72272#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {72272#true} is VALID [2022-04-08 08:46:58,509 INFO L290 TraceCheckUtils]: 23: Hoare triple {72272#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {72272#true} is VALID [2022-04-08 08:46:58,509 INFO L290 TraceCheckUtils]: 24: Hoare triple {72272#true} assume 8464 == #t~mem55;havoc #t~mem55; {72272#true} is VALID [2022-04-08 08:46:58,509 INFO L290 TraceCheckUtils]: 25: Hoare triple {72272#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {72272#true} is VALID [2022-04-08 08:46:58,509 INFO L290 TraceCheckUtils]: 26: Hoare triple {72272#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {72272#true} is VALID [2022-04-08 08:46:58,511 INFO L290 TraceCheckUtils]: 27: Hoare triple {72272#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); {72277#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:58,511 INFO L290 TraceCheckUtils]: 28: Hoare triple {72277#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {72277#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:58,511 INFO L290 TraceCheckUtils]: 29: Hoare triple {72277#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {72277#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:58,512 INFO L290 TraceCheckUtils]: 30: Hoare triple {72277#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {72277#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:58,512 INFO L290 TraceCheckUtils]: 31: Hoare triple {72277#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {72277#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:58,512 INFO L290 TraceCheckUtils]: 32: Hoare triple {72277#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {72278#(= |ssl3_accept_#t~mem47| 8496)} is VALID [2022-04-08 08:46:58,513 INFO L290 TraceCheckUtils]: 33: Hoare triple {72278#(= |ssl3_accept_#t~mem47| 8496)} assume 12292 == #t~mem47;havoc #t~mem47; {72273#false} is VALID [2022-04-08 08:46:58,513 INFO L290 TraceCheckUtils]: 34: Hoare triple {72273#false} call write~int(1, ~s.base, 40 + ~s.offset, 4); {72273#false} is VALID [2022-04-08 08:46:58,513 INFO L290 TraceCheckUtils]: 35: Hoare triple {72273#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {72273#false} is VALID [2022-04-08 08:46:58,513 INFO L290 TraceCheckUtils]: 36: Hoare triple {72273#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {72273#false} is VALID [2022-04-08 08:46:58,513 INFO L290 TraceCheckUtils]: 37: Hoare triple {72273#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {72273#false} is VALID [2022-04-08 08:46:58,513 INFO L290 TraceCheckUtils]: 38: Hoare triple {72273#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {72273#false} is VALID [2022-04-08 08:46:58,513 INFO L290 TraceCheckUtils]: 39: Hoare triple {72273#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {72273#false} is VALID [2022-04-08 08:46:58,513 INFO L290 TraceCheckUtils]: 40: Hoare triple {72273#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {72273#false} is VALID [2022-04-08 08:46:58,513 INFO L290 TraceCheckUtils]: 41: Hoare triple {72273#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem89 := read~int(#t~mem88.base, 76 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 76 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {72273#false} is VALID [2022-04-08 08:46:58,513 INFO L290 TraceCheckUtils]: 42: Hoare triple {72273#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {72273#false} is VALID [2022-04-08 08:46:58,513 INFO L290 TraceCheckUtils]: 43: Hoare triple {72273#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {72273#false} is VALID [2022-04-08 08:46:58,513 INFO L290 TraceCheckUtils]: 44: Hoare triple {72273#false} ~skip~0 := 0; {72273#false} is VALID [2022-04-08 08:46:58,514 INFO L290 TraceCheckUtils]: 45: Hoare triple {72273#false} assume !false; {72273#false} is VALID [2022-04-08 08:46:58,514 INFO L290 TraceCheckUtils]: 46: Hoare triple {72273#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {72273#false} is VALID [2022-04-08 08:46:58,514 INFO L290 TraceCheckUtils]: 47: Hoare triple {72273#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {72273#false} is VALID [2022-04-08 08:46:58,514 INFO L290 TraceCheckUtils]: 48: Hoare triple {72273#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {72273#false} is VALID [2022-04-08 08:46:58,514 INFO L290 TraceCheckUtils]: 49: Hoare triple {72273#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {72273#false} is VALID [2022-04-08 08:46:58,514 INFO L290 TraceCheckUtils]: 50: Hoare triple {72273#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {72273#false} is VALID [2022-04-08 08:46:58,514 INFO L290 TraceCheckUtils]: 51: Hoare triple {72273#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {72273#false} is VALID [2022-04-08 08:46:58,514 INFO L290 TraceCheckUtils]: 52: Hoare triple {72273#false} assume 8480 == #t~mem52;havoc #t~mem52; {72273#false} is VALID [2022-04-08 08:46:58,514 INFO L290 TraceCheckUtils]: 53: Hoare triple {72273#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {72273#false} is VALID [2022-04-08 08:46:58,514 INFO L290 TraceCheckUtils]: 54: Hoare triple {72273#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem91.base, 844 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {72273#false} is VALID [2022-04-08 08:46:58,514 INFO L290 TraceCheckUtils]: 55: Hoare triple {72273#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {72273#false} is VALID [2022-04-08 08:46:58,515 INFO L290 TraceCheckUtils]: 56: Hoare triple {72273#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {72273#false} is VALID [2022-04-08 08:46:58,515 INFO L290 TraceCheckUtils]: 57: Hoare triple {72273#false} ~skip~0 := 0; {72273#false} is VALID [2022-04-08 08:46:58,515 INFO L290 TraceCheckUtils]: 58: Hoare triple {72273#false} assume !false; {72273#false} is VALID [2022-04-08 08:46:58,515 INFO L290 TraceCheckUtils]: 59: Hoare triple {72273#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {72273#false} is VALID [2022-04-08 08:46:58,515 INFO L290 TraceCheckUtils]: 60: Hoare triple {72273#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {72273#false} is VALID [2022-04-08 08:46:58,515 INFO L290 TraceCheckUtils]: 61: Hoare triple {72273#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {72273#false} is VALID [2022-04-08 08:46:58,515 INFO L290 TraceCheckUtils]: 62: Hoare triple {72273#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {72273#false} is VALID [2022-04-08 08:46:58,515 INFO L290 TraceCheckUtils]: 63: Hoare triple {72273#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {72273#false} is VALID [2022-04-08 08:46:58,515 INFO L290 TraceCheckUtils]: 64: Hoare triple {72273#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {72273#false} is VALID [2022-04-08 08:46:58,515 INFO L290 TraceCheckUtils]: 65: Hoare triple {72273#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {72273#false} is VALID [2022-04-08 08:46:58,515 INFO L290 TraceCheckUtils]: 66: Hoare triple {72273#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {72273#false} is VALID [2022-04-08 08:46:58,516 INFO L290 TraceCheckUtils]: 67: Hoare triple {72273#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {72273#false} is VALID [2022-04-08 08:46:58,516 INFO L290 TraceCheckUtils]: 68: Hoare triple {72273#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {72273#false} is VALID [2022-04-08 08:46:58,516 INFO L290 TraceCheckUtils]: 69: Hoare triple {72273#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {72273#false} is VALID [2022-04-08 08:46:58,516 INFO L290 TraceCheckUtils]: 70: Hoare triple {72273#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {72273#false} is VALID [2022-04-08 08:46:58,516 INFO L290 TraceCheckUtils]: 71: Hoare triple {72273#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {72273#false} is VALID [2022-04-08 08:46:58,516 INFO L290 TraceCheckUtils]: 72: Hoare triple {72273#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {72273#false} is VALID [2022-04-08 08:46:58,516 INFO L290 TraceCheckUtils]: 73: Hoare triple {72273#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {72273#false} is VALID [2022-04-08 08:46:58,516 INFO L290 TraceCheckUtils]: 74: Hoare triple {72273#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {72273#false} is VALID [2022-04-08 08:46:58,516 INFO L290 TraceCheckUtils]: 75: Hoare triple {72273#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {72273#false} is VALID [2022-04-08 08:46:58,516 INFO L290 TraceCheckUtils]: 76: Hoare triple {72273#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {72273#false} is VALID [2022-04-08 08:46:58,517 INFO L290 TraceCheckUtils]: 77: Hoare triple {72273#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {72273#false} is VALID [2022-04-08 08:46:58,517 INFO L290 TraceCheckUtils]: 78: Hoare triple {72273#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {72273#false} is VALID [2022-04-08 08:46:58,517 INFO L290 TraceCheckUtils]: 79: Hoare triple {72273#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {72273#false} is VALID [2022-04-08 08:46:58,517 INFO L290 TraceCheckUtils]: 80: Hoare triple {72273#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {72273#false} is VALID [2022-04-08 08:46:58,517 INFO L290 TraceCheckUtils]: 81: Hoare triple {72273#false} assume 8448 == #t~mem68;havoc #t~mem68; {72273#false} is VALID [2022-04-08 08:46:58,517 INFO L290 TraceCheckUtils]: 82: Hoare triple {72273#false} assume !(~num1~0 > 0); {72273#false} is VALID [2022-04-08 08:46:58,517 INFO L290 TraceCheckUtils]: 83: Hoare triple {72273#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {72273#false} is VALID [2022-04-08 08:46:58,517 INFO L290 TraceCheckUtils]: 84: Hoare triple {72273#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {72273#false} is VALID [2022-04-08 08:46:58,517 INFO L290 TraceCheckUtils]: 85: Hoare triple {72273#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {72273#false} is VALID [2022-04-08 08:46:58,517 INFO L290 TraceCheckUtils]: 86: Hoare triple {72273#false} ~skip~0 := 0; {72273#false} is VALID [2022-04-08 08:46:58,517 INFO L290 TraceCheckUtils]: 87: Hoare triple {72273#false} assume !false; {72273#false} is VALID [2022-04-08 08:46:58,518 INFO L290 TraceCheckUtils]: 88: Hoare triple {72273#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {72273#false} is VALID [2022-04-08 08:46:58,518 INFO L290 TraceCheckUtils]: 89: Hoare triple {72273#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {72273#false} is VALID [2022-04-08 08:46:58,518 INFO L290 TraceCheckUtils]: 90: Hoare triple {72273#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {72273#false} is VALID [2022-04-08 08:46:58,518 INFO L290 TraceCheckUtils]: 91: Hoare triple {72273#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {72273#false} is VALID [2022-04-08 08:46:58,518 INFO L290 TraceCheckUtils]: 92: Hoare triple {72273#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {72273#false} is VALID [2022-04-08 08:46:58,518 INFO L290 TraceCheckUtils]: 93: Hoare triple {72273#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {72273#false} is VALID [2022-04-08 08:46:58,518 INFO L290 TraceCheckUtils]: 94: Hoare triple {72273#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {72273#false} is VALID [2022-04-08 08:46:58,518 INFO L290 TraceCheckUtils]: 95: Hoare triple {72273#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {72273#false} is VALID [2022-04-08 08:46:58,518 INFO L290 TraceCheckUtils]: 96: Hoare triple {72273#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {72273#false} is VALID [2022-04-08 08:46:58,518 INFO L290 TraceCheckUtils]: 97: Hoare triple {72273#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {72273#false} is VALID [2022-04-08 08:46:58,518 INFO L290 TraceCheckUtils]: 98: Hoare triple {72273#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {72273#false} is VALID [2022-04-08 08:46:58,519 INFO L290 TraceCheckUtils]: 99: Hoare triple {72273#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {72273#false} is VALID [2022-04-08 08:46:58,519 INFO L290 TraceCheckUtils]: 100: Hoare triple {72273#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {72273#false} is VALID [2022-04-08 08:46:58,519 INFO L290 TraceCheckUtils]: 101: Hoare triple {72273#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {72273#false} is VALID [2022-04-08 08:46:58,519 INFO L290 TraceCheckUtils]: 102: Hoare triple {72273#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {72273#false} is VALID [2022-04-08 08:46:58,519 INFO L290 TraceCheckUtils]: 103: Hoare triple {72273#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {72273#false} is VALID [2022-04-08 08:46:58,519 INFO L290 TraceCheckUtils]: 104: Hoare triple {72273#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {72273#false} is VALID [2022-04-08 08:46:58,519 INFO L290 TraceCheckUtils]: 105: Hoare triple {72273#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {72273#false} is VALID [2022-04-08 08:46:58,519 INFO L290 TraceCheckUtils]: 106: Hoare triple {72273#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {72273#false} is VALID [2022-04-08 08:46:58,519 INFO L290 TraceCheckUtils]: 107: Hoare triple {72273#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {72273#false} is VALID [2022-04-08 08:46:58,520 INFO L290 TraceCheckUtils]: 108: Hoare triple {72273#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {72273#false} is VALID [2022-04-08 08:46:58,520 INFO L290 TraceCheckUtils]: 109: Hoare triple {72273#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {72273#false} is VALID [2022-04-08 08:46:58,520 INFO L290 TraceCheckUtils]: 110: Hoare triple {72273#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {72273#false} is VALID [2022-04-08 08:46:58,520 INFO L290 TraceCheckUtils]: 111: Hoare triple {72273#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {72273#false} is VALID [2022-04-08 08:46:58,520 INFO L290 TraceCheckUtils]: 112: Hoare triple {72273#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {72273#false} is VALID [2022-04-08 08:46:58,520 INFO L290 TraceCheckUtils]: 113: Hoare triple {72273#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {72273#false} is VALID [2022-04-08 08:46:58,520 INFO L290 TraceCheckUtils]: 114: Hoare triple {72273#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {72273#false} is VALID [2022-04-08 08:46:58,520 INFO L290 TraceCheckUtils]: 115: Hoare triple {72273#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {72273#false} is VALID [2022-04-08 08:46:58,520 INFO L290 TraceCheckUtils]: 116: Hoare triple {72273#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {72273#false} is VALID [2022-04-08 08:46:58,520 INFO L290 TraceCheckUtils]: 117: Hoare triple {72273#false} assume 8640 == #t~mem75;havoc #t~mem75; {72273#false} is VALID [2022-04-08 08:46:58,521 INFO L290 TraceCheckUtils]: 118: Hoare triple {72273#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {72273#false} is VALID [2022-04-08 08:46:58,521 INFO L290 TraceCheckUtils]: 119: Hoare triple {72273#false} assume !(4 == ~blastFlag~0); {72273#false} is VALID [2022-04-08 08:46:58,521 INFO L290 TraceCheckUtils]: 120: Hoare triple {72273#false} assume 7 == ~blastFlag~0; {72273#false} is VALID [2022-04-08 08:46:58,521 INFO L290 TraceCheckUtils]: 121: Hoare triple {72273#false} assume !false; {72273#false} is VALID [2022-04-08 08:46:58,521 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-04-08 08:46:58,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:46:58,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036771552] [2022-04-08 08:46:58,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036771552] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:46:58,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:46:58,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:46:58,522 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:46:58,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [905235990] [2022-04-08 08:46:58,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [905235990] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:46:58,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:46:58,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:46:58,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197030439] [2022-04-08 08:46:58,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:46:58,523 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 122 [2022-04-08 08:46:58,523 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:46:58,524 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:58,582 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:58,582 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:46:58,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:46:58,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:46:58,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:46:58,583 INFO L87 Difference]: Start difference. First operand 344 states and 533 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:07,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:47:07,268 INFO L93 Difference]: Finished difference Result 667 states and 1044 transitions. [2022-04-08 08:47:07,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:47:07,268 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 122 [2022-04-08 08:47:07,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:47:07,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:07,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 444 transitions. [2022-04-08 08:47:07,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:07,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 444 transitions. [2022-04-08 08:47:07,271 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 444 transitions. [2022-04-08 08:47:07,536 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 444 edges. 444 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:47:07,541 INFO L225 Difference]: With dead ends: 667 [2022-04-08 08:47:07,541 INFO L226 Difference]: Without dead ends: 351 [2022-04-08 08:47:07,541 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:47:07,542 INFO L913 BasicCegarLoop]: 201 mSDtfsCounter, 30 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-08 08:47:07,542 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 511 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-08 08:47:07,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2022-04-08 08:47:07,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 344. [2022-04-08 08:47:07,553 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:47:07,553 INFO L82 GeneralOperation]: Start isEquivalent. First operand 351 states. Second operand has 344 states, 339 states have (on average 1.5575221238938053) internal successors, (528), 339 states have internal predecessors, (528), 3 states have call successors, (3), 3 states have 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:47:07,553 INFO L74 IsIncluded]: Start isIncluded. First operand 351 states. Second operand has 344 states, 339 states have (on average 1.5575221238938053) internal successors, (528), 339 states have internal predecessors, (528), 3 states have call successors, (3), 3 states have 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:47:07,554 INFO L87 Difference]: Start difference. First operand 351 states. Second operand has 344 states, 339 states have (on average 1.5575221238938053) internal successors, (528), 339 states have internal predecessors, (528), 3 states have call successors, (3), 3 states have 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:47:07,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:47:07,558 INFO L93 Difference]: Finished difference Result 351 states and 542 transitions. [2022-04-08 08:47:07,558 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 542 transitions. [2022-04-08 08:47:07,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:47:07,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:47:07,559 INFO L74 IsIncluded]: Start isIncluded. First operand has 344 states, 339 states have (on average 1.5575221238938053) internal successors, (528), 339 states have internal predecessors, (528), 3 states have call successors, (3), 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 351 states. [2022-04-08 08:47:07,559 INFO L87 Difference]: Start difference. First operand has 344 states, 339 states have (on average 1.5575221238938053) internal successors, (528), 339 states have internal predecessors, (528), 3 states have call successors, (3), 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 351 states. [2022-04-08 08:47:07,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:47:07,563 INFO L93 Difference]: Finished difference Result 351 states and 542 transitions. [2022-04-08 08:47:07,563 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 542 transitions. [2022-04-08 08:47:07,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:47:07,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:47:07,564 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:47:07,564 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:47:07,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 339 states have (on average 1.5575221238938053) internal successors, (528), 339 states have internal predecessors, (528), 3 states have call successors, (3), 3 states have 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:47:07,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 532 transitions. [2022-04-08 08:47:07,575 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 532 transitions. Word has length 122 [2022-04-08 08:47:07,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:47:07,575 INFO L478 AbstractCegarLoop]: Abstraction has 344 states and 532 transitions. [2022-04-08 08:47:07,575 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:07,576 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 344 states and 532 transitions. [2022-04-08 08:47:07,981 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 532 edges. 532 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:47:07,981 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 532 transitions. [2022-04-08 08:47:07,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-04-08 08:47:07,981 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:47:07,982 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:47:07,982 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-08 08:47:07,982 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:47:07,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:47:07,982 INFO L85 PathProgramCache]: Analyzing trace with hash -2107194313, now seen corresponding path program 1 times [2022-04-08 08:47:07,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:47:07,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [592110661] [2022-04-08 08:47:08,043 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:47:08,043 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:47:08,043 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:47:08,043 INFO L85 PathProgramCache]: Analyzing trace with hash -2107194313, now seen corresponding path program 2 times [2022-04-08 08:47:08,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:47:08,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438029633] [2022-04-08 08:47:08,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:47:08,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:47:08,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:47:08,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:47:08,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:47:08,196 INFO L290 TraceCheckUtils]: 0: Hoare triple {75015#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {75008#true} is VALID [2022-04-08 08:47:08,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {75008#true} assume true; {75008#true} is VALID [2022-04-08 08:47:08,196 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {75008#true} {75008#true} #678#return; {75008#true} is VALID [2022-04-08 08:47:08,197 INFO L272 TraceCheckUtils]: 0: Hoare triple {75008#true} call ULTIMATE.init(); {75015#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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:47:08,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {75015#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {75008#true} is VALID [2022-04-08 08:47:08,197 INFO L290 TraceCheckUtils]: 2: Hoare triple {75008#true} assume true; {75008#true} is VALID [2022-04-08 08:47:08,197 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {75008#true} {75008#true} #678#return; {75008#true} is VALID [2022-04-08 08:47:08,197 INFO L272 TraceCheckUtils]: 4: Hoare triple {75008#true} call #t~ret161 := main(); {75008#true} is VALID [2022-04-08 08:47:08,197 INFO L290 TraceCheckUtils]: 5: Hoare triple {75008#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {75008#true} is VALID [2022-04-08 08:47:08,197 INFO L290 TraceCheckUtils]: 6: Hoare triple {75008#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {75008#true} is VALID [2022-04-08 08:47:08,197 INFO L272 TraceCheckUtils]: 7: Hoare triple {75008#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {75008#true} is VALID [2022-04-08 08:47:08,198 INFO L290 TraceCheckUtils]: 8: Hoare triple {75008#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {75008#true} is VALID [2022-04-08 08:47:08,198 INFO L290 TraceCheckUtils]: 9: Hoare triple {75008#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {75008#true} is VALID [2022-04-08 08:47:08,198 INFO L290 TraceCheckUtils]: 10: Hoare triple {75008#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {75008#true} is VALID [2022-04-08 08:47:08,198 INFO L290 TraceCheckUtils]: 11: Hoare triple {75008#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {75008#true} is VALID [2022-04-08 08:47:08,198 INFO L290 TraceCheckUtils]: 12: Hoare triple {75008#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {75008#true} is VALID [2022-04-08 08:47:08,198 INFO L290 TraceCheckUtils]: 13: Hoare triple {75008#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {75008#true} is VALID [2022-04-08 08:47:08,198 INFO L290 TraceCheckUtils]: 14: Hoare triple {75008#true} assume !false; {75008#true} is VALID [2022-04-08 08:47:08,198 INFO L290 TraceCheckUtils]: 15: Hoare triple {75008#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {75008#true} is VALID [2022-04-08 08:47:08,198 INFO L290 TraceCheckUtils]: 16: Hoare triple {75008#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {75008#true} is VALID [2022-04-08 08:47:08,198 INFO L290 TraceCheckUtils]: 17: Hoare triple {75008#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {75008#true} is VALID [2022-04-08 08:47:08,198 INFO L290 TraceCheckUtils]: 18: Hoare triple {75008#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {75008#true} is VALID [2022-04-08 08:47:08,198 INFO L290 TraceCheckUtils]: 19: Hoare triple {75008#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {75008#true} is VALID [2022-04-08 08:47:08,198 INFO L290 TraceCheckUtils]: 20: Hoare triple {75008#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {75008#true} is VALID [2022-04-08 08:47:08,198 INFO L290 TraceCheckUtils]: 21: Hoare triple {75008#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {75008#true} is VALID [2022-04-08 08:47:08,198 INFO L290 TraceCheckUtils]: 22: Hoare triple {75008#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {75008#true} is VALID [2022-04-08 08:47:08,199 INFO L290 TraceCheckUtils]: 23: Hoare triple {75008#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {75008#true} is VALID [2022-04-08 08:47:08,199 INFO L290 TraceCheckUtils]: 24: Hoare triple {75008#true} assume 8464 == #t~mem55;havoc #t~mem55; {75008#true} is VALID [2022-04-08 08:47:08,199 INFO L290 TraceCheckUtils]: 25: Hoare triple {75008#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {75008#true} is VALID [2022-04-08 08:47:08,199 INFO L290 TraceCheckUtils]: 26: Hoare triple {75008#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {75008#true} is VALID [2022-04-08 08:47:08,199 INFO L290 TraceCheckUtils]: 27: Hoare triple {75008#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); {75008#true} is VALID [2022-04-08 08:47:08,199 INFO L290 TraceCheckUtils]: 28: Hoare triple {75008#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {75008#true} is VALID [2022-04-08 08:47:08,199 INFO L290 TraceCheckUtils]: 29: Hoare triple {75008#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {75008#true} is VALID [2022-04-08 08:47:08,199 INFO L290 TraceCheckUtils]: 30: Hoare triple {75008#true} ~skip~0 := 0; {75008#true} is VALID [2022-04-08 08:47:08,199 INFO L290 TraceCheckUtils]: 31: Hoare triple {75008#true} assume !false; {75008#true} is VALID [2022-04-08 08:47:08,199 INFO L290 TraceCheckUtils]: 32: Hoare triple {75008#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {75008#true} is VALID [2022-04-08 08:47:08,199 INFO L290 TraceCheckUtils]: 33: Hoare triple {75008#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {75008#true} is VALID [2022-04-08 08:47:08,199 INFO L290 TraceCheckUtils]: 34: Hoare triple {75008#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {75008#true} is VALID [2022-04-08 08:47:08,199 INFO L290 TraceCheckUtils]: 35: Hoare triple {75008#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {75008#true} is VALID [2022-04-08 08:47:08,199 INFO L290 TraceCheckUtils]: 36: Hoare triple {75008#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {75008#true} is VALID [2022-04-08 08:47:08,200 INFO L290 TraceCheckUtils]: 37: Hoare triple {75008#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {75008#true} is VALID [2022-04-08 08:47:08,200 INFO L290 TraceCheckUtils]: 38: Hoare triple {75008#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {75008#true} is VALID [2022-04-08 08:47:08,200 INFO L290 TraceCheckUtils]: 39: Hoare triple {75008#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {75008#true} is VALID [2022-04-08 08:47:08,200 INFO L290 TraceCheckUtils]: 40: Hoare triple {75008#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {75008#true} is VALID [2022-04-08 08:47:08,200 INFO L290 TraceCheckUtils]: 41: Hoare triple {75008#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {75008#true} is VALID [2022-04-08 08:47:08,200 INFO L290 TraceCheckUtils]: 42: Hoare triple {75008#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {75008#true} is VALID [2022-04-08 08:47:08,200 INFO L290 TraceCheckUtils]: 43: Hoare triple {75008#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {75008#true} is VALID [2022-04-08 08:47:08,200 INFO L290 TraceCheckUtils]: 44: Hoare triple {75008#true} assume 8496 == #t~mem58;havoc #t~mem58; {75008#true} is VALID [2022-04-08 08:47:08,200 INFO L290 TraceCheckUtils]: 45: Hoare triple {75008#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {75008#true} is VALID [2022-04-08 08:47:08,200 INFO L290 TraceCheckUtils]: 46: Hoare triple {75008#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {75008#true} is VALID [2022-04-08 08:47:08,200 INFO L290 TraceCheckUtils]: 47: Hoare triple {75008#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {75008#true} is VALID [2022-04-08 08:47:08,201 INFO L290 TraceCheckUtils]: 48: Hoare triple {75008#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {75013#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:08,202 INFO L290 TraceCheckUtils]: 49: Hoare triple {75013#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {75013#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:08,202 INFO L290 TraceCheckUtils]: 50: Hoare triple {75013#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {75013#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:08,202 INFO L290 TraceCheckUtils]: 51: Hoare triple {75013#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {75013#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:08,203 INFO L290 TraceCheckUtils]: 52: Hoare triple {75013#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {75013#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:08,203 INFO L290 TraceCheckUtils]: 53: Hoare triple {75013#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {75013#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:08,203 INFO L290 TraceCheckUtils]: 54: Hoare triple {75013#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {75013#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:08,204 INFO L290 TraceCheckUtils]: 55: Hoare triple {75013#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {75013#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:08,204 INFO L290 TraceCheckUtils]: 56: Hoare triple {75013#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {75013#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:08,204 INFO L290 TraceCheckUtils]: 57: Hoare triple {75013#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {75013#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:08,205 INFO L290 TraceCheckUtils]: 58: Hoare triple {75013#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {75013#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:08,205 INFO L290 TraceCheckUtils]: 59: Hoare triple {75013#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {75013#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:08,205 INFO L290 TraceCheckUtils]: 60: Hoare triple {75013#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {75013#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:08,206 INFO L290 TraceCheckUtils]: 61: Hoare triple {75013#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {75013#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:08,206 INFO L290 TraceCheckUtils]: 62: Hoare triple {75013#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {75013#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:08,206 INFO L290 TraceCheckUtils]: 63: Hoare triple {75013#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {75013#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:08,207 INFO L290 TraceCheckUtils]: 64: Hoare triple {75013#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {75013#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:08,207 INFO L290 TraceCheckUtils]: 65: Hoare triple {75013#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {75013#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:08,207 INFO L290 TraceCheckUtils]: 66: Hoare triple {75013#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {75013#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:08,208 INFO L290 TraceCheckUtils]: 67: Hoare triple {75013#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {75013#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:08,208 INFO L290 TraceCheckUtils]: 68: Hoare triple {75013#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {75013#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:08,208 INFO L290 TraceCheckUtils]: 69: Hoare triple {75013#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {75013#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:08,209 INFO L290 TraceCheckUtils]: 70: Hoare triple {75013#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {75013#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:08,209 INFO L290 TraceCheckUtils]: 71: Hoare triple {75013#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {75013#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:08,209 INFO L290 TraceCheckUtils]: 72: Hoare triple {75013#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {75013#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:08,210 INFO L290 TraceCheckUtils]: 73: Hoare triple {75013#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {75013#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:08,210 INFO L290 TraceCheckUtils]: 74: Hoare triple {75013#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {75013#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:08,210 INFO L290 TraceCheckUtils]: 75: Hoare triple {75013#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {75013#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:08,210 INFO L290 TraceCheckUtils]: 76: Hoare triple {75013#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {75013#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:08,211 INFO L290 TraceCheckUtils]: 77: Hoare triple {75013#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {75013#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:08,211 INFO L290 TraceCheckUtils]: 78: Hoare triple {75013#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {75013#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:08,211 INFO L290 TraceCheckUtils]: 79: Hoare triple {75013#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {75013#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:08,212 INFO L290 TraceCheckUtils]: 80: Hoare triple {75013#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {75014#(not (= |ssl3_accept_#t~mem73| 8608))} is VALID [2022-04-08 08:47:08,212 INFO L290 TraceCheckUtils]: 81: Hoare triple {75014#(not (= |ssl3_accept_#t~mem73| 8608))} assume 8608 == #t~mem73;havoc #t~mem73; {75009#false} is VALID [2022-04-08 08:47:08,212 INFO L290 TraceCheckUtils]: 82: Hoare triple {75009#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {75009#false} is VALID [2022-04-08 08:47:08,212 INFO L290 TraceCheckUtils]: 83: Hoare triple {75009#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {75009#false} is VALID [2022-04-08 08:47:08,212 INFO L290 TraceCheckUtils]: 84: Hoare triple {75009#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {75009#false} is VALID [2022-04-08 08:47:08,212 INFO L290 TraceCheckUtils]: 85: Hoare triple {75009#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {75009#false} is VALID [2022-04-08 08:47:08,212 INFO L290 TraceCheckUtils]: 86: Hoare triple {75009#false} ~skip~0 := 0; {75009#false} is VALID [2022-04-08 08:47:08,213 INFO L290 TraceCheckUtils]: 87: Hoare triple {75009#false} assume !false; {75009#false} is VALID [2022-04-08 08:47:08,213 INFO L290 TraceCheckUtils]: 88: Hoare triple {75009#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {75009#false} is VALID [2022-04-08 08:47:08,213 INFO L290 TraceCheckUtils]: 89: Hoare triple {75009#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {75009#false} is VALID [2022-04-08 08:47:08,213 INFO L290 TraceCheckUtils]: 90: Hoare triple {75009#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {75009#false} is VALID [2022-04-08 08:47:08,213 INFO L290 TraceCheckUtils]: 91: Hoare triple {75009#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {75009#false} is VALID [2022-04-08 08:47:08,213 INFO L290 TraceCheckUtils]: 92: Hoare triple {75009#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {75009#false} is VALID [2022-04-08 08:47:08,213 INFO L290 TraceCheckUtils]: 93: Hoare triple {75009#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {75009#false} is VALID [2022-04-08 08:47:08,213 INFO L290 TraceCheckUtils]: 94: Hoare triple {75009#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {75009#false} is VALID [2022-04-08 08:47:08,213 INFO L290 TraceCheckUtils]: 95: Hoare triple {75009#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {75009#false} is VALID [2022-04-08 08:47:08,213 INFO L290 TraceCheckUtils]: 96: Hoare triple {75009#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {75009#false} is VALID [2022-04-08 08:47:08,213 INFO L290 TraceCheckUtils]: 97: Hoare triple {75009#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {75009#false} is VALID [2022-04-08 08:47:08,213 INFO L290 TraceCheckUtils]: 98: Hoare triple {75009#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {75009#false} is VALID [2022-04-08 08:47:08,213 INFO L290 TraceCheckUtils]: 99: Hoare triple {75009#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {75009#false} is VALID [2022-04-08 08:47:08,213 INFO L290 TraceCheckUtils]: 100: Hoare triple {75009#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {75009#false} is VALID [2022-04-08 08:47:08,213 INFO L290 TraceCheckUtils]: 101: Hoare triple {75009#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {75009#false} is VALID [2022-04-08 08:47:08,214 INFO L290 TraceCheckUtils]: 102: Hoare triple {75009#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {75009#false} is VALID [2022-04-08 08:47:08,214 INFO L290 TraceCheckUtils]: 103: Hoare triple {75009#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {75009#false} is VALID [2022-04-08 08:47:08,214 INFO L290 TraceCheckUtils]: 104: Hoare triple {75009#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {75009#false} is VALID [2022-04-08 08:47:08,214 INFO L290 TraceCheckUtils]: 105: Hoare triple {75009#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {75009#false} is VALID [2022-04-08 08:47:08,214 INFO L290 TraceCheckUtils]: 106: Hoare triple {75009#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {75009#false} is VALID [2022-04-08 08:47:08,214 INFO L290 TraceCheckUtils]: 107: Hoare triple {75009#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {75009#false} is VALID [2022-04-08 08:47:08,214 INFO L290 TraceCheckUtils]: 108: Hoare triple {75009#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {75009#false} is VALID [2022-04-08 08:47:08,214 INFO L290 TraceCheckUtils]: 109: Hoare triple {75009#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {75009#false} is VALID [2022-04-08 08:47:08,214 INFO L290 TraceCheckUtils]: 110: Hoare triple {75009#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {75009#false} is VALID [2022-04-08 08:47:08,214 INFO L290 TraceCheckUtils]: 111: Hoare triple {75009#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {75009#false} is VALID [2022-04-08 08:47:08,214 INFO L290 TraceCheckUtils]: 112: Hoare triple {75009#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {75009#false} is VALID [2022-04-08 08:47:08,214 INFO L290 TraceCheckUtils]: 113: Hoare triple {75009#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {75009#false} is VALID [2022-04-08 08:47:08,214 INFO L290 TraceCheckUtils]: 114: Hoare triple {75009#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {75009#false} is VALID [2022-04-08 08:47:08,214 INFO L290 TraceCheckUtils]: 115: Hoare triple {75009#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {75009#false} is VALID [2022-04-08 08:47:08,215 INFO L290 TraceCheckUtils]: 116: Hoare triple {75009#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {75009#false} is VALID [2022-04-08 08:47:08,215 INFO L290 TraceCheckUtils]: 117: Hoare triple {75009#false} assume 8640 == #t~mem75;havoc #t~mem75; {75009#false} is VALID [2022-04-08 08:47:08,215 INFO L290 TraceCheckUtils]: 118: Hoare triple {75009#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {75009#false} is VALID [2022-04-08 08:47:08,215 INFO L290 TraceCheckUtils]: 119: Hoare triple {75009#false} assume !(4 == ~blastFlag~0); {75009#false} is VALID [2022-04-08 08:47:08,215 INFO L290 TraceCheckUtils]: 120: Hoare triple {75009#false} assume 7 == ~blastFlag~0; {75009#false} is VALID [2022-04-08 08:47:08,215 INFO L290 TraceCheckUtils]: 121: Hoare triple {75009#false} assume !false; {75009#false} is VALID [2022-04-08 08:47:08,215 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-08 08:47:08,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:47:08,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438029633] [2022-04-08 08:47:08,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438029633] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:47:08,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:47:08,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:47:08,216 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:47:08,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [592110661] [2022-04-08 08:47:08,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [592110661] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:47:08,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:47:08,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:47:08,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789850244] [2022-04-08 08:47:08,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:47:08,216 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 122 [2022-04-08 08:47:08,217 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:47:08,217 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:08,303 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:47:08,303 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:47:08,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:47:08,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:47:08,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:47:08,304 INFO L87 Difference]: Start difference. First operand 344 states and 532 transitions. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:16,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:47:16,702 INFO L93 Difference]: Finished difference Result 784 states and 1214 transitions. [2022-04-08 08:47:16,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:47:16,702 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 122 [2022-04-08 08:47:16,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:47:16,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:16,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 577 transitions. [2022-04-08 08:47:16,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:16,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 577 transitions. [2022-04-08 08:47:16,706 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 577 transitions. [2022-04-08 08:47:17,067 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 577 edges. 577 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:47:17,076 INFO L225 Difference]: With dead ends: 784 [2022-04-08 08:47:17,076 INFO L226 Difference]: Without dead ends: 468 [2022-04-08 08:47:17,076 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:47:17,077 INFO L913 BasicCegarLoop]: 114 mSDtfsCounter, 116 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-04-08 08:47:17,077 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 332 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-04-08 08:47:17,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2022-04-08 08:47:17,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 381. [2022-04-08 08:47:17,090 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:47:17,090 INFO L82 GeneralOperation]: Start isEquivalent. First operand 468 states. Second operand has 381 states, 376 states have (on average 1.5664893617021276) internal successors, (589), 376 states have internal predecessors, (589), 3 states have call successors, (3), 3 states have 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:47:17,091 INFO L74 IsIncluded]: Start isIncluded. First operand 468 states. Second operand has 381 states, 376 states have (on average 1.5664893617021276) internal successors, (589), 376 states have internal predecessors, (589), 3 states have call successors, (3), 3 states have 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:47:17,091 INFO L87 Difference]: Start difference. First operand 468 states. Second operand has 381 states, 376 states have (on average 1.5664893617021276) internal successors, (589), 376 states have internal predecessors, (589), 3 states have call successors, (3), 3 states have 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:47:17,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:47:17,098 INFO L93 Difference]: Finished difference Result 468 states and 712 transitions. [2022-04-08 08:47:17,098 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 712 transitions. [2022-04-08 08:47:17,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:47:17,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:47:17,099 INFO L74 IsIncluded]: Start isIncluded. First operand has 381 states, 376 states have (on average 1.5664893617021276) internal successors, (589), 376 states have internal predecessors, (589), 3 states have call successors, (3), 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 468 states. [2022-04-08 08:47:17,099 INFO L87 Difference]: Start difference. First operand has 381 states, 376 states have (on average 1.5664893617021276) internal successors, (589), 376 states have internal predecessors, (589), 3 states have call successors, (3), 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 468 states. [2022-04-08 08:47:17,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:47:17,106 INFO L93 Difference]: Finished difference Result 468 states and 712 transitions. [2022-04-08 08:47:17,107 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 712 transitions. [2022-04-08 08:47:17,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:47:17,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:47:17,107 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:47:17,107 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:47:17,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 376 states have (on average 1.5664893617021276) internal successors, (589), 376 states have internal predecessors, (589), 3 states have call successors, (3), 3 states have 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:47:17,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 593 transitions. [2022-04-08 08:47:17,113 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 593 transitions. Word has length 122 [2022-04-08 08:47:17,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:47:17,113 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 593 transitions. [2022-04-08 08:47:17,113 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:17,113 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 381 states and 593 transitions. [2022-04-08 08:47:17,573 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 593 edges. 593 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:47:17,574 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 593 transitions. [2022-04-08 08:47:17,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-04-08 08:47:17,574 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:47:17,574 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:47:17,575 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-08 08:47:17,575 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:47:17,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:47:17,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1920434487, now seen corresponding path program 1 times [2022-04-08 08:47:17,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:47:17,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [476890945] [2022-04-08 08:47:17,653 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:47:17,653 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:47:17,653 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:47:17,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1920434487, now seen corresponding path program 2 times [2022-04-08 08:47:17,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:47:17,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016752793] [2022-04-08 08:47:17,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:47:17,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:47:17,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:47:17,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:47:17,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:47:17,799 INFO L290 TraceCheckUtils]: 0: Hoare triple {78293#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {78286#true} is VALID [2022-04-08 08:47:17,799 INFO L290 TraceCheckUtils]: 1: Hoare triple {78286#true} assume true; {78286#true} is VALID [2022-04-08 08:47:17,799 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {78286#true} {78286#true} #678#return; {78286#true} is VALID [2022-04-08 08:47:17,800 INFO L272 TraceCheckUtils]: 0: Hoare triple {78286#true} call ULTIMATE.init(); {78293#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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:47:17,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {78293#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {78286#true} is VALID [2022-04-08 08:47:17,800 INFO L290 TraceCheckUtils]: 2: Hoare triple {78286#true} assume true; {78286#true} is VALID [2022-04-08 08:47:17,800 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {78286#true} {78286#true} #678#return; {78286#true} is VALID [2022-04-08 08:47:17,800 INFO L272 TraceCheckUtils]: 4: Hoare triple {78286#true} call #t~ret161 := main(); {78286#true} is VALID [2022-04-08 08:47:17,800 INFO L290 TraceCheckUtils]: 5: Hoare triple {78286#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {78286#true} is VALID [2022-04-08 08:47:17,801 INFO L290 TraceCheckUtils]: 6: Hoare triple {78286#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {78286#true} is VALID [2022-04-08 08:47:17,801 INFO L272 TraceCheckUtils]: 7: Hoare triple {78286#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {78286#true} is VALID [2022-04-08 08:47:17,801 INFO L290 TraceCheckUtils]: 8: Hoare triple {78286#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {78286#true} is VALID [2022-04-08 08:47:17,801 INFO L290 TraceCheckUtils]: 9: Hoare triple {78286#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {78286#true} is VALID [2022-04-08 08:47:17,801 INFO L290 TraceCheckUtils]: 10: Hoare triple {78286#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {78286#true} is VALID [2022-04-08 08:47:17,801 INFO L290 TraceCheckUtils]: 11: Hoare triple {78286#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {78286#true} is VALID [2022-04-08 08:47:17,801 INFO L290 TraceCheckUtils]: 12: Hoare triple {78286#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {78286#true} is VALID [2022-04-08 08:47:17,801 INFO L290 TraceCheckUtils]: 13: Hoare triple {78286#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {78286#true} is VALID [2022-04-08 08:47:17,801 INFO L290 TraceCheckUtils]: 14: Hoare triple {78286#true} assume !false; {78286#true} is VALID [2022-04-08 08:47:17,801 INFO L290 TraceCheckUtils]: 15: Hoare triple {78286#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {78286#true} is VALID [2022-04-08 08:47:17,801 INFO L290 TraceCheckUtils]: 16: Hoare triple {78286#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {78286#true} is VALID [2022-04-08 08:47:17,801 INFO L290 TraceCheckUtils]: 17: Hoare triple {78286#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {78286#true} is VALID [2022-04-08 08:47:17,801 INFO L290 TraceCheckUtils]: 18: Hoare triple {78286#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {78286#true} is VALID [2022-04-08 08:47:17,801 INFO L290 TraceCheckUtils]: 19: Hoare triple {78286#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {78286#true} is VALID [2022-04-08 08:47:17,802 INFO L290 TraceCheckUtils]: 20: Hoare triple {78286#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {78286#true} is VALID [2022-04-08 08:47:17,802 INFO L290 TraceCheckUtils]: 21: Hoare triple {78286#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {78286#true} is VALID [2022-04-08 08:47:17,802 INFO L290 TraceCheckUtils]: 22: Hoare triple {78286#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {78286#true} is VALID [2022-04-08 08:47:17,802 INFO L290 TraceCheckUtils]: 23: Hoare triple {78286#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {78286#true} is VALID [2022-04-08 08:47:17,802 INFO L290 TraceCheckUtils]: 24: Hoare triple {78286#true} assume 8464 == #t~mem55;havoc #t~mem55; {78286#true} is VALID [2022-04-08 08:47:17,802 INFO L290 TraceCheckUtils]: 25: Hoare triple {78286#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {78286#true} is VALID [2022-04-08 08:47:17,802 INFO L290 TraceCheckUtils]: 26: Hoare triple {78286#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {78286#true} is VALID [2022-04-08 08:47:17,802 INFO L290 TraceCheckUtils]: 27: Hoare triple {78286#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); {78286#true} is VALID [2022-04-08 08:47:17,802 INFO L290 TraceCheckUtils]: 28: Hoare triple {78286#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {78286#true} is VALID [2022-04-08 08:47:17,802 INFO L290 TraceCheckUtils]: 29: Hoare triple {78286#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {78286#true} is VALID [2022-04-08 08:47:17,802 INFO L290 TraceCheckUtils]: 30: Hoare triple {78286#true} ~skip~0 := 0; {78286#true} is VALID [2022-04-08 08:47:17,802 INFO L290 TraceCheckUtils]: 31: Hoare triple {78286#true} assume !false; {78286#true} is VALID [2022-04-08 08:47:17,802 INFO L290 TraceCheckUtils]: 32: Hoare triple {78286#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {78286#true} is VALID [2022-04-08 08:47:17,802 INFO L290 TraceCheckUtils]: 33: Hoare triple {78286#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {78286#true} is VALID [2022-04-08 08:47:17,803 INFO L290 TraceCheckUtils]: 34: Hoare triple {78286#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {78286#true} is VALID [2022-04-08 08:47:17,803 INFO L290 TraceCheckUtils]: 35: Hoare triple {78286#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {78286#true} is VALID [2022-04-08 08:47:17,803 INFO L290 TraceCheckUtils]: 36: Hoare triple {78286#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {78286#true} is VALID [2022-04-08 08:47:17,803 INFO L290 TraceCheckUtils]: 37: Hoare triple {78286#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {78286#true} is VALID [2022-04-08 08:47:17,803 INFO L290 TraceCheckUtils]: 38: Hoare triple {78286#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {78286#true} is VALID [2022-04-08 08:47:17,803 INFO L290 TraceCheckUtils]: 39: Hoare triple {78286#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {78286#true} is VALID [2022-04-08 08:47:17,803 INFO L290 TraceCheckUtils]: 40: Hoare triple {78286#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {78286#true} is VALID [2022-04-08 08:47:17,803 INFO L290 TraceCheckUtils]: 41: Hoare triple {78286#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {78286#true} is VALID [2022-04-08 08:47:17,803 INFO L290 TraceCheckUtils]: 42: Hoare triple {78286#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {78286#true} is VALID [2022-04-08 08:47:17,803 INFO L290 TraceCheckUtils]: 43: Hoare triple {78286#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {78286#true} is VALID [2022-04-08 08:47:17,803 INFO L290 TraceCheckUtils]: 44: Hoare triple {78286#true} assume 8496 == #t~mem58;havoc #t~mem58; {78286#true} is VALID [2022-04-08 08:47:17,803 INFO L290 TraceCheckUtils]: 45: Hoare triple {78286#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {78286#true} is VALID [2022-04-08 08:47:17,803 INFO L290 TraceCheckUtils]: 46: Hoare triple {78286#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {78286#true} is VALID [2022-04-08 08:47:17,803 INFO L290 TraceCheckUtils]: 47: Hoare triple {78286#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {78286#true} is VALID [2022-04-08 08:47:17,804 INFO L290 TraceCheckUtils]: 48: Hoare triple {78286#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {78291#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:47:17,805 INFO L290 TraceCheckUtils]: 49: Hoare triple {78291#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {78291#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:47:17,805 INFO L290 TraceCheckUtils]: 50: Hoare triple {78291#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {78291#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:47:17,806 INFO L290 TraceCheckUtils]: 51: Hoare triple {78291#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {78291#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:47:17,806 INFO L290 TraceCheckUtils]: 52: Hoare triple {78291#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} ~skip~0 := 0; {78291#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:47:17,806 INFO L290 TraceCheckUtils]: 53: Hoare triple {78291#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !false; {78291#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:47:17,807 INFO L290 TraceCheckUtils]: 54: Hoare triple {78291#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {78291#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:47:17,807 INFO L290 TraceCheckUtils]: 55: Hoare triple {78291#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {78291#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:47:17,807 INFO L290 TraceCheckUtils]: 56: Hoare triple {78291#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {78291#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:47:17,808 INFO L290 TraceCheckUtils]: 57: Hoare triple {78291#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {78291#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:47:17,808 INFO L290 TraceCheckUtils]: 58: Hoare triple {78291#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {78291#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:47:17,808 INFO L290 TraceCheckUtils]: 59: Hoare triple {78291#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {78291#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:47:17,809 INFO L290 TraceCheckUtils]: 60: Hoare triple {78291#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {78291#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:47:17,809 INFO L290 TraceCheckUtils]: 61: Hoare triple {78291#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {78291#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:47:17,809 INFO L290 TraceCheckUtils]: 62: Hoare triple {78291#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {78291#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:47:17,810 INFO L290 TraceCheckUtils]: 63: Hoare triple {78291#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {78291#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:47:17,810 INFO L290 TraceCheckUtils]: 64: Hoare triple {78291#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {78291#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:47:17,810 INFO L290 TraceCheckUtils]: 65: Hoare triple {78291#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {78291#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:47:17,811 INFO L290 TraceCheckUtils]: 66: Hoare triple {78291#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {78291#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:47:17,811 INFO L290 TraceCheckUtils]: 67: Hoare triple {78291#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {78291#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:47:17,812 INFO L290 TraceCheckUtils]: 68: Hoare triple {78291#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {78291#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:47:17,812 INFO L290 TraceCheckUtils]: 69: Hoare triple {78291#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {78291#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:47:17,812 INFO L290 TraceCheckUtils]: 70: Hoare triple {78291#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {78291#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:47:17,813 INFO L290 TraceCheckUtils]: 71: Hoare triple {78291#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {78291#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:47:17,813 INFO L290 TraceCheckUtils]: 72: Hoare triple {78291#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {78291#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:47:17,813 INFO L290 TraceCheckUtils]: 73: Hoare triple {78291#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {78291#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:47:17,814 INFO L290 TraceCheckUtils]: 74: Hoare triple {78291#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {78291#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:47:17,814 INFO L290 TraceCheckUtils]: 75: Hoare triple {78291#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {78291#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:47:17,814 INFO L290 TraceCheckUtils]: 76: Hoare triple {78291#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {78291#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:47:17,815 INFO L290 TraceCheckUtils]: 77: Hoare triple {78291#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {78291#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:47:17,815 INFO L290 TraceCheckUtils]: 78: Hoare triple {78291#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {78291#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:47:17,815 INFO L290 TraceCheckUtils]: 79: Hoare triple {78291#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {78291#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:47:17,816 INFO L290 TraceCheckUtils]: 80: Hoare triple {78291#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {78291#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:47:17,816 INFO L290 TraceCheckUtils]: 81: Hoare triple {78291#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {78292#(not (= |ssl3_accept_#t~mem74| 8609))} is VALID [2022-04-08 08:47:17,816 INFO L290 TraceCheckUtils]: 82: Hoare triple {78292#(not (= |ssl3_accept_#t~mem74| 8609))} assume 8609 == #t~mem74;havoc #t~mem74; {78287#false} is VALID [2022-04-08 08:47:17,816 INFO L290 TraceCheckUtils]: 83: Hoare triple {78287#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {78287#false} is VALID [2022-04-08 08:47:17,817 INFO L290 TraceCheckUtils]: 84: Hoare triple {78287#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {78287#false} is VALID [2022-04-08 08:47:17,817 INFO L290 TraceCheckUtils]: 85: Hoare triple {78287#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {78287#false} is VALID [2022-04-08 08:47:17,817 INFO L290 TraceCheckUtils]: 86: Hoare triple {78287#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {78287#false} is VALID [2022-04-08 08:47:17,817 INFO L290 TraceCheckUtils]: 87: Hoare triple {78287#false} ~skip~0 := 0; {78287#false} is VALID [2022-04-08 08:47:17,817 INFO L290 TraceCheckUtils]: 88: Hoare triple {78287#false} assume !false; {78287#false} is VALID [2022-04-08 08:47:17,817 INFO L290 TraceCheckUtils]: 89: Hoare triple {78287#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {78287#false} is VALID [2022-04-08 08:47:17,817 INFO L290 TraceCheckUtils]: 90: Hoare triple {78287#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {78287#false} is VALID [2022-04-08 08:47:17,817 INFO L290 TraceCheckUtils]: 91: Hoare triple {78287#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {78287#false} is VALID [2022-04-08 08:47:17,817 INFO L290 TraceCheckUtils]: 92: Hoare triple {78287#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {78287#false} is VALID [2022-04-08 08:47:17,817 INFO L290 TraceCheckUtils]: 93: Hoare triple {78287#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {78287#false} is VALID [2022-04-08 08:47:17,817 INFO L290 TraceCheckUtils]: 94: Hoare triple {78287#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {78287#false} is VALID [2022-04-08 08:47:17,817 INFO L290 TraceCheckUtils]: 95: Hoare triple {78287#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {78287#false} is VALID [2022-04-08 08:47:17,817 INFO L290 TraceCheckUtils]: 96: Hoare triple {78287#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {78287#false} is VALID [2022-04-08 08:47:17,817 INFO L290 TraceCheckUtils]: 97: Hoare triple {78287#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {78287#false} is VALID [2022-04-08 08:47:17,818 INFO L290 TraceCheckUtils]: 98: Hoare triple {78287#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {78287#false} is VALID [2022-04-08 08:47:17,818 INFO L290 TraceCheckUtils]: 99: Hoare triple {78287#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {78287#false} is VALID [2022-04-08 08:47:17,818 INFO L290 TraceCheckUtils]: 100: Hoare triple {78287#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {78287#false} is VALID [2022-04-08 08:47:17,818 INFO L290 TraceCheckUtils]: 101: Hoare triple {78287#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {78287#false} is VALID [2022-04-08 08:47:17,818 INFO L290 TraceCheckUtils]: 102: Hoare triple {78287#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {78287#false} is VALID [2022-04-08 08:47:17,818 INFO L290 TraceCheckUtils]: 103: Hoare triple {78287#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {78287#false} is VALID [2022-04-08 08:47:17,818 INFO L290 TraceCheckUtils]: 104: Hoare triple {78287#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {78287#false} is VALID [2022-04-08 08:47:17,818 INFO L290 TraceCheckUtils]: 105: Hoare triple {78287#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {78287#false} is VALID [2022-04-08 08:47:17,818 INFO L290 TraceCheckUtils]: 106: Hoare triple {78287#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {78287#false} is VALID [2022-04-08 08:47:17,818 INFO L290 TraceCheckUtils]: 107: Hoare triple {78287#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {78287#false} is VALID [2022-04-08 08:47:17,818 INFO L290 TraceCheckUtils]: 108: Hoare triple {78287#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {78287#false} is VALID [2022-04-08 08:47:17,818 INFO L290 TraceCheckUtils]: 109: Hoare triple {78287#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {78287#false} is VALID [2022-04-08 08:47:17,818 INFO L290 TraceCheckUtils]: 110: Hoare triple {78287#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {78287#false} is VALID [2022-04-08 08:47:17,818 INFO L290 TraceCheckUtils]: 111: Hoare triple {78287#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {78287#false} is VALID [2022-04-08 08:47:17,819 INFO L290 TraceCheckUtils]: 112: Hoare triple {78287#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {78287#false} is VALID [2022-04-08 08:47:17,819 INFO L290 TraceCheckUtils]: 113: Hoare triple {78287#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {78287#false} is VALID [2022-04-08 08:47:17,819 INFO L290 TraceCheckUtils]: 114: Hoare triple {78287#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {78287#false} is VALID [2022-04-08 08:47:17,819 INFO L290 TraceCheckUtils]: 115: Hoare triple {78287#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {78287#false} is VALID [2022-04-08 08:47:17,819 INFO L290 TraceCheckUtils]: 116: Hoare triple {78287#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {78287#false} is VALID [2022-04-08 08:47:17,819 INFO L290 TraceCheckUtils]: 117: Hoare triple {78287#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {78287#false} is VALID [2022-04-08 08:47:17,819 INFO L290 TraceCheckUtils]: 118: Hoare triple {78287#false} assume 8640 == #t~mem75;havoc #t~mem75; {78287#false} is VALID [2022-04-08 08:47:17,819 INFO L290 TraceCheckUtils]: 119: Hoare triple {78287#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {78287#false} is VALID [2022-04-08 08:47:17,819 INFO L290 TraceCheckUtils]: 120: Hoare triple {78287#false} assume !(4 == ~blastFlag~0); {78287#false} is VALID [2022-04-08 08:47:17,819 INFO L290 TraceCheckUtils]: 121: Hoare triple {78287#false} assume 7 == ~blastFlag~0; {78287#false} is VALID [2022-04-08 08:47:17,819 INFO L290 TraceCheckUtils]: 122: Hoare triple {78287#false} assume !false; {78287#false} is VALID [2022-04-08 08:47:17,820 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-08 08:47:17,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:47:17,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016752793] [2022-04-08 08:47:17,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016752793] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:47:17,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:47:17,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:47:17,820 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:47:17,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [476890945] [2022-04-08 08:47:17,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [476890945] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:47:17,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:47:17,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:47:17,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792888078] [2022-04-08 08:47:17,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:47:17,821 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 123 [2022-04-08 08:47:17,821 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:47:17,821 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:17,893 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:47:17,893 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:47:17,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:47:17,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:47:17,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:47:17,897 INFO L87 Difference]: Start difference. First operand 381 states and 593 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:25,365 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:47:27,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:47:27,769 INFO L93 Difference]: Finished difference Result 818 states and 1269 transitions. [2022-04-08 08:47:27,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:47:27,769 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 123 [2022-04-08 08:47:27,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:47:27,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:27,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 577 transitions. [2022-04-08 08:47:27,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:27,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 577 transitions. [2022-04-08 08:47:27,773 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 577 transitions. [2022-04-08 08:47:28,151 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 577 edges. 577 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:47:28,159 INFO L225 Difference]: With dead ends: 818 [2022-04-08 08:47:28,159 INFO L226 Difference]: Without dead ends: 465 [2022-04-08 08:47:28,160 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:47:28,160 INFO L913 BasicCegarLoop]: 114 mSDtfsCounter, 115 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-04-08 08:47:28,160 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 332 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-04-08 08:47:28,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2022-04-08 08:47:28,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 381. [2022-04-08 08:47:28,174 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:47:28,175 INFO L82 GeneralOperation]: Start isEquivalent. First operand 465 states. Second operand has 381 states, 376 states have (on average 1.5611702127659575) internal successors, (587), 376 states have internal predecessors, (587), 3 states have call successors, (3), 3 states have 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:47:28,175 INFO L74 IsIncluded]: Start isIncluded. First operand 465 states. Second operand has 381 states, 376 states have (on average 1.5611702127659575) internal successors, (587), 376 states have internal predecessors, (587), 3 states have call successors, (3), 3 states have 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:47:28,175 INFO L87 Difference]: Start difference. First operand 465 states. Second operand has 381 states, 376 states have (on average 1.5611702127659575) internal successors, (587), 376 states have internal predecessors, (587), 3 states have call successors, (3), 3 states have 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:47:28,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:47:28,182 INFO L93 Difference]: Finished difference Result 465 states and 706 transitions. [2022-04-08 08:47:28,183 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 706 transitions. [2022-04-08 08:47:28,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:47:28,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:47:28,183 INFO L74 IsIncluded]: Start isIncluded. First operand has 381 states, 376 states have (on average 1.5611702127659575) internal successors, (587), 376 states have internal predecessors, (587), 3 states have call successors, (3), 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 465 states. [2022-04-08 08:47:28,184 INFO L87 Difference]: Start difference. First operand has 381 states, 376 states have (on average 1.5611702127659575) internal successors, (587), 376 states have internal predecessors, (587), 3 states have call successors, (3), 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 465 states. [2022-04-08 08:47:28,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:47:28,191 INFO L93 Difference]: Finished difference Result 465 states and 706 transitions. [2022-04-08 08:47:28,191 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 706 transitions. [2022-04-08 08:47:28,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:47:28,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:47:28,191 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:47:28,191 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:47:28,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 376 states have (on average 1.5611702127659575) internal successors, (587), 376 states have internal predecessors, (587), 3 states have call successors, (3), 3 states have 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:47:28,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 591 transitions. [2022-04-08 08:47:28,197 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 591 transitions. Word has length 123 [2022-04-08 08:47:28,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:47:28,197 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 591 transitions. [2022-04-08 08:47:28,198 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:28,198 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 381 states and 591 transitions. [2022-04-08 08:47:28,662 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 591 edges. 591 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:47:28,662 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 591 transitions. [2022-04-08 08:47:28,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-08 08:47:28,663 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:47:28,663 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:47:28,663 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-08 08:47:28,663 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:47:28,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:47:28,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1060012237, now seen corresponding path program 1 times [2022-04-08 08:47:28,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:47:28,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [805151710] [2022-04-08 08:47:28,744 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:47:28,745 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:47:28,745 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:47:28,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1060012237, now seen corresponding path program 2 times [2022-04-08 08:47:28,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:47:28,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609598756] [2022-04-08 08:47:28,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:47:28,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:47:28,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:47:28,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:47:28,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:47:28,902 INFO L290 TraceCheckUtils]: 0: Hoare triple {81633#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {81626#true} is VALID [2022-04-08 08:47:28,902 INFO L290 TraceCheckUtils]: 1: Hoare triple {81626#true} assume true; {81626#true} is VALID [2022-04-08 08:47:28,902 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {81626#true} {81626#true} #678#return; {81626#true} is VALID [2022-04-08 08:47:28,903 INFO L272 TraceCheckUtils]: 0: Hoare triple {81626#true} call ULTIMATE.init(); {81633#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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:47:28,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {81633#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {81626#true} is VALID [2022-04-08 08:47:28,903 INFO L290 TraceCheckUtils]: 2: Hoare triple {81626#true} assume true; {81626#true} is VALID [2022-04-08 08:47:28,903 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {81626#true} {81626#true} #678#return; {81626#true} is VALID [2022-04-08 08:47:28,903 INFO L272 TraceCheckUtils]: 4: Hoare triple {81626#true} call #t~ret161 := main(); {81626#true} is VALID [2022-04-08 08:47:28,903 INFO L290 TraceCheckUtils]: 5: Hoare triple {81626#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {81626#true} is VALID [2022-04-08 08:47:28,903 INFO L290 TraceCheckUtils]: 6: Hoare triple {81626#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {81626#true} is VALID [2022-04-08 08:47:28,903 INFO L272 TraceCheckUtils]: 7: Hoare triple {81626#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {81626#true} is VALID [2022-04-08 08:47:28,903 INFO L290 TraceCheckUtils]: 8: Hoare triple {81626#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {81626#true} is VALID [2022-04-08 08:47:28,903 INFO L290 TraceCheckUtils]: 9: Hoare triple {81626#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {81626#true} is VALID [2022-04-08 08:47:28,903 INFO L290 TraceCheckUtils]: 10: Hoare triple {81626#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {81626#true} is VALID [2022-04-08 08:47:28,903 INFO L290 TraceCheckUtils]: 11: Hoare triple {81626#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {81626#true} is VALID [2022-04-08 08:47:28,903 INFO L290 TraceCheckUtils]: 12: Hoare triple {81626#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {81626#true} is VALID [2022-04-08 08:47:28,904 INFO L290 TraceCheckUtils]: 13: Hoare triple {81626#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {81626#true} is VALID [2022-04-08 08:47:28,904 INFO L290 TraceCheckUtils]: 14: Hoare triple {81626#true} assume !false; {81626#true} is VALID [2022-04-08 08:47:28,904 INFO L290 TraceCheckUtils]: 15: Hoare triple {81626#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {81626#true} is VALID [2022-04-08 08:47:28,904 INFO L290 TraceCheckUtils]: 16: Hoare triple {81626#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {81626#true} is VALID [2022-04-08 08:47:28,904 INFO L290 TraceCheckUtils]: 17: Hoare triple {81626#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {81626#true} is VALID [2022-04-08 08:47:28,904 INFO L290 TraceCheckUtils]: 18: Hoare triple {81626#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {81626#true} is VALID [2022-04-08 08:47:28,904 INFO L290 TraceCheckUtils]: 19: Hoare triple {81626#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {81626#true} is VALID [2022-04-08 08:47:28,904 INFO L290 TraceCheckUtils]: 20: Hoare triple {81626#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {81626#true} is VALID [2022-04-08 08:47:28,904 INFO L290 TraceCheckUtils]: 21: Hoare triple {81626#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {81626#true} is VALID [2022-04-08 08:47:28,904 INFO L290 TraceCheckUtils]: 22: Hoare triple {81626#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {81626#true} is VALID [2022-04-08 08:47:28,904 INFO L290 TraceCheckUtils]: 23: Hoare triple {81626#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {81626#true} is VALID [2022-04-08 08:47:28,904 INFO L290 TraceCheckUtils]: 24: Hoare triple {81626#true} assume 8464 == #t~mem55;havoc #t~mem55; {81626#true} is VALID [2022-04-08 08:47:28,904 INFO L290 TraceCheckUtils]: 25: Hoare triple {81626#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {81626#true} is VALID [2022-04-08 08:47:28,904 INFO L290 TraceCheckUtils]: 26: Hoare triple {81626#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {81626#true} is VALID [2022-04-08 08:47:28,904 INFO L290 TraceCheckUtils]: 27: Hoare triple {81626#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); {81626#true} is VALID [2022-04-08 08:47:28,905 INFO L290 TraceCheckUtils]: 28: Hoare triple {81626#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {81626#true} is VALID [2022-04-08 08:47:28,905 INFO L290 TraceCheckUtils]: 29: Hoare triple {81626#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {81626#true} is VALID [2022-04-08 08:47:28,905 INFO L290 TraceCheckUtils]: 30: Hoare triple {81626#true} ~skip~0 := 0; {81626#true} is VALID [2022-04-08 08:47:28,905 INFO L290 TraceCheckUtils]: 31: Hoare triple {81626#true} assume !false; {81626#true} is VALID [2022-04-08 08:47:28,905 INFO L290 TraceCheckUtils]: 32: Hoare triple {81626#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {81626#true} is VALID [2022-04-08 08:47:28,905 INFO L290 TraceCheckUtils]: 33: Hoare triple {81626#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {81626#true} is VALID [2022-04-08 08:47:28,905 INFO L290 TraceCheckUtils]: 34: Hoare triple {81626#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {81626#true} is VALID [2022-04-08 08:47:28,905 INFO L290 TraceCheckUtils]: 35: Hoare triple {81626#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {81626#true} is VALID [2022-04-08 08:47:28,905 INFO L290 TraceCheckUtils]: 36: Hoare triple {81626#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {81626#true} is VALID [2022-04-08 08:47:28,905 INFO L290 TraceCheckUtils]: 37: Hoare triple {81626#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {81626#true} is VALID [2022-04-08 08:47:28,905 INFO L290 TraceCheckUtils]: 38: Hoare triple {81626#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {81626#true} is VALID [2022-04-08 08:47:28,905 INFO L290 TraceCheckUtils]: 39: Hoare triple {81626#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {81626#true} is VALID [2022-04-08 08:47:28,905 INFO L290 TraceCheckUtils]: 40: Hoare triple {81626#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {81626#true} is VALID [2022-04-08 08:47:28,905 INFO L290 TraceCheckUtils]: 41: Hoare triple {81626#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {81626#true} is VALID [2022-04-08 08:47:28,906 INFO L290 TraceCheckUtils]: 42: Hoare triple {81626#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {81626#true} is VALID [2022-04-08 08:47:28,906 INFO L290 TraceCheckUtils]: 43: Hoare triple {81626#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {81626#true} is VALID [2022-04-08 08:47:28,906 INFO L290 TraceCheckUtils]: 44: Hoare triple {81626#true} assume 8496 == #t~mem58;havoc #t~mem58; {81626#true} is VALID [2022-04-08 08:47:28,906 INFO L290 TraceCheckUtils]: 45: Hoare triple {81626#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {81626#true} is VALID [2022-04-08 08:47:28,906 INFO L290 TraceCheckUtils]: 46: Hoare triple {81626#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {81626#true} is VALID [2022-04-08 08:47:28,906 INFO L290 TraceCheckUtils]: 47: Hoare triple {81626#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {81626#true} is VALID [2022-04-08 08:47:28,907 INFO L290 TraceCheckUtils]: 48: Hoare triple {81626#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {81631#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:28,907 INFO L290 TraceCheckUtils]: 49: Hoare triple {81631#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {81631#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:28,908 INFO L290 TraceCheckUtils]: 50: Hoare triple {81631#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {81631#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:28,908 INFO L290 TraceCheckUtils]: 51: Hoare triple {81631#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {81631#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:28,908 INFO L290 TraceCheckUtils]: 52: Hoare triple {81631#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {81631#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:28,909 INFO L290 TraceCheckUtils]: 53: Hoare triple {81631#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {81631#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:28,909 INFO L290 TraceCheckUtils]: 54: Hoare triple {81631#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {81631#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:28,909 INFO L290 TraceCheckUtils]: 55: Hoare triple {81631#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {81631#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:28,910 INFO L290 TraceCheckUtils]: 56: Hoare triple {81631#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {81631#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:28,910 INFO L290 TraceCheckUtils]: 57: Hoare triple {81631#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {81631#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:28,911 INFO L290 TraceCheckUtils]: 58: Hoare triple {81631#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {81631#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:28,911 INFO L290 TraceCheckUtils]: 59: Hoare triple {81631#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {81631#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:28,911 INFO L290 TraceCheckUtils]: 60: Hoare triple {81631#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {81631#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:28,912 INFO L290 TraceCheckUtils]: 61: Hoare triple {81631#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {81631#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:28,912 INFO L290 TraceCheckUtils]: 62: Hoare triple {81631#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {81631#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:28,912 INFO L290 TraceCheckUtils]: 63: Hoare triple {81631#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {81631#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:28,913 INFO L290 TraceCheckUtils]: 64: Hoare triple {81631#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {81631#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:28,913 INFO L290 TraceCheckUtils]: 65: Hoare triple {81631#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {81631#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:28,913 INFO L290 TraceCheckUtils]: 66: Hoare triple {81631#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {81631#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:28,914 INFO L290 TraceCheckUtils]: 67: Hoare triple {81631#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {81631#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:28,914 INFO L290 TraceCheckUtils]: 68: Hoare triple {81631#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {81631#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:28,915 INFO L290 TraceCheckUtils]: 69: Hoare triple {81631#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {81631#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:28,915 INFO L290 TraceCheckUtils]: 70: Hoare triple {81631#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {81631#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:28,915 INFO L290 TraceCheckUtils]: 71: Hoare triple {81631#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {81631#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:28,916 INFO L290 TraceCheckUtils]: 72: Hoare triple {81631#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {81631#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:28,916 INFO L290 TraceCheckUtils]: 73: Hoare triple {81631#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {81631#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:28,916 INFO L290 TraceCheckUtils]: 74: Hoare triple {81631#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {81631#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:28,917 INFO L290 TraceCheckUtils]: 75: Hoare triple {81631#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {81631#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:28,917 INFO L290 TraceCheckUtils]: 76: Hoare triple {81631#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {81631#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:28,917 INFO L290 TraceCheckUtils]: 77: Hoare triple {81631#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {81631#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:28,918 INFO L290 TraceCheckUtils]: 78: Hoare triple {81631#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {81631#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:28,918 INFO L290 TraceCheckUtils]: 79: Hoare triple {81631#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {81631#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:28,918 INFO L290 TraceCheckUtils]: 80: Hoare triple {81631#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {81631#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:28,919 INFO L290 TraceCheckUtils]: 81: Hoare triple {81631#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {81631#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:28,919 INFO L290 TraceCheckUtils]: 82: Hoare triple {81631#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {81631#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:28,920 INFO L290 TraceCheckUtils]: 83: Hoare triple {81631#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {81631#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:28,920 INFO L290 TraceCheckUtils]: 84: Hoare triple {81631#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {81631#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:28,920 INFO L290 TraceCheckUtils]: 85: Hoare triple {81631#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {81631#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:28,921 INFO L290 TraceCheckUtils]: 86: Hoare triple {81631#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {81632#(not (= |ssl3_accept_#t~mem79| 8672))} is VALID [2022-04-08 08:47:28,921 INFO L290 TraceCheckUtils]: 87: Hoare triple {81632#(not (= |ssl3_accept_#t~mem79| 8672))} assume 8672 == #t~mem79;havoc #t~mem79; {81627#false} is VALID [2022-04-08 08:47:28,921 INFO L290 TraceCheckUtils]: 88: Hoare triple {81627#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {81627#false} is VALID [2022-04-08 08:47:28,921 INFO L290 TraceCheckUtils]: 89: Hoare triple {81627#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {81627#false} is VALID [2022-04-08 08:47:28,921 INFO L290 TraceCheckUtils]: 90: Hoare triple {81627#false} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 52 + ~s.offset, 4);call #t~mem145 := read~int(~s.base, 92 + ~s.offset, 4); {81627#false} is VALID [2022-04-08 08:47:28,921 INFO L290 TraceCheckUtils]: 91: Hoare triple {81627#false} assume 0 != #t~mem145;havoc #t~mem145;call #t~mem146.base, #t~mem146.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8640, #t~mem146.base, 844 + #t~mem146.offset, 4);havoc #t~mem146.base, #t~mem146.offset; {81627#false} is VALID [2022-04-08 08:47:28,921 INFO L290 TraceCheckUtils]: 92: Hoare triple {81627#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {81627#false} is VALID [2022-04-08 08:47:28,922 INFO L290 TraceCheckUtils]: 93: Hoare triple {81627#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {81627#false} is VALID [2022-04-08 08:47:28,922 INFO L290 TraceCheckUtils]: 94: Hoare triple {81627#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {81627#false} is VALID [2022-04-08 08:47:28,922 INFO L290 TraceCheckUtils]: 95: Hoare triple {81627#false} ~skip~0 := 0; {81627#false} is VALID [2022-04-08 08:47:28,922 INFO L290 TraceCheckUtils]: 96: Hoare triple {81627#false} assume !false; {81627#false} is VALID [2022-04-08 08:47:28,922 INFO L290 TraceCheckUtils]: 97: Hoare triple {81627#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {81627#false} is VALID [2022-04-08 08:47:28,922 INFO L290 TraceCheckUtils]: 98: Hoare triple {81627#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {81627#false} is VALID [2022-04-08 08:47:28,922 INFO L290 TraceCheckUtils]: 99: Hoare triple {81627#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {81627#false} is VALID [2022-04-08 08:47:28,922 INFO L290 TraceCheckUtils]: 100: Hoare triple {81627#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {81627#false} is VALID [2022-04-08 08:47:28,922 INFO L290 TraceCheckUtils]: 101: Hoare triple {81627#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {81627#false} is VALID [2022-04-08 08:47:28,922 INFO L290 TraceCheckUtils]: 102: Hoare triple {81627#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {81627#false} is VALID [2022-04-08 08:47:28,922 INFO L290 TraceCheckUtils]: 103: Hoare triple {81627#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {81627#false} is VALID [2022-04-08 08:47:28,922 INFO L290 TraceCheckUtils]: 104: Hoare triple {81627#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {81627#false} is VALID [2022-04-08 08:47:28,922 INFO L290 TraceCheckUtils]: 105: Hoare triple {81627#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {81627#false} is VALID [2022-04-08 08:47:28,922 INFO L290 TraceCheckUtils]: 106: Hoare triple {81627#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {81627#false} is VALID [2022-04-08 08:47:28,923 INFO L290 TraceCheckUtils]: 107: Hoare triple {81627#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {81627#false} is VALID [2022-04-08 08:47:28,923 INFO L290 TraceCheckUtils]: 108: Hoare triple {81627#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {81627#false} is VALID [2022-04-08 08:47:28,923 INFO L290 TraceCheckUtils]: 109: Hoare triple {81627#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {81627#false} is VALID [2022-04-08 08:47:28,923 INFO L290 TraceCheckUtils]: 110: Hoare triple {81627#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {81627#false} is VALID [2022-04-08 08:47:28,923 INFO L290 TraceCheckUtils]: 111: Hoare triple {81627#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {81627#false} is VALID [2022-04-08 08:47:28,923 INFO L290 TraceCheckUtils]: 112: Hoare triple {81627#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {81627#false} is VALID [2022-04-08 08:47:28,923 INFO L290 TraceCheckUtils]: 113: Hoare triple {81627#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {81627#false} is VALID [2022-04-08 08:47:28,923 INFO L290 TraceCheckUtils]: 114: Hoare triple {81627#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {81627#false} is VALID [2022-04-08 08:47:28,923 INFO L290 TraceCheckUtils]: 115: Hoare triple {81627#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {81627#false} is VALID [2022-04-08 08:47:28,923 INFO L290 TraceCheckUtils]: 116: Hoare triple {81627#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {81627#false} is VALID [2022-04-08 08:47:28,923 INFO L290 TraceCheckUtils]: 117: Hoare triple {81627#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {81627#false} is VALID [2022-04-08 08:47:28,923 INFO L290 TraceCheckUtils]: 118: Hoare triple {81627#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {81627#false} is VALID [2022-04-08 08:47:28,923 INFO L290 TraceCheckUtils]: 119: Hoare triple {81627#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {81627#false} is VALID [2022-04-08 08:47:28,923 INFO L290 TraceCheckUtils]: 120: Hoare triple {81627#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {81627#false} is VALID [2022-04-08 08:47:28,923 INFO L290 TraceCheckUtils]: 121: Hoare triple {81627#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {81627#false} is VALID [2022-04-08 08:47:28,924 INFO L290 TraceCheckUtils]: 122: Hoare triple {81627#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {81627#false} is VALID [2022-04-08 08:47:28,924 INFO L290 TraceCheckUtils]: 123: Hoare triple {81627#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {81627#false} is VALID [2022-04-08 08:47:28,924 INFO L290 TraceCheckUtils]: 124: Hoare triple {81627#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {81627#false} is VALID [2022-04-08 08:47:28,924 INFO L290 TraceCheckUtils]: 125: Hoare triple {81627#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {81627#false} is VALID [2022-04-08 08:47:28,924 INFO L290 TraceCheckUtils]: 126: Hoare triple {81627#false} assume 8640 == #t~mem75;havoc #t~mem75; {81627#false} is VALID [2022-04-08 08:47:28,924 INFO L290 TraceCheckUtils]: 127: Hoare triple {81627#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {81627#false} is VALID [2022-04-08 08:47:28,924 INFO L290 TraceCheckUtils]: 128: Hoare triple {81627#false} assume !(4 == ~blastFlag~0); {81627#false} is VALID [2022-04-08 08:47:28,924 INFO L290 TraceCheckUtils]: 129: Hoare triple {81627#false} assume 7 == ~blastFlag~0; {81627#false} is VALID [2022-04-08 08:47:28,924 INFO L290 TraceCheckUtils]: 130: Hoare triple {81627#false} assume !false; {81627#false} is VALID [2022-04-08 08:47:28,924 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-08 08:47:28,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:47:28,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609598756] [2022-04-08 08:47:28,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609598756] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:47:28,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:47:28,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:47:28,925 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:47:28,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [805151710] [2022-04-08 08:47:28,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [805151710] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:47:28,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:47:28,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:47:28,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614153940] [2022-04-08 08:47:28,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:47:28,926 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 131 [2022-04-08 08:47:28,926 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:47:28,926 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:29,005 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:47:29,005 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:47:29,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:47:29,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:47:29,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:47:29,006 INFO L87 Difference]: Start difference. First operand 381 states and 591 transitions. Second operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:31,058 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:47:38,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:47:38,960 INFO L93 Difference]: Finished difference Result 858 states and 1330 transitions. [2022-04-08 08:47:38,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:47:38,961 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 131 [2022-04-08 08:47:38,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:47:38,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:38,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 576 transitions. [2022-04-08 08:47:38,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:38,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 576 transitions. [2022-04-08 08:47:38,965 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 576 transitions. [2022-04-08 08:47:39,322 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:47:39,332 INFO L225 Difference]: With dead ends: 858 [2022-04-08 08:47:39,332 INFO L226 Difference]: Without dead ends: 505 [2022-04-08 08:47:39,332 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:47:39,333 INFO L913 BasicCegarLoop]: 114 mSDtfsCounter, 108 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-04-08 08:47:39,333 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 333 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-04-08 08:47:39,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2022-04-08 08:47:39,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 424. [2022-04-08 08:47:39,362 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:47:39,362 INFO L82 GeneralOperation]: Start isEquivalent. First operand 505 states. Second operand has 424 states, 419 states have (on average 1.568019093078759) internal successors, (657), 419 states have internal predecessors, (657), 3 states have call successors, (3), 3 states have 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:47:39,363 INFO L74 IsIncluded]: Start isIncluded. First operand 505 states. Second operand has 424 states, 419 states have (on average 1.568019093078759) internal successors, (657), 419 states have internal predecessors, (657), 3 states have call successors, (3), 3 states have 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:47:39,363 INFO L87 Difference]: Start difference. First operand 505 states. Second operand has 424 states, 419 states have (on average 1.568019093078759) internal successors, (657), 419 states have internal predecessors, (657), 3 states have call successors, (3), 3 states have 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:47:39,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:47:39,371 INFO L93 Difference]: Finished difference Result 505 states and 770 transitions. [2022-04-08 08:47:39,371 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 770 transitions. [2022-04-08 08:47:39,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:47:39,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:47:39,372 INFO L74 IsIncluded]: Start isIncluded. First operand has 424 states, 419 states have (on average 1.568019093078759) internal successors, (657), 419 states have internal predecessors, (657), 3 states have call successors, (3), 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 505 states. [2022-04-08 08:47:39,372 INFO L87 Difference]: Start difference. First operand has 424 states, 419 states have (on average 1.568019093078759) internal successors, (657), 419 states have internal predecessors, (657), 3 states have call successors, (3), 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 505 states. [2022-04-08 08:47:39,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:47:39,381 INFO L93 Difference]: Finished difference Result 505 states and 770 transitions. [2022-04-08 08:47:39,381 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 770 transitions. [2022-04-08 08:47:39,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:47:39,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:47:39,381 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:47:39,381 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:47:39,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 419 states have (on average 1.568019093078759) internal successors, (657), 419 states have internal predecessors, (657), 3 states have call successors, (3), 3 states have 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:47:39,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 661 transitions. [2022-04-08 08:47:39,389 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 661 transitions. Word has length 131 [2022-04-08 08:47:39,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:47:39,389 INFO L478 AbstractCegarLoop]: Abstraction has 424 states and 661 transitions. [2022-04-08 08:47:39,389 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:39,389 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 424 states and 661 transitions. [2022-04-08 08:47:39,916 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 661 edges. 661 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:47:39,917 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 661 transitions. [2022-04-08 08:47:39,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-04-08 08:47:39,917 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:47:39,918 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:47:39,918 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-08 08:47:39,918 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:47:39,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:47:39,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1992420845, now seen corresponding path program 1 times [2022-04-08 08:47:39,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:47:39,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1745522664] [2022-04-08 08:47:39,999 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:47:39,999 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:47:39,999 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:47:39,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1992420845, now seen corresponding path program 2 times [2022-04-08 08:47:39,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:47:39,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903784200] [2022-04-08 08:47:40,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:47:40,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:47:40,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:47:40,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:47:40,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:47:40,160 INFO L290 TraceCheckUtils]: 0: Hoare triple {85219#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {85212#true} is VALID [2022-04-08 08:47:40,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {85212#true} assume true; {85212#true} is VALID [2022-04-08 08:47:40,161 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {85212#true} {85212#true} #678#return; {85212#true} is VALID [2022-04-08 08:47:40,161 INFO L272 TraceCheckUtils]: 0: Hoare triple {85212#true} call ULTIMATE.init(); {85219#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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:47:40,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {85219#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {85212#true} is VALID [2022-04-08 08:47:40,162 INFO L290 TraceCheckUtils]: 2: Hoare triple {85212#true} assume true; {85212#true} is VALID [2022-04-08 08:47:40,162 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {85212#true} {85212#true} #678#return; {85212#true} is VALID [2022-04-08 08:47:40,162 INFO L272 TraceCheckUtils]: 4: Hoare triple {85212#true} call #t~ret161 := main(); {85212#true} is VALID [2022-04-08 08:47:40,162 INFO L290 TraceCheckUtils]: 5: Hoare triple {85212#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {85212#true} is VALID [2022-04-08 08:47:40,162 INFO L290 TraceCheckUtils]: 6: Hoare triple {85212#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {85212#true} is VALID [2022-04-08 08:47:40,162 INFO L272 TraceCheckUtils]: 7: Hoare triple {85212#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {85212#true} is VALID [2022-04-08 08:47:40,162 INFO L290 TraceCheckUtils]: 8: Hoare triple {85212#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {85212#true} is VALID [2022-04-08 08:47:40,162 INFO L290 TraceCheckUtils]: 9: Hoare triple {85212#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {85212#true} is VALID [2022-04-08 08:47:40,162 INFO L290 TraceCheckUtils]: 10: Hoare triple {85212#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {85212#true} is VALID [2022-04-08 08:47:40,162 INFO L290 TraceCheckUtils]: 11: Hoare triple {85212#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {85212#true} is VALID [2022-04-08 08:47:40,162 INFO L290 TraceCheckUtils]: 12: Hoare triple {85212#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {85212#true} is VALID [2022-04-08 08:47:40,162 INFO L290 TraceCheckUtils]: 13: Hoare triple {85212#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {85212#true} is VALID [2022-04-08 08:47:40,162 INFO L290 TraceCheckUtils]: 14: Hoare triple {85212#true} assume !false; {85212#true} is VALID [2022-04-08 08:47:40,162 INFO L290 TraceCheckUtils]: 15: Hoare triple {85212#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {85212#true} is VALID [2022-04-08 08:47:40,163 INFO L290 TraceCheckUtils]: 16: Hoare triple {85212#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {85212#true} is VALID [2022-04-08 08:47:40,163 INFO L290 TraceCheckUtils]: 17: Hoare triple {85212#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {85212#true} is VALID [2022-04-08 08:47:40,163 INFO L290 TraceCheckUtils]: 18: Hoare triple {85212#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {85212#true} is VALID [2022-04-08 08:47:40,163 INFO L290 TraceCheckUtils]: 19: Hoare triple {85212#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {85212#true} is VALID [2022-04-08 08:47:40,163 INFO L290 TraceCheckUtils]: 20: Hoare triple {85212#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {85212#true} is VALID [2022-04-08 08:47:40,163 INFO L290 TraceCheckUtils]: 21: Hoare triple {85212#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {85212#true} is VALID [2022-04-08 08:47:40,163 INFO L290 TraceCheckUtils]: 22: Hoare triple {85212#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {85212#true} is VALID [2022-04-08 08:47:40,163 INFO L290 TraceCheckUtils]: 23: Hoare triple {85212#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {85212#true} is VALID [2022-04-08 08:47:40,163 INFO L290 TraceCheckUtils]: 24: Hoare triple {85212#true} assume 8464 == #t~mem55;havoc #t~mem55; {85212#true} is VALID [2022-04-08 08:47:40,163 INFO L290 TraceCheckUtils]: 25: Hoare triple {85212#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {85212#true} is VALID [2022-04-08 08:47:40,163 INFO L290 TraceCheckUtils]: 26: Hoare triple {85212#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {85212#true} is VALID [2022-04-08 08:47:40,163 INFO L290 TraceCheckUtils]: 27: Hoare triple {85212#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); {85212#true} is VALID [2022-04-08 08:47:40,163 INFO L290 TraceCheckUtils]: 28: Hoare triple {85212#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {85212#true} is VALID [2022-04-08 08:47:40,163 INFO L290 TraceCheckUtils]: 29: Hoare triple {85212#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {85212#true} is VALID [2022-04-08 08:47:40,164 INFO L290 TraceCheckUtils]: 30: Hoare triple {85212#true} ~skip~0 := 0; {85212#true} is VALID [2022-04-08 08:47:40,164 INFO L290 TraceCheckUtils]: 31: Hoare triple {85212#true} assume !false; {85212#true} is VALID [2022-04-08 08:47:40,164 INFO L290 TraceCheckUtils]: 32: Hoare triple {85212#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {85212#true} is VALID [2022-04-08 08:47:40,164 INFO L290 TraceCheckUtils]: 33: Hoare triple {85212#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {85212#true} is VALID [2022-04-08 08:47:40,164 INFO L290 TraceCheckUtils]: 34: Hoare triple {85212#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {85212#true} is VALID [2022-04-08 08:47:40,164 INFO L290 TraceCheckUtils]: 35: Hoare triple {85212#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {85212#true} is VALID [2022-04-08 08:47:40,164 INFO L290 TraceCheckUtils]: 36: Hoare triple {85212#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {85212#true} is VALID [2022-04-08 08:47:40,164 INFO L290 TraceCheckUtils]: 37: Hoare triple {85212#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {85212#true} is VALID [2022-04-08 08:47:40,164 INFO L290 TraceCheckUtils]: 38: Hoare triple {85212#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {85212#true} is VALID [2022-04-08 08:47:40,164 INFO L290 TraceCheckUtils]: 39: Hoare triple {85212#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {85212#true} is VALID [2022-04-08 08:47:40,164 INFO L290 TraceCheckUtils]: 40: Hoare triple {85212#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {85212#true} is VALID [2022-04-08 08:47:40,164 INFO L290 TraceCheckUtils]: 41: Hoare triple {85212#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {85212#true} is VALID [2022-04-08 08:47:40,164 INFO L290 TraceCheckUtils]: 42: Hoare triple {85212#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {85212#true} is VALID [2022-04-08 08:47:40,165 INFO L290 TraceCheckUtils]: 43: Hoare triple {85212#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {85212#true} is VALID [2022-04-08 08:47:40,165 INFO L290 TraceCheckUtils]: 44: Hoare triple {85212#true} assume 8496 == #t~mem58;havoc #t~mem58; {85212#true} is VALID [2022-04-08 08:47:40,165 INFO L290 TraceCheckUtils]: 45: Hoare triple {85212#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {85212#true} is VALID [2022-04-08 08:47:40,165 INFO L290 TraceCheckUtils]: 46: Hoare triple {85212#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {85212#true} is VALID [2022-04-08 08:47:40,165 INFO L290 TraceCheckUtils]: 47: Hoare triple {85212#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {85212#true} is VALID [2022-04-08 08:47:40,171 INFO L290 TraceCheckUtils]: 48: Hoare triple {85212#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:40,172 INFO L290 TraceCheckUtils]: 49: Hoare triple {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:40,173 INFO L290 TraceCheckUtils]: 50: Hoare triple {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:40,173 INFO L290 TraceCheckUtils]: 51: Hoare triple {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:40,173 INFO L290 TraceCheckUtils]: 52: Hoare triple {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:40,174 INFO L290 TraceCheckUtils]: 53: Hoare triple {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:40,174 INFO L290 TraceCheckUtils]: 54: Hoare triple {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:40,174 INFO L290 TraceCheckUtils]: 55: Hoare triple {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:40,175 INFO L290 TraceCheckUtils]: 56: Hoare triple {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:40,175 INFO L290 TraceCheckUtils]: 57: Hoare triple {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:40,175 INFO L290 TraceCheckUtils]: 58: Hoare triple {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:40,176 INFO L290 TraceCheckUtils]: 59: Hoare triple {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:40,176 INFO L290 TraceCheckUtils]: 60: Hoare triple {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:40,176 INFO L290 TraceCheckUtils]: 61: Hoare triple {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:40,177 INFO L290 TraceCheckUtils]: 62: Hoare triple {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:40,177 INFO L290 TraceCheckUtils]: 63: Hoare triple {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:40,177 INFO L290 TraceCheckUtils]: 64: Hoare triple {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:40,178 INFO L290 TraceCheckUtils]: 65: Hoare triple {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:40,178 INFO L290 TraceCheckUtils]: 66: Hoare triple {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:40,178 INFO L290 TraceCheckUtils]: 67: Hoare triple {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:40,179 INFO L290 TraceCheckUtils]: 68: Hoare triple {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:40,179 INFO L290 TraceCheckUtils]: 69: Hoare triple {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:40,179 INFO L290 TraceCheckUtils]: 70: Hoare triple {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:40,179 INFO L290 TraceCheckUtils]: 71: Hoare triple {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:40,180 INFO L290 TraceCheckUtils]: 72: Hoare triple {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:40,180 INFO L290 TraceCheckUtils]: 73: Hoare triple {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:40,180 INFO L290 TraceCheckUtils]: 74: Hoare triple {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:40,181 INFO L290 TraceCheckUtils]: 75: Hoare triple {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:40,181 INFO L290 TraceCheckUtils]: 76: Hoare triple {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:40,181 INFO L290 TraceCheckUtils]: 77: Hoare triple {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:40,182 INFO L290 TraceCheckUtils]: 78: Hoare triple {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:40,182 INFO L290 TraceCheckUtils]: 79: Hoare triple {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:40,182 INFO L290 TraceCheckUtils]: 80: Hoare triple {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:40,183 INFO L290 TraceCheckUtils]: 81: Hoare triple {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:40,183 INFO L290 TraceCheckUtils]: 82: Hoare triple {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:40,183 INFO L290 TraceCheckUtils]: 83: Hoare triple {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:40,184 INFO L290 TraceCheckUtils]: 84: Hoare triple {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:40,184 INFO L290 TraceCheckUtils]: 85: Hoare triple {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:40,184 INFO L290 TraceCheckUtils]: 86: Hoare triple {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:40,185 INFO L290 TraceCheckUtils]: 87: Hoare triple {85217#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 52 + ~s.offset, 4); {85218#(not (= |ssl3_accept_#t~mem80| 8673))} is VALID [2022-04-08 08:47:40,185 INFO L290 TraceCheckUtils]: 88: Hoare triple {85218#(not (= |ssl3_accept_#t~mem80| 8673))} assume 8673 == #t~mem80;havoc #t~mem80; {85213#false} is VALID [2022-04-08 08:47:40,185 INFO L290 TraceCheckUtils]: 89: Hoare triple {85213#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {85213#false} is VALID [2022-04-08 08:47:40,185 INFO L290 TraceCheckUtils]: 90: Hoare triple {85213#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {85213#false} is VALID [2022-04-08 08:47:40,185 INFO L290 TraceCheckUtils]: 91: Hoare triple {85213#false} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 52 + ~s.offset, 4);call #t~mem145 := read~int(~s.base, 92 + ~s.offset, 4); {85213#false} is VALID [2022-04-08 08:47:40,185 INFO L290 TraceCheckUtils]: 92: Hoare triple {85213#false} assume 0 != #t~mem145;havoc #t~mem145;call #t~mem146.base, #t~mem146.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8640, #t~mem146.base, 844 + #t~mem146.offset, 4);havoc #t~mem146.base, #t~mem146.offset; {85213#false} is VALID [2022-04-08 08:47:40,185 INFO L290 TraceCheckUtils]: 93: Hoare triple {85213#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {85213#false} is VALID [2022-04-08 08:47:40,185 INFO L290 TraceCheckUtils]: 94: Hoare triple {85213#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {85213#false} is VALID [2022-04-08 08:47:40,185 INFO L290 TraceCheckUtils]: 95: Hoare triple {85213#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {85213#false} is VALID [2022-04-08 08:47:40,185 INFO L290 TraceCheckUtils]: 96: Hoare triple {85213#false} ~skip~0 := 0; {85213#false} is VALID [2022-04-08 08:47:40,186 INFO L290 TraceCheckUtils]: 97: Hoare triple {85213#false} assume !false; {85213#false} is VALID [2022-04-08 08:47:40,186 INFO L290 TraceCheckUtils]: 98: Hoare triple {85213#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {85213#false} is VALID [2022-04-08 08:47:40,186 INFO L290 TraceCheckUtils]: 99: Hoare triple {85213#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {85213#false} is VALID [2022-04-08 08:47:40,186 INFO L290 TraceCheckUtils]: 100: Hoare triple {85213#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {85213#false} is VALID [2022-04-08 08:47:40,186 INFO L290 TraceCheckUtils]: 101: Hoare triple {85213#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {85213#false} is VALID [2022-04-08 08:47:40,186 INFO L290 TraceCheckUtils]: 102: Hoare triple {85213#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {85213#false} is VALID [2022-04-08 08:47:40,186 INFO L290 TraceCheckUtils]: 103: Hoare triple {85213#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {85213#false} is VALID [2022-04-08 08:47:40,186 INFO L290 TraceCheckUtils]: 104: Hoare triple {85213#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {85213#false} is VALID [2022-04-08 08:47:40,186 INFO L290 TraceCheckUtils]: 105: Hoare triple {85213#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {85213#false} is VALID [2022-04-08 08:47:40,186 INFO L290 TraceCheckUtils]: 106: Hoare triple {85213#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {85213#false} is VALID [2022-04-08 08:47:40,186 INFO L290 TraceCheckUtils]: 107: Hoare triple {85213#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {85213#false} is VALID [2022-04-08 08:47:40,186 INFO L290 TraceCheckUtils]: 108: Hoare triple {85213#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {85213#false} is VALID [2022-04-08 08:47:40,186 INFO L290 TraceCheckUtils]: 109: Hoare triple {85213#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {85213#false} is VALID [2022-04-08 08:47:40,186 INFO L290 TraceCheckUtils]: 110: Hoare triple {85213#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {85213#false} is VALID [2022-04-08 08:47:40,187 INFO L290 TraceCheckUtils]: 111: Hoare triple {85213#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {85213#false} is VALID [2022-04-08 08:47:40,187 INFO L290 TraceCheckUtils]: 112: Hoare triple {85213#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {85213#false} is VALID [2022-04-08 08:47:40,187 INFO L290 TraceCheckUtils]: 113: Hoare triple {85213#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {85213#false} is VALID [2022-04-08 08:47:40,187 INFO L290 TraceCheckUtils]: 114: Hoare triple {85213#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {85213#false} is VALID [2022-04-08 08:47:40,187 INFO L290 TraceCheckUtils]: 115: Hoare triple {85213#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {85213#false} is VALID [2022-04-08 08:47:40,187 INFO L290 TraceCheckUtils]: 116: Hoare triple {85213#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {85213#false} is VALID [2022-04-08 08:47:40,187 INFO L290 TraceCheckUtils]: 117: Hoare triple {85213#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {85213#false} is VALID [2022-04-08 08:47:40,187 INFO L290 TraceCheckUtils]: 118: Hoare triple {85213#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {85213#false} is VALID [2022-04-08 08:47:40,187 INFO L290 TraceCheckUtils]: 119: Hoare triple {85213#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {85213#false} is VALID [2022-04-08 08:47:40,187 INFO L290 TraceCheckUtils]: 120: Hoare triple {85213#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {85213#false} is VALID [2022-04-08 08:47:40,187 INFO L290 TraceCheckUtils]: 121: Hoare triple {85213#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {85213#false} is VALID [2022-04-08 08:47:40,187 INFO L290 TraceCheckUtils]: 122: Hoare triple {85213#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {85213#false} is VALID [2022-04-08 08:47:40,187 INFO L290 TraceCheckUtils]: 123: Hoare triple {85213#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {85213#false} is VALID [2022-04-08 08:47:40,187 INFO L290 TraceCheckUtils]: 124: Hoare triple {85213#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {85213#false} is VALID [2022-04-08 08:47:40,188 INFO L290 TraceCheckUtils]: 125: Hoare triple {85213#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {85213#false} is VALID [2022-04-08 08:47:40,188 INFO L290 TraceCheckUtils]: 126: Hoare triple {85213#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {85213#false} is VALID [2022-04-08 08:47:40,188 INFO L290 TraceCheckUtils]: 127: Hoare triple {85213#false} assume 8640 == #t~mem75;havoc #t~mem75; {85213#false} is VALID [2022-04-08 08:47:40,188 INFO L290 TraceCheckUtils]: 128: Hoare triple {85213#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {85213#false} is VALID [2022-04-08 08:47:40,188 INFO L290 TraceCheckUtils]: 129: Hoare triple {85213#false} assume !(4 == ~blastFlag~0); {85213#false} is VALID [2022-04-08 08:47:40,188 INFO L290 TraceCheckUtils]: 130: Hoare triple {85213#false} assume 7 == ~blastFlag~0; {85213#false} is VALID [2022-04-08 08:47:40,188 INFO L290 TraceCheckUtils]: 131: Hoare triple {85213#false} assume !false; {85213#false} is VALID [2022-04-08 08:47:40,188 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-08 08:47:40,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:47:40,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903784200] [2022-04-08 08:47:40,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903784200] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:47:40,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:47:40,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:47:40,189 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:47:40,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1745522664] [2022-04-08 08:47:40,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1745522664] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:47:40,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:47:40,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:47:40,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327328588] [2022-04-08 08:47:40,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:47:40,189 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 1 states have call successors, (3), 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 132 [2022-04-08 08:47:40,190 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:47:40,190 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 1 states have call successors, (3), 2 states have 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:47:40,277 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:47:40,277 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:47:40,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:47:40,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:47:40,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:47:40,278 INFO L87 Difference]: Start difference. First operand 424 states and 661 transitions. Second operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 1 states have call successors, (3), 2 states have 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:47:42,972 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:47:44,719 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:47:50,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:47:50,168 INFO L93 Difference]: Finished difference Result 904 states and 1405 transitions. [2022-04-08 08:47:50,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:47:50,169 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 1 states have call successors, (3), 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 132 [2022-04-08 08:47:50,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:47:50,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 1 states have call successors, (3), 2 states have 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:47:50,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 576 transitions. [2022-04-08 08:47:50,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 1 states have call successors, (3), 2 states have 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:47:50,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 576 transitions. [2022-04-08 08:47:50,172 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 576 transitions. [2022-04-08 08:47:50,542 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:47:50,551 INFO L225 Difference]: With dead ends: 904 [2022-04-08 08:47:50,551 INFO L226 Difference]: Without dead ends: 506 [2022-04-08 08:47:50,552 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:47:50,552 INFO L913 BasicCegarLoop]: 124 mSDtfsCounter, 109 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-04-08 08:47:50,552 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 352 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2022-04-08 08:47:50,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2022-04-08 08:47:50,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 426. [2022-04-08 08:47:50,583 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:47:50,584 INFO L82 GeneralOperation]: Start isEquivalent. First operand 506 states. Second operand has 426 states, 421 states have (on average 1.5676959619952493) internal successors, (660), 421 states have internal predecessors, (660), 3 states have call successors, (3), 3 states have 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:47:50,584 INFO L74 IsIncluded]: Start isIncluded. First operand 506 states. Second operand has 426 states, 421 states have (on average 1.5676959619952493) internal successors, (660), 421 states have internal predecessors, (660), 3 states have call successors, (3), 3 states have 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:47:50,584 INFO L87 Difference]: Start difference. First operand 506 states. Second operand has 426 states, 421 states have (on average 1.5676959619952493) internal successors, (660), 421 states have internal predecessors, (660), 3 states have call successors, (3), 3 states have 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:47:50,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:47:50,593 INFO L93 Difference]: Finished difference Result 506 states and 772 transitions. [2022-04-08 08:47:50,593 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 772 transitions. [2022-04-08 08:47:50,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:47:50,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:47:50,593 INFO L74 IsIncluded]: Start isIncluded. First operand has 426 states, 421 states have (on average 1.5676959619952493) internal successors, (660), 421 states have internal predecessors, (660), 3 states have call successors, (3), 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 506 states. [2022-04-08 08:47:50,594 INFO L87 Difference]: Start difference. First operand has 426 states, 421 states have (on average 1.5676959619952493) internal successors, (660), 421 states have internal predecessors, (660), 3 states have call successors, (3), 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 506 states. [2022-04-08 08:47:50,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:47:50,602 INFO L93 Difference]: Finished difference Result 506 states and 772 transitions. [2022-04-08 08:47:50,602 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 772 transitions. [2022-04-08 08:47:50,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:47:50,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:47:50,602 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:47:50,602 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:47:50,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 421 states have (on average 1.5676959619952493) internal successors, (660), 421 states have internal predecessors, (660), 3 states have call successors, (3), 3 states have 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:47:50,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 664 transitions. [2022-04-08 08:47:50,610 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 664 transitions. Word has length 132 [2022-04-08 08:47:50,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:47:50,611 INFO L478 AbstractCegarLoop]: Abstraction has 426 states and 664 transitions. [2022-04-08 08:47:50,611 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 1 states have call successors, (3), 2 states have 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:47:50,611 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 426 states and 664 transitions. [2022-04-08 08:47:51,188 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 664 edges. 664 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:47:51,188 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 664 transitions. [2022-04-08 08:47:51,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-04-08 08:47:51,189 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:47:51,189 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:47:51,189 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-04-08 08:47:51,189 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:47:51,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:47:51,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1635626389, now seen corresponding path program 1 times [2022-04-08 08:47:51,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:47:51,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1043810699] [2022-04-08 08:47:51,278 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:47:51,278 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:47:51,278 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:47:51,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1635626389, now seen corresponding path program 2 times [2022-04-08 08:47:51,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:47:51,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558903853] [2022-04-08 08:47:51,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:47:51,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:47:51,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:47:51,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:47:51,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:47:51,437 INFO L290 TraceCheckUtils]: 0: Hoare triple {88903#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {88896#true} is VALID [2022-04-08 08:47:51,437 INFO L290 TraceCheckUtils]: 1: Hoare triple {88896#true} assume true; {88896#true} is VALID [2022-04-08 08:47:51,437 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {88896#true} {88896#true} #678#return; {88896#true} is VALID [2022-04-08 08:47:51,438 INFO L272 TraceCheckUtils]: 0: Hoare triple {88896#true} call ULTIMATE.init(); {88903#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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:47:51,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {88903#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {88896#true} is VALID [2022-04-08 08:47:51,438 INFO L290 TraceCheckUtils]: 2: Hoare triple {88896#true} assume true; {88896#true} is VALID [2022-04-08 08:47:51,438 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {88896#true} {88896#true} #678#return; {88896#true} is VALID [2022-04-08 08:47:51,438 INFO L272 TraceCheckUtils]: 4: Hoare triple {88896#true} call #t~ret161 := main(); {88896#true} is VALID [2022-04-08 08:47:51,438 INFO L290 TraceCheckUtils]: 5: Hoare triple {88896#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {88896#true} is VALID [2022-04-08 08:47:51,438 INFO L290 TraceCheckUtils]: 6: Hoare triple {88896#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {88896#true} is VALID [2022-04-08 08:47:51,438 INFO L272 TraceCheckUtils]: 7: Hoare triple {88896#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {88896#true} is VALID [2022-04-08 08:47:51,438 INFO L290 TraceCheckUtils]: 8: Hoare triple {88896#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {88896#true} is VALID [2022-04-08 08:47:51,438 INFO L290 TraceCheckUtils]: 9: Hoare triple {88896#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {88896#true} is VALID [2022-04-08 08:47:51,438 INFO L290 TraceCheckUtils]: 10: Hoare triple {88896#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {88896#true} is VALID [2022-04-08 08:47:51,439 INFO L290 TraceCheckUtils]: 11: Hoare triple {88896#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {88896#true} is VALID [2022-04-08 08:47:51,439 INFO L290 TraceCheckUtils]: 12: Hoare triple {88896#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {88896#true} is VALID [2022-04-08 08:47:51,439 INFO L290 TraceCheckUtils]: 13: Hoare triple {88896#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {88896#true} is VALID [2022-04-08 08:47:51,439 INFO L290 TraceCheckUtils]: 14: Hoare triple {88896#true} assume !false; {88896#true} is VALID [2022-04-08 08:47:51,439 INFO L290 TraceCheckUtils]: 15: Hoare triple {88896#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {88896#true} is VALID [2022-04-08 08:47:51,439 INFO L290 TraceCheckUtils]: 16: Hoare triple {88896#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {88896#true} is VALID [2022-04-08 08:47:51,439 INFO L290 TraceCheckUtils]: 17: Hoare triple {88896#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {88896#true} is VALID [2022-04-08 08:47:51,439 INFO L290 TraceCheckUtils]: 18: Hoare triple {88896#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {88896#true} is VALID [2022-04-08 08:47:51,439 INFO L290 TraceCheckUtils]: 19: Hoare triple {88896#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {88896#true} is VALID [2022-04-08 08:47:51,439 INFO L290 TraceCheckUtils]: 20: Hoare triple {88896#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {88896#true} is VALID [2022-04-08 08:47:51,439 INFO L290 TraceCheckUtils]: 21: Hoare triple {88896#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {88896#true} is VALID [2022-04-08 08:47:51,439 INFO L290 TraceCheckUtils]: 22: Hoare triple {88896#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {88896#true} is VALID [2022-04-08 08:47:51,439 INFO L290 TraceCheckUtils]: 23: Hoare triple {88896#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {88896#true} is VALID [2022-04-08 08:47:51,439 INFO L290 TraceCheckUtils]: 24: Hoare triple {88896#true} assume 8464 == #t~mem55;havoc #t~mem55; {88896#true} is VALID [2022-04-08 08:47:51,440 INFO L290 TraceCheckUtils]: 25: Hoare triple {88896#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {88896#true} is VALID [2022-04-08 08:47:51,440 INFO L290 TraceCheckUtils]: 26: Hoare triple {88896#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {88896#true} is VALID [2022-04-08 08:47:51,440 INFO L290 TraceCheckUtils]: 27: Hoare triple {88896#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); {88896#true} is VALID [2022-04-08 08:47:51,440 INFO L290 TraceCheckUtils]: 28: Hoare triple {88896#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {88896#true} is VALID [2022-04-08 08:47:51,440 INFO L290 TraceCheckUtils]: 29: Hoare triple {88896#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {88896#true} is VALID [2022-04-08 08:47:51,440 INFO L290 TraceCheckUtils]: 30: Hoare triple {88896#true} ~skip~0 := 0; {88896#true} is VALID [2022-04-08 08:47:51,440 INFO L290 TraceCheckUtils]: 31: Hoare triple {88896#true} assume !false; {88896#true} is VALID [2022-04-08 08:47:51,440 INFO L290 TraceCheckUtils]: 32: Hoare triple {88896#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {88896#true} is VALID [2022-04-08 08:47:51,440 INFO L290 TraceCheckUtils]: 33: Hoare triple {88896#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {88896#true} is VALID [2022-04-08 08:47:51,440 INFO L290 TraceCheckUtils]: 34: Hoare triple {88896#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {88896#true} is VALID [2022-04-08 08:47:51,440 INFO L290 TraceCheckUtils]: 35: Hoare triple {88896#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {88896#true} is VALID [2022-04-08 08:47:51,440 INFO L290 TraceCheckUtils]: 36: Hoare triple {88896#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {88896#true} is VALID [2022-04-08 08:47:51,440 INFO L290 TraceCheckUtils]: 37: Hoare triple {88896#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {88896#true} is VALID [2022-04-08 08:47:51,440 INFO L290 TraceCheckUtils]: 38: Hoare triple {88896#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {88896#true} is VALID [2022-04-08 08:47:51,441 INFO L290 TraceCheckUtils]: 39: Hoare triple {88896#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {88896#true} is VALID [2022-04-08 08:47:51,441 INFO L290 TraceCheckUtils]: 40: Hoare triple {88896#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {88896#true} is VALID [2022-04-08 08:47:51,441 INFO L290 TraceCheckUtils]: 41: Hoare triple {88896#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {88896#true} is VALID [2022-04-08 08:47:51,441 INFO L290 TraceCheckUtils]: 42: Hoare triple {88896#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {88896#true} is VALID [2022-04-08 08:47:51,441 INFO L290 TraceCheckUtils]: 43: Hoare triple {88896#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {88896#true} is VALID [2022-04-08 08:47:51,441 INFO L290 TraceCheckUtils]: 44: Hoare triple {88896#true} assume 8496 == #t~mem58;havoc #t~mem58; {88896#true} is VALID [2022-04-08 08:47:51,441 INFO L290 TraceCheckUtils]: 45: Hoare triple {88896#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {88896#true} is VALID [2022-04-08 08:47:51,441 INFO L290 TraceCheckUtils]: 46: Hoare triple {88896#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {88896#true} is VALID [2022-04-08 08:47:51,441 INFO L290 TraceCheckUtils]: 47: Hoare triple {88896#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {88896#true} is VALID [2022-04-08 08:47:51,442 INFO L290 TraceCheckUtils]: 48: Hoare triple {88896#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {88901#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:51,442 INFO L290 TraceCheckUtils]: 49: Hoare triple {88901#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {88901#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:51,443 INFO L290 TraceCheckUtils]: 50: Hoare triple {88901#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {88901#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:51,443 INFO L290 TraceCheckUtils]: 51: Hoare triple {88901#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {88901#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:51,444 INFO L290 TraceCheckUtils]: 52: Hoare triple {88901#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {88901#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:51,444 INFO L290 TraceCheckUtils]: 53: Hoare triple {88901#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {88901#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:51,444 INFO L290 TraceCheckUtils]: 54: Hoare triple {88901#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {88902#(not (= 12292 |ssl3_accept_#t~mem47|))} is VALID [2022-04-08 08:47:51,445 INFO L290 TraceCheckUtils]: 55: Hoare triple {88902#(not (= 12292 |ssl3_accept_#t~mem47|))} assume 12292 == #t~mem47;havoc #t~mem47; {88897#false} is VALID [2022-04-08 08:47:51,445 INFO L290 TraceCheckUtils]: 56: Hoare triple {88897#false} call write~int(1, ~s.base, 40 + ~s.offset, 4); {88897#false} is VALID [2022-04-08 08:47:51,445 INFO L290 TraceCheckUtils]: 57: Hoare triple {88897#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {88897#false} is VALID [2022-04-08 08:47:51,445 INFO L290 TraceCheckUtils]: 58: Hoare triple {88897#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {88897#false} is VALID [2022-04-08 08:47:51,445 INFO L290 TraceCheckUtils]: 59: Hoare triple {88897#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {88897#false} is VALID [2022-04-08 08:47:51,445 INFO L290 TraceCheckUtils]: 60: Hoare triple {88897#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {88897#false} is VALID [2022-04-08 08:47:51,445 INFO L290 TraceCheckUtils]: 61: Hoare triple {88897#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {88897#false} is VALID [2022-04-08 08:47:51,445 INFO L290 TraceCheckUtils]: 62: Hoare triple {88897#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {88897#false} is VALID [2022-04-08 08:47:51,445 INFO L290 TraceCheckUtils]: 63: Hoare triple {88897#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem89 := read~int(#t~mem88.base, 76 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 76 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {88897#false} is VALID [2022-04-08 08:47:51,445 INFO L290 TraceCheckUtils]: 64: Hoare triple {88897#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {88897#false} is VALID [2022-04-08 08:47:51,445 INFO L290 TraceCheckUtils]: 65: Hoare triple {88897#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {88897#false} is VALID [2022-04-08 08:47:51,445 INFO L290 TraceCheckUtils]: 66: Hoare triple {88897#false} ~skip~0 := 0; {88897#false} is VALID [2022-04-08 08:47:51,445 INFO L290 TraceCheckUtils]: 67: Hoare triple {88897#false} assume !false; {88897#false} is VALID [2022-04-08 08:47:51,446 INFO L290 TraceCheckUtils]: 68: Hoare triple {88897#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {88897#false} is VALID [2022-04-08 08:47:51,446 INFO L290 TraceCheckUtils]: 69: Hoare triple {88897#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {88897#false} is VALID [2022-04-08 08:47:51,446 INFO L290 TraceCheckUtils]: 70: Hoare triple {88897#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {88897#false} is VALID [2022-04-08 08:47:51,446 INFO L290 TraceCheckUtils]: 71: Hoare triple {88897#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {88897#false} is VALID [2022-04-08 08:47:51,446 INFO L290 TraceCheckUtils]: 72: Hoare triple {88897#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {88897#false} is VALID [2022-04-08 08:47:51,446 INFO L290 TraceCheckUtils]: 73: Hoare triple {88897#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {88897#false} is VALID [2022-04-08 08:47:51,446 INFO L290 TraceCheckUtils]: 74: Hoare triple {88897#false} assume 8480 == #t~mem52;havoc #t~mem52; {88897#false} is VALID [2022-04-08 08:47:51,446 INFO L290 TraceCheckUtils]: 75: Hoare triple {88897#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {88897#false} is VALID [2022-04-08 08:47:51,446 INFO L290 TraceCheckUtils]: 76: Hoare triple {88897#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem91.base, 844 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {88897#false} is VALID [2022-04-08 08:47:51,446 INFO L290 TraceCheckUtils]: 77: Hoare triple {88897#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {88897#false} is VALID [2022-04-08 08:47:51,446 INFO L290 TraceCheckUtils]: 78: Hoare triple {88897#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {88897#false} is VALID [2022-04-08 08:47:51,446 INFO L290 TraceCheckUtils]: 79: Hoare triple {88897#false} ~skip~0 := 0; {88897#false} is VALID [2022-04-08 08:47:51,446 INFO L290 TraceCheckUtils]: 80: Hoare triple {88897#false} assume !false; {88897#false} is VALID [2022-04-08 08:47:51,446 INFO L290 TraceCheckUtils]: 81: Hoare triple {88897#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {88897#false} is VALID [2022-04-08 08:47:51,447 INFO L290 TraceCheckUtils]: 82: Hoare triple {88897#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {88897#false} is VALID [2022-04-08 08:47:51,447 INFO L290 TraceCheckUtils]: 83: Hoare triple {88897#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {88897#false} is VALID [2022-04-08 08:47:51,447 INFO L290 TraceCheckUtils]: 84: Hoare triple {88897#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {88897#false} is VALID [2022-04-08 08:47:51,447 INFO L290 TraceCheckUtils]: 85: Hoare triple {88897#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {88897#false} is VALID [2022-04-08 08:47:51,447 INFO L290 TraceCheckUtils]: 86: Hoare triple {88897#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {88897#false} is VALID [2022-04-08 08:47:51,447 INFO L290 TraceCheckUtils]: 87: Hoare triple {88897#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {88897#false} is VALID [2022-04-08 08:47:51,447 INFO L290 TraceCheckUtils]: 88: Hoare triple {88897#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {88897#false} is VALID [2022-04-08 08:47:51,447 INFO L290 TraceCheckUtils]: 89: Hoare triple {88897#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {88897#false} is VALID [2022-04-08 08:47:51,447 INFO L290 TraceCheckUtils]: 90: Hoare triple {88897#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {88897#false} is VALID [2022-04-08 08:47:51,447 INFO L290 TraceCheckUtils]: 91: Hoare triple {88897#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {88897#false} is VALID [2022-04-08 08:47:51,447 INFO L290 TraceCheckUtils]: 92: Hoare triple {88897#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {88897#false} is VALID [2022-04-08 08:47:51,447 INFO L290 TraceCheckUtils]: 93: Hoare triple {88897#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {88897#false} is VALID [2022-04-08 08:47:51,447 INFO L290 TraceCheckUtils]: 94: Hoare triple {88897#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {88897#false} is VALID [2022-04-08 08:47:51,447 INFO L290 TraceCheckUtils]: 95: Hoare triple {88897#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {88897#false} is VALID [2022-04-08 08:47:51,448 INFO L290 TraceCheckUtils]: 96: Hoare triple {88897#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {88897#false} is VALID [2022-04-08 08:47:51,448 INFO L290 TraceCheckUtils]: 97: Hoare triple {88897#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {88897#false} is VALID [2022-04-08 08:47:51,448 INFO L290 TraceCheckUtils]: 98: Hoare triple {88897#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {88897#false} is VALID [2022-04-08 08:47:51,448 INFO L290 TraceCheckUtils]: 99: Hoare triple {88897#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {88897#false} is VALID [2022-04-08 08:47:51,448 INFO L290 TraceCheckUtils]: 100: Hoare triple {88897#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {88897#false} is VALID [2022-04-08 08:47:51,448 INFO L290 TraceCheckUtils]: 101: Hoare triple {88897#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {88897#false} is VALID [2022-04-08 08:47:51,448 INFO L290 TraceCheckUtils]: 102: Hoare triple {88897#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {88897#false} is VALID [2022-04-08 08:47:51,448 INFO L290 TraceCheckUtils]: 103: Hoare triple {88897#false} assume 8448 == #t~mem68;havoc #t~mem68; {88897#false} is VALID [2022-04-08 08:47:51,448 INFO L290 TraceCheckUtils]: 104: Hoare triple {88897#false} assume !(~num1~0 > 0); {88897#false} is VALID [2022-04-08 08:47:51,448 INFO L290 TraceCheckUtils]: 105: Hoare triple {88897#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {88897#false} is VALID [2022-04-08 08:47:51,448 INFO L290 TraceCheckUtils]: 106: Hoare triple {88897#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {88897#false} is VALID [2022-04-08 08:47:51,448 INFO L290 TraceCheckUtils]: 107: Hoare triple {88897#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {88897#false} is VALID [2022-04-08 08:47:51,448 INFO L290 TraceCheckUtils]: 108: Hoare triple {88897#false} ~skip~0 := 0; {88897#false} is VALID [2022-04-08 08:47:51,448 INFO L290 TraceCheckUtils]: 109: Hoare triple {88897#false} assume !false; {88897#false} is VALID [2022-04-08 08:47:51,449 INFO L290 TraceCheckUtils]: 110: Hoare triple {88897#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {88897#false} is VALID [2022-04-08 08:47:51,449 INFO L290 TraceCheckUtils]: 111: Hoare triple {88897#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {88897#false} is VALID [2022-04-08 08:47:51,449 INFO L290 TraceCheckUtils]: 112: Hoare triple {88897#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {88897#false} is VALID [2022-04-08 08:47:51,449 INFO L290 TraceCheckUtils]: 113: Hoare triple {88897#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {88897#false} is VALID [2022-04-08 08:47:51,449 INFO L290 TraceCheckUtils]: 114: Hoare triple {88897#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {88897#false} is VALID [2022-04-08 08:47:51,449 INFO L290 TraceCheckUtils]: 115: Hoare triple {88897#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {88897#false} is VALID [2022-04-08 08:47:51,449 INFO L290 TraceCheckUtils]: 116: Hoare triple {88897#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {88897#false} is VALID [2022-04-08 08:47:51,449 INFO L290 TraceCheckUtils]: 117: Hoare triple {88897#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {88897#false} is VALID [2022-04-08 08:47:51,449 INFO L290 TraceCheckUtils]: 118: Hoare triple {88897#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {88897#false} is VALID [2022-04-08 08:47:51,449 INFO L290 TraceCheckUtils]: 119: Hoare triple {88897#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {88897#false} is VALID [2022-04-08 08:47:51,449 INFO L290 TraceCheckUtils]: 120: Hoare triple {88897#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {88897#false} is VALID [2022-04-08 08:47:51,449 INFO L290 TraceCheckUtils]: 121: Hoare triple {88897#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {88897#false} is VALID [2022-04-08 08:47:51,449 INFO L290 TraceCheckUtils]: 122: Hoare triple {88897#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {88897#false} is VALID [2022-04-08 08:47:51,449 INFO L290 TraceCheckUtils]: 123: Hoare triple {88897#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {88897#false} is VALID [2022-04-08 08:47:51,449 INFO L290 TraceCheckUtils]: 124: Hoare triple {88897#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {88897#false} is VALID [2022-04-08 08:47:51,450 INFO L290 TraceCheckUtils]: 125: Hoare triple {88897#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {88897#false} is VALID [2022-04-08 08:47:51,450 INFO L290 TraceCheckUtils]: 126: Hoare triple {88897#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {88897#false} is VALID [2022-04-08 08:47:51,450 INFO L290 TraceCheckUtils]: 127: Hoare triple {88897#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {88897#false} is VALID [2022-04-08 08:47:51,450 INFO L290 TraceCheckUtils]: 128: Hoare triple {88897#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {88897#false} is VALID [2022-04-08 08:47:51,450 INFO L290 TraceCheckUtils]: 129: Hoare triple {88897#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {88897#false} is VALID [2022-04-08 08:47:51,450 INFO L290 TraceCheckUtils]: 130: Hoare triple {88897#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {88897#false} is VALID [2022-04-08 08:47:51,450 INFO L290 TraceCheckUtils]: 131: Hoare triple {88897#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {88897#false} is VALID [2022-04-08 08:47:51,450 INFO L290 TraceCheckUtils]: 132: Hoare triple {88897#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {88897#false} is VALID [2022-04-08 08:47:51,450 INFO L290 TraceCheckUtils]: 133: Hoare triple {88897#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {88897#false} is VALID [2022-04-08 08:47:51,450 INFO L290 TraceCheckUtils]: 134: Hoare triple {88897#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {88897#false} is VALID [2022-04-08 08:47:51,450 INFO L290 TraceCheckUtils]: 135: Hoare triple {88897#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {88897#false} is VALID [2022-04-08 08:47:51,450 INFO L290 TraceCheckUtils]: 136: Hoare triple {88897#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {88897#false} is VALID [2022-04-08 08:47:51,450 INFO L290 TraceCheckUtils]: 137: Hoare triple {88897#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {88897#false} is VALID [2022-04-08 08:47:51,450 INFO L290 TraceCheckUtils]: 138: Hoare triple {88897#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {88897#false} is VALID [2022-04-08 08:47:51,451 INFO L290 TraceCheckUtils]: 139: Hoare triple {88897#false} assume 8640 == #t~mem75;havoc #t~mem75; {88897#false} is VALID [2022-04-08 08:47:51,451 INFO L290 TraceCheckUtils]: 140: Hoare triple {88897#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {88897#false} is VALID [2022-04-08 08:47:51,451 INFO L290 TraceCheckUtils]: 141: Hoare triple {88897#false} assume !(4 == ~blastFlag~0); {88897#false} is VALID [2022-04-08 08:47:51,451 INFO L290 TraceCheckUtils]: 142: Hoare triple {88897#false} assume 7 == ~blastFlag~0; {88897#false} is VALID [2022-04-08 08:47:51,451 INFO L290 TraceCheckUtils]: 143: Hoare triple {88897#false} assume !false; {88897#false} is VALID [2022-04-08 08:47:51,451 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-08 08:47:51,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:47:51,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558903853] [2022-04-08 08:47:51,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558903853] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:47:51,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:47:51,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:47:51,452 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:47:51,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1043810699] [2022-04-08 08:47:51,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1043810699] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:47:51,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:47:51,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:47:51,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331477826] [2022-04-08 08:47:51,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:47:51,454 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (3), 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 144 [2022-04-08 08:47:51,454 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:47:51,454 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (3), 2 states have 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:47:51,520 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:47:51,520 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:47:51,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:47:51,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:47:51,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:47:51,521 INFO L87 Difference]: Start difference. First operand 426 states and 664 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (3), 2 states have 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:47:56,057 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:48:00,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:48:00,276 INFO L93 Difference]: Finished difference Result 894 states and 1392 transitions. [2022-04-08 08:48:00,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:48:00,276 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (3), 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 144 [2022-04-08 08:48:00,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:48:00,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (3), 2 states have 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:48:00,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 573 transitions. [2022-04-08 08:48:00,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (3), 2 states have 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:48:00,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 573 transitions. [2022-04-08 08:48:00,280 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 573 transitions. [2022-04-08 08:48:00,643 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:48:00,653 INFO L225 Difference]: With dead ends: 894 [2022-04-08 08:48:00,653 INFO L226 Difference]: Without dead ends: 496 [2022-04-08 08:48:00,654 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:48:00,654 INFO L913 BasicCegarLoop]: 126 mSDtfsCounter, 139 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 59 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:48:00,654 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 356 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 476 Invalid, 1 Unknown, 0 Unchecked, 5.1s Time] [2022-04-08 08:48:00,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2022-04-08 08:48:00,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 426. [2022-04-08 08:48:00,684 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:48:00,684 INFO L82 GeneralOperation]: Start isEquivalent. First operand 496 states. Second operand has 426 states, 421 states have (on average 1.5510688836104514) internal successors, (653), 421 states have internal predecessors, (653), 3 states have call successors, (3), 3 states have 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:48:00,684 INFO L74 IsIncluded]: Start isIncluded. First operand 496 states. Second operand has 426 states, 421 states have (on average 1.5510688836104514) internal successors, (653), 421 states have internal predecessors, (653), 3 states have call successors, (3), 3 states have 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:48:00,685 INFO L87 Difference]: Start difference. First operand 496 states. Second operand has 426 states, 421 states have (on average 1.5510688836104514) internal successors, (653), 421 states have internal predecessors, (653), 3 states have call successors, (3), 3 states have 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:48:00,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:48:00,693 INFO L93 Difference]: Finished difference Result 496 states and 753 transitions. [2022-04-08 08:48:00,693 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 753 transitions. [2022-04-08 08:48:00,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:48:00,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:48:00,694 INFO L74 IsIncluded]: Start isIncluded. First operand has 426 states, 421 states have (on average 1.5510688836104514) internal successors, (653), 421 states have internal predecessors, (653), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 496 states. [2022-04-08 08:48:00,694 INFO L87 Difference]: Start difference. First operand has 426 states, 421 states have (on average 1.5510688836104514) internal successors, (653), 421 states have internal predecessors, (653), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 496 states. [2022-04-08 08:48:00,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:48:00,703 INFO L93 Difference]: Finished difference Result 496 states and 753 transitions. [2022-04-08 08:48:00,703 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 753 transitions. [2022-04-08 08:48:00,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:48:00,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:48:00,703 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:48:00,703 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:48:00,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 421 states have (on average 1.5510688836104514) internal successors, (653), 421 states have internal predecessors, (653), 3 states have call successors, (3), 3 states have 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:48:00,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 657 transitions. [2022-04-08 08:48:00,711 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 657 transitions. Word has length 144 [2022-04-08 08:48:00,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:48:00,711 INFO L478 AbstractCegarLoop]: Abstraction has 426 states and 657 transitions. [2022-04-08 08:48:00,711 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (3), 2 states have 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:48:00,711 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 426 states and 657 transitions. [2022-04-08 08:48:01,255 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 657 edges. 657 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:48:01,255 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 657 transitions. [2022-04-08 08:48:01,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-04-08 08:48:01,256 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:48:01,256 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:48:01,256 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-04-08 08:48:01,256 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:48:01,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:48:01,256 INFO L85 PathProgramCache]: Analyzing trace with hash -485488767, now seen corresponding path program 1 times [2022-04-08 08:48:01,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:48:01,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1943675104] [2022-04-08 08:48:01,517 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 18 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 08:48:01,517 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:48:01,517 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:48:01,518 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:48:01,521 INFO L158 Benchmark]: Toolchain (without parser) took 342709.95ms. Allocated memory was 173.0MB in the beginning and 249.6MB in the end (delta: 76.5MB). Free memory was 119.0MB in the beginning and 205.9MB in the end (delta: -86.9MB). Peak memory consumption was 131.7MB. Max. memory is 8.0GB. [2022-04-08 08:48:01,521 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 173.0MB. Free memory was 137.4MB in the beginning and 137.3MB in the end (delta: 69.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 08:48:01,521 INFO L158 Benchmark]: CACSL2BoogieTranslator took 513.85ms. Allocated memory was 173.0MB in the beginning and 207.6MB in the end (delta: 34.6MB). Free memory was 118.8MB in the beginning and 159.7MB in the end (delta: -40.9MB). Peak memory consumption was 11.7MB. Max. memory is 8.0GB. [2022-04-08 08:48:01,521 INFO L158 Benchmark]: Boogie Preprocessor took 100.39ms. Allocated memory is still 207.6MB. Free memory was 159.7MB in the beginning and 149.8MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-08 08:48:01,521 INFO L158 Benchmark]: RCFGBuilder took 1430.46ms. Allocated memory is still 207.6MB. Free memory was 149.8MB in the beginning and 137.4MB in the end (delta: 12.4MB). Peak memory consumption was 56.9MB. Max. memory is 8.0GB. [2022-04-08 08:48:01,521 INFO L158 Benchmark]: TraceAbstraction took 340656.01ms. Allocated memory was 207.6MB in the beginning and 249.6MB in the end (delta: 41.9MB). Free memory was 136.9MB in the beginning and 205.9MB in the end (delta: -69.0MB). Peak memory consumption was 113.4MB. Max. memory is 8.0GB. [2022-04-08 08:48:01,522 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 173.0MB. Free memory was 137.4MB in the beginning and 137.3MB in the end (delta: 69.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 513.85ms. Allocated memory was 173.0MB in the beginning and 207.6MB in the end (delta: 34.6MB). Free memory was 118.8MB in the beginning and 159.7MB in the end (delta: -40.9MB). Peak memory consumption was 11.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 100.39ms. Allocated memory is still 207.6MB. Free memory was 159.7MB in the beginning and 149.8MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * RCFGBuilder took 1430.46ms. Allocated memory is still 207.6MB. Free memory was 149.8MB in the beginning and 137.4MB in the end (delta: 12.4MB). Peak memory consumption was 56.9MB. Max. memory is 8.0GB. * TraceAbstraction took 340656.01ms. Allocated memory was 207.6MB in the beginning and 249.6MB in the end (delta: 41.9MB). Free memory was 136.9MB in the beginning and 205.9MB in the end (delta: -69.0MB). Peak memory consumption was 113.4MB. 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:48:01,586 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...