/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.15.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 11:46:33,810 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 11:46:33,812 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 11:46:33,845 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 11:46:33,846 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 11:46:33,847 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 11:46:33,848 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 11:46:33,849 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 11:46:33,851 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 11:46:33,852 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 11:46:33,853 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 11:46:33,854 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 11:46:33,854 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 11:46:33,855 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 11:46:33,856 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 11:46:33,857 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 11:46:33,857 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 11:46:33,858 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 11:46:33,860 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 11:46:33,861 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 11:46:33,862 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 11:46:33,863 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 11:46:33,864 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 11:46:33,865 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 11:46:33,866 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 11:46:33,869 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 11:46:33,869 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 11:46:33,869 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 11:46:33,870 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 11:46:33,870 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 11:46:33,871 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 11:46:33,871 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 11:46:33,872 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 11:46:33,872 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 11:46:33,873 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 11:46:33,874 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 11:46:33,874 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 11:46:33,875 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 11:46:33,875 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 11:46:33,875 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 11:46:33,876 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 11:46:33,879 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 11:46:33,879 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 11:46:33,887 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 11:46:33,887 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 11:46:33,888 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 11:46:33,888 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 11:46:33,888 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 11:46:33,889 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 11:46:33,889 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 11:46:33,889 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 11:46:33,889 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 11:46:33,889 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 11:46:33,890 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 11:46:33,890 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 11:46:33,890 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 11:46:33,890 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 11:46:33,890 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 11:46:33,891 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 11:46:33,891 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 11:46:33,897 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 11:46:33,898 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 11:46:33,898 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 11:46:33,898 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 11:46:33,898 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 11:46:33,898 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 11:46:33,899 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 11:46:33,899 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 11:46:33,899 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-15 11:46:34,135 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 11:46:34,158 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 11:46:34,160 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 11:46:34,161 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 11:46:34,161 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 11:46:34,162 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_srvr.blast.15.i.cil-2.c [2022-04-15 11:46:34,220 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6d38fc5a/f5927c76e4a34b07891473b35de2df07/FLAGdd168f96c [2022-04-15 11:46:34,650 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 11:46:34,651 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.15.i.cil-2.c [2022-04-15 11:46:34,672 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6d38fc5a/f5927c76e4a34b07891473b35de2df07/FLAGdd168f96c [2022-04-15 11:46:34,983 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6d38fc5a/f5927c76e4a34b07891473b35de2df07 [2022-04-15 11:46:34,985 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 11:46:34,988 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 11:46:34,989 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 11:46:34,989 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 11:46:34,993 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 11:46:34,994 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 11:46:34" (1/1) ... [2022-04-15 11:46:34,995 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@348ceea9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:46:34, skipping insertion in model container [2022-04-15 11:46:34,995 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 11:46:34" (1/1) ... [2022-04-15 11:46:35,001 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 11:46:35,062 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 11:46:35,412 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.15.i.cil-2.c[75833,75846] [2022-04-15 11:46:35,421 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 11:46:35,443 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 11:46:35,610 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.15.i.cil-2.c[75833,75846] [2022-04-15 11:46:35,613 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 11:46:35,633 INFO L208 MainTranslator]: Completed translation [2022-04-15 11:46:35,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:46:35 WrapperNode [2022-04-15 11:46:35,634 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 11:46:35,635 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 11:46:35,635 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 11:46:35,635 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 11:46:35,646 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:46:35" (1/1) ... [2022-04-15 11:46:35,646 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:46:35" (1/1) ... [2022-04-15 11:46:35,680 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:46:35" (1/1) ... [2022-04-15 11:46:35,680 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:46:35" (1/1) ... [2022-04-15 11:46:35,757 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:46:35" (1/1) ... [2022-04-15 11:46:35,773 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:46:35" (1/1) ... [2022-04-15 11:46:35,776 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:46:35" (1/1) ... [2022-04-15 11:46:35,790 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 11:46:35,791 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 11:46:35,791 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 11:46:35,791 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 11:46:35,792 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:46:35" (1/1) ... [2022-04-15 11:46:35,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 11:46:35,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:46:35,824 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-15 11:46:35,831 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-15 11:46:35,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 11:46:35,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 11:46:35,859 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 11:46:35,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2022-04-15 11:46:35,859 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2022-04-15 11:46:35,859 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 11:46:35,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2022-04-15 11:46:35,859 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-15 11:46:35,860 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-15 11:46:35,860 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-15 11:46:35,860 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 11:46:35,860 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 11:46:35,860 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 11:46:35,860 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 11:46:35,860 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-15 11:46:35,860 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-15 11:46:35,860 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 11:46:35,860 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-15 11:46:35,861 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-15 11:46:35,861 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-15 11:46:35,861 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2022-04-15 11:46:35,861 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-15 11:46:35,861 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2022-04-15 11:46:35,861 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2022-04-15 11:46:35,861 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-15 11:46:35,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-15 11:46:35,861 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 11:46:35,861 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-15 11:46:35,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 11:46:35,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-15 11:46:35,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 11:46:35,862 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-15 11:46:35,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-15 11:46:35,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 11:46:35,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 11:46:35,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 11:46:35,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-15 11:46:35,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-15 11:46:35,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-15 11:46:35,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-15 11:46:35,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 11:46:36,000 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 11:46:36,001 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 11:46:36,814 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:46:37,422 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2022-04-15 11:46:37,422 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2022-04-15 11:46:37,439 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 11:46:37,453 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 11:46:37,453 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 11:46:37,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 11:46:37 BoogieIcfgContainer [2022-04-15 11:46:37,455 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 11:46:37,457 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 11:46:37,457 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 11:46:37,460 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 11:46:37,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 11:46:34" (1/3) ... [2022-04-15 11:46:37,461 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@287e489b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 11:46:37, skipping insertion in model container [2022-04-15 11:46:37,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:46:35" (2/3) ... [2022-04-15 11:46:37,462 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@287e489b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 11:46:37, skipping insertion in model container [2022-04-15 11:46:37,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 11:46:37" (3/3) ... [2022-04-15 11:46:37,464 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.15.i.cil-2.c [2022-04-15 11:46:37,472 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 11:46:37,472 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 11:46:37,520 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 11:46:37,526 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-15 11:46:37,526 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 11:46:37,546 INFO L276 IsEmpty]: Start isEmpty. Operand has 162 states, 154 states have (on average 1.7142857142857142) internal successors, (264), 155 states have internal predecessors, (264), 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-15 11:46:37,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-15 11:46:37,556 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:46:37,557 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:46:37,557 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:46:37,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:46:37,561 INFO L85 PathProgramCache]: Analyzing trace with hash -668377608, now seen corresponding path program 1 times [2022-04-15 11:46:37,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:46:37,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2027218919] [2022-04-15 11:46:37,575 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:46:37,575 INFO L85 PathProgramCache]: Analyzing trace with hash -668377608, now seen corresponding path program 2 times [2022-04-15 11:46:37,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:46:37,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986764009] [2022-04-15 11:46:37,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:46:37,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:46:37,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:46:38,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:46:38,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:46:38,141 INFO L290 TraceCheckUtils]: 0: Hoare triple {172#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {165#true} is VALID [2022-04-15 11:46:38,141 INFO L290 TraceCheckUtils]: 1: Hoare triple {165#true} assume true; {165#true} is VALID [2022-04-15 11:46:38,142 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {165#true} {165#true} #708#return; {165#true} is VALID [2022-04-15 11:46:38,144 INFO L272 TraceCheckUtils]: 0: Hoare triple {165#true} call ULTIMATE.init(); {172#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:46:38,144 INFO L290 TraceCheckUtils]: 1: Hoare triple {172#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {165#true} is VALID [2022-04-15 11:46:38,144 INFO L290 TraceCheckUtils]: 2: Hoare triple {165#true} assume true; {165#true} is VALID [2022-04-15 11:46:38,144 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {165#true} {165#true} #708#return; {165#true} is VALID [2022-04-15 11:46:38,145 INFO L272 TraceCheckUtils]: 4: Hoare triple {165#true} call #t~ret161 := main(); {165#true} is VALID [2022-04-15 11:46:38,145 INFO L290 TraceCheckUtils]: 5: Hoare triple {165#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; {165#true} is VALID [2022-04-15 11:46:38,145 INFO L290 TraceCheckUtils]: 6: Hoare triple {165#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {165#true} is VALID [2022-04-15 11:46:38,146 INFO L272 TraceCheckUtils]: 7: Hoare triple {165#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {165#true} is VALID [2022-04-15 11:46:38,148 INFO L290 TraceCheckUtils]: 8: Hoare triple {165#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); {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:38,149 INFO L290 TraceCheckUtils]: 9: Hoare triple {170#(= 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; {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:38,150 INFO L290 TraceCheckUtils]: 10: Hoare triple {170#(= 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; {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:38,151 INFO L290 TraceCheckUtils]: 11: Hoare triple {170#(= 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)))); {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:38,152 INFO L290 TraceCheckUtils]: 12: Hoare triple {170#(= 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); {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:38,152 INFO L290 TraceCheckUtils]: 13: Hoare triple {170#(= 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; {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:38,153 INFO L290 TraceCheckUtils]: 14: Hoare triple {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:38,154 INFO L290 TraceCheckUtils]: 15: Hoare triple {170#(= 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); {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:38,154 INFO L290 TraceCheckUtils]: 16: Hoare triple {170#(= 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); {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:38,155 INFO L290 TraceCheckUtils]: 17: Hoare triple {170#(= 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); {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:38,155 INFO L290 TraceCheckUtils]: 18: Hoare triple {170#(= 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); {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:38,156 INFO L290 TraceCheckUtils]: 19: Hoare triple {170#(= 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); {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:38,157 INFO L290 TraceCheckUtils]: 20: Hoare triple {170#(= 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); {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:38,159 INFO L290 TraceCheckUtils]: 21: Hoare triple {170#(= 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); {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:38,160 INFO L290 TraceCheckUtils]: 22: Hoare triple {170#(= 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); {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:38,160 INFO L290 TraceCheckUtils]: 23: Hoare triple {170#(= 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); {171#(= 8464 |ssl3_accept_#t~mem55|)} is VALID [2022-04-15 11:46:38,161 INFO L290 TraceCheckUtils]: 24: Hoare triple {171#(= 8464 |ssl3_accept_#t~mem55|)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {166#false} is VALID [2022-04-15 11:46:38,161 INFO L290 TraceCheckUtils]: 25: Hoare triple {166#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {166#false} is VALID [2022-04-15 11:46:38,161 INFO L290 TraceCheckUtils]: 26: Hoare triple {166#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {166#false} is VALID [2022-04-15 11:46:38,162 INFO L290 TraceCheckUtils]: 27: Hoare triple {166#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {166#false} is VALID [2022-04-15 11:46:38,162 INFO L290 TraceCheckUtils]: 28: Hoare triple {166#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {166#false} is VALID [2022-04-15 11:46:38,162 INFO L290 TraceCheckUtils]: 29: Hoare triple {166#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {166#false} is VALID [2022-04-15 11:46:38,162 INFO L290 TraceCheckUtils]: 30: Hoare triple {166#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {166#false} is VALID [2022-04-15 11:46:38,163 INFO L290 TraceCheckUtils]: 31: Hoare triple {166#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {166#false} is VALID [2022-04-15 11:46:38,163 INFO L290 TraceCheckUtils]: 32: Hoare triple {166#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {166#false} is VALID [2022-04-15 11:46:38,163 INFO L290 TraceCheckUtils]: 33: Hoare triple {166#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {166#false} is VALID [2022-04-15 11:46:38,163 INFO L290 TraceCheckUtils]: 34: Hoare triple {166#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {166#false} is VALID [2022-04-15 11:46:38,163 INFO L290 TraceCheckUtils]: 35: Hoare triple {166#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {166#false} is VALID [2022-04-15 11:46:38,164 INFO L290 TraceCheckUtils]: 36: Hoare triple {166#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {166#false} is VALID [2022-04-15 11:46:38,164 INFO L290 TraceCheckUtils]: 37: Hoare triple {166#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {166#false} is VALID [2022-04-15 11:46:38,164 INFO L290 TraceCheckUtils]: 38: Hoare triple {166#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {166#false} is VALID [2022-04-15 11:46:38,164 INFO L290 TraceCheckUtils]: 39: Hoare triple {166#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {166#false} is VALID [2022-04-15 11:46:38,165 INFO L290 TraceCheckUtils]: 40: Hoare triple {166#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {166#false} is VALID [2022-04-15 11:46:38,165 INFO L290 TraceCheckUtils]: 41: Hoare triple {166#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {166#false} is VALID [2022-04-15 11:46:38,165 INFO L290 TraceCheckUtils]: 42: Hoare triple {166#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {166#false} is VALID [2022-04-15 11:46:38,165 INFO L290 TraceCheckUtils]: 43: Hoare triple {166#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {166#false} is VALID [2022-04-15 11:46:38,166 INFO L290 TraceCheckUtils]: 44: Hoare triple {166#false} assume 8640 == #t~mem75;havoc #t~mem75; {166#false} is VALID [2022-04-15 11:46:38,166 INFO L290 TraceCheckUtils]: 45: Hoare triple {166#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {166#false} is VALID [2022-04-15 11:46:38,166 INFO L290 TraceCheckUtils]: 46: Hoare triple {166#false} assume !(4 == ~blastFlag~0); {166#false} is VALID [2022-04-15 11:46:38,166 INFO L290 TraceCheckUtils]: 47: Hoare triple {166#false} assume !(7 == ~blastFlag~0); {166#false} is VALID [2022-04-15 11:46:38,166 INFO L290 TraceCheckUtils]: 48: Hoare triple {166#false} assume !(10 == ~blastFlag~0); {166#false} is VALID [2022-04-15 11:46:38,167 INFO L290 TraceCheckUtils]: 49: Hoare triple {166#false} assume 13 == ~blastFlag~0; {166#false} is VALID [2022-04-15 11:46:38,167 INFO L290 TraceCheckUtils]: 50: Hoare triple {166#false} assume !false; {166#false} is VALID [2022-04-15 11:46:38,168 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-15 11:46:38,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:46:38,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986764009] [2022-04-15 11:46:38,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986764009] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:46:38,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:46:38,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:46:38,172 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:46:38,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2027218919] [2022-04-15 11:46:38,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2027218919] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:46:38,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:46:38,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:46:38,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566720021] [2022-04-15 11:46:38,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:46:38,179 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (3), 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 51 [2022-04-15 11:46:38,181 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:46:38,184 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:38,246 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:46:38,246 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:46:38,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:46:38,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:46:38,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:46:38,277 INFO L87 Difference]: Start difference. First operand has 162 states, 154 states have (on average 1.7142857142857142) internal successors, (264), 155 states have internal predecessors, (264), 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.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:42,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:42,127 INFO L93 Difference]: Finished difference Result 342 states and 576 transitions. [2022-04-15 11:46:42,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:46:42,127 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (3), 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 51 [2022-04-15 11:46:42,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:46:42,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:42,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 576 transitions. [2022-04-15 11:46:42,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:42,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 576 transitions. [2022-04-15 11:46:42,151 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 576 transitions. [2022-04-15 11:46:42,638 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-15 11:46:42,652 INFO L225 Difference]: With dead ends: 342 [2022-04-15 11:46:42,652 INFO L226 Difference]: Without dead ends: 174 [2022-04-15 11:46:42,655 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-15 11:46:42,658 INFO L913 BasicCegarLoop]: 237 mSDtfsCounter, 34 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-15 11:46:42,659 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 631 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-15 11:46:42,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-04-15 11:46:42,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 157. [2022-04-15 11:46:42,695 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:46:42,696 INFO L82 GeneralOperation]: Start isEquivalent. First operand 174 states. Second operand has 157 states, 152 states have (on average 1.5657894736842106) internal successors, (238), 152 states have internal predecessors, (238), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:42,697 INFO L74 IsIncluded]: Start isIncluded. First operand 174 states. Second operand has 157 states, 152 states have (on average 1.5657894736842106) internal successors, (238), 152 states have internal predecessors, (238), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:42,698 INFO L87 Difference]: Start difference. First operand 174 states. Second operand has 157 states, 152 states have (on average 1.5657894736842106) internal successors, (238), 152 states have internal predecessors, (238), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:42,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:42,706 INFO L93 Difference]: Finished difference Result 174 states and 263 transitions. [2022-04-15 11:46:42,706 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 263 transitions. [2022-04-15 11:46:42,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:46:42,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:46:42,708 INFO L74 IsIncluded]: Start isIncluded. First operand has 157 states, 152 states have (on average 1.5657894736842106) internal successors, (238), 152 states have internal predecessors, (238), 3 states have call successors, (3), 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 174 states. [2022-04-15 11:46:42,709 INFO L87 Difference]: Start difference. First operand has 157 states, 152 states have (on average 1.5657894736842106) internal successors, (238), 152 states have internal predecessors, (238), 3 states have call successors, (3), 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 174 states. [2022-04-15 11:46:42,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:42,716 INFO L93 Difference]: Finished difference Result 174 states and 263 transitions. [2022-04-15 11:46:42,716 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 263 transitions. [2022-04-15 11:46:42,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:46:42,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:46:42,718 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:46:42,718 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:46:42,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 152 states have (on average 1.5657894736842106) internal successors, (238), 152 states have internal predecessors, (238), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:42,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 242 transitions. [2022-04-15 11:46:42,726 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 242 transitions. Word has length 51 [2022-04-15 11:46:42,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:46:42,726 INFO L478 AbstractCegarLoop]: Abstraction has 157 states and 242 transitions. [2022-04-15 11:46:42,727 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:42,727 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 157 states and 242 transitions. [2022-04-15 11:46:42,926 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 242 edges. 242 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:46:42,926 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 242 transitions. [2022-04-15 11:46:42,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-15 11:46:42,928 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:46:42,929 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:46:42,929 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 11:46:42,929 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:46:42,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:46:42,930 INFO L85 PathProgramCache]: Analyzing trace with hash -480939749, now seen corresponding path program 1 times [2022-04-15 11:46:42,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:46:42,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1406995734] [2022-04-15 11:46:42,963 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:46:42,964 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:46:42,964 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:46:42,964 INFO L85 PathProgramCache]: Analyzing trace with hash -480939749, now seen corresponding path program 2 times [2022-04-15 11:46:42,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:46:42,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402637917] [2022-04-15 11:46:42,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:46:42,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:46:43,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:46:43,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:46:43,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:46:43,155 INFO L290 TraceCheckUtils]: 0: Hoare triple {1530#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {1523#true} is VALID [2022-04-15 11:46:43,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {1523#true} assume true; {1523#true} is VALID [2022-04-15 11:46:43,156 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1523#true} {1523#true} #708#return; {1523#true} is VALID [2022-04-15 11:46:43,158 INFO L272 TraceCheckUtils]: 0: Hoare triple {1523#true} call ULTIMATE.init(); {1530#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:46:43,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {1530#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {1523#true} is VALID [2022-04-15 11:46:43,158 INFO L290 TraceCheckUtils]: 2: Hoare triple {1523#true} assume true; {1523#true} is VALID [2022-04-15 11:46:43,159 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1523#true} {1523#true} #708#return; {1523#true} is VALID [2022-04-15 11:46:43,159 INFO L272 TraceCheckUtils]: 4: Hoare triple {1523#true} call #t~ret161 := main(); {1523#true} is VALID [2022-04-15 11:46:43,159 INFO L290 TraceCheckUtils]: 5: Hoare triple {1523#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; {1523#true} is VALID [2022-04-15 11:46:43,159 INFO L290 TraceCheckUtils]: 6: Hoare triple {1523#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {1523#true} is VALID [2022-04-15 11:46:43,159 INFO L272 TraceCheckUtils]: 7: Hoare triple {1523#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {1523#true} is VALID [2022-04-15 11:46:43,162 INFO L290 TraceCheckUtils]: 8: Hoare triple {1523#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); {1528#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:43,163 INFO L290 TraceCheckUtils]: 9: Hoare triple {1528#(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; {1528#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:43,164 INFO L290 TraceCheckUtils]: 10: Hoare triple {1528#(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; {1528#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:43,165 INFO L290 TraceCheckUtils]: 11: Hoare triple {1528#(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)))); {1528#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:43,165 INFO L290 TraceCheckUtils]: 12: Hoare triple {1528#(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); {1528#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:43,166 INFO L290 TraceCheckUtils]: 13: Hoare triple {1528#(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; {1528#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:43,166 INFO L290 TraceCheckUtils]: 14: Hoare triple {1528#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {1528#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:43,167 INFO L290 TraceCheckUtils]: 15: Hoare triple {1528#(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); {1528#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:43,168 INFO L290 TraceCheckUtils]: 16: Hoare triple {1528#(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); {1528#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:43,168 INFO L290 TraceCheckUtils]: 17: Hoare triple {1528#(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); {1528#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:43,169 INFO L290 TraceCheckUtils]: 18: Hoare triple {1528#(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); {1528#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:43,170 INFO L290 TraceCheckUtils]: 19: Hoare triple {1528#(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); {1528#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:43,170 INFO L290 TraceCheckUtils]: 20: Hoare triple {1528#(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); {1529#(not (= |ssl3_accept_#t~mem52| 8480))} is VALID [2022-04-15 11:46:43,171 INFO L290 TraceCheckUtils]: 21: Hoare triple {1529#(not (= |ssl3_accept_#t~mem52| 8480))} assume 8480 == #t~mem52;havoc #t~mem52; {1524#false} is VALID [2022-04-15 11:46:43,171 INFO L290 TraceCheckUtils]: 22: Hoare triple {1524#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; {1524#false} is VALID [2022-04-15 11:46:43,171 INFO L290 TraceCheckUtils]: 23: Hoare triple {1524#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); {1524#false} is VALID [2022-04-15 11:46:43,171 INFO L290 TraceCheckUtils]: 24: Hoare triple {1524#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); {1524#false} is VALID [2022-04-15 11:46:43,171 INFO L290 TraceCheckUtils]: 25: Hoare triple {1524#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {1524#false} is VALID [2022-04-15 11:46:43,172 INFO L290 TraceCheckUtils]: 26: Hoare triple {1524#false} ~skip~0 := 0; {1524#false} is VALID [2022-04-15 11:46:43,172 INFO L290 TraceCheckUtils]: 27: Hoare triple {1524#false} assume !false; {1524#false} is VALID [2022-04-15 11:46:43,172 INFO L290 TraceCheckUtils]: 28: Hoare triple {1524#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); {1524#false} is VALID [2022-04-15 11:46:43,172 INFO L290 TraceCheckUtils]: 29: Hoare triple {1524#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-15 11:46:43,172 INFO L290 TraceCheckUtils]: 30: Hoare triple {1524#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-15 11:46:43,173 INFO L290 TraceCheckUtils]: 31: Hoare triple {1524#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-15 11:46:43,173 INFO L290 TraceCheckUtils]: 32: Hoare triple {1524#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-15 11:46:43,173 INFO L290 TraceCheckUtils]: 33: Hoare triple {1524#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-15 11:46:43,173 INFO L290 TraceCheckUtils]: 34: Hoare triple {1524#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-15 11:46:43,173 INFO L290 TraceCheckUtils]: 35: Hoare triple {1524#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-15 11:46:43,174 INFO L290 TraceCheckUtils]: 36: Hoare triple {1524#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-15 11:46:43,174 INFO L290 TraceCheckUtils]: 37: Hoare triple {1524#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-15 11:46:43,174 INFO L290 TraceCheckUtils]: 38: Hoare triple {1524#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-15 11:46:43,174 INFO L290 TraceCheckUtils]: 39: Hoare triple {1524#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-15 11:46:43,174 INFO L290 TraceCheckUtils]: 40: Hoare triple {1524#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-15 11:46:43,175 INFO L290 TraceCheckUtils]: 41: Hoare triple {1524#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-15 11:46:43,175 INFO L290 TraceCheckUtils]: 42: Hoare triple {1524#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-15 11:46:43,175 INFO L290 TraceCheckUtils]: 43: Hoare triple {1524#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-15 11:46:43,175 INFO L290 TraceCheckUtils]: 44: Hoare triple {1524#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-15 11:46:43,175 INFO L290 TraceCheckUtils]: 45: Hoare triple {1524#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-15 11:46:43,176 INFO L290 TraceCheckUtils]: 46: Hoare triple {1524#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-15 11:46:43,176 INFO L290 TraceCheckUtils]: 47: Hoare triple {1524#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-15 11:46:43,176 INFO L290 TraceCheckUtils]: 48: Hoare triple {1524#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-15 11:46:43,176 INFO L290 TraceCheckUtils]: 49: Hoare triple {1524#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-15 11:46:43,176 INFO L290 TraceCheckUtils]: 50: Hoare triple {1524#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-15 11:46:43,177 INFO L290 TraceCheckUtils]: 51: Hoare triple {1524#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-15 11:46:43,177 INFO L290 TraceCheckUtils]: 52: Hoare triple {1524#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-15 11:46:43,177 INFO L290 TraceCheckUtils]: 53: Hoare triple {1524#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-15 11:46:43,177 INFO L290 TraceCheckUtils]: 54: Hoare triple {1524#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-15 11:46:43,177 INFO L290 TraceCheckUtils]: 55: Hoare triple {1524#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-15 11:46:43,177 INFO L290 TraceCheckUtils]: 56: Hoare triple {1524#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-15 11:46:43,178 INFO L290 TraceCheckUtils]: 57: Hoare triple {1524#false} assume 8640 == #t~mem75;havoc #t~mem75; {1524#false} is VALID [2022-04-15 11:46:43,178 INFO L290 TraceCheckUtils]: 58: Hoare triple {1524#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {1524#false} is VALID [2022-04-15 11:46:43,178 INFO L290 TraceCheckUtils]: 59: Hoare triple {1524#false} assume !(4 == ~blastFlag~0); {1524#false} is VALID [2022-04-15 11:46:43,178 INFO L290 TraceCheckUtils]: 60: Hoare triple {1524#false} assume !(7 == ~blastFlag~0); {1524#false} is VALID [2022-04-15 11:46:43,178 INFO L290 TraceCheckUtils]: 61: Hoare triple {1524#false} assume !(10 == ~blastFlag~0); {1524#false} is VALID [2022-04-15 11:46:43,179 INFO L290 TraceCheckUtils]: 62: Hoare triple {1524#false} assume 13 == ~blastFlag~0; {1524#false} is VALID [2022-04-15 11:46:43,179 INFO L290 TraceCheckUtils]: 63: Hoare triple {1524#false} assume !false; {1524#false} is VALID [2022-04-15 11:46:43,179 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:46:43,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:46:43,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402637917] [2022-04-15 11:46:43,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402637917] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:46:43,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:46:43,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:46:43,181 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:46:43,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1406995734] [2022-04-15 11:46:43,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1406995734] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:46:43,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:46:43,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:46:43,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894207473] [2022-04-15 11:46:43,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:46:43,182 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 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 64 [2022-04-15 11:46:43,183 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:46:43,183 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:43,243 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:46:43,243 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:46:43,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:46:43,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:46:43,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:46:43,244 INFO L87 Difference]: Start difference. First operand 157 states and 242 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:46,010 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:46:48,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:48,902 INFO L93 Difference]: Finished difference Result 408 states and 634 transitions. [2022-04-15 11:46:48,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:46:48,902 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 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 64 [2022-04-15 11:46:48,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:46:48,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:48,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 615 transitions. [2022-04-15 11:46:48,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:48,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 615 transitions. [2022-04-15 11:46:48,915 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 615 transitions. [2022-04-15 11:46:49,363 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 615 edges. 615 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:46:49,376 INFO L225 Difference]: With dead ends: 408 [2022-04-15 11:46:49,376 INFO L226 Difference]: Without dead ends: 277 [2022-04-15 11:46:49,377 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-15 11:46:49,378 INFO L913 BasicCegarLoop]: 273 mSDtfsCounter, 149 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:46:49,379 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 662 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-04-15 11:46:49,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2022-04-15 11:46:49,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 173. [2022-04-15 11:46:49,392 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:46:49,393 INFO L82 GeneralOperation]: Start isEquivalent. First operand 277 states. Second operand has 173 states, 168 states have (on average 1.5654761904761905) internal successors, (263), 168 states have internal predecessors, (263), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:49,393 INFO L74 IsIncluded]: Start isIncluded. First operand 277 states. Second operand has 173 states, 168 states have (on average 1.5654761904761905) internal successors, (263), 168 states have internal predecessors, (263), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:49,394 INFO L87 Difference]: Start difference. First operand 277 states. Second operand has 173 states, 168 states have (on average 1.5654761904761905) internal successors, (263), 168 states have internal predecessors, (263), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:49,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:49,405 INFO L93 Difference]: Finished difference Result 277 states and 428 transitions. [2022-04-15 11:46:49,405 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 428 transitions. [2022-04-15 11:46:49,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:46:49,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:46:49,407 INFO L74 IsIncluded]: Start isIncluded. First operand has 173 states, 168 states have (on average 1.5654761904761905) internal successors, (263), 168 states have internal predecessors, (263), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 277 states. [2022-04-15 11:46:49,407 INFO L87 Difference]: Start difference. First operand has 173 states, 168 states have (on average 1.5654761904761905) internal successors, (263), 168 states have internal predecessors, (263), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 277 states. [2022-04-15 11:46:49,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:49,418 INFO L93 Difference]: Finished difference Result 277 states and 428 transitions. [2022-04-15 11:46:49,418 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 428 transitions. [2022-04-15 11:46:49,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:46:49,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:46:49,419 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:46:49,419 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:46:49,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 168 states have (on average 1.5654761904761905) internal successors, (263), 168 states have internal predecessors, (263), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:49,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 267 transitions. [2022-04-15 11:46:49,426 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 267 transitions. Word has length 64 [2022-04-15 11:46:49,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:46:49,427 INFO L478 AbstractCegarLoop]: Abstraction has 173 states and 267 transitions. [2022-04-15 11:46:49,427 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:49,427 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 173 states and 267 transitions. [2022-04-15 11:46:49,640 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 267 edges. 267 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:46:49,640 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 267 transitions. [2022-04-15 11:46:49,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-15 11:46:49,642 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:46:49,642 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:46:49,642 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 11:46:49,642 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:46:49,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:46:49,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1522986347, now seen corresponding path program 1 times [2022-04-15 11:46:49,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:46:49,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1189219619] [2022-04-15 11:46:49,670 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:46:49,670 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:46:49,670 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:46:49,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1522986347, now seen corresponding path program 2 times [2022-04-15 11:46:49,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:46:49,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940647467] [2022-04-15 11:46:49,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:46:49,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:46:49,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:46:49,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:46:49,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:46:49,821 INFO L290 TraceCheckUtils]: 0: Hoare triple {3258#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {3251#true} is VALID [2022-04-15 11:46:49,821 INFO L290 TraceCheckUtils]: 1: Hoare triple {3251#true} assume true; {3251#true} is VALID [2022-04-15 11:46:49,822 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3251#true} {3251#true} #708#return; {3251#true} is VALID [2022-04-15 11:46:49,823 INFO L272 TraceCheckUtils]: 0: Hoare triple {3251#true} call ULTIMATE.init(); {3258#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:46:49,823 INFO L290 TraceCheckUtils]: 1: Hoare triple {3258#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {3251#true} is VALID [2022-04-15 11:46:49,823 INFO L290 TraceCheckUtils]: 2: Hoare triple {3251#true} assume true; {3251#true} is VALID [2022-04-15 11:46:49,823 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3251#true} {3251#true} #708#return; {3251#true} is VALID [2022-04-15 11:46:49,823 INFO L272 TraceCheckUtils]: 4: Hoare triple {3251#true} call #t~ret161 := main(); {3251#true} is VALID [2022-04-15 11:46:49,824 INFO L290 TraceCheckUtils]: 5: Hoare triple {3251#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; {3251#true} is VALID [2022-04-15 11:46:49,824 INFO L290 TraceCheckUtils]: 6: Hoare triple {3251#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {3251#true} is VALID [2022-04-15 11:46:49,824 INFO L272 TraceCheckUtils]: 7: Hoare triple {3251#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {3251#true} is VALID [2022-04-15 11:46:49,826 INFO L290 TraceCheckUtils]: 8: Hoare triple {3251#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); {3256#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:49,827 INFO L290 TraceCheckUtils]: 9: Hoare triple {3256#(= 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; {3256#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:49,828 INFO L290 TraceCheckUtils]: 10: Hoare triple {3256#(= 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; {3256#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:49,828 INFO L290 TraceCheckUtils]: 11: Hoare triple {3256#(= 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)))); {3256#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:49,829 INFO L290 TraceCheckUtils]: 12: Hoare triple {3256#(= 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); {3256#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:49,829 INFO L290 TraceCheckUtils]: 13: Hoare triple {3256#(= 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; {3256#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:49,830 INFO L290 TraceCheckUtils]: 14: Hoare triple {3256#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {3256#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:49,830 INFO L290 TraceCheckUtils]: 15: Hoare triple {3256#(= 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); {3257#(= 8464 |ssl3_accept_#t~mem47|)} is VALID [2022-04-15 11:46:49,831 INFO L290 TraceCheckUtils]: 16: Hoare triple {3257#(= 8464 |ssl3_accept_#t~mem47|)} assume 12292 == #t~mem47;havoc #t~mem47; {3252#false} is VALID [2022-04-15 11:46:49,831 INFO L290 TraceCheckUtils]: 17: Hoare triple {3252#false} call write~int(1, ~s.base, 40 + ~s.offset, 4); {3252#false} is VALID [2022-04-15 11:46:49,831 INFO L290 TraceCheckUtils]: 18: Hoare triple {3252#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {3252#false} is VALID [2022-04-15 11:46:49,831 INFO L290 TraceCheckUtils]: 19: Hoare triple {3252#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {3252#false} is VALID [2022-04-15 11:46:49,831 INFO L290 TraceCheckUtils]: 20: Hoare triple {3252#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {3252#false} is VALID [2022-04-15 11:46:49,832 INFO L290 TraceCheckUtils]: 21: Hoare triple {3252#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); {3252#false} is VALID [2022-04-15 11:46:49,832 INFO L290 TraceCheckUtils]: 22: Hoare triple {3252#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {3252#false} is VALID [2022-04-15 11:46:49,832 INFO L290 TraceCheckUtils]: 23: Hoare triple {3252#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); {3252#false} is VALID [2022-04-15 11:46:49,832 INFO L290 TraceCheckUtils]: 24: Hoare triple {3252#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); {3252#false} is VALID [2022-04-15 11:46:49,832 INFO L290 TraceCheckUtils]: 25: Hoare triple {3252#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); {3252#false} is VALID [2022-04-15 11:46:49,832 INFO L290 TraceCheckUtils]: 26: Hoare triple {3252#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {3252#false} is VALID [2022-04-15 11:46:49,833 INFO L290 TraceCheckUtils]: 27: Hoare triple {3252#false} ~skip~0 := 0; {3252#false} is VALID [2022-04-15 11:46:49,833 INFO L290 TraceCheckUtils]: 28: Hoare triple {3252#false} assume !false; {3252#false} is VALID [2022-04-15 11:46:49,833 INFO L290 TraceCheckUtils]: 29: Hoare triple {3252#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); {3252#false} is VALID [2022-04-15 11:46:49,833 INFO L290 TraceCheckUtils]: 30: Hoare triple {3252#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-15 11:46:49,833 INFO L290 TraceCheckUtils]: 31: Hoare triple {3252#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-15 11:46:49,833 INFO L290 TraceCheckUtils]: 32: Hoare triple {3252#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-15 11:46:49,834 INFO L290 TraceCheckUtils]: 33: Hoare triple {3252#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-15 11:46:49,834 INFO L290 TraceCheckUtils]: 34: Hoare triple {3252#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-15 11:46:49,834 INFO L290 TraceCheckUtils]: 35: Hoare triple {3252#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-15 11:46:49,834 INFO L290 TraceCheckUtils]: 36: Hoare triple {3252#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-15 11:46:49,834 INFO L290 TraceCheckUtils]: 37: Hoare triple {3252#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-15 11:46:49,834 INFO L290 TraceCheckUtils]: 38: Hoare triple {3252#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-15 11:46:49,834 INFO L290 TraceCheckUtils]: 39: Hoare triple {3252#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-15 11:46:49,835 INFO L290 TraceCheckUtils]: 40: Hoare triple {3252#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-15 11:46:49,835 INFO L290 TraceCheckUtils]: 41: Hoare triple {3252#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-15 11:46:49,835 INFO L290 TraceCheckUtils]: 42: Hoare triple {3252#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-15 11:46:49,835 INFO L290 TraceCheckUtils]: 43: Hoare triple {3252#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-15 11:46:49,835 INFO L290 TraceCheckUtils]: 44: Hoare triple {3252#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-15 11:46:49,835 INFO L290 TraceCheckUtils]: 45: Hoare triple {3252#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-15 11:46:49,835 INFO L290 TraceCheckUtils]: 46: Hoare triple {3252#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-15 11:46:49,835 INFO L290 TraceCheckUtils]: 47: Hoare triple {3252#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-15 11:46:49,836 INFO L290 TraceCheckUtils]: 48: Hoare triple {3252#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-15 11:46:49,836 INFO L290 TraceCheckUtils]: 49: Hoare triple {3252#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-15 11:46:49,836 INFO L290 TraceCheckUtils]: 50: Hoare triple {3252#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-15 11:46:49,836 INFO L290 TraceCheckUtils]: 51: Hoare triple {3252#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-15 11:46:49,836 INFO L290 TraceCheckUtils]: 52: Hoare triple {3252#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-15 11:46:49,836 INFO L290 TraceCheckUtils]: 53: Hoare triple {3252#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-15 11:46:49,837 INFO L290 TraceCheckUtils]: 54: Hoare triple {3252#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-15 11:46:49,837 INFO L290 TraceCheckUtils]: 55: Hoare triple {3252#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-15 11:46:49,837 INFO L290 TraceCheckUtils]: 56: Hoare triple {3252#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-15 11:46:49,837 INFO L290 TraceCheckUtils]: 57: Hoare triple {3252#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-15 11:46:49,837 INFO L290 TraceCheckUtils]: 58: Hoare triple {3252#false} assume 8640 == #t~mem75;havoc #t~mem75; {3252#false} is VALID [2022-04-15 11:46:49,837 INFO L290 TraceCheckUtils]: 59: Hoare triple {3252#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {3252#false} is VALID [2022-04-15 11:46:49,837 INFO L290 TraceCheckUtils]: 60: Hoare triple {3252#false} assume !(4 == ~blastFlag~0); {3252#false} is VALID [2022-04-15 11:46:49,838 INFO L290 TraceCheckUtils]: 61: Hoare triple {3252#false} assume !(7 == ~blastFlag~0); {3252#false} is VALID [2022-04-15 11:46:49,838 INFO L290 TraceCheckUtils]: 62: Hoare triple {3252#false} assume !(10 == ~blastFlag~0); {3252#false} is VALID [2022-04-15 11:46:49,838 INFO L290 TraceCheckUtils]: 63: Hoare triple {3252#false} assume 13 == ~blastFlag~0; {3252#false} is VALID [2022-04-15 11:46:49,838 INFO L290 TraceCheckUtils]: 64: Hoare triple {3252#false} assume !false; {3252#false} is VALID [2022-04-15 11:46:49,838 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:46:49,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:46:49,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940647467] [2022-04-15 11:46:49,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940647467] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:46:49,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:46:49,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:46:49,839 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:46:49,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1189219619] [2022-04-15 11:46:49,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1189219619] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:46:49,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:46:49,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:46:49,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373706485] [2022-04-15 11:46:49,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:46:49,841 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-15 11:46:49,841 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:46:49,841 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-15 11:46:49,897 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-15 11:46:49,897 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:46:49,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:46:49,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:46:49,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:46:49,898 INFO L87 Difference]: Start difference. First operand 173 states and 267 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-15 11:46:53,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:53,049 INFO L93 Difference]: Finished difference Result 336 states and 517 transitions. [2022-04-15 11:46:53,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:46:53,049 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-15 11:46:53,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:46:53,050 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-15 11:46:53,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 465 transitions. [2022-04-15 11:46:53,055 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-15 11:46:53,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 465 transitions. [2022-04-15 11:46:53,060 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 465 transitions. [2022-04-15 11:46:53,365 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 465 edges. 465 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:46:53,372 INFO L225 Difference]: With dead ends: 336 [2022-04-15 11:46:53,372 INFO L226 Difference]: Without dead ends: 189 [2022-04-15 11:46:53,373 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-15 11:46:53,374 INFO L913 BasicCegarLoop]: 196 mSDtfsCounter, 28 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:46:53,375 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 509 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-15 11:46:53,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-04-15 11:46:53,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 173. [2022-04-15 11:46:53,384 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:46:53,385 INFO L82 GeneralOperation]: Start isEquivalent. First operand 189 states. Second operand has 173 states, 168 states have (on average 1.5595238095238095) internal successors, (262), 168 states have internal predecessors, (262), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:53,385 INFO L74 IsIncluded]: Start isIncluded. First operand 189 states. Second operand has 173 states, 168 states have (on average 1.5595238095238095) internal successors, (262), 168 states have internal predecessors, (262), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:53,386 INFO L87 Difference]: Start difference. First operand 189 states. Second operand has 173 states, 168 states have (on average 1.5595238095238095) internal successors, (262), 168 states have internal predecessors, (262), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:53,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:53,398 INFO L93 Difference]: Finished difference Result 189 states and 286 transitions. [2022-04-15 11:46:53,398 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 286 transitions. [2022-04-15 11:46:53,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:46:53,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:46:53,399 INFO L74 IsIncluded]: Start isIncluded. First operand has 173 states, 168 states have (on average 1.5595238095238095) internal successors, (262), 168 states have internal predecessors, (262), 3 states have call successors, (3), 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 189 states. [2022-04-15 11:46:53,400 INFO L87 Difference]: Start difference. First operand has 173 states, 168 states have (on average 1.5595238095238095) internal successors, (262), 168 states have internal predecessors, (262), 3 states have call successors, (3), 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 189 states. [2022-04-15 11:46:53,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:53,409 INFO L93 Difference]: Finished difference Result 189 states and 286 transitions. [2022-04-15 11:46:53,409 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 286 transitions. [2022-04-15 11:46:53,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:46:53,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:46:53,409 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:46:53,409 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:46:53,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 168 states have (on average 1.5595238095238095) internal successors, (262), 168 states have internal predecessors, (262), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:53,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 266 transitions. [2022-04-15 11:46:53,418 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 266 transitions. Word has length 65 [2022-04-15 11:46:53,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:46:53,419 INFO L478 AbstractCegarLoop]: Abstraction has 173 states and 266 transitions. [2022-04-15 11:46:53,419 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-15 11:46:53,419 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 173 states and 266 transitions. [2022-04-15 11:46:53,605 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 266 edges. 266 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:46:53,605 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 266 transitions. [2022-04-15 11:46:53,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-15 11:46:53,606 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:46:53,606 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:46:53,606 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 11:46:53,607 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:46:53,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:46:53,607 INFO L85 PathProgramCache]: Analyzing trace with hash -112549033, now seen corresponding path program 1 times [2022-04-15 11:46:53,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:46:53,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1743496941] [2022-04-15 11:46:53,780 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-15 11:46:53,783 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 11:46:53,784 INFO L85 PathProgramCache]: Analyzing trace with hash 14964021, now seen corresponding path program 1 times [2022-04-15 11:46:53,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:46:53,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064737447] [2022-04-15 11:46:53,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:46:53,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:46:53,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:46:53,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:46:53,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:46:53,964 INFO L290 TraceCheckUtils]: 0: Hoare triple {4665#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {4659#true} is VALID [2022-04-15 11:46:53,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {4659#true} assume true; {4659#true} is VALID [2022-04-15 11:46:53,965 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4659#true} {4659#true} #708#return; {4659#true} is VALID [2022-04-15 11:46:53,966 INFO L272 TraceCheckUtils]: 0: Hoare triple {4659#true} call ULTIMATE.init(); {4665#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:46:53,966 INFO L290 TraceCheckUtils]: 1: Hoare triple {4665#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {4659#true} is VALID [2022-04-15 11:46:53,966 INFO L290 TraceCheckUtils]: 2: Hoare triple {4659#true} assume true; {4659#true} is VALID [2022-04-15 11:46:53,966 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4659#true} {4659#true} #708#return; {4659#true} is VALID [2022-04-15 11:46:53,966 INFO L272 TraceCheckUtils]: 4: Hoare triple {4659#true} call #t~ret161 := main(); {4659#true} is VALID [2022-04-15 11:46:53,966 INFO L290 TraceCheckUtils]: 5: Hoare triple {4659#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; {4659#true} is VALID [2022-04-15 11:46:53,966 INFO L290 TraceCheckUtils]: 6: Hoare triple {4659#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {4659#true} is VALID [2022-04-15 11:46:53,967 INFO L272 TraceCheckUtils]: 7: Hoare triple {4659#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {4659#true} is VALID [2022-04-15 11:46:53,967 INFO L290 TraceCheckUtils]: 8: Hoare triple {4659#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); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:53,967 INFO L290 TraceCheckUtils]: 9: Hoare triple {4664#(= 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; {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:53,968 INFO L290 TraceCheckUtils]: 10: Hoare triple {4664#(= 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; {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:53,968 INFO L290 TraceCheckUtils]: 11: Hoare triple {4664#(= 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)))); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:53,968 INFO L290 TraceCheckUtils]: 12: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:53,969 INFO L290 TraceCheckUtils]: 13: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:53,969 INFO L290 TraceCheckUtils]: 14: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} [714] L1167-2-->L1168_primed: Formula: (let ((.cse0 (= |v_ssl3_accept_#t~mem85_10| |v_ssl3_accept_#t~mem85_8|)) (.cse1 (= v_ssl3_accept_~skip~0_16 v_ssl3_accept_~skip~0_15)) (.cse2 (= |v_ssl3_accept_#t~mem47_12| |v_ssl3_accept_#t~mem47_10|)) (.cse3 (= |v_ssl3_accept_#t~mem150.base_10| |v_ssl3_accept_#t~mem150.base_8|)) (.cse4 (= v_ssl3_accept_~state~0_8 v_ssl3_accept_~state~0_7)) (.cse5 (= |v_ssl3_accept_#t~mem88.base_5| |v_ssl3_accept_#t~mem88.base_4|)) (.cse6 (= |v_ssl3_accept_#t~mem48_10| |v_ssl3_accept_#t~mem48_8|)) (.cse7 (= |v_ssl3_accept_#t~mem88.offset_5| |v_ssl3_accept_#t~mem88.offset_4|)) (.cse8 (= |v_ssl3_accept_#t~mem46_6| |v_ssl3_accept_#t~mem46_5|)) (.cse9 (= |v_ssl3_accept_#t~mem151_12| |v_ssl3_accept_#t~mem151_10|)) (.cse10 (= |v_ssl3_accept_#t~mem89_5| |v_ssl3_accept_#t~mem89_4|)) (.cse11 (= |v_ssl3_accept_#t~mem82_10| |v_ssl3_accept_#t~mem82_8|))) (or (and (= |v_#memory_$Pointer$.offset_250| |v_#memory_$Pointer$.offset_256|) .cse0 (= |v_ssl3_accept_#t~mem83.offset_8| |v_ssl3_accept_#t~mem83.offset_10|) .cse1 .cse2 .cse3 .cse4 (= |v_ssl3_accept_#t~mem150.offset_8| |v_ssl3_accept_#t~mem150.offset_10|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= |v_#memory_int_251| |v_#memory_int_256|) (= |v_#memory_$Pointer$.base_250| |v_#memory_$Pointer$.base_256|) (= |v_ssl3_accept_#t~mem83.base_8| |v_ssl3_accept_#t~mem83.base_10|)) (and (= |v_#memory_int_256| |v_#memory_int_251|) .cse0 .cse1 (= |v_#memory_$Pointer$.offset_256| |v_#memory_$Pointer$.offset_250|) .cse2 (= |v_#memory_$Pointer$.base_256| |v_#memory_$Pointer$.base_250|) .cse3 .cse4 (= |v_ssl3_accept_#t~mem150.offset_10| |v_ssl3_accept_#t~mem150.offset_8|) (= |v_ssl3_accept_#t~mem83.base_10| |v_ssl3_accept_#t~mem83.base_8|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= |v_ssl3_accept_#t~mem83.offset_10| |v_ssl3_accept_#t~mem83.offset_8|)))) InVars {ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_10|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_256|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_10|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_10|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_12|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_10|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_5|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_10|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_10|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_10|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_12|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_6|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_16, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_5|, #memory_int=|v_#memory_int_256|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_5|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_256|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_8} OutVars{ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_8|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_250|, 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_10|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_8|, 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_8|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_8|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_10|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_5|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_15, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_4|, #memory_int=|v_#memory_int_251|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_4|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_250|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_7} 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] {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:53,970 INFO L290 TraceCheckUtils]: 15: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} [713] L1168_primed-->L1168: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:53,970 INFO L290 TraceCheckUtils]: 16: Hoare triple {4664#(= 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); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:53,970 INFO L290 TraceCheckUtils]: 17: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:53,971 INFO L290 TraceCheckUtils]: 18: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:53,971 INFO L290 TraceCheckUtils]: 19: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:53,972 INFO L290 TraceCheckUtils]: 20: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:53,972 INFO L290 TraceCheckUtils]: 21: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:53,972 INFO L290 TraceCheckUtils]: 22: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:53,973 INFO L290 TraceCheckUtils]: 23: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:53,973 INFO L290 TraceCheckUtils]: 24: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:53,973 INFO L290 TraceCheckUtils]: 25: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:53,974 INFO L290 TraceCheckUtils]: 26: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:53,974 INFO L290 TraceCheckUtils]: 27: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:53,974 INFO L290 TraceCheckUtils]: 28: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:53,975 INFO L290 TraceCheckUtils]: 29: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:53,975 INFO L290 TraceCheckUtils]: 30: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:53,975 INFO L290 TraceCheckUtils]: 31: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:53,976 INFO L290 TraceCheckUtils]: 32: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:53,976 INFO L290 TraceCheckUtils]: 33: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:53,977 INFO L290 TraceCheckUtils]: 34: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:53,977 INFO L290 TraceCheckUtils]: 35: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:53,977 INFO L290 TraceCheckUtils]: 36: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:53,978 INFO L290 TraceCheckUtils]: 37: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:53,978 INFO L290 TraceCheckUtils]: 38: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:53,978 INFO L290 TraceCheckUtils]: 39: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:53,979 INFO L290 TraceCheckUtils]: 40: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:53,979 INFO L290 TraceCheckUtils]: 41: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:53,979 INFO L290 TraceCheckUtils]: 42: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:53,980 INFO L290 TraceCheckUtils]: 43: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:53,980 INFO L290 TraceCheckUtils]: 44: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:53,980 INFO L290 TraceCheckUtils]: 45: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume 8640 == #t~mem75;havoc #t~mem75; {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:53,981 INFO L290 TraceCheckUtils]: 46: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:53,981 INFO L290 TraceCheckUtils]: 47: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(4 == ~blastFlag~0); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:53,981 INFO L290 TraceCheckUtils]: 48: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(7 == ~blastFlag~0); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:53,982 INFO L290 TraceCheckUtils]: 49: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(10 == ~blastFlag~0); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:53,982 INFO L290 TraceCheckUtils]: 50: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume 13 == ~blastFlag~0; {4660#false} is VALID [2022-04-15 11:46:53,982 INFO L290 TraceCheckUtils]: 51: Hoare triple {4660#false} assume !false; {4660#false} is VALID [2022-04-15 11:46:53,983 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-15 11:46:53,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:46:53,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064737447] [2022-04-15 11:46:53,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064737447] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:46:53,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:46:53,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:46:57,859 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:46:57,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1743496941] [2022-04-15 11:46:57,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1743496941] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:46:57,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:46:57,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 11:46:57,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305127758] [2022-04-15 11:46:57,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:46:57,860 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-15 11:46:57,860 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:46:57,861 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 12 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-15 11:46:57,936 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-15 11:46:57,937 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 11:46:57,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:46:57,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 11:46:57,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=107, Unknown=1, NotChecked=0, Total=156 [2022-04-15 11:46:57,938 INFO L87 Difference]: Start difference. First operand 173 states and 266 transitions. Second operand has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 12 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-15 11:47:00,161 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:47:02,193 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-15 11:47:05,438 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:47:12,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:12,240 INFO L93 Difference]: Finished difference Result 465 states and 726 transitions. [2022-04-15 11:47:12,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 11:47:12,241 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-15 11:47:12,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:47:12,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 12 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-15 11:47:12,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 631 transitions. [2022-04-15 11:47:12,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 12 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-15 11:47:12,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 631 transitions. [2022-04-15 11:47:12,251 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 631 transitions. [2022-04-15 11:47:12,737 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 631 edges. 631 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:47:12,744 INFO L225 Difference]: With dead ends: 465 [2022-04-15 11:47:12,745 INFO L226 Difference]: Without dead ends: 318 [2022-04-15 11:47:12,746 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=48, Invalid=107, Unknown=1, NotChecked=0, Total=156 [2022-04-15 11:47:12,746 INFO L913 BasicCegarLoop]: 348 mSDtfsCounter, 148 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 1062 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 1094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1062 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 14 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:47:12,747 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 992 Invalid, 1094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1062 Invalid, 0 Unknown, 14 Unchecked, 7.1s Time] [2022-04-15 11:47:12,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2022-04-15 11:47:12,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 313. [2022-04-15 11:47:12,765 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:47:12,766 INFO L82 GeneralOperation]: Start isEquivalent. First operand 318 states. Second operand has 313 states, 308 states have (on average 1.5292207792207793) internal successors, (471), 308 states have internal predecessors, (471), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:12,767 INFO L74 IsIncluded]: Start isIncluded. First operand 318 states. Second operand has 313 states, 308 states have (on average 1.5292207792207793) internal successors, (471), 308 states have internal predecessors, (471), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:12,768 INFO L87 Difference]: Start difference. First operand 318 states. Second operand has 313 states, 308 states have (on average 1.5292207792207793) internal successors, (471), 308 states have internal predecessors, (471), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:12,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:12,775 INFO L93 Difference]: Finished difference Result 318 states and 481 transitions. [2022-04-15 11:47:12,775 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 481 transitions. [2022-04-15 11:47:12,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:47:12,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:47:12,777 INFO L74 IsIncluded]: Start isIncluded. First operand has 313 states, 308 states have (on average 1.5292207792207793) internal successors, (471), 308 states have internal predecessors, (471), 3 states have call successors, (3), 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 318 states. [2022-04-15 11:47:12,778 INFO L87 Difference]: Start difference. First operand has 313 states, 308 states have (on average 1.5292207792207793) internal successors, (471), 308 states have internal predecessors, (471), 3 states have call successors, (3), 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 318 states. [2022-04-15 11:47:12,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:12,786 INFO L93 Difference]: Finished difference Result 318 states and 481 transitions. [2022-04-15 11:47:12,786 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 481 transitions. [2022-04-15 11:47:12,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:47:12,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:47:12,787 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:47:12,787 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:47:12,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 308 states have (on average 1.5292207792207793) internal successors, (471), 308 states have internal predecessors, (471), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:12,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 475 transitions. [2022-04-15 11:47:12,796 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 475 transitions. Word has length 65 [2022-04-15 11:47:12,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:47:12,797 INFO L478 AbstractCegarLoop]: Abstraction has 313 states and 475 transitions. [2022-04-15 11:47:12,797 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 12 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-15 11:47:12,797 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 313 states and 475 transitions. [2022-04-15 11:47:13,146 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 475 edges. 475 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:47:13,146 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 475 transitions. [2022-04-15 11:47:13,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-15 11:47:13,147 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:47:13,147 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:47:13,148 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 11:47:13,148 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:47:13,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:47:13,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1815723669, now seen corresponding path program 1 times [2022-04-15 11:47:13,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:47:13,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [113854259] [2022-04-15 11:47:13,313 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-15 11:47:13,314 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 11:47:13,314 INFO L85 PathProgramCache]: Analyzing trace with hash -354863755, now seen corresponding path program 1 times [2022-04-15 11:47:13,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:47:13,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812551094] [2022-04-15 11:47:13,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:47:13,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:47:13,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:47:13,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:47:13,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:47:13,449 INFO L290 TraceCheckUtils]: 0: Hoare triple {6875#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {6869#true} is VALID [2022-04-15 11:47:13,450 INFO L290 TraceCheckUtils]: 1: Hoare triple {6869#true} assume true; {6869#true} is VALID [2022-04-15 11:47:13,453 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6869#true} {6869#true} #708#return; {6869#true} is VALID [2022-04-15 11:47:13,455 INFO L272 TraceCheckUtils]: 0: Hoare triple {6869#true} call ULTIMATE.init(); {6875#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:47:13,462 INFO L290 TraceCheckUtils]: 1: Hoare triple {6875#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {6869#true} is VALID [2022-04-15 11:47:13,462 INFO L290 TraceCheckUtils]: 2: Hoare triple {6869#true} assume true; {6869#true} is VALID [2022-04-15 11:47:13,462 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6869#true} {6869#true} #708#return; {6869#true} is VALID [2022-04-15 11:47:13,462 INFO L272 TraceCheckUtils]: 4: Hoare triple {6869#true} call #t~ret161 := main(); {6869#true} is VALID [2022-04-15 11:47:13,462 INFO L290 TraceCheckUtils]: 5: Hoare triple {6869#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; {6869#true} is VALID [2022-04-15 11:47:13,463 INFO L290 TraceCheckUtils]: 6: Hoare triple {6869#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {6869#true} is VALID [2022-04-15 11:47:13,463 INFO L272 TraceCheckUtils]: 7: Hoare triple {6869#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {6869#true} is VALID [2022-04-15 11:47:13,464 INFO L290 TraceCheckUtils]: 8: Hoare triple {6869#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); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:13,465 INFO L290 TraceCheckUtils]: 9: Hoare triple {6874#(= 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; {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:13,465 INFO L290 TraceCheckUtils]: 10: Hoare triple {6874#(= 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; {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:13,465 INFO L290 TraceCheckUtils]: 11: Hoare triple {6874#(= 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)))); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:13,466 INFO L290 TraceCheckUtils]: 12: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:13,466 INFO L290 TraceCheckUtils]: 13: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:13,467 INFO L290 TraceCheckUtils]: 14: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} [716] L1167-2-->L1168_primed: Formula: (let ((.cse0 (= |v_ssl3_accept_#t~mem88.offset_10| |v_ssl3_accept_#t~mem88.offset_9|)) (.cse1 (= |v_ssl3_accept_#t~mem150.offset_16| |v_ssl3_accept_#t~mem150.offset_14|)) (.cse2 (= v_ssl3_accept_~skip~0_21 v_ssl3_accept_~skip~0_20)) (.cse3 (= |v_ssl3_accept_#t~mem82_17| |v_ssl3_accept_#t~mem82_15|)) (.cse4 (= |v_ssl3_accept_#t~mem151_18| |v_ssl3_accept_#t~mem151_16|)) (.cse5 (= |v_ssl3_accept_#t~mem47_19| |v_ssl3_accept_#t~mem47_17|)) (.cse6 (= |v_ssl3_accept_#t~mem83.offset_17| |v_ssl3_accept_#t~mem83.offset_15|)) (.cse7 (= |v_ssl3_accept_#t~mem85_17| |v_ssl3_accept_#t~mem85_15|)) (.cse8 (= v_ssl3_accept_~state~0_13 v_ssl3_accept_~state~0_12)) (.cse9 (= |v_ssl3_accept_#t~mem89_10| |v_ssl3_accept_#t~mem89_9|)) (.cse10 (= |v_ssl3_accept_#t~mem150.base_16| |v_ssl3_accept_#t~mem150.base_14|)) (.cse11 (= |v_ssl3_accept_#t~mem46_11| |v_ssl3_accept_#t~mem46_10|))) (or (and .cse0 (= |v_ssl3_accept_#t~mem88.base_9| |v_ssl3_accept_#t~mem88.base_10|) .cse1 .cse2 .cse3 .cse4 (= |v_#memory_$Pointer$.base_270| |v_#memory_$Pointer$.base_276|) .cse5 (= |v_#memory_int_270| |v_#memory_int_275|) .cse6 .cse7 (= |v_#memory_$Pointer$.offset_270| |v_#memory_$Pointer$.offset_276|) .cse8 .cse9 .cse10 (= |v_ssl3_accept_#t~mem48_15| |v_ssl3_accept_#t~mem48_17|) .cse11 (= |v_ssl3_accept_#t~mem83.base_15| |v_ssl3_accept_#t~mem83.base_17|)) (and .cse0 .cse1 (= |v_#memory_$Pointer$.base_276| |v_#memory_$Pointer$.base_270|) .cse2 .cse3 (= |v_ssl3_accept_#t~mem83.base_17| |v_ssl3_accept_#t~mem83.base_15|) .cse4 (= |v_ssl3_accept_#t~mem48_17| |v_ssl3_accept_#t~mem48_15|) .cse5 .cse6 .cse7 (= |v_#memory_int_275| |v_#memory_int_270|) .cse8 (= |v_ssl3_accept_#t~mem88.base_10| |v_ssl3_accept_#t~mem88.base_9|) .cse9 .cse10 .cse11 (= |v_#memory_$Pointer$.offset_276| |v_#memory_$Pointer$.offset_270|)))) InVars {ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_17|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_276|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_17|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_17|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_18|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_16|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_10|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_17|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_17|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_16|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_19|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_11|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_21, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_10|, #memory_int=|v_#memory_int_275|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_10|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_276|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_13} OutVars{ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_15|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_270|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_15|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_15|, 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_9|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_15|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_15|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_14|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_17|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_10|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_20, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_9|, #memory_int=|v_#memory_int_270|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_9|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_270|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_12} 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] {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:13,467 INFO L290 TraceCheckUtils]: 15: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} [715] L1168_primed-->L1168: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:13,469 INFO L290 TraceCheckUtils]: 16: Hoare triple {6874#(= 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); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:13,469 INFO L290 TraceCheckUtils]: 17: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:13,469 INFO L290 TraceCheckUtils]: 18: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:13,470 INFO L290 TraceCheckUtils]: 19: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:13,470 INFO L290 TraceCheckUtils]: 20: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:13,470 INFO L290 TraceCheckUtils]: 21: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:13,471 INFO L290 TraceCheckUtils]: 22: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:13,471 INFO L290 TraceCheckUtils]: 23: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:13,471 INFO L290 TraceCheckUtils]: 24: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:13,472 INFO L290 TraceCheckUtils]: 25: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:13,472 INFO L290 TraceCheckUtils]: 26: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:13,472 INFO L290 TraceCheckUtils]: 27: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:13,473 INFO L290 TraceCheckUtils]: 28: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:13,473 INFO L290 TraceCheckUtils]: 29: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:13,473 INFO L290 TraceCheckUtils]: 30: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:13,474 INFO L290 TraceCheckUtils]: 31: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:13,474 INFO L290 TraceCheckUtils]: 32: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:13,474 INFO L290 TraceCheckUtils]: 33: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:13,475 INFO L290 TraceCheckUtils]: 34: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:13,475 INFO L290 TraceCheckUtils]: 35: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:13,476 INFO L290 TraceCheckUtils]: 36: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:13,476 INFO L290 TraceCheckUtils]: 37: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:13,476 INFO L290 TraceCheckUtils]: 38: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:13,477 INFO L290 TraceCheckUtils]: 39: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:13,477 INFO L290 TraceCheckUtils]: 40: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:13,477 INFO L290 TraceCheckUtils]: 41: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:13,478 INFO L290 TraceCheckUtils]: 42: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:13,478 INFO L290 TraceCheckUtils]: 43: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:13,478 INFO L290 TraceCheckUtils]: 44: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:13,479 INFO L290 TraceCheckUtils]: 45: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume 8640 == #t~mem75;havoc #t~mem75; {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:13,479 INFO L290 TraceCheckUtils]: 46: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:13,479 INFO L290 TraceCheckUtils]: 47: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(4 == ~blastFlag~0); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:13,480 INFO L290 TraceCheckUtils]: 48: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(7 == ~blastFlag~0); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:13,480 INFO L290 TraceCheckUtils]: 49: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(10 == ~blastFlag~0); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:13,480 INFO L290 TraceCheckUtils]: 50: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume 13 == ~blastFlag~0; {6870#false} is VALID [2022-04-15 11:47:13,480 INFO L290 TraceCheckUtils]: 51: Hoare triple {6870#false} assume !false; {6870#false} is VALID [2022-04-15 11:47:13,482 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-15 11:47:13,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:47:13,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812551094] [2022-04-15 11:47:13,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812551094] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:47:13,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:47:13,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:47:16,761 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:47:16,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [113854259] [2022-04-15 11:47:16,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [113854259] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:47:16,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:47:16,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 11:47:16,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990907835] [2022-04-15 11:47:16,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:47:16,762 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-15 11:47:16,762 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:47:16,763 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 12 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-15 11:47:16,827 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-15 11:47:16,828 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 11:47:16,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:47:16,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 11:47:16,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=107, Unknown=1, NotChecked=0, Total=156 [2022-04-15 11:47:16,829 INFO L87 Difference]: Start difference. First operand 313 states and 475 transitions. Second operand has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 12 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-15 11:47:19,713 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:47:22,909 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:47:26,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:26,706 INFO L93 Difference]: Finished difference Result 469 states and 717 transitions. [2022-04-15 11:47:26,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 11:47:26,706 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-15 11:47:26,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:47:26,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 12 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-15 11:47:26,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 617 transitions. [2022-04-15 11:47:26,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 12 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-15 11:47:26,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 617 transitions. [2022-04-15 11:47:26,714 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 617 transitions. [2022-04-15 11:47:27,217 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 617 edges. 617 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:47:27,224 INFO L225 Difference]: With dead ends: 469 [2022-04-15 11:47:27,224 INFO L226 Difference]: Without dead ends: 322 [2022-04-15 11:47:27,225 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=48, Invalid=107, Unknown=1, NotChecked=0, Total=156 [2022-04-15 11:47:27,226 INFO L913 BasicCegarLoop]: 211 mSDtfsCounter, 146 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 1099 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 463 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:47:27,226 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 926 Invalid, 1099 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 630 Invalid, 0 Unknown, 463 Unchecked, 5.2s Time] [2022-04-15 11:47:27,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2022-04-15 11:47:27,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 313. [2022-04-15 11:47:27,242 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:47:27,243 INFO L82 GeneralOperation]: Start isEquivalent. First operand 322 states. Second operand has 313 states, 308 states have (on average 1.5292207792207793) internal successors, (471), 308 states have internal predecessors, (471), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:27,244 INFO L74 IsIncluded]: Start isIncluded. First operand 322 states. Second operand has 313 states, 308 states have (on average 1.5292207792207793) internal successors, (471), 308 states have internal predecessors, (471), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:27,244 INFO L87 Difference]: Start difference. First operand 322 states. Second operand has 313 states, 308 states have (on average 1.5292207792207793) internal successors, (471), 308 states have internal predecessors, (471), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:27,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:27,252 INFO L93 Difference]: Finished difference Result 322 states and 486 transitions. [2022-04-15 11:47:27,252 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 486 transitions. [2022-04-15 11:47:27,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:47:27,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:47:27,253 INFO L74 IsIncluded]: Start isIncluded. First operand has 313 states, 308 states have (on average 1.5292207792207793) internal successors, (471), 308 states have internal predecessors, (471), 3 states have call successors, (3), 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 322 states. [2022-04-15 11:47:27,254 INFO L87 Difference]: Start difference. First operand has 313 states, 308 states have (on average 1.5292207792207793) internal successors, (471), 308 states have internal predecessors, (471), 3 states have call successors, (3), 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 322 states. [2022-04-15 11:47:27,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:27,261 INFO L93 Difference]: Finished difference Result 322 states and 486 transitions. [2022-04-15 11:47:27,261 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 486 transitions. [2022-04-15 11:47:27,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:47:27,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:47:27,262 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:47:27,262 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:47:27,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 308 states have (on average 1.5292207792207793) internal successors, (471), 308 states have internal predecessors, (471), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:27,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 475 transitions. [2022-04-15 11:47:27,271 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 475 transitions. Word has length 65 [2022-04-15 11:47:27,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:47:27,272 INFO L478 AbstractCegarLoop]: Abstraction has 313 states and 475 transitions. [2022-04-15 11:47:27,272 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 12 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-15 11:47:27,272 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 313 states and 475 transitions. [2022-04-15 11:47:27,639 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 475 edges. 475 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:47:27,640 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 475 transitions. [2022-04-15 11:47:27,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-15 11:47:27,641 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:47:27,641 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:47:27,641 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 11:47:27,641 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:47:27,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:47:27,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1939266114, now seen corresponding path program 1 times [2022-04-15 11:47:27,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:47:27,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [549930860] [2022-04-15 11:47:27,669 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:47:27,669 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:47:27,669 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:47:27,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1939266114, now seen corresponding path program 2 times [2022-04-15 11:47:27,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:47:27,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726765211] [2022-04-15 11:47:27,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:47:27,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:47:27,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:47:27,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:47:27,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:47:27,835 INFO L290 TraceCheckUtils]: 0: Hoare triple {9102#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {9095#true} is VALID [2022-04-15 11:47:27,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {9095#true} assume true; {9095#true} is VALID [2022-04-15 11:47:27,835 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9095#true} {9095#true} #708#return; {9095#true} is VALID [2022-04-15 11:47:27,836 INFO L272 TraceCheckUtils]: 0: Hoare triple {9095#true} call ULTIMATE.init(); {9102#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:47:27,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {9102#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {9095#true} is VALID [2022-04-15 11:47:27,837 INFO L290 TraceCheckUtils]: 2: Hoare triple {9095#true} assume true; {9095#true} is VALID [2022-04-15 11:47:27,837 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9095#true} {9095#true} #708#return; {9095#true} is VALID [2022-04-15 11:47:27,837 INFO L272 TraceCheckUtils]: 4: Hoare triple {9095#true} call #t~ret161 := main(); {9095#true} is VALID [2022-04-15 11:47:27,837 INFO L290 TraceCheckUtils]: 5: Hoare triple {9095#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; {9095#true} is VALID [2022-04-15 11:47:27,837 INFO L290 TraceCheckUtils]: 6: Hoare triple {9095#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {9095#true} is VALID [2022-04-15 11:47:27,837 INFO L272 TraceCheckUtils]: 7: Hoare triple {9095#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {9095#true} is VALID [2022-04-15 11:47:27,840 INFO L290 TraceCheckUtils]: 8: Hoare triple {9095#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); {9100#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:27,840 INFO L290 TraceCheckUtils]: 9: Hoare triple {9100#(not (= 16384 (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; {9100#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:27,841 INFO L290 TraceCheckUtils]: 10: Hoare triple {9100#(not (= 16384 (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; {9100#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:27,841 INFO L290 TraceCheckUtils]: 11: Hoare triple {9100#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {9100#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:27,842 INFO L290 TraceCheckUtils]: 12: Hoare triple {9100#(not (= 16384 (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); {9100#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:27,842 INFO L290 TraceCheckUtils]: 13: Hoare triple {9100#(not (= 16384 (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; {9100#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:27,843 INFO L290 TraceCheckUtils]: 14: Hoare triple {9100#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {9100#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:27,843 INFO L290 TraceCheckUtils]: 15: Hoare triple {9100#(not (= 16384 (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); {9100#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:27,844 INFO L290 TraceCheckUtils]: 16: Hoare triple {9100#(not (= 16384 (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); {9101#(not (= |ssl3_accept_#t~mem48| 16384))} is VALID [2022-04-15 11:47:27,844 INFO L290 TraceCheckUtils]: 17: Hoare triple {9101#(not (= |ssl3_accept_#t~mem48| 16384))} assume 16384 == #t~mem48;havoc #t~mem48; {9096#false} is VALID [2022-04-15 11:47:27,844 INFO L290 TraceCheckUtils]: 18: Hoare triple {9096#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {9096#false} is VALID [2022-04-15 11:47:27,844 INFO L290 TraceCheckUtils]: 19: Hoare triple {9096#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {9096#false} is VALID [2022-04-15 11:47:27,844 INFO L290 TraceCheckUtils]: 20: Hoare triple {9096#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {9096#false} is VALID [2022-04-15 11:47:27,844 INFO L290 TraceCheckUtils]: 21: Hoare triple {9096#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); {9096#false} is VALID [2022-04-15 11:47:27,845 INFO L290 TraceCheckUtils]: 22: Hoare triple {9096#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {9096#false} is VALID [2022-04-15 11:47:27,845 INFO L290 TraceCheckUtils]: 23: Hoare triple {9096#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); {9096#false} is VALID [2022-04-15 11:47:27,845 INFO L290 TraceCheckUtils]: 24: Hoare triple {9096#false} assume 12292 != #t~mem85;havoc #t~mem85; {9096#false} is VALID [2022-04-15 11:47:27,845 INFO L290 TraceCheckUtils]: 25: Hoare triple {9096#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; {9096#false} is VALID [2022-04-15 11:47:27,845 INFO L290 TraceCheckUtils]: 26: Hoare triple {9096#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); {9096#false} is VALID [2022-04-15 11:47:27,845 INFO L290 TraceCheckUtils]: 27: Hoare triple {9096#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {9096#false} is VALID [2022-04-15 11:47:27,845 INFO L290 TraceCheckUtils]: 28: Hoare triple {9096#false} ~skip~0 := 0; {9096#false} is VALID [2022-04-15 11:47:27,846 INFO L290 TraceCheckUtils]: 29: Hoare triple {9096#false} assume !false; {9096#false} is VALID [2022-04-15 11:47:27,846 INFO L290 TraceCheckUtils]: 30: Hoare triple {9096#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); {9096#false} is VALID [2022-04-15 11:47:27,846 INFO L290 TraceCheckUtils]: 31: Hoare triple {9096#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-15 11:47:27,846 INFO L290 TraceCheckUtils]: 32: Hoare triple {9096#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-15 11:47:27,846 INFO L290 TraceCheckUtils]: 33: Hoare triple {9096#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-15 11:47:27,846 INFO L290 TraceCheckUtils]: 34: Hoare triple {9096#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-15 11:47:27,846 INFO L290 TraceCheckUtils]: 35: Hoare triple {9096#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-15 11:47:27,847 INFO L290 TraceCheckUtils]: 36: Hoare triple {9096#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-15 11:47:27,847 INFO L290 TraceCheckUtils]: 37: Hoare triple {9096#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-15 11:47:27,847 INFO L290 TraceCheckUtils]: 38: Hoare triple {9096#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-15 11:47:27,847 INFO L290 TraceCheckUtils]: 39: Hoare triple {9096#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-15 11:47:27,847 INFO L290 TraceCheckUtils]: 40: Hoare triple {9096#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-15 11:47:27,847 INFO L290 TraceCheckUtils]: 41: Hoare triple {9096#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-15 11:47:27,865 INFO L290 TraceCheckUtils]: 42: Hoare triple {9096#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-15 11:47:27,866 INFO L290 TraceCheckUtils]: 43: Hoare triple {9096#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-15 11:47:27,866 INFO L290 TraceCheckUtils]: 44: Hoare triple {9096#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-15 11:47:27,866 INFO L290 TraceCheckUtils]: 45: Hoare triple {9096#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-15 11:47:27,866 INFO L290 TraceCheckUtils]: 46: Hoare triple {9096#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-15 11:47:27,866 INFO L290 TraceCheckUtils]: 47: Hoare triple {9096#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-15 11:47:27,866 INFO L290 TraceCheckUtils]: 48: Hoare triple {9096#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-15 11:47:27,866 INFO L290 TraceCheckUtils]: 49: Hoare triple {9096#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-15 11:47:27,867 INFO L290 TraceCheckUtils]: 50: Hoare triple {9096#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-15 11:47:27,867 INFO L290 TraceCheckUtils]: 51: Hoare triple {9096#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-15 11:47:27,867 INFO L290 TraceCheckUtils]: 52: Hoare triple {9096#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-15 11:47:27,867 INFO L290 TraceCheckUtils]: 53: Hoare triple {9096#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-15 11:47:27,867 INFO L290 TraceCheckUtils]: 54: Hoare triple {9096#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-15 11:47:27,867 INFO L290 TraceCheckUtils]: 55: Hoare triple {9096#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-15 11:47:27,867 INFO L290 TraceCheckUtils]: 56: Hoare triple {9096#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-15 11:47:27,867 INFO L290 TraceCheckUtils]: 57: Hoare triple {9096#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-15 11:47:27,867 INFO L290 TraceCheckUtils]: 58: Hoare triple {9096#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-15 11:47:27,868 INFO L290 TraceCheckUtils]: 59: Hoare triple {9096#false} assume 8640 == #t~mem75;havoc #t~mem75; {9096#false} is VALID [2022-04-15 11:47:27,868 INFO L290 TraceCheckUtils]: 60: Hoare triple {9096#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {9096#false} is VALID [2022-04-15 11:47:27,868 INFO L290 TraceCheckUtils]: 61: Hoare triple {9096#false} assume !(4 == ~blastFlag~0); {9096#false} is VALID [2022-04-15 11:47:27,868 INFO L290 TraceCheckUtils]: 62: Hoare triple {9096#false} assume !(7 == ~blastFlag~0); {9096#false} is VALID [2022-04-15 11:47:27,868 INFO L290 TraceCheckUtils]: 63: Hoare triple {9096#false} assume !(10 == ~blastFlag~0); {9096#false} is VALID [2022-04-15 11:47:27,868 INFO L290 TraceCheckUtils]: 64: Hoare triple {9096#false} assume 13 == ~blastFlag~0; {9096#false} is VALID [2022-04-15 11:47:27,869 INFO L290 TraceCheckUtils]: 65: Hoare triple {9096#false} assume !false; {9096#false} is VALID [2022-04-15 11:47:27,869 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:47:27,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:47:27,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726765211] [2022-04-15 11:47:27,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726765211] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:47:27,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:47:27,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:47:27,870 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:47:27,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [549930860] [2022-04-15 11:47:27,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [549930860] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:47:27,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:47:27,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:47:27,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152981084] [2022-04-15 11:47:27,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:47:27,871 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-15 11:47:27,871 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:47:27,871 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-15 11:47:27,920 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-15 11:47:27,920 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:47:27,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:47:27,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:47:27,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:47:27,922 INFO L87 Difference]: Start difference. First operand 313 states and 475 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-15 11:47:29,951 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-15 11:47:34,783 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:47:36,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:36,173 INFO L93 Difference]: Finished difference Result 677 states and 1037 transitions. [2022-04-15 11:47:36,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:47:36,174 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-15 11:47:36,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:47:36,174 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-15 11:47:36,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 615 transitions. [2022-04-15 11:47:36,179 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-15 11:47:36,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 615 transitions. [2022-04-15 11:47:36,206 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 615 transitions. [2022-04-15 11:47:36,723 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 615 edges. 615 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:47:36,741 INFO L225 Difference]: With dead ends: 677 [2022-04-15 11:47:36,742 INFO L226 Difference]: Without dead ends: 523 [2022-04-15 11:47:36,742 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-15 11:47:36,744 INFO L913 BasicCegarLoop]: 125 mSDtfsCounter, 153 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:47:36,745 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 366 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2022-04-15 11:47:36,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2022-04-15 11:47:36,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 325. [2022-04-15 11:47:36,761 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:47:36,762 INFO L82 GeneralOperation]: Start isEquivalent. First operand 523 states. Second operand has 325 states, 320 states have (on average 1.51875) internal successors, (486), 320 states have internal predecessors, (486), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:36,763 INFO L74 IsIncluded]: Start isIncluded. First operand 523 states. Second operand has 325 states, 320 states have (on average 1.51875) internal successors, (486), 320 states have internal predecessors, (486), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:36,763 INFO L87 Difference]: Start difference. First operand 523 states. Second operand has 325 states, 320 states have (on average 1.51875) internal successors, (486), 320 states have internal predecessors, (486), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:36,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:36,779 INFO L93 Difference]: Finished difference Result 523 states and 794 transitions. [2022-04-15 11:47:36,779 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 794 transitions. [2022-04-15 11:47:36,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:47:36,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:47:36,781 INFO L74 IsIncluded]: Start isIncluded. First operand has 325 states, 320 states have (on average 1.51875) internal successors, (486), 320 states have internal predecessors, (486), 3 states have call successors, (3), 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 523 states. [2022-04-15 11:47:36,782 INFO L87 Difference]: Start difference. First operand has 325 states, 320 states have (on average 1.51875) internal successors, (486), 320 states have internal predecessors, (486), 3 states have call successors, (3), 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 523 states. [2022-04-15 11:47:36,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:36,798 INFO L93 Difference]: Finished difference Result 523 states and 794 transitions. [2022-04-15 11:47:36,798 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 794 transitions. [2022-04-15 11:47:36,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:47:36,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:47:36,799 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:47:36,799 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:47:36,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 320 states have (on average 1.51875) internal successors, (486), 320 states have internal predecessors, (486), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:36,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 490 transitions. [2022-04-15 11:47:36,809 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 490 transitions. Word has length 66 [2022-04-15 11:47:36,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:47:36,809 INFO L478 AbstractCegarLoop]: Abstraction has 325 states and 490 transitions. [2022-04-15 11:47:36,809 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-15 11:47:36,809 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 325 states and 490 transitions. [2022-04-15 11:47:37,234 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 490 edges. 490 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:47:37,235 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 490 transitions. [2022-04-15 11:47:37,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-15 11:47:37,236 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:47:37,236 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:47:37,236 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 11:47:37,236 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:47:37,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:47:37,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1596653458, now seen corresponding path program 1 times [2022-04-15 11:47:37,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:47:37,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1894930272] [2022-04-15 11:47:37,402 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 19 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 11:47:37,402 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 11:47:37,403 INFO L85 PathProgramCache]: Analyzing trace with hash -724691531, now seen corresponding path program 1 times [2022-04-15 11:47:37,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:47:37,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269588230] [2022-04-15 11:47:37,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:47:37,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:47:37,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:47:37,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:47:37,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:47:37,576 INFO L290 TraceCheckUtils]: 0: Hoare triple {12163#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {12157#true} is VALID [2022-04-15 11:47:37,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {12157#true} assume true; {12157#true} is VALID [2022-04-15 11:47:37,577 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12157#true} {12157#true} #708#return; {12157#true} is VALID [2022-04-15 11:47:37,578 INFO L272 TraceCheckUtils]: 0: Hoare triple {12157#true} call ULTIMATE.init(); {12163#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:47:37,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {12163#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {12157#true} is VALID [2022-04-15 11:47:37,580 INFO L290 TraceCheckUtils]: 2: Hoare triple {12157#true} assume true; {12157#true} is VALID [2022-04-15 11:47:37,581 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12157#true} {12157#true} #708#return; {12157#true} is VALID [2022-04-15 11:47:37,583 INFO L272 TraceCheckUtils]: 4: Hoare triple {12157#true} call #t~ret161 := main(); {12157#true} is VALID [2022-04-15 11:47:37,583 INFO L290 TraceCheckUtils]: 5: Hoare triple {12157#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; {12157#true} is VALID [2022-04-15 11:47:37,583 INFO L290 TraceCheckUtils]: 6: Hoare triple {12157#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {12157#true} is VALID [2022-04-15 11:47:37,583 INFO L272 TraceCheckUtils]: 7: Hoare triple {12157#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {12157#true} is VALID [2022-04-15 11:47:37,584 INFO L290 TraceCheckUtils]: 8: Hoare triple {12157#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); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:37,584 INFO L290 TraceCheckUtils]: 9: Hoare triple {12162#(= 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; {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:37,584 INFO L290 TraceCheckUtils]: 10: Hoare triple {12162#(= 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; {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:37,585 INFO L290 TraceCheckUtils]: 11: Hoare triple {12162#(= 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)))); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:37,587 INFO L290 TraceCheckUtils]: 12: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:37,588 INFO L290 TraceCheckUtils]: 13: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:37,588 INFO L290 TraceCheckUtils]: 14: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} [718] L1167-2-->L1168_primed: Formula: (let ((.cse0 (= |v_#memory_int_305| |v_#memory_int_300|)) (.cse1 (= |v_ssl3_accept_#t~mem47_28| |v_ssl3_accept_#t~mem47_26|)) (.cse2 (= |v_ssl3_accept_#t~mem49_10| |v_ssl3_accept_#t~mem49_8|)) (.cse3 (= |v_ssl3_accept_#t~mem83.base_26| |v_ssl3_accept_#t~mem83.base_24|)) (.cse4 (= |v_ssl3_accept_#t~mem83.offset_26| |v_ssl3_accept_#t~mem83.offset_24|)) (.cse5 (= |v_ssl3_accept_#t~mem150.base_24| |v_ssl3_accept_#t~mem150.base_22|)) (.cse6 (= |v_ssl3_accept_#t~mem88.offset_15| |v_ssl3_accept_#t~mem88.offset_14|)) (.cse7 (= |v_ssl3_accept_#t~mem82_26| |v_ssl3_accept_#t~mem82_24|)) (.cse8 (= v_ssl3_accept_~skip~0_27 v_ssl3_accept_~skip~0_26)) (.cse9 (= |v_ssl3_accept_#t~mem88.base_15| |v_ssl3_accept_#t~mem88.base_14|)) (.cse10 (= |v_ssl3_accept_#t~mem89_15| |v_ssl3_accept_#t~mem89_14|)) (.cse11 (= |v_ssl3_accept_#t~mem85_26| |v_ssl3_accept_#t~mem85_24|)) (.cse12 (= |v_ssl3_accept_#t~mem150.offset_24| |v_ssl3_accept_#t~mem150.offset_22|)) (.cse13 (= |v_ssl3_accept_#t~mem151_26| |v_ssl3_accept_#t~mem151_24|)) (.cse14 (= v_ssl3_accept_~state~0_19 v_ssl3_accept_~state~0_18)) (.cse15 (= |v_ssl3_accept_#t~mem48_26| |v_ssl3_accept_#t~mem48_24|)) (.cse16 (= |v_ssl3_accept_#t~mem46_17| |v_ssl3_accept_#t~mem46_16|))) (or (and .cse0 .cse1 .cse2 (= |v_#memory_$Pointer$.offset_317| |v_#memory_$Pointer$.offset_311|) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (= |v_#memory_$Pointer$.base_317| |v_#memory_$Pointer$.base_311|)) (and (= |v_#memory_$Pointer$.offset_311| |v_#memory_$Pointer$.offset_317|) .cse0 (= |v_#memory_$Pointer$.base_311| |v_#memory_$Pointer$.base_317|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16))) InVars {ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_26|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_317|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_26|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_26|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_26|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_24|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_15|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_26|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_10|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_26|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_24|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_28|, 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_15|, #memory_int=|v_#memory_int_305|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_15|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_317|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_19} OutVars{ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_24|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_311|, 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_24|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_22|, 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_8|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_24|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_22|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_26|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_16|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_26, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_14|, #memory_int=|v_#memory_int_300|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_14|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_311|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_18} 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~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] {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:37,589 INFO L290 TraceCheckUtils]: 15: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} [717] L1168_primed-->L1168: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:37,589 INFO L290 TraceCheckUtils]: 16: Hoare triple {12162#(= 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); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:37,589 INFO L290 TraceCheckUtils]: 17: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:37,590 INFO L290 TraceCheckUtils]: 18: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:37,590 INFO L290 TraceCheckUtils]: 19: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:37,590 INFO L290 TraceCheckUtils]: 20: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:37,591 INFO L290 TraceCheckUtils]: 21: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:37,591 INFO L290 TraceCheckUtils]: 22: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:37,591 INFO L290 TraceCheckUtils]: 23: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:37,592 INFO L290 TraceCheckUtils]: 24: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:37,592 INFO L290 TraceCheckUtils]: 25: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:37,592 INFO L290 TraceCheckUtils]: 26: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:37,593 INFO L290 TraceCheckUtils]: 27: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:37,593 INFO L290 TraceCheckUtils]: 28: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:37,593 INFO L290 TraceCheckUtils]: 29: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:37,594 INFO L290 TraceCheckUtils]: 30: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:37,594 INFO L290 TraceCheckUtils]: 31: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:37,594 INFO L290 TraceCheckUtils]: 32: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:37,595 INFO L290 TraceCheckUtils]: 33: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:37,595 INFO L290 TraceCheckUtils]: 34: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:37,595 INFO L290 TraceCheckUtils]: 35: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:37,596 INFO L290 TraceCheckUtils]: 36: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:37,596 INFO L290 TraceCheckUtils]: 37: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:37,600 INFO L290 TraceCheckUtils]: 38: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:37,600 INFO L290 TraceCheckUtils]: 39: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:37,601 INFO L290 TraceCheckUtils]: 40: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:37,601 INFO L290 TraceCheckUtils]: 41: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:37,601 INFO L290 TraceCheckUtils]: 42: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:37,602 INFO L290 TraceCheckUtils]: 43: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:37,602 INFO L290 TraceCheckUtils]: 44: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:37,602 INFO L290 TraceCheckUtils]: 45: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume 8640 == #t~mem75;havoc #t~mem75; {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:37,603 INFO L290 TraceCheckUtils]: 46: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:37,603 INFO L290 TraceCheckUtils]: 47: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(4 == ~blastFlag~0); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:37,603 INFO L290 TraceCheckUtils]: 48: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(7 == ~blastFlag~0); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:37,604 INFO L290 TraceCheckUtils]: 49: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(10 == ~blastFlag~0); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:37,605 INFO L290 TraceCheckUtils]: 50: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume 13 == ~blastFlag~0; {12158#false} is VALID [2022-04-15 11:47:37,605 INFO L290 TraceCheckUtils]: 51: Hoare triple {12158#false} assume !false; {12158#false} is VALID [2022-04-15 11:47:37,606 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-15 11:47:37,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:47:37,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269588230] [2022-04-15 11:47:37,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269588230] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:47:37,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:47:37,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:47:40,669 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:47:40,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1894930272] [2022-04-15 11:47:40,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1894930272] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:47:40,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:47:40,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 11:47:40,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853117646] [2022-04-15 11:47:40,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:47:40,671 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 13 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-15 11:47:40,671 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:47:40,671 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 13 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-15 11:47:40,731 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-15 11:47:40,731 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 11:47:40,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:47:40,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 11:47:40,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=130, Unknown=1, NotChecked=0, Total=182 [2022-04-15 11:47:40,732 INFO L87 Difference]: Start difference. First operand 325 states and 490 transitions. Second operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 13 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-15 11:47:42,777 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-15 11:47:44,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:44,975 INFO L93 Difference]: Finished difference Result 495 states and 752 transitions. [2022-04-15 11:47:44,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 11:47:44,975 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 13 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-15 11:47:44,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:47:44,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 13 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-15 11:47:44,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 616 transitions. [2022-04-15 11:47:44,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 13 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-15 11:47:44,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 616 transitions. [2022-04-15 11:47:44,983 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 616 transitions. [2022-04-15 11:47:45,496 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 616 edges. 616 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:47:45,505 INFO L225 Difference]: With dead ends: 495 [2022-04-15 11:47:45,505 INFO L226 Difference]: Without dead ends: 336 [2022-04-15 11:47:45,506 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=51, Invalid=130, Unknown=1, NotChecked=0, Total=182 [2022-04-15 11:47:45,507 INFO L913 BasicCegarLoop]: 204 mSDtfsCounter, 146 mSDsluCounter, 1020 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 1224 SdHoareTripleChecker+Invalid, 1359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 698 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-15 11:47:45,507 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 1224 Invalid, 1359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 654 Invalid, 1 Unknown, 698 Unchecked, 2.6s Time] [2022-04-15 11:47:45,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2022-04-15 11:47:45,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 327. [2022-04-15 11:47:45,523 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:47:45,525 INFO L82 GeneralOperation]: Start isEquivalent. First operand 336 states. Second operand has 327 states, 322 states have (on average 1.5186335403726707) internal successors, (489), 322 states have internal predecessors, (489), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:45,526 INFO L74 IsIncluded]: Start isIncluded. First operand 336 states. Second operand has 327 states, 322 states have (on average 1.5186335403726707) internal successors, (489), 322 states have internal predecessors, (489), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:45,526 INFO L87 Difference]: Start difference. First operand 336 states. Second operand has 327 states, 322 states have (on average 1.5186335403726707) internal successors, (489), 322 states have internal predecessors, (489), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:45,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:45,535 INFO L93 Difference]: Finished difference Result 336 states and 504 transitions. [2022-04-15 11:47:45,535 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 504 transitions. [2022-04-15 11:47:45,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:47:45,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:47:45,537 INFO L74 IsIncluded]: Start isIncluded. First operand has 327 states, 322 states have (on average 1.5186335403726707) internal successors, (489), 322 states have internal predecessors, (489), 3 states have call successors, (3), 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 336 states. [2022-04-15 11:47:45,538 INFO L87 Difference]: Start difference. First operand has 327 states, 322 states have (on average 1.5186335403726707) internal successors, (489), 322 states have internal predecessors, (489), 3 states have call successors, (3), 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 336 states. [2022-04-15 11:47:45,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:45,546 INFO L93 Difference]: Finished difference Result 336 states and 504 transitions. [2022-04-15 11:47:45,546 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 504 transitions. [2022-04-15 11:47:45,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:47:45,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:47:45,547 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:47:45,547 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:47:45,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 322 states have (on average 1.5186335403726707) internal successors, (489), 322 states have internal predecessors, (489), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:45,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 493 transitions. [2022-04-15 11:47:45,557 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 493 transitions. Word has length 66 [2022-04-15 11:47:45,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:47:45,557 INFO L478 AbstractCegarLoop]: Abstraction has 327 states and 493 transitions. [2022-04-15 11:47:45,557 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 13 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-15 11:47:45,557 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 327 states and 493 transitions. [2022-04-15 11:47:46,329 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 493 edges. 493 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:47:46,330 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 493 transitions. [2022-04-15 11:47:46,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-15 11:47:46,330 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:47:46,330 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:47:46,331 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 11:47:46,331 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:47:46,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:47:46,331 INFO L85 PathProgramCache]: Analyzing trace with hash -770041136, now seen corresponding path program 1 times [2022-04-15 11:47:46,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:47:46,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2031689606] [2022-04-15 11:47:46,480 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 19 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 11:47:46,481 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 11:47:46,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1094519307, now seen corresponding path program 1 times [2022-04-15 11:47:46,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:47:46,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624256073] [2022-04-15 11:47:46,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:47:46,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:47:46,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:47:46,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:47:46,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:47:46,600 INFO L290 TraceCheckUtils]: 0: Hoare triple {14498#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {14492#true} is VALID [2022-04-15 11:47:46,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {14492#true} assume true; {14492#true} is VALID [2022-04-15 11:47:46,601 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14492#true} {14492#true} #708#return; {14492#true} is VALID [2022-04-15 11:47:46,601 INFO L272 TraceCheckUtils]: 0: Hoare triple {14492#true} call ULTIMATE.init(); {14498#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:47:46,602 INFO L290 TraceCheckUtils]: 1: Hoare triple {14498#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {14492#true} is VALID [2022-04-15 11:47:46,602 INFO L290 TraceCheckUtils]: 2: Hoare triple {14492#true} assume true; {14492#true} is VALID [2022-04-15 11:47:46,602 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14492#true} {14492#true} #708#return; {14492#true} is VALID [2022-04-15 11:47:46,602 INFO L272 TraceCheckUtils]: 4: Hoare triple {14492#true} call #t~ret161 := main(); {14492#true} is VALID [2022-04-15 11:47:46,602 INFO L290 TraceCheckUtils]: 5: Hoare triple {14492#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; {14492#true} is VALID [2022-04-15 11:47:46,602 INFO L290 TraceCheckUtils]: 6: Hoare triple {14492#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {14492#true} is VALID [2022-04-15 11:47:46,602 INFO L272 TraceCheckUtils]: 7: Hoare triple {14492#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {14492#true} is VALID [2022-04-15 11:47:46,603 INFO L290 TraceCheckUtils]: 8: Hoare triple {14492#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); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:46,603 INFO L290 TraceCheckUtils]: 9: Hoare triple {14497#(= 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; {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:46,604 INFO L290 TraceCheckUtils]: 10: Hoare triple {14497#(= 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; {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:46,604 INFO L290 TraceCheckUtils]: 11: Hoare triple {14497#(= 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)))); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:46,604 INFO L290 TraceCheckUtils]: 12: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:46,605 INFO L290 TraceCheckUtils]: 13: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:46,606 INFO L290 TraceCheckUtils]: 14: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} [720] L1167-2-->L1168_primed: Formula: (let ((.cse0 (= |v_ssl3_accept_#t~mem82_33| |v_ssl3_accept_#t~mem82_31|)) (.cse1 (= |v_ssl3_accept_#t~mem89_20| |v_ssl3_accept_#t~mem89_19|)) (.cse2 (= |v_ssl3_accept_#t~mem85_33| |v_ssl3_accept_#t~mem85_31|)) (.cse3 (= v_ssl3_accept_~skip~0_32 v_ssl3_accept_~skip~0_31)) (.cse4 (= |v_ssl3_accept_#t~mem151_32| |v_ssl3_accept_#t~mem151_30|)) (.cse5 (= |v_ssl3_accept_#t~mem83.base_33| |v_ssl3_accept_#t~mem83.base_31|)) (.cse6 (= |v_ssl3_accept_#t~mem46_22| |v_ssl3_accept_#t~mem46_21|)) (.cse7 (= |v_ssl3_accept_#t~mem47_35| |v_ssl3_accept_#t~mem47_33|)) (.cse8 (= v_ssl3_accept_~state~0_24 v_ssl3_accept_~state~0_23)) (.cse9 (= |v_ssl3_accept_#t~mem83.offset_33| |v_ssl3_accept_#t~mem83.offset_31|)) (.cse10 (= |v_ssl3_accept_#t~mem48_33| |v_ssl3_accept_#t~mem48_31|))) (or (and (= |v_ssl3_accept_#t~mem150.offset_28| |v_ssl3_accept_#t~mem150.offset_30|) .cse0 .cse1 .cse2 (= |v_ssl3_accept_#t~mem150.base_28| |v_ssl3_accept_#t~mem150.base_30|) (= |v_ssl3_accept_#t~mem88.base_19| |v_ssl3_accept_#t~mem88.base_20|) .cse3 .cse4 .cse5 (= |v_#memory_$Pointer$.base_331| |v_#memory_$Pointer$.base_337|) (= |v_ssl3_accept_#t~mem88.offset_19| |v_ssl3_accept_#t~mem88.offset_20|) .cse6 .cse7 .cse8 .cse9 (= |v_#memory_int_319| |v_#memory_int_324|) (= |v_#memory_$Pointer$.offset_331| |v_#memory_$Pointer$.offset_337|) (= |v_ssl3_accept_#t~mem49_15| |v_ssl3_accept_#t~mem49_17|) .cse10) (and .cse0 (= |v_#memory_int_324| |v_#memory_int_319|) (= |v_#memory_$Pointer$.base_337| |v_#memory_$Pointer$.base_331|) .cse1 .cse2 (= |v_#memory_$Pointer$.offset_337| |v_#memory_$Pointer$.offset_331|) (= |v_ssl3_accept_#t~mem49_17| |v_ssl3_accept_#t~mem49_15|) .cse3 .cse4 .cse5 (= |v_ssl3_accept_#t~mem150.offset_30| |v_ssl3_accept_#t~mem150.offset_28|) .cse6 .cse7 .cse8 (= |v_ssl3_accept_#t~mem150.base_30| |v_ssl3_accept_#t~mem150.base_28|) .cse9 (= |v_ssl3_accept_#t~mem88.base_20| |v_ssl3_accept_#t~mem88.base_19|) .cse10 (= |v_ssl3_accept_#t~mem88.offset_20| |v_ssl3_accept_#t~mem88.offset_19|)))) InVars {ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_33|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_337|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_33|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_33|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_32|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_30|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_20|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_33|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_17|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_33|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_30|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_35|, 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_20|, #memory_int=|v_#memory_int_324|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_20|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_337|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_24} OutVars{ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_31|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_331|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_31|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_31|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_30|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_28|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_19|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_31|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_15|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_31|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_28|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_33|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_21|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_31, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_19|, #memory_int=|v_#memory_int_319|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_19|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_331|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_23} 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~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] {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:46,606 INFO L290 TraceCheckUtils]: 15: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} [719] L1168_primed-->L1168: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:46,606 INFO L290 TraceCheckUtils]: 16: Hoare triple {14497#(= 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); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:46,607 INFO L290 TraceCheckUtils]: 17: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:46,607 INFO L290 TraceCheckUtils]: 18: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:46,607 INFO L290 TraceCheckUtils]: 19: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:46,608 INFO L290 TraceCheckUtils]: 20: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:46,608 INFO L290 TraceCheckUtils]: 21: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:46,608 INFO L290 TraceCheckUtils]: 22: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:46,609 INFO L290 TraceCheckUtils]: 23: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:46,609 INFO L290 TraceCheckUtils]: 24: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:46,609 INFO L290 TraceCheckUtils]: 25: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:46,610 INFO L290 TraceCheckUtils]: 26: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:46,610 INFO L290 TraceCheckUtils]: 27: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:46,610 INFO L290 TraceCheckUtils]: 28: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:46,611 INFO L290 TraceCheckUtils]: 29: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:46,611 INFO L290 TraceCheckUtils]: 30: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:46,611 INFO L290 TraceCheckUtils]: 31: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:46,612 INFO L290 TraceCheckUtils]: 32: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:46,612 INFO L290 TraceCheckUtils]: 33: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:46,612 INFO L290 TraceCheckUtils]: 34: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:46,613 INFO L290 TraceCheckUtils]: 35: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:46,613 INFO L290 TraceCheckUtils]: 36: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:46,613 INFO L290 TraceCheckUtils]: 37: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:46,614 INFO L290 TraceCheckUtils]: 38: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:46,614 INFO L290 TraceCheckUtils]: 39: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:46,614 INFO L290 TraceCheckUtils]: 40: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:46,615 INFO L290 TraceCheckUtils]: 41: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:46,615 INFO L290 TraceCheckUtils]: 42: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:46,615 INFO L290 TraceCheckUtils]: 43: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:46,616 INFO L290 TraceCheckUtils]: 44: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:46,616 INFO L290 TraceCheckUtils]: 45: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume 8640 == #t~mem75;havoc #t~mem75; {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:46,616 INFO L290 TraceCheckUtils]: 46: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:46,617 INFO L290 TraceCheckUtils]: 47: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(4 == ~blastFlag~0); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:46,617 INFO L290 TraceCheckUtils]: 48: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(7 == ~blastFlag~0); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:46,617 INFO L290 TraceCheckUtils]: 49: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(10 == ~blastFlag~0); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:47:46,618 INFO L290 TraceCheckUtils]: 50: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume 13 == ~blastFlag~0; {14493#false} is VALID [2022-04-15 11:47:46,618 INFO L290 TraceCheckUtils]: 51: Hoare triple {14493#false} assume !false; {14493#false} is VALID [2022-04-15 11:47:46,618 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-15 11:47:46,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:47:46,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624256073] [2022-04-15 11:47:46,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624256073] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:47:46,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:47:46,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:47:49,666 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:47:49,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2031689606] [2022-04-15 11:47:49,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2031689606] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:47:49,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:47:49,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 11:47:49,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002783854] [2022-04-15 11:47:49,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:47:49,668 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 13 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-15 11:47:49,668 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:47:49,668 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 13 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-15 11:47:49,729 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-15 11:47:49,729 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 11:47:49,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:47:49,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 11:47:49,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=130, Unknown=1, NotChecked=0, Total=182 [2022-04-15 11:47:49,730 INFO L87 Difference]: Start difference. First operand 327 states and 493 transitions. Second operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 13 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-15 11:47:52,934 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-15 11:47:57,392 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-15 11:48:02,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:02,650 INFO L93 Difference]: Finished difference Result 496 states and 753 transitions. [2022-04-15 11:48:02,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 11:48:02,650 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 13 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-15 11:48:02,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:48:02,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 13 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-15 11:48:02,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 617 transitions. [2022-04-15 11:48:02,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 13 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-15 11:48:02,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 617 transitions. [2022-04-15 11:48:02,658 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 617 transitions. [2022-04-15 11:48:03,116 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 617 edges. 617 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:48:03,122 INFO L225 Difference]: With dead ends: 496 [2022-04-15 11:48:03,122 INFO L226 Difference]: Without dead ends: 337 [2022-04-15 11:48:03,123 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=51, Invalid=130, Unknown=1, NotChecked=0, Total=182 [2022-04-15 11:48:03,123 INFO L913 BasicCegarLoop]: 209 mSDtfsCounter, 145 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 7 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 310 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-04-15 11:48:03,124 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 918 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 774 Invalid, 2 Unknown, 310 Unchecked, 6.7s Time] [2022-04-15 11:48:03,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-04-15 11:48:03,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 325. [2022-04-15 11:48:03,137 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:48:03,138 INFO L82 GeneralOperation]: Start isEquivalent. First operand 337 states. Second operand has 325 states, 320 states have (on average 1.51875) internal successors, (486), 320 states have internal predecessors, (486), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:03,139 INFO L74 IsIncluded]: Start isIncluded. First operand 337 states. Second operand has 325 states, 320 states have (on average 1.51875) internal successors, (486), 320 states have internal predecessors, (486), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:03,140 INFO L87 Difference]: Start difference. First operand 337 states. Second operand has 325 states, 320 states have (on average 1.51875) internal successors, (486), 320 states have internal predecessors, (486), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:03,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:03,147 INFO L93 Difference]: Finished difference Result 337 states and 505 transitions. [2022-04-15 11:48:03,147 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 505 transitions. [2022-04-15 11:48:03,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:48:03,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:48:03,149 INFO L74 IsIncluded]: Start isIncluded. First operand has 325 states, 320 states have (on average 1.51875) internal successors, (486), 320 states have internal predecessors, (486), 3 states have call successors, (3), 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 337 states. [2022-04-15 11:48:03,150 INFO L87 Difference]: Start difference. First operand has 325 states, 320 states have (on average 1.51875) internal successors, (486), 320 states have internal predecessors, (486), 3 states have call successors, (3), 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 337 states. [2022-04-15 11:48:03,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:03,157 INFO L93 Difference]: Finished difference Result 337 states and 505 transitions. [2022-04-15 11:48:03,157 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 505 transitions. [2022-04-15 11:48:03,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:48:03,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:48:03,158 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:48:03,158 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:48:03,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 320 states have (on average 1.51875) internal successors, (486), 320 states have internal predecessors, (486), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:03,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 490 transitions. [2022-04-15 11:48:03,167 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 490 transitions. Word has length 66 [2022-04-15 11:48:03,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:48:03,167 INFO L478 AbstractCegarLoop]: Abstraction has 325 states and 490 transitions. [2022-04-15 11:48:03,167 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 13 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-15 11:48:03,167 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 325 states and 490 transitions. [2022-04-15 11:48:04,232 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 490 edges. 490 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:48:04,232 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 490 transitions. [2022-04-15 11:48:04,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-15 11:48:04,233 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:48:04,233 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:48:04,233 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-15 11:48:04,234 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:48:04,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:48:04,234 INFO L85 PathProgramCache]: Analyzing trace with hash -493596445, now seen corresponding path program 1 times [2022-04-15 11:48:04,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:48:04,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1629233565] [2022-04-15 11:48:04,256 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:48:04,256 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:48:04,256 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:48:04,256 INFO L85 PathProgramCache]: Analyzing trace with hash -493596445, now seen corresponding path program 2 times [2022-04-15 11:48:04,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:48:04,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992071183] [2022-04-15 11:48:04,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:48:04,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:48:04,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:48:04,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:48:04,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:48:04,415 INFO L290 TraceCheckUtils]: 0: Hoare triple {16834#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {16827#true} is VALID [2022-04-15 11:48:04,415 INFO L290 TraceCheckUtils]: 1: Hoare triple {16827#true} assume true; {16827#true} is VALID [2022-04-15 11:48:04,415 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16827#true} {16827#true} #708#return; {16827#true} is VALID [2022-04-15 11:48:04,416 INFO L272 TraceCheckUtils]: 0: Hoare triple {16827#true} call ULTIMATE.init(); {16834#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:48:04,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {16834#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {16827#true} is VALID [2022-04-15 11:48:04,417 INFO L290 TraceCheckUtils]: 2: Hoare triple {16827#true} assume true; {16827#true} is VALID [2022-04-15 11:48:04,417 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16827#true} {16827#true} #708#return; {16827#true} is VALID [2022-04-15 11:48:04,417 INFO L272 TraceCheckUtils]: 4: Hoare triple {16827#true} call #t~ret161 := main(); {16827#true} is VALID [2022-04-15 11:48:04,417 INFO L290 TraceCheckUtils]: 5: Hoare triple {16827#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; {16827#true} is VALID [2022-04-15 11:48:04,417 INFO L290 TraceCheckUtils]: 6: Hoare triple {16827#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {16827#true} is VALID [2022-04-15 11:48:04,417 INFO L272 TraceCheckUtils]: 7: Hoare triple {16827#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {16827#true} is VALID [2022-04-15 11:48:04,420 INFO L290 TraceCheckUtils]: 8: Hoare triple {16827#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); {16832#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:04,420 INFO L290 TraceCheckUtils]: 9: Hoare triple {16832#(not (= 8192 (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; {16832#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:04,421 INFO L290 TraceCheckUtils]: 10: Hoare triple {16832#(not (= 8192 (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; {16832#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:04,421 INFO L290 TraceCheckUtils]: 11: Hoare triple {16832#(not (= 8192 (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)))); {16832#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:04,422 INFO L290 TraceCheckUtils]: 12: Hoare triple {16832#(not (= 8192 (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); {16832#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:04,422 INFO L290 TraceCheckUtils]: 13: Hoare triple {16832#(not (= 8192 (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; {16832#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:04,423 INFO L290 TraceCheckUtils]: 14: Hoare triple {16832#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {16832#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:04,423 INFO L290 TraceCheckUtils]: 15: Hoare triple {16832#(not (= 8192 (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); {16832#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:04,424 INFO L290 TraceCheckUtils]: 16: Hoare triple {16832#(not (= 8192 (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); {16832#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:04,424 INFO L290 TraceCheckUtils]: 17: Hoare triple {16832#(not (= 8192 (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); {16833#(not (= 8192 |ssl3_accept_#t~mem49|))} is VALID [2022-04-15 11:48:04,425 INFO L290 TraceCheckUtils]: 18: Hoare triple {16833#(not (= 8192 |ssl3_accept_#t~mem49|))} assume 8192 == #t~mem49;havoc #t~mem49; {16828#false} is VALID [2022-04-15 11:48:04,425 INFO L290 TraceCheckUtils]: 19: Hoare triple {16828#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {16828#false} is VALID [2022-04-15 11:48:04,425 INFO L290 TraceCheckUtils]: 20: Hoare triple {16828#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {16828#false} is VALID [2022-04-15 11:48:04,425 INFO L290 TraceCheckUtils]: 21: Hoare triple {16828#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {16828#false} is VALID [2022-04-15 11:48:04,425 INFO L290 TraceCheckUtils]: 22: Hoare triple {16828#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); {16828#false} is VALID [2022-04-15 11:48:04,425 INFO L290 TraceCheckUtils]: 23: Hoare triple {16828#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {16828#false} is VALID [2022-04-15 11:48:04,425 INFO L290 TraceCheckUtils]: 24: Hoare triple {16828#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); {16828#false} is VALID [2022-04-15 11:48:04,426 INFO L290 TraceCheckUtils]: 25: Hoare triple {16828#false} assume 12292 != #t~mem85;havoc #t~mem85; {16828#false} is VALID [2022-04-15 11:48:04,426 INFO L290 TraceCheckUtils]: 26: Hoare triple {16828#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; {16828#false} is VALID [2022-04-15 11:48:04,426 INFO L290 TraceCheckUtils]: 27: Hoare triple {16828#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); {16828#false} is VALID [2022-04-15 11:48:04,426 INFO L290 TraceCheckUtils]: 28: Hoare triple {16828#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {16828#false} is VALID [2022-04-15 11:48:04,426 INFO L290 TraceCheckUtils]: 29: Hoare triple {16828#false} ~skip~0 := 0; {16828#false} is VALID [2022-04-15 11:48:04,426 INFO L290 TraceCheckUtils]: 30: Hoare triple {16828#false} assume !false; {16828#false} is VALID [2022-04-15 11:48:04,426 INFO L290 TraceCheckUtils]: 31: Hoare triple {16828#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); {16828#false} is VALID [2022-04-15 11:48:04,426 INFO L290 TraceCheckUtils]: 32: Hoare triple {16828#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-15 11:48:04,426 INFO L290 TraceCheckUtils]: 33: Hoare triple {16828#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-15 11:48:04,427 INFO L290 TraceCheckUtils]: 34: Hoare triple {16828#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-15 11:48:04,427 INFO L290 TraceCheckUtils]: 35: Hoare triple {16828#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-15 11:48:04,427 INFO L290 TraceCheckUtils]: 36: Hoare triple {16828#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-15 11:48:04,427 INFO L290 TraceCheckUtils]: 37: Hoare triple {16828#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-15 11:48:04,427 INFO L290 TraceCheckUtils]: 38: Hoare triple {16828#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-15 11:48:04,427 INFO L290 TraceCheckUtils]: 39: Hoare triple {16828#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-15 11:48:04,427 INFO L290 TraceCheckUtils]: 40: Hoare triple {16828#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-15 11:48:04,427 INFO L290 TraceCheckUtils]: 41: Hoare triple {16828#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-15 11:48:04,427 INFO L290 TraceCheckUtils]: 42: Hoare triple {16828#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-15 11:48:04,428 INFO L290 TraceCheckUtils]: 43: Hoare triple {16828#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-15 11:48:04,428 INFO L290 TraceCheckUtils]: 44: Hoare triple {16828#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-15 11:48:04,428 INFO L290 TraceCheckUtils]: 45: Hoare triple {16828#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-15 11:48:04,428 INFO L290 TraceCheckUtils]: 46: Hoare triple {16828#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-15 11:48:04,428 INFO L290 TraceCheckUtils]: 47: Hoare triple {16828#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-15 11:48:04,428 INFO L290 TraceCheckUtils]: 48: Hoare triple {16828#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-15 11:48:04,428 INFO L290 TraceCheckUtils]: 49: Hoare triple {16828#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-15 11:48:04,428 INFO L290 TraceCheckUtils]: 50: Hoare triple {16828#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-15 11:48:04,428 INFO L290 TraceCheckUtils]: 51: Hoare triple {16828#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-15 11:48:04,428 INFO L290 TraceCheckUtils]: 52: Hoare triple {16828#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-15 11:48:04,429 INFO L290 TraceCheckUtils]: 53: Hoare triple {16828#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-15 11:48:04,429 INFO L290 TraceCheckUtils]: 54: Hoare triple {16828#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-15 11:48:04,429 INFO L290 TraceCheckUtils]: 55: Hoare triple {16828#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-15 11:48:04,429 INFO L290 TraceCheckUtils]: 56: Hoare triple {16828#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-15 11:48:04,429 INFO L290 TraceCheckUtils]: 57: Hoare triple {16828#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-15 11:48:04,429 INFO L290 TraceCheckUtils]: 58: Hoare triple {16828#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-15 11:48:04,429 INFO L290 TraceCheckUtils]: 59: Hoare triple {16828#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-15 11:48:04,429 INFO L290 TraceCheckUtils]: 60: Hoare triple {16828#false} assume 8640 == #t~mem75;havoc #t~mem75; {16828#false} is VALID [2022-04-15 11:48:04,429 INFO L290 TraceCheckUtils]: 61: Hoare triple {16828#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {16828#false} is VALID [2022-04-15 11:48:04,429 INFO L290 TraceCheckUtils]: 62: Hoare triple {16828#false} assume !(4 == ~blastFlag~0); {16828#false} is VALID [2022-04-15 11:48:04,430 INFO L290 TraceCheckUtils]: 63: Hoare triple {16828#false} assume !(7 == ~blastFlag~0); {16828#false} is VALID [2022-04-15 11:48:04,430 INFO L290 TraceCheckUtils]: 64: Hoare triple {16828#false} assume !(10 == ~blastFlag~0); {16828#false} is VALID [2022-04-15 11:48:04,430 INFO L290 TraceCheckUtils]: 65: Hoare triple {16828#false} assume 13 == ~blastFlag~0; {16828#false} is VALID [2022-04-15 11:48:04,430 INFO L290 TraceCheckUtils]: 66: Hoare triple {16828#false} assume !false; {16828#false} is VALID [2022-04-15 11:48:04,430 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:48:04,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:48:04,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992071183] [2022-04-15 11:48:04,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992071183] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:48:04,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:48:04,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:48:04,431 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:48:04,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1629233565] [2022-04-15 11:48:04,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1629233565] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:48:04,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:48:04,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:48:04,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541800556] [2022-04-15 11:48:04,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:48:04,432 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-15 11:48:04,432 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:48:04,432 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-15 11:48:04,489 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-15 11:48:04,490 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:48:04,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:48:04,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:48:04,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:48:04,490 INFO L87 Difference]: Start difference. First operand 325 states and 490 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-15 11:48:06,539 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-15 11:48:08,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:08,713 INFO L93 Difference]: Finished difference Result 689 states and 1050 transitions. [2022-04-15 11:48:08,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:48:08,714 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-15 11:48:08,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:48:08,714 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-15 11:48:08,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 614 transitions. [2022-04-15 11:48:08,717 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-15 11:48:08,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 614 transitions. [2022-04-15 11:48:08,720 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 614 transitions. [2022-04-15 11:48:09,149 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 614 edges. 614 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:48:09,161 INFO L225 Difference]: With dead ends: 689 [2022-04-15 11:48:09,161 INFO L226 Difference]: Without dead ends: 523 [2022-04-15 11:48:09,161 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-15 11:48:09,162 INFO L913 BasicCegarLoop]: 125 mSDtfsCounter, 151 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 64 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-04-15 11:48:09,162 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 366 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 481 Invalid, 1 Unknown, 0 Unchecked, 2.9s Time] [2022-04-15 11:48:09,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2022-04-15 11:48:09,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 326. [2022-04-15 11:48:09,180 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:48:09,181 INFO L82 GeneralOperation]: Start isEquivalent. First operand 523 states. Second operand has 326 states, 321 states have (on average 1.5077881619937694) internal successors, (484), 321 states have internal predecessors, (484), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:09,181 INFO L74 IsIncluded]: Start isIncluded. First operand 523 states. Second operand has 326 states, 321 states have (on average 1.5077881619937694) internal successors, (484), 321 states have internal predecessors, (484), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:09,182 INFO L87 Difference]: Start difference. First operand 523 states. Second operand has 326 states, 321 states have (on average 1.5077881619937694) internal successors, (484), 321 states have internal predecessors, (484), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:09,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:09,196 INFO L93 Difference]: Finished difference Result 523 states and 790 transitions. [2022-04-15 11:48:09,196 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 790 transitions. [2022-04-15 11:48:09,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:48:09,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:48:09,197 INFO L74 IsIncluded]: Start isIncluded. First operand has 326 states, 321 states have (on average 1.5077881619937694) internal successors, (484), 321 states have internal predecessors, (484), 3 states have call successors, (3), 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 523 states. [2022-04-15 11:48:09,198 INFO L87 Difference]: Start difference. First operand has 326 states, 321 states have (on average 1.5077881619937694) internal successors, (484), 321 states have internal predecessors, (484), 3 states have call successors, (3), 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 523 states. [2022-04-15 11:48:09,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:09,212 INFO L93 Difference]: Finished difference Result 523 states and 790 transitions. [2022-04-15 11:48:09,213 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 790 transitions. [2022-04-15 11:48:09,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:48:09,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:48:09,214 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:48:09,214 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:48:09,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 321 states have (on average 1.5077881619937694) internal successors, (484), 321 states have internal predecessors, (484), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:09,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 488 transitions. [2022-04-15 11:48:09,222 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 488 transitions. Word has length 67 [2022-04-15 11:48:09,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:48:09,223 INFO L478 AbstractCegarLoop]: Abstraction has 326 states and 488 transitions. [2022-04-15 11:48:09,223 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-15 11:48:09,223 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 326 states and 488 transitions. [2022-04-15 11:48:10,301 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 488 edges. 488 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:48:10,301 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 488 transitions. [2022-04-15 11:48:10,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-15 11:48:10,302 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:48:10,302 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:48:10,302 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-15 11:48:10,302 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:48:10,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:48:10,303 INFO L85 PathProgramCache]: Analyzing trace with hash -699706350, now seen corresponding path program 1 times [2022-04-15 11:48:10,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:48:10,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [779593611] [2022-04-15 11:48:10,554 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-15 11:48:10,555 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 11:48:10,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1464347083, now seen corresponding path program 1 times [2022-04-15 11:48:10,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:48:10,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400567944] [2022-04-15 11:48:10,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:48:10,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:48:10,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:48:10,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:48:10,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:48:10,742 INFO L290 TraceCheckUtils]: 0: Hoare triple {19921#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {19915#true} is VALID [2022-04-15 11:48:10,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {19915#true} assume true; {19915#true} is VALID [2022-04-15 11:48:10,743 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19915#true} {19915#true} #708#return; {19915#true} is VALID [2022-04-15 11:48:10,744 INFO L272 TraceCheckUtils]: 0: Hoare triple {19915#true} call ULTIMATE.init(); {19921#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:48:10,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {19921#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {19915#true} is VALID [2022-04-15 11:48:10,744 INFO L290 TraceCheckUtils]: 2: Hoare triple {19915#true} assume true; {19915#true} is VALID [2022-04-15 11:48:10,744 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19915#true} {19915#true} #708#return; {19915#true} is VALID [2022-04-15 11:48:10,744 INFO L272 TraceCheckUtils]: 4: Hoare triple {19915#true} call #t~ret161 := main(); {19915#true} is VALID [2022-04-15 11:48:10,744 INFO L290 TraceCheckUtils]: 5: Hoare triple {19915#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; {19915#true} is VALID [2022-04-15 11:48:10,744 INFO L290 TraceCheckUtils]: 6: Hoare triple {19915#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {19915#true} is VALID [2022-04-15 11:48:10,744 INFO L272 TraceCheckUtils]: 7: Hoare triple {19915#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {19915#true} is VALID [2022-04-15 11:48:10,745 INFO L290 TraceCheckUtils]: 8: Hoare triple {19915#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); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:10,745 INFO L290 TraceCheckUtils]: 9: Hoare triple {19920#(= 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; {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:10,745 INFO L290 TraceCheckUtils]: 10: Hoare triple {19920#(= 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; {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:10,746 INFO L290 TraceCheckUtils]: 11: Hoare triple {19920#(= 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)))); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:10,746 INFO L290 TraceCheckUtils]: 12: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:10,746 INFO L290 TraceCheckUtils]: 13: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:10,747 INFO L290 TraceCheckUtils]: 14: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} [722] L1167-2-->L1168_primed: Formula: (let ((.cse0 (= |v_ssl3_accept_#t~mem82_42| |v_ssl3_accept_#t~mem82_40|)) (.cse1 (= |v_ssl3_accept_#t~mem83.offset_42| |v_ssl3_accept_#t~mem83.offset_40|)) (.cse2 (= |v_ssl3_accept_#t~mem150.offset_38| |v_ssl3_accept_#t~mem150.offset_36|)) (.cse3 (= |v_ssl3_accept_#t~mem46_28| |v_ssl3_accept_#t~mem46_27|)) (.cse4 (= |v_ssl3_accept_#t~mem88.base_25| |v_ssl3_accept_#t~mem88.base_24|)) (.cse5 (= |v_ssl3_accept_#t~mem50_10| |v_ssl3_accept_#t~mem50_8|)) (.cse6 (= |v_ssl3_accept_#t~mem89_25| |v_ssl3_accept_#t~mem89_24|)) (.cse7 (= |v_ssl3_accept_#t~mem83.base_42| |v_ssl3_accept_#t~mem83.base_40|)) (.cse8 (= |v_ssl3_accept_#t~mem48_42| |v_ssl3_accept_#t~mem48_40|)) (.cse9 (= |v_ssl3_accept_#t~mem47_44| |v_ssl3_accept_#t~mem47_42|)) (.cse10 (= v_ssl3_accept_~skip~0_38 v_ssl3_accept_~skip~0_37)) (.cse11 (= |v_ssl3_accept_#t~mem150.base_38| |v_ssl3_accept_#t~mem150.base_36|)) (.cse12 (= |v_ssl3_accept_#t~mem49_26| |v_ssl3_accept_#t~mem49_24|)) (.cse13 (= |v_ssl3_accept_#t~mem88.offset_25| |v_ssl3_accept_#t~mem88.offset_24|))) (or (and .cse0 .cse1 (= |v_#memory_$Pointer$.offset_372| |v_#memory_$Pointer$.offset_378|) .cse2 (= |v_ssl3_accept_#t~mem151_38| |v_ssl3_accept_#t~mem151_40|) .cse3 .cse4 (= |v_#memory_$Pointer$.base_372| |v_#memory_$Pointer$.base_378|) .cse5 .cse6 .cse7 (= v_ssl3_accept_~state~0_29 v_ssl3_accept_~state~0_30) (= |v_#memory_int_349| |v_#memory_int_354|) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= |v_ssl3_accept_#t~mem85_40| |v_ssl3_accept_#t~mem85_42|)) (and .cse0 .cse1 .cse2 (= |v_#memory_$Pointer$.offset_378| |v_#memory_$Pointer$.offset_372|) .cse3 .cse4 (= v_ssl3_accept_~state~0_30 v_ssl3_accept_~state~0_29) .cse5 .cse6 .cse7 .cse8 (= |v_#memory_int_354| |v_#memory_int_349|) (= |v_ssl3_accept_#t~mem151_40| |v_ssl3_accept_#t~mem151_38|) (= |v_#memory_$Pointer$.base_378| |v_#memory_$Pointer$.base_372|) .cse9 (= |v_ssl3_accept_#t~mem85_42| |v_ssl3_accept_#t~mem85_40|) .cse10 .cse11 .cse12 .cse13))) InVars {ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_42|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_378|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_42|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_42|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_40|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_38|, ssl3_accept_#t~mem50=|v_ssl3_accept_#t~mem50_10|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_25|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_42|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_26|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_42|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_38|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_44|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_28|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_38, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_25|, #memory_int=|v_#memory_int_354|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_25|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_378|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_30} OutVars{ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_40|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_372|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_40|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_40|, 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_8|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_24|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_40|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_24|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_40|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_36|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_42|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_27|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_37, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_24|, #memory_int=|v_#memory_int_349|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_24|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_372|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_29} 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] {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:10,747 INFO L290 TraceCheckUtils]: 15: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} [721] L1168_primed-->L1168: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:10,748 INFO L290 TraceCheckUtils]: 16: Hoare triple {19920#(= 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); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:10,748 INFO L290 TraceCheckUtils]: 17: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:10,748 INFO L290 TraceCheckUtils]: 18: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:10,749 INFO L290 TraceCheckUtils]: 19: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:10,749 INFO L290 TraceCheckUtils]: 20: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:10,749 INFO L290 TraceCheckUtils]: 21: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:10,750 INFO L290 TraceCheckUtils]: 22: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:10,750 INFO L290 TraceCheckUtils]: 23: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:10,750 INFO L290 TraceCheckUtils]: 24: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:10,751 INFO L290 TraceCheckUtils]: 25: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:10,751 INFO L290 TraceCheckUtils]: 26: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:10,751 INFO L290 TraceCheckUtils]: 27: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:10,752 INFO L290 TraceCheckUtils]: 28: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:10,752 INFO L290 TraceCheckUtils]: 29: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:10,752 INFO L290 TraceCheckUtils]: 30: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:10,753 INFO L290 TraceCheckUtils]: 31: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:10,753 INFO L290 TraceCheckUtils]: 32: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:10,754 INFO L290 TraceCheckUtils]: 33: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:10,754 INFO L290 TraceCheckUtils]: 34: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:10,754 INFO L290 TraceCheckUtils]: 35: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:10,755 INFO L290 TraceCheckUtils]: 36: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:10,755 INFO L290 TraceCheckUtils]: 37: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:10,755 INFO L290 TraceCheckUtils]: 38: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:10,756 INFO L290 TraceCheckUtils]: 39: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:10,756 INFO L290 TraceCheckUtils]: 40: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:10,756 INFO L290 TraceCheckUtils]: 41: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:10,757 INFO L290 TraceCheckUtils]: 42: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:10,757 INFO L290 TraceCheckUtils]: 43: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:10,757 INFO L290 TraceCheckUtils]: 44: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:10,758 INFO L290 TraceCheckUtils]: 45: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume 8640 == #t~mem75;havoc #t~mem75; {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:10,758 INFO L290 TraceCheckUtils]: 46: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:10,758 INFO L290 TraceCheckUtils]: 47: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(4 == ~blastFlag~0); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:10,759 INFO L290 TraceCheckUtils]: 48: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(7 == ~blastFlag~0); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:10,759 INFO L290 TraceCheckUtils]: 49: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(10 == ~blastFlag~0); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:10,760 INFO L290 TraceCheckUtils]: 50: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume 13 == ~blastFlag~0; {19916#false} is VALID [2022-04-15 11:48:10,760 INFO L290 TraceCheckUtils]: 51: Hoare triple {19916#false} assume !false; {19916#false} is VALID [2022-04-15 11:48:10,760 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-15 11:48:10,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:48:10,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400567944] [2022-04-15 11:48:10,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400567944] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:48:10,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:48:10,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:48:15,537 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:48:15,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [779593611] [2022-04-15 11:48:15,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [779593611] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:48:15,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:48:15,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 11:48:15,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140545365] [2022-04-15 11:48:15,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:48:15,539 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.2) internal successors, (63), 14 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-15 11:48:15,539 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:48:15,539 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 4.2) internal successors, (63), 14 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-15 11:48:15,605 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-15 11:48:15,605 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 11:48:15,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:48:15,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 11:48:15,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=155, Unknown=1, NotChecked=0, Total=210 [2022-04-15 11:48:15,606 INFO L87 Difference]: Start difference. First operand 326 states and 488 transitions. Second operand has 15 states, 15 states have (on average 4.2) internal successors, (63), 14 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-15 11:48:19,064 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:48:21,092 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:48:24,150 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:48:30,322 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:48:33,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:33,978 INFO L93 Difference]: Finished difference Result 497 states and 749 transitions. [2022-04-15 11:48:33,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 11:48:33,979 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.2) internal successors, (63), 14 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-15 11:48:33,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:48:33,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 4.2) internal successors, (63), 14 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-15 11:48:33,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 456 transitions. [2022-04-15 11:48:33,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 4.2) internal successors, (63), 14 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-15 11:48:33,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 456 transitions. [2022-04-15 11:48:33,983 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 456 transitions. [2022-04-15 11:48:34,288 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 456 edges. 456 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:48:34,293 INFO L225 Difference]: With dead ends: 497 [2022-04-15 11:48:34,294 INFO L226 Difference]: Without dead ends: 337 [2022-04-15 11:48:34,294 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=54, Invalid=155, Unknown=1, NotChecked=0, Total=210 [2022-04-15 11:48:34,295 INFO L913 BasicCegarLoop]: 208 mSDtfsCounter, 9 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 1147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 411 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:48:34,295 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 992 Invalid, 1147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 732 Invalid, 2 Unknown, 411 Unchecked, 9.1s Time] [2022-04-15 11:48:34,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-04-15 11:48:34,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 328. [2022-04-15 11:48:34,312 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:48:34,313 INFO L82 GeneralOperation]: Start isEquivalent. First operand 337 states. Second operand has 328 states, 323 states have (on average 1.5077399380804954) internal successors, (487), 323 states have internal predecessors, (487), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:34,314 INFO L74 IsIncluded]: Start isIncluded. First operand 337 states. Second operand has 328 states, 323 states have (on average 1.5077399380804954) internal successors, (487), 323 states have internal predecessors, (487), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:34,314 INFO L87 Difference]: Start difference. First operand 337 states. Second operand has 328 states, 323 states have (on average 1.5077399380804954) internal successors, (487), 323 states have internal predecessors, (487), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:34,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:34,321 INFO L93 Difference]: Finished difference Result 337 states and 501 transitions. [2022-04-15 11:48:34,321 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 501 transitions. [2022-04-15 11:48:34,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:48:34,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:48:34,322 INFO L74 IsIncluded]: Start isIncluded. First operand has 328 states, 323 states have (on average 1.5077399380804954) internal successors, (487), 323 states have internal predecessors, (487), 3 states have call successors, (3), 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 337 states. [2022-04-15 11:48:34,323 INFO L87 Difference]: Start difference. First operand has 328 states, 323 states have (on average 1.5077399380804954) internal successors, (487), 323 states have internal predecessors, (487), 3 states have call successors, (3), 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 337 states. [2022-04-15 11:48:34,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:34,330 INFO L93 Difference]: Finished difference Result 337 states and 501 transitions. [2022-04-15 11:48:34,330 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 501 transitions. [2022-04-15 11:48:34,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:48:34,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:48:34,331 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:48:34,331 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:48:34,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 323 states have (on average 1.5077399380804954) internal successors, (487), 323 states have internal predecessors, (487), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:34,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 491 transitions. [2022-04-15 11:48:34,339 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 491 transitions. Word has length 67 [2022-04-15 11:48:34,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:48:34,340 INFO L478 AbstractCegarLoop]: Abstraction has 328 states and 491 transitions. [2022-04-15 11:48:34,340 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.2) internal successors, (63), 14 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-15 11:48:34,340 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 328 states and 491 transitions. [2022-04-15 11:48:36,280 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 491 edges. 491 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:48:36,280 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 491 transitions. [2022-04-15 11:48:36,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-15 11:48:36,281 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:48:36,281 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:48:36,281 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-15 11:48:36,282 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:48:36,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:48:36,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1228566352, now seen corresponding path program 1 times [2022-04-15 11:48:36,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:48:36,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [365592221] [2022-04-15 11:48:36,534 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-15 11:48:36,534 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 11:48:36,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1834174859, now seen corresponding path program 1 times [2022-04-15 11:48:36,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:48:36,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732068451] [2022-04-15 11:48:36,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:48:36,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:48:36,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:48:36,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:48:36,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:48:36,716 INFO L290 TraceCheckUtils]: 0: Hoare triple {22265#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {22259#true} is VALID [2022-04-15 11:48:36,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {22259#true} assume true; {22259#true} is VALID [2022-04-15 11:48:36,716 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22259#true} {22259#true} #708#return; {22259#true} is VALID [2022-04-15 11:48:36,717 INFO L272 TraceCheckUtils]: 0: Hoare triple {22259#true} call ULTIMATE.init(); {22265#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:48:36,717 INFO L290 TraceCheckUtils]: 1: Hoare triple {22265#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {22259#true} is VALID [2022-04-15 11:48:36,717 INFO L290 TraceCheckUtils]: 2: Hoare triple {22259#true} assume true; {22259#true} is VALID [2022-04-15 11:48:36,718 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22259#true} {22259#true} #708#return; {22259#true} is VALID [2022-04-15 11:48:36,718 INFO L272 TraceCheckUtils]: 4: Hoare triple {22259#true} call #t~ret161 := main(); {22259#true} is VALID [2022-04-15 11:48:36,718 INFO L290 TraceCheckUtils]: 5: Hoare triple {22259#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; {22259#true} is VALID [2022-04-15 11:48:36,718 INFO L290 TraceCheckUtils]: 6: Hoare triple {22259#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {22259#true} is VALID [2022-04-15 11:48:36,718 INFO L272 TraceCheckUtils]: 7: Hoare triple {22259#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {22259#true} is VALID [2022-04-15 11:48:36,718 INFO L290 TraceCheckUtils]: 8: Hoare triple {22259#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); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:36,719 INFO L290 TraceCheckUtils]: 9: Hoare triple {22264#(= 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; {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:36,719 INFO L290 TraceCheckUtils]: 10: Hoare triple {22264#(= 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; {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:36,719 INFO L290 TraceCheckUtils]: 11: Hoare triple {22264#(= 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)))); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:36,720 INFO L290 TraceCheckUtils]: 12: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:36,720 INFO L290 TraceCheckUtils]: 13: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:36,721 INFO L290 TraceCheckUtils]: 14: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} [724] L1167-2-->L1168_primed: Formula: (let ((.cse0 (= |v_ssl3_accept_#t~mem88.offset_30| |v_ssl3_accept_#t~mem88.offset_29|)) (.cse1 (= |v_ssl3_accept_#t~mem82_49| |v_ssl3_accept_#t~mem82_47|)) (.cse2 (= |v_ssl3_accept_#t~mem150.base_44| |v_ssl3_accept_#t~mem150.base_42|)) (.cse3 (= |v_ssl3_accept_#t~mem85_49| |v_ssl3_accept_#t~mem85_47|)) (.cse4 (= |v_ssl3_accept_#t~mem88.base_30| |v_ssl3_accept_#t~mem88.base_29|)) (.cse5 (= |v_ssl3_accept_#t~mem46_33| |v_ssl3_accept_#t~mem46_32|)) (.cse6 (= |v_ssl3_accept_#t~mem150.offset_44| |v_ssl3_accept_#t~mem150.offset_42|)) (.cse7 (= v_ssl3_accept_~state~0_35 v_ssl3_accept_~state~0_34)) (.cse8 (= |v_ssl3_accept_#t~mem49_33| |v_ssl3_accept_#t~mem49_31|)) (.cse9 (= |v_ssl3_accept_#t~mem151_46| |v_ssl3_accept_#t~mem151_44|)) (.cse10 (= |v_ssl3_accept_#t~mem50_17| |v_ssl3_accept_#t~mem50_15|)) (.cse11 (= |v_ssl3_accept_#t~mem83.offset_49| |v_ssl3_accept_#t~mem83.offset_47|)) (.cse12 (= v_ssl3_accept_~skip~0_43 v_ssl3_accept_~skip~0_42))) (or (and (= |v_ssl3_accept_#t~mem48_49| |v_ssl3_accept_#t~mem48_47|) .cse0 .cse1 .cse2 .cse3 (= |v_ssl3_accept_#t~mem89_30| |v_ssl3_accept_#t~mem89_29|) .cse4 .cse5 .cse6 (= |v_#memory_int_373| |v_#memory_int_368|) .cse7 .cse8 .cse9 (= |v_#memory_$Pointer$.offset_398| |v_#memory_$Pointer$.offset_392|) (= |v_#memory_$Pointer$.base_398| |v_#memory_$Pointer$.base_392|) .cse10 (= |v_ssl3_accept_#t~mem83.base_49| |v_ssl3_accept_#t~mem83.base_47|) (= |v_ssl3_accept_#t~mem47_51| |v_ssl3_accept_#t~mem47_49|) .cse11 .cse12) (and (= |v_ssl3_accept_#t~mem89_29| |v_ssl3_accept_#t~mem89_30|) (= |v_#memory_int_368| |v_#memory_int_373|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |v_ssl3_accept_#t~mem83.base_47| |v_ssl3_accept_#t~mem83.base_49|) (= |v_#memory_$Pointer$.offset_392| |v_#memory_$Pointer$.offset_398|) .cse6 .cse7 .cse8 .cse9 .cse10 (= |v_#memory_$Pointer$.base_392| |v_#memory_$Pointer$.base_398|) (= |v_ssl3_accept_#t~mem47_49| |v_ssl3_accept_#t~mem47_51|) .cse11 (= |v_ssl3_accept_#t~mem48_47| |v_ssl3_accept_#t~mem48_49|) .cse12))) InVars {ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_49|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_398|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_49|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_49|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_46|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_44|, ssl3_accept_#t~mem50=|v_ssl3_accept_#t~mem50_17|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_30|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_49|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_33|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_49|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_44|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_51|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_33|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_43, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_30|, #memory_int=|v_#memory_int_373|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_30|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_398|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_35} OutVars{ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_47|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_392|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_47|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_47|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_44|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_42|, ssl3_accept_#t~mem50=|v_ssl3_accept_#t~mem50_15|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_29|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_47|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_31|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_47|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_42|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_49|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_32|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_42, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_29|, #memory_int=|v_#memory_int_368|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_29|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_392|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_34} 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] {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:36,721 INFO L290 TraceCheckUtils]: 15: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} [723] L1168_primed-->L1168: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:36,721 INFO L290 TraceCheckUtils]: 16: Hoare triple {22264#(= 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); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:36,722 INFO L290 TraceCheckUtils]: 17: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:36,722 INFO L290 TraceCheckUtils]: 18: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:36,722 INFO L290 TraceCheckUtils]: 19: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:36,723 INFO L290 TraceCheckUtils]: 20: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:36,723 INFO L290 TraceCheckUtils]: 21: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:36,724 INFO L290 TraceCheckUtils]: 22: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:36,724 INFO L290 TraceCheckUtils]: 23: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:36,724 INFO L290 TraceCheckUtils]: 24: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:36,725 INFO L290 TraceCheckUtils]: 25: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:36,725 INFO L290 TraceCheckUtils]: 26: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:36,725 INFO L290 TraceCheckUtils]: 27: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:36,726 INFO L290 TraceCheckUtils]: 28: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:36,726 INFO L290 TraceCheckUtils]: 29: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:36,726 INFO L290 TraceCheckUtils]: 30: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:36,727 INFO L290 TraceCheckUtils]: 31: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:36,727 INFO L290 TraceCheckUtils]: 32: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:36,727 INFO L290 TraceCheckUtils]: 33: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:36,728 INFO L290 TraceCheckUtils]: 34: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:36,728 INFO L290 TraceCheckUtils]: 35: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:36,728 INFO L290 TraceCheckUtils]: 36: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:36,729 INFO L290 TraceCheckUtils]: 37: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:36,729 INFO L290 TraceCheckUtils]: 38: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:36,730 INFO L290 TraceCheckUtils]: 39: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:36,730 INFO L290 TraceCheckUtils]: 40: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:36,730 INFO L290 TraceCheckUtils]: 41: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:36,731 INFO L290 TraceCheckUtils]: 42: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:36,731 INFO L290 TraceCheckUtils]: 43: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:36,731 INFO L290 TraceCheckUtils]: 44: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:36,732 INFO L290 TraceCheckUtils]: 45: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume 8640 == #t~mem75;havoc #t~mem75; {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:36,732 INFO L290 TraceCheckUtils]: 46: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:36,732 INFO L290 TraceCheckUtils]: 47: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(4 == ~blastFlag~0); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:36,733 INFO L290 TraceCheckUtils]: 48: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(7 == ~blastFlag~0); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:36,733 INFO L290 TraceCheckUtils]: 49: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(10 == ~blastFlag~0); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:48:36,733 INFO L290 TraceCheckUtils]: 50: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume 13 == ~blastFlag~0; {22260#false} is VALID [2022-04-15 11:48:36,734 INFO L290 TraceCheckUtils]: 51: Hoare triple {22260#false} assume !false; {22260#false} is VALID [2022-04-15 11:48:36,734 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-15 11:48:36,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:48:36,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732068451] [2022-04-15 11:48:36,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732068451] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:48:36,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:48:36,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:48:40,804 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:48:40,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [365592221] [2022-04-15 11:48:40,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [365592221] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:48:40,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:48:40,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 11:48:40,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025458293] [2022-04-15 11:48:40,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:48:40,805 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.2) internal successors, (63), 14 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-15 11:48:40,805 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:48:40,805 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 4.2) internal successors, (63), 14 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-15 11:48:40,871 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-15 11:48:40,871 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 11:48:40,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:48:40,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 11:48:40,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=155, Unknown=1, NotChecked=0, Total=210 [2022-04-15 11:48:40,872 INFO L87 Difference]: Start difference. First operand 328 states and 491 transitions. Second operand has 15 states, 15 states have (on average 4.2) internal successors, (63), 14 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-15 11:48:44,293 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:48:45,925 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:48:48,726 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:48:54,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:54,574 INFO L93 Difference]: Finished difference Result 498 states and 750 transitions. [2022-04-15 11:48:54,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 11:48:54,574 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.2) internal successors, (63), 14 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-15 11:48:54,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:48:54,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 4.2) internal successors, (63), 14 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-15 11:48:54,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 457 transitions. [2022-04-15 11:48:54,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 4.2) internal successors, (63), 14 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-15 11:48:54,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 457 transitions. [2022-04-15 11:48:54,580 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 457 transitions. [2022-04-15 11:48:54,906 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 457 edges. 457 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:48:54,911 INFO L225 Difference]: With dead ends: 498 [2022-04-15 11:48:54,911 INFO L226 Difference]: Without dead ends: 338 [2022-04-15 11:48:54,911 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=54, Invalid=155, Unknown=1, NotChecked=0, Total=210 [2022-04-15 11:48:54,912 INFO L913 BasicCegarLoop]: 213 mSDtfsCounter, 10 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 305 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-04-15 11:48:54,912 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 860 Invalid, 938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 630 Invalid, 0 Unknown, 305 Unchecked, 5.9s Time] [2022-04-15 11:48:54,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2022-04-15 11:48:54,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 326. [2022-04-15 11:48:54,928 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:48:54,929 INFO L82 GeneralOperation]: Start isEquivalent. First operand 338 states. Second operand has 326 states, 321 states have (on average 1.5077881619937694) internal successors, (484), 321 states have internal predecessors, (484), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:54,930 INFO L74 IsIncluded]: Start isIncluded. First operand 338 states. Second operand has 326 states, 321 states have (on average 1.5077881619937694) internal successors, (484), 321 states have internal predecessors, (484), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:54,930 INFO L87 Difference]: Start difference. First operand 338 states. Second operand has 326 states, 321 states have (on average 1.5077881619937694) internal successors, (484), 321 states have internal predecessors, (484), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:54,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:54,937 INFO L93 Difference]: Finished difference Result 338 states and 502 transitions. [2022-04-15 11:48:54,937 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 502 transitions. [2022-04-15 11:48:54,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:48:54,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:48:54,938 INFO L74 IsIncluded]: Start isIncluded. First operand has 326 states, 321 states have (on average 1.5077881619937694) internal successors, (484), 321 states have internal predecessors, (484), 3 states have call successors, (3), 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 338 states. [2022-04-15 11:48:54,938 INFO L87 Difference]: Start difference. First operand has 326 states, 321 states have (on average 1.5077881619937694) internal successors, (484), 321 states have internal predecessors, (484), 3 states have call successors, (3), 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 338 states. [2022-04-15 11:48:54,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:54,945 INFO L93 Difference]: Finished difference Result 338 states and 502 transitions. [2022-04-15 11:48:54,945 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 502 transitions. [2022-04-15 11:48:54,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:48:54,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:48:54,946 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:48:54,946 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:48:54,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 321 states have (on average 1.5077881619937694) internal successors, (484), 321 states have internal predecessors, (484), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:54,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 488 transitions. [2022-04-15 11:48:54,955 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 488 transitions. Word has length 67 [2022-04-15 11:48:54,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:48:54,962 INFO L478 AbstractCegarLoop]: Abstraction has 326 states and 488 transitions. [2022-04-15 11:48:54,962 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.2) internal successors, (63), 14 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-15 11:48:54,962 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 326 states and 488 transitions. [2022-04-15 11:48:57,524 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 488 edges. 487 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:48:57,524 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 488 transitions. [2022-04-15 11:48:57,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-15 11:48:57,525 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:48:57,525 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:48:57,526 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-15 11:48:57,526 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:48:57,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:48:57,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1333693539, now seen corresponding path program 1 times [2022-04-15 11:48:57,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:48:57,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [875633115] [2022-04-15 11:48:57,555 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:48:57,555 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:48:57,556 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:48:57,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1333693539, now seen corresponding path program 2 times [2022-04-15 11:48:57,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:48:57,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923764009] [2022-04-15 11:48:57,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:48:57,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:48:57,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:48:57,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:48:57,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:48:57,748 INFO L290 TraceCheckUtils]: 0: Hoare triple {24610#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {24603#true} is VALID [2022-04-15 11:48:57,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {24603#true} assume true; {24603#true} is VALID [2022-04-15 11:48:57,748 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24603#true} {24603#true} #708#return; {24603#true} is VALID [2022-04-15 11:48:57,749 INFO L272 TraceCheckUtils]: 0: Hoare triple {24603#true} call ULTIMATE.init(); {24610#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:48:57,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {24610#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {24603#true} is VALID [2022-04-15 11:48:57,750 INFO L290 TraceCheckUtils]: 2: Hoare triple {24603#true} assume true; {24603#true} is VALID [2022-04-15 11:48:57,750 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24603#true} {24603#true} #708#return; {24603#true} is VALID [2022-04-15 11:48:57,750 INFO L272 TraceCheckUtils]: 4: Hoare triple {24603#true} call #t~ret161 := main(); {24603#true} is VALID [2022-04-15 11:48:57,750 INFO L290 TraceCheckUtils]: 5: Hoare triple {24603#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; {24603#true} is VALID [2022-04-15 11:48:57,750 INFO L290 TraceCheckUtils]: 6: Hoare triple {24603#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {24603#true} is VALID [2022-04-15 11:48:57,750 INFO L272 TraceCheckUtils]: 7: Hoare triple {24603#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {24603#true} is VALID [2022-04-15 11:48:57,753 INFO L290 TraceCheckUtils]: 8: Hoare triple {24603#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); {24608#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:57,754 INFO L290 TraceCheckUtils]: 9: Hoare triple {24608#(= 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; {24608#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:57,755 INFO L290 TraceCheckUtils]: 10: Hoare triple {24608#(= 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; {24608#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:57,756 INFO L290 TraceCheckUtils]: 11: Hoare triple {24608#(= 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)))); {24608#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:57,756 INFO L290 TraceCheckUtils]: 12: Hoare triple {24608#(= 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); {24608#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:57,757 INFO L290 TraceCheckUtils]: 13: Hoare triple {24608#(= 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; {24608#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:57,757 INFO L290 TraceCheckUtils]: 14: Hoare triple {24608#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {24608#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:57,757 INFO L290 TraceCheckUtils]: 15: Hoare triple {24608#(= 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); {24608#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:57,758 INFO L290 TraceCheckUtils]: 16: Hoare triple {24608#(= 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); {24608#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:57,758 INFO L290 TraceCheckUtils]: 17: Hoare triple {24608#(= 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); {24608#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:57,759 INFO L290 TraceCheckUtils]: 18: Hoare triple {24608#(= 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); {24609#(= 8464 |ssl3_accept_#t~mem50|)} is VALID [2022-04-15 11:48:57,759 INFO L290 TraceCheckUtils]: 19: Hoare triple {24609#(= 8464 |ssl3_accept_#t~mem50|)} assume 24576 == #t~mem50;havoc #t~mem50; {24604#false} is VALID [2022-04-15 11:48:57,760 INFO L290 TraceCheckUtils]: 20: Hoare triple {24604#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {24604#false} is VALID [2022-04-15 11:48:57,760 INFO L290 TraceCheckUtils]: 21: Hoare triple {24604#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {24604#false} is VALID [2022-04-15 11:48:57,760 INFO L290 TraceCheckUtils]: 22: Hoare triple {24604#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {24604#false} is VALID [2022-04-15 11:48:57,760 INFO L290 TraceCheckUtils]: 23: Hoare triple {24604#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); {24604#false} is VALID [2022-04-15 11:48:57,760 INFO L290 TraceCheckUtils]: 24: Hoare triple {24604#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {24604#false} is VALID [2022-04-15 11:48:57,760 INFO L290 TraceCheckUtils]: 25: Hoare triple {24604#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); {24604#false} is VALID [2022-04-15 11:48:57,760 INFO L290 TraceCheckUtils]: 26: Hoare triple {24604#false} assume 12292 != #t~mem85;havoc #t~mem85; {24604#false} is VALID [2022-04-15 11:48:57,760 INFO L290 TraceCheckUtils]: 27: Hoare triple {24604#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; {24604#false} is VALID [2022-04-15 11:48:57,760 INFO L290 TraceCheckUtils]: 28: Hoare triple {24604#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); {24604#false} is VALID [2022-04-15 11:48:57,761 INFO L290 TraceCheckUtils]: 29: Hoare triple {24604#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {24604#false} is VALID [2022-04-15 11:48:57,761 INFO L290 TraceCheckUtils]: 30: Hoare triple {24604#false} ~skip~0 := 0; {24604#false} is VALID [2022-04-15 11:48:57,761 INFO L290 TraceCheckUtils]: 31: Hoare triple {24604#false} assume !false; {24604#false} is VALID [2022-04-15 11:48:57,761 INFO L290 TraceCheckUtils]: 32: Hoare triple {24604#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); {24604#false} is VALID [2022-04-15 11:48:57,761 INFO L290 TraceCheckUtils]: 33: Hoare triple {24604#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-15 11:48:57,761 INFO L290 TraceCheckUtils]: 34: Hoare triple {24604#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-15 11:48:57,761 INFO L290 TraceCheckUtils]: 35: Hoare triple {24604#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-15 11:48:57,761 INFO L290 TraceCheckUtils]: 36: Hoare triple {24604#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-15 11:48:57,761 INFO L290 TraceCheckUtils]: 37: Hoare triple {24604#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-15 11:48:57,761 INFO L290 TraceCheckUtils]: 38: Hoare triple {24604#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-15 11:48:57,762 INFO L290 TraceCheckUtils]: 39: Hoare triple {24604#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-15 11:48:57,762 INFO L290 TraceCheckUtils]: 40: Hoare triple {24604#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-15 11:48:57,762 INFO L290 TraceCheckUtils]: 41: Hoare triple {24604#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-15 11:48:57,762 INFO L290 TraceCheckUtils]: 42: Hoare triple {24604#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-15 11:48:57,762 INFO L290 TraceCheckUtils]: 43: Hoare triple {24604#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-15 11:48:57,762 INFO L290 TraceCheckUtils]: 44: Hoare triple {24604#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-15 11:48:57,762 INFO L290 TraceCheckUtils]: 45: Hoare triple {24604#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-15 11:48:57,762 INFO L290 TraceCheckUtils]: 46: Hoare triple {24604#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-15 11:48:57,763 INFO L290 TraceCheckUtils]: 47: Hoare triple {24604#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-15 11:48:57,763 INFO L290 TraceCheckUtils]: 48: Hoare triple {24604#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-15 11:48:57,763 INFO L290 TraceCheckUtils]: 49: Hoare triple {24604#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-15 11:48:57,763 INFO L290 TraceCheckUtils]: 50: Hoare triple {24604#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-15 11:48:57,763 INFO L290 TraceCheckUtils]: 51: Hoare triple {24604#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-15 11:48:57,763 INFO L290 TraceCheckUtils]: 52: Hoare triple {24604#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-15 11:48:57,763 INFO L290 TraceCheckUtils]: 53: Hoare triple {24604#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-15 11:48:57,763 INFO L290 TraceCheckUtils]: 54: Hoare triple {24604#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-15 11:48:57,763 INFO L290 TraceCheckUtils]: 55: Hoare triple {24604#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-15 11:48:57,764 INFO L290 TraceCheckUtils]: 56: Hoare triple {24604#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-15 11:48:57,764 INFO L290 TraceCheckUtils]: 57: Hoare triple {24604#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-15 11:48:57,764 INFO L290 TraceCheckUtils]: 58: Hoare triple {24604#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-15 11:48:57,764 INFO L290 TraceCheckUtils]: 59: Hoare triple {24604#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-15 11:48:57,764 INFO L290 TraceCheckUtils]: 60: Hoare triple {24604#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-15 11:48:57,764 INFO L290 TraceCheckUtils]: 61: Hoare triple {24604#false} assume 8640 == #t~mem75;havoc #t~mem75; {24604#false} is VALID [2022-04-15 11:48:57,764 INFO L290 TraceCheckUtils]: 62: Hoare triple {24604#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {24604#false} is VALID [2022-04-15 11:48:57,764 INFO L290 TraceCheckUtils]: 63: Hoare triple {24604#false} assume !(4 == ~blastFlag~0); {24604#false} is VALID [2022-04-15 11:48:57,765 INFO L290 TraceCheckUtils]: 64: Hoare triple {24604#false} assume !(7 == ~blastFlag~0); {24604#false} is VALID [2022-04-15 11:48:57,765 INFO L290 TraceCheckUtils]: 65: Hoare triple {24604#false} assume !(10 == ~blastFlag~0); {24604#false} is VALID [2022-04-15 11:48:57,765 INFO L290 TraceCheckUtils]: 66: Hoare triple {24604#false} assume 13 == ~blastFlag~0; {24604#false} is VALID [2022-04-15 11:48:57,765 INFO L290 TraceCheckUtils]: 67: Hoare triple {24604#false} assume !false; {24604#false} is VALID [2022-04-15 11:48:57,765 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:48:57,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:48:57,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923764009] [2022-04-15 11:48:57,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923764009] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:48:57,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:48:57,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:48:57,766 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:48:57,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [875633115] [2022-04-15 11:48:57,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [875633115] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:48:57,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:48:57,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:48:57,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586102626] [2022-04-15 11:48:57,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:48:57,767 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-15 11:48:57,767 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:48:57,767 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:57,831 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:48:57,831 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:48:57,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:48:57,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:48:57,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:48:57,832 INFO L87 Difference]: Start difference. First operand 326 states and 488 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:05,068 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-15 11:49:10,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:49:10,708 INFO L93 Difference]: Finished difference Result 509 states and 763 transitions. [2022-04-15 11:49:10,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:49:10,708 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-15 11:49:10,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:49:10,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:10,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 461 transitions. [2022-04-15 11:49:10,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:10,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 461 transitions. [2022-04-15 11:49:10,713 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 461 transitions. [2022-04-15 11:49:11,033 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-15 11:49:11,040 INFO L225 Difference]: With dead ends: 509 [2022-04-15 11:49:11,040 INFO L226 Difference]: Without dead ends: 342 [2022-04-15 11:49:11,041 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-15 11:49:11,042 INFO L913 BasicCegarLoop]: 196 mSDtfsCounter, 21 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:49:11,043 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 509 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-04-15 11:49:11,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2022-04-15 11:49:11,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 326. [2022-04-15 11:49:11,060 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:49:11,061 INFO L82 GeneralOperation]: Start isEquivalent. First operand 342 states. Second operand has 326 states, 321 states have (on average 1.5046728971962617) internal successors, (483), 321 states have internal predecessors, (483), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:11,061 INFO L74 IsIncluded]: Start isIncluded. First operand 342 states. Second operand has 326 states, 321 states have (on average 1.5046728971962617) internal successors, (483), 321 states have internal predecessors, (483), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:11,062 INFO L87 Difference]: Start difference. First operand 342 states. Second operand has 326 states, 321 states have (on average 1.5046728971962617) internal successors, (483), 321 states have internal predecessors, (483), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:11,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:49:11,069 INFO L93 Difference]: Finished difference Result 342 states and 506 transitions. [2022-04-15 11:49:11,069 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 506 transitions. [2022-04-15 11:49:11,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:49:11,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:49:11,070 INFO L74 IsIncluded]: Start isIncluded. First operand has 326 states, 321 states have (on average 1.5046728971962617) internal successors, (483), 321 states have internal predecessors, (483), 3 states have call successors, (3), 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 342 states. [2022-04-15 11:49:11,072 INFO L87 Difference]: Start difference. First operand has 326 states, 321 states have (on average 1.5046728971962617) internal successors, (483), 321 states have internal predecessors, (483), 3 states have call successors, (3), 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 342 states. [2022-04-15 11:49:11,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:49:11,079 INFO L93 Difference]: Finished difference Result 342 states and 506 transitions. [2022-04-15 11:49:11,079 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 506 transitions. [2022-04-15 11:49:11,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:49:11,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:49:11,080 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:49:11,080 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:49:11,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 321 states have (on average 1.5046728971962617) internal successors, (483), 321 states have internal predecessors, (483), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:11,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 487 transitions. [2022-04-15 11:49:11,088 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 487 transitions. Word has length 68 [2022-04-15 11:49:11,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:49:11,089 INFO L478 AbstractCegarLoop]: Abstraction has 326 states and 487 transitions. [2022-04-15 11:49:11,089 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:11,089 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 326 states and 487 transitions. [2022-04-15 11:49:13,671 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 487 edges. 486 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:49:13,672 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 487 transitions. [2022-04-15 11:49:13,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-15 11:49:13,673 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:49:13,673 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:49:13,673 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-15 11:49:13,673 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:49:13,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:49:13,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1680521453, now seen corresponding path program 1 times [2022-04-15 11:49:13,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:49:13,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [69334779] [2022-04-15 11:49:13,981 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-15 11:49:13,981 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 11:49:13,981 INFO L85 PathProgramCache]: Analyzing trace with hash 2090964661, now seen corresponding path program 1 times [2022-04-15 11:49:13,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:49:13,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271425666] [2022-04-15 11:49:13,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:49:13,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:49:14,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:49:14,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:49:14,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:49:14,138 INFO L290 TraceCheckUtils]: 0: Hoare triple {26975#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {26969#true} is VALID [2022-04-15 11:49:14,138 INFO L290 TraceCheckUtils]: 1: Hoare triple {26969#true} assume true; {26969#true} is VALID [2022-04-15 11:49:14,138 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26969#true} {26969#true} #708#return; {26969#true} is VALID [2022-04-15 11:49:14,139 INFO L272 TraceCheckUtils]: 0: Hoare triple {26969#true} call ULTIMATE.init(); {26975#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:49:14,139 INFO L290 TraceCheckUtils]: 1: Hoare triple {26975#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {26969#true} is VALID [2022-04-15 11:49:14,140 INFO L290 TraceCheckUtils]: 2: Hoare triple {26969#true} assume true; {26969#true} is VALID [2022-04-15 11:49:14,140 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26969#true} {26969#true} #708#return; {26969#true} is VALID [2022-04-15 11:49:14,140 INFO L272 TraceCheckUtils]: 4: Hoare triple {26969#true} call #t~ret161 := main(); {26969#true} is VALID [2022-04-15 11:49:14,140 INFO L290 TraceCheckUtils]: 5: Hoare triple {26969#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; {26969#true} is VALID [2022-04-15 11:49:14,140 INFO L290 TraceCheckUtils]: 6: Hoare triple {26969#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {26969#true} is VALID [2022-04-15 11:49:14,140 INFO L272 TraceCheckUtils]: 7: Hoare triple {26969#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {26969#true} is VALID [2022-04-15 11:49:14,140 INFO L290 TraceCheckUtils]: 8: Hoare triple {26969#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); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:14,141 INFO L290 TraceCheckUtils]: 9: Hoare triple {26974#(= 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; {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:14,141 INFO L290 TraceCheckUtils]: 10: Hoare triple {26974#(= 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; {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:14,142 INFO L290 TraceCheckUtils]: 11: Hoare triple {26974#(= 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)))); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:14,142 INFO L290 TraceCheckUtils]: 12: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:14,142 INFO L290 TraceCheckUtils]: 13: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:14,143 INFO L290 TraceCheckUtils]: 14: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} [726] L1167-2-->L1168_primed: Formula: (let ((.cse0 (= |v_ssl3_accept_#t~mem47_60| |v_ssl3_accept_#t~mem47_58|)) (.cse1 (= v_ssl3_accept_~skip~0_49 v_ssl3_accept_~skip~0_48)) (.cse2 (= |v_ssl3_accept_#t~mem50_26| |v_ssl3_accept_#t~mem50_24|)) (.cse3 (= |v_ssl3_accept_#t~mem46_39| |v_ssl3_accept_#t~mem46_38|)) (.cse4 (= |v_ssl3_accept_#t~mem88.base_35| |v_ssl3_accept_#t~mem88.base_34|)) (.cse5 (= |v_ssl3_accept_#t~mem85_58| |v_ssl3_accept_#t~mem85_56|)) (.cse6 (= |v_ssl3_accept_#t~mem82_58| |v_ssl3_accept_#t~mem82_56|)) (.cse7 (= |v_ssl3_accept_#t~mem151_54| |v_ssl3_accept_#t~mem151_52|)) (.cse8 (= |v_ssl3_accept_#t~mem83.offset_58| |v_ssl3_accept_#t~mem83.offset_56|)) (.cse9 (= |v_ssl3_accept_#t~mem51_10| |v_ssl3_accept_#t~mem51_8|)) (.cse10 (= |v_ssl3_accept_#t~mem49_42| |v_ssl3_accept_#t~mem49_40|)) (.cse11 (= |v_ssl3_accept_#t~mem83.base_58| |v_ssl3_accept_#t~mem83.base_56|)) (.cse12 (= v_ssl3_accept_~state~0_41 v_ssl3_accept_~state~0_40)) (.cse13 (= |v_ssl3_accept_#t~mem150.offset_52| |v_ssl3_accept_#t~mem150.offset_50|)) (.cse14 (= |v_ssl3_accept_#t~mem48_58| |v_ssl3_accept_#t~mem48_56|)) (.cse15 (= |v_ssl3_accept_#t~mem150.base_52| |v_ssl3_accept_#t~mem150.base_50|))) (or (and .cse0 (= |v_ssl3_accept_#t~mem88.offset_35| |v_ssl3_accept_#t~mem88.offset_34|) (= |v_ssl3_accept_#t~mem89_35| |v_ssl3_accept_#t~mem89_34|) .cse1 .cse2 .cse3 .cse4 .cse5 (= |v_#memory_$Pointer$.base_439| |v_#memory_$Pointer$.base_433|) .cse6 (= |v_#memory_$Pointer$.offset_439| |v_#memory_$Pointer$.offset_433|) .cse7 .cse8 .cse9 .cse10 .cse11 (= |v_#memory_int_403| |v_#memory_int_398|) .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 (= |v_#memory_$Pointer$.offset_433| |v_#memory_$Pointer$.offset_439|) .cse4 (= |v_ssl3_accept_#t~mem89_34| |v_ssl3_accept_#t~mem89_35|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= |v_#memory_int_398| |v_#memory_int_403|) (= |v_ssl3_accept_#t~mem88.offset_34| |v_ssl3_accept_#t~mem88.offset_35|) .cse12 (= |v_#memory_$Pointer$.base_433| |v_#memory_$Pointer$.base_439|) .cse13 .cse14 .cse15))) InVars {ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_58|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_439|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_58|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_58|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_54|, ssl3_accept_#t~mem51=|v_ssl3_accept_#t~mem51_10|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_52|, ssl3_accept_#t~mem50=|v_ssl3_accept_#t~mem50_26|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_35|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_58|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_42|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_58|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_52|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_60|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_39|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_49, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_35|, #memory_int=|v_#memory_int_403|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_35|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_439|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_41} OutVars{ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_56|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_433|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_56|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_56|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_52|, ssl3_accept_#t~mem51=|v_ssl3_accept_#t~mem51_8|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_50|, ssl3_accept_#t~mem50=|v_ssl3_accept_#t~mem50_24|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_34|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_56|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_40|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_56|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_50|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_58|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_38|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_48, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_34|, #memory_int=|v_#memory_int_398|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_34|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_433|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_40} 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] {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:14,143 INFO L290 TraceCheckUtils]: 15: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} [725] L1168_primed-->L1168: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:14,143 INFO L290 TraceCheckUtils]: 16: Hoare triple {26974#(= 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); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:14,144 INFO L290 TraceCheckUtils]: 17: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:14,144 INFO L290 TraceCheckUtils]: 18: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:14,145 INFO L290 TraceCheckUtils]: 19: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:14,145 INFO L290 TraceCheckUtils]: 20: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:14,145 INFO L290 TraceCheckUtils]: 21: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:14,146 INFO L290 TraceCheckUtils]: 22: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:14,146 INFO L290 TraceCheckUtils]: 23: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:14,146 INFO L290 TraceCheckUtils]: 24: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:14,147 INFO L290 TraceCheckUtils]: 25: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:14,147 INFO L290 TraceCheckUtils]: 26: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:14,147 INFO L290 TraceCheckUtils]: 27: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:14,148 INFO L290 TraceCheckUtils]: 28: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:14,148 INFO L290 TraceCheckUtils]: 29: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:14,148 INFO L290 TraceCheckUtils]: 30: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:14,149 INFO L290 TraceCheckUtils]: 31: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:14,149 INFO L290 TraceCheckUtils]: 32: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:14,149 INFO L290 TraceCheckUtils]: 33: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:14,150 INFO L290 TraceCheckUtils]: 34: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:14,150 INFO L290 TraceCheckUtils]: 35: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:14,150 INFO L290 TraceCheckUtils]: 36: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:14,151 INFO L290 TraceCheckUtils]: 37: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:14,151 INFO L290 TraceCheckUtils]: 38: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:14,151 INFO L290 TraceCheckUtils]: 39: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:14,152 INFO L290 TraceCheckUtils]: 40: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:14,152 INFO L290 TraceCheckUtils]: 41: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:14,152 INFO L290 TraceCheckUtils]: 42: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:14,153 INFO L290 TraceCheckUtils]: 43: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:14,153 INFO L290 TraceCheckUtils]: 44: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:14,154 INFO L290 TraceCheckUtils]: 45: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume 8640 == #t~mem75;havoc #t~mem75; {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:14,154 INFO L290 TraceCheckUtils]: 46: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:14,154 INFO L290 TraceCheckUtils]: 47: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(4 == ~blastFlag~0); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:14,155 INFO L290 TraceCheckUtils]: 48: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(7 == ~blastFlag~0); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:14,155 INFO L290 TraceCheckUtils]: 49: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(10 == ~blastFlag~0); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:14,155 INFO L290 TraceCheckUtils]: 50: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume 13 == ~blastFlag~0; {26970#false} is VALID [2022-04-15 11:49:14,155 INFO L290 TraceCheckUtils]: 51: Hoare triple {26970#false} assume !false; {26970#false} is VALID [2022-04-15 11:49:14,156 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-15 11:49:14,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:49:14,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271425666] [2022-04-15 11:49:14,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271425666] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:49:14,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:49:14,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:49:18,123 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:49:18,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [69334779] [2022-04-15 11:49:18,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [69334779] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:49:18,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:49:18,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 11:49:18,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689029349] [2022-04-15 11:49:18,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:49:18,124 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.0) internal successors, (64), 15 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-15 11:49:18,124 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:49:18,124 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 4.0) internal successors, (64), 15 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:18,215 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:49:18,215 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 11:49:18,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:49:18,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 11:49:18,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=182, Unknown=1, NotChecked=0, Total=240 [2022-04-15 11:49:18,216 INFO L87 Difference]: Start difference. First operand 326 states and 487 transitions. Second operand has 16 states, 16 states have (on average 4.0) internal successors, (64), 15 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:22,173 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:49:25,958 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:49:44,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:49:44,394 INFO L93 Difference]: Finished difference Result 498 states and 750 transitions. [2022-04-15 11:49:44,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 11:49:44,394 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.0) internal successors, (64), 15 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-15 11:49:44,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:49:44,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 4.0) internal successors, (64), 15 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:44,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 617 transitions. [2022-04-15 11:49:44,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 4.0) internal successors, (64), 15 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:44,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 617 transitions. [2022-04-15 11:49:44,401 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 617 transitions. [2022-04-15 11:49:44,817 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 617 edges. 617 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:49:44,822 INFO L225 Difference]: With dead ends: 498 [2022-04-15 11:49:44,822 INFO L226 Difference]: Without dead ends: 338 [2022-04-15 11:49:44,823 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=57, Invalid=182, Unknown=1, NotChecked=0, Total=240 [2022-04-15 11:49:44,823 INFO L913 BasicCegarLoop]: 200 mSDtfsCounter, 143 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 1058 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 972 SdHoareTripleChecker+Invalid, 1219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 154 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:49:44,823 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 972 Invalid, 1219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1058 Invalid, 0 Unknown, 154 Unchecked, 9.1s Time] [2022-04-15 11:49:44,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2022-04-15 11:49:44,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 328. [2022-04-15 11:49:44,840 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:49:44,841 INFO L82 GeneralOperation]: Start isEquivalent. First operand 338 states. Second operand has 328 states, 323 states have (on average 1.5046439628482973) internal successors, (486), 323 states have internal predecessors, (486), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:44,841 INFO L74 IsIncluded]: Start isIncluded. First operand 338 states. Second operand has 328 states, 323 states have (on average 1.5046439628482973) internal successors, (486), 323 states have internal predecessors, (486), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:44,842 INFO L87 Difference]: Start difference. First operand 338 states. Second operand has 328 states, 323 states have (on average 1.5046439628482973) internal successors, (486), 323 states have internal predecessors, (486), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:44,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:49:44,848 INFO L93 Difference]: Finished difference Result 338 states and 502 transitions. [2022-04-15 11:49:44,848 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 502 transitions. [2022-04-15 11:49:44,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:49:44,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:49:44,849 INFO L74 IsIncluded]: Start isIncluded. First operand has 328 states, 323 states have (on average 1.5046439628482973) internal successors, (486), 323 states have internal predecessors, (486), 3 states have call successors, (3), 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 338 states. [2022-04-15 11:49:44,850 INFO L87 Difference]: Start difference. First operand has 328 states, 323 states have (on average 1.5046439628482973) internal successors, (486), 323 states have internal predecessors, (486), 3 states have call successors, (3), 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 338 states. [2022-04-15 11:49:44,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:49:44,856 INFO L93 Difference]: Finished difference Result 338 states and 502 transitions. [2022-04-15 11:49:44,856 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 502 transitions. [2022-04-15 11:49:44,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:49:44,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:49:44,857 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:49:44,857 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:49:44,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 323 states have (on average 1.5046439628482973) internal successors, (486), 323 states have internal predecessors, (486), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:44,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 490 transitions. [2022-04-15 11:49:44,865 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 490 transitions. Word has length 68 [2022-04-15 11:49:44,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:49:44,866 INFO L478 AbstractCegarLoop]: Abstraction has 328 states and 490 transitions. [2022-04-15 11:49:44,866 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.0) internal successors, (64), 15 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:44,866 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 328 states and 490 transitions. [2022-04-15 11:49:47,492 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 490 edges. 489 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:49:47,493 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 490 transitions. [2022-04-15 11:49:47,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-15 11:49:47,493 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:49:47,494 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:49:47,494 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-15 11:49:47,494 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:49:47,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:49:47,494 INFO L85 PathProgramCache]: Analyzing trace with hash -686173141, now seen corresponding path program 1 times [2022-04-15 11:49:47,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:49:47,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [979990264] [2022-04-15 11:49:47,809 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-15 11:49:47,809 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 11:49:47,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1721136885, now seen corresponding path program 1 times [2022-04-15 11:49:47,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:49:47,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908662814] [2022-04-15 11:49:47,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:49:47,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:49:47,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:49:47,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:49:47,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:49:47,970 INFO L290 TraceCheckUtils]: 0: Hoare triple {29324#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {29318#true} is VALID [2022-04-15 11:49:47,970 INFO L290 TraceCheckUtils]: 1: Hoare triple {29318#true} assume true; {29318#true} is VALID [2022-04-15 11:49:47,970 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29318#true} {29318#true} #708#return; {29318#true} is VALID [2022-04-15 11:49:47,971 INFO L272 TraceCheckUtils]: 0: Hoare triple {29318#true} call ULTIMATE.init(); {29324#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:49:47,971 INFO L290 TraceCheckUtils]: 1: Hoare triple {29324#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {29318#true} is VALID [2022-04-15 11:49:47,971 INFO L290 TraceCheckUtils]: 2: Hoare triple {29318#true} assume true; {29318#true} is VALID [2022-04-15 11:49:47,971 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29318#true} {29318#true} #708#return; {29318#true} is VALID [2022-04-15 11:49:47,971 INFO L272 TraceCheckUtils]: 4: Hoare triple {29318#true} call #t~ret161 := main(); {29318#true} is VALID [2022-04-15 11:49:47,971 INFO L290 TraceCheckUtils]: 5: Hoare triple {29318#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; {29318#true} is VALID [2022-04-15 11:49:47,971 INFO L290 TraceCheckUtils]: 6: Hoare triple {29318#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {29318#true} is VALID [2022-04-15 11:49:47,971 INFO L272 TraceCheckUtils]: 7: Hoare triple {29318#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {29318#true} is VALID [2022-04-15 11:49:47,972 INFO L290 TraceCheckUtils]: 8: Hoare triple {29318#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); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:47,972 INFO L290 TraceCheckUtils]: 9: Hoare triple {29323#(= 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; {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:47,972 INFO L290 TraceCheckUtils]: 10: Hoare triple {29323#(= 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; {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:47,972 INFO L290 TraceCheckUtils]: 11: Hoare triple {29323#(= 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)))); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:47,973 INFO L290 TraceCheckUtils]: 12: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:47,973 INFO L290 TraceCheckUtils]: 13: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:47,974 INFO L290 TraceCheckUtils]: 14: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} [728] L1167-2-->L1168_primed: Formula: (let ((.cse0 (= |v_ssl3_accept_#t~mem89_40| |v_ssl3_accept_#t~mem89_39|)) (.cse1 (= |v_ssl3_accept_#t~mem51_17| |v_ssl3_accept_#t~mem51_15|)) (.cse2 (= |v_#memory_int_422| |v_#memory_int_417|)) (.cse3 (= |v_ssl3_accept_#t~mem150.offset_58| |v_ssl3_accept_#t~mem150.offset_56|)) (.cse4 (= |v_ssl3_accept_#t~mem83.base_65| |v_ssl3_accept_#t~mem83.base_63|)) (.cse5 (= |v_ssl3_accept_#t~mem50_33| |v_ssl3_accept_#t~mem50_31|)) (.cse6 (= |v_ssl3_accept_#t~mem47_67| |v_ssl3_accept_#t~mem47_65|)) (.cse7 (= |v_ssl3_accept_#t~mem49_49| |v_ssl3_accept_#t~mem49_47|)) (.cse8 (= |v_ssl3_accept_#t~mem48_65| |v_ssl3_accept_#t~mem48_63|)) (.cse9 (= |v_ssl3_accept_#t~mem83.offset_65| |v_ssl3_accept_#t~mem83.offset_63|)) (.cse10 (= v_ssl3_accept_~state~0_46 v_ssl3_accept_~state~0_45)) (.cse11 (= |v_ssl3_accept_#t~mem150.base_58| |v_ssl3_accept_#t~mem150.base_56|)) (.cse12 (= v_ssl3_accept_~skip~0_54 v_ssl3_accept_~skip~0_53)) (.cse13 (= |v_ssl3_accept_#t~mem46_44| |v_ssl3_accept_#t~mem46_43|)) (.cse14 (= |v_ssl3_accept_#t~mem82_65| |v_ssl3_accept_#t~mem82_63|))) (or (and (= |v_#memory_$Pointer$.offset_453| |v_#memory_$Pointer$.offset_459|) (= |v_ssl3_accept_#t~mem88.offset_39| |v_ssl3_accept_#t~mem88.offset_40|) .cse0 (= |v_ssl3_accept_#t~mem85_63| |v_ssl3_accept_#t~mem85_65|) .cse1 (= |v_ssl3_accept_#t~mem88.base_39| |v_ssl3_accept_#t~mem88.base_40|) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= |v_ssl3_accept_#t~mem151_58| |v_ssl3_accept_#t~mem151_60|) .cse12 .cse13 .cse14 (= |v_#memory_$Pointer$.base_453| |v_#memory_$Pointer$.base_459|)) (and (= |v_ssl3_accept_#t~mem85_65| |v_ssl3_accept_#t~mem85_63|) (= |v_ssl3_accept_#t~mem151_60| |v_ssl3_accept_#t~mem151_58|) (= |v_ssl3_accept_#t~mem88.base_40| |v_ssl3_accept_#t~mem88.base_39|) .cse0 (= |v_#memory_$Pointer$.offset_459| |v_#memory_$Pointer$.offset_453|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= |v_ssl3_accept_#t~mem88.offset_40| |v_ssl3_accept_#t~mem88.offset_39|) .cse12 (= |v_#memory_$Pointer$.base_459| |v_#memory_$Pointer$.base_453|) .cse13 .cse14))) InVars {ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_65|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_459|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_65|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_65|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_60|, ssl3_accept_#t~mem51=|v_ssl3_accept_#t~mem51_17|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_58|, ssl3_accept_#t~mem50=|v_ssl3_accept_#t~mem50_33|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_40|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_65|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_49|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_65|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_58|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_67|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_44|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_54, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_40|, #memory_int=|v_#memory_int_422|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_40|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_459|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_46} OutVars{ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_63|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_453|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_63|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_63|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_58|, ssl3_accept_#t~mem51=|v_ssl3_accept_#t~mem51_15|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_56|, ssl3_accept_#t~mem50=|v_ssl3_accept_#t~mem50_31|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_39|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_63|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_47|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_63|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_56|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_65|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_43|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_53, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_39|, #memory_int=|v_#memory_int_417|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_39|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_453|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_45} 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] {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:47,974 INFO L290 TraceCheckUtils]: 15: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} [727] L1168_primed-->L1168: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:47,974 INFO L290 TraceCheckUtils]: 16: Hoare triple {29323#(= 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); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:47,975 INFO L290 TraceCheckUtils]: 17: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:47,975 INFO L290 TraceCheckUtils]: 18: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:47,975 INFO L290 TraceCheckUtils]: 19: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:47,976 INFO L290 TraceCheckUtils]: 20: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:47,976 INFO L290 TraceCheckUtils]: 21: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:47,977 INFO L290 TraceCheckUtils]: 22: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:47,977 INFO L290 TraceCheckUtils]: 23: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:47,977 INFO L290 TraceCheckUtils]: 24: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:47,978 INFO L290 TraceCheckUtils]: 25: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:47,978 INFO L290 TraceCheckUtils]: 26: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:47,978 INFO L290 TraceCheckUtils]: 27: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:47,979 INFO L290 TraceCheckUtils]: 28: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:47,979 INFO L290 TraceCheckUtils]: 29: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:47,979 INFO L290 TraceCheckUtils]: 30: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:47,980 INFO L290 TraceCheckUtils]: 31: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:47,980 INFO L290 TraceCheckUtils]: 32: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:47,980 INFO L290 TraceCheckUtils]: 33: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:47,981 INFO L290 TraceCheckUtils]: 34: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:47,981 INFO L290 TraceCheckUtils]: 35: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:47,982 INFO L290 TraceCheckUtils]: 36: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:47,982 INFO L290 TraceCheckUtils]: 37: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:47,982 INFO L290 TraceCheckUtils]: 38: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:47,983 INFO L290 TraceCheckUtils]: 39: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:47,983 INFO L290 TraceCheckUtils]: 40: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:47,983 INFO L290 TraceCheckUtils]: 41: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:47,983 INFO L290 TraceCheckUtils]: 42: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:47,984 INFO L290 TraceCheckUtils]: 43: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:47,984 INFO L290 TraceCheckUtils]: 44: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:47,984 INFO L290 TraceCheckUtils]: 45: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume 8640 == #t~mem75;havoc #t~mem75; {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:47,984 INFO L290 TraceCheckUtils]: 46: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:47,985 INFO L290 TraceCheckUtils]: 47: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(4 == ~blastFlag~0); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:47,985 INFO L290 TraceCheckUtils]: 48: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(7 == ~blastFlag~0); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:47,985 INFO L290 TraceCheckUtils]: 49: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(10 == ~blastFlag~0); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:49:47,986 INFO L290 TraceCheckUtils]: 50: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume 13 == ~blastFlag~0; {29319#false} is VALID [2022-04-15 11:49:47,986 INFO L290 TraceCheckUtils]: 51: Hoare triple {29319#false} assume !false; {29319#false} is VALID [2022-04-15 11:49:47,986 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-15 11:49:47,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:49:47,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908662814] [2022-04-15 11:49:47,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908662814] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:49:47,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:49:47,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:49:51,844 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:49:51,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [979990264] [2022-04-15 11:49:51,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [979990264] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:49:51,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:49:51,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 11:49:51,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658192417] [2022-04-15 11:49:51,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:49:51,846 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.0) internal successors, (64), 15 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-15 11:49:51,846 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:49:51,846 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 4.0) internal successors, (64), 15 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:51,927 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:49:51,927 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 11:49:51,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:49:51,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 11:49:51,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=182, Unknown=1, NotChecked=0, Total=240 [2022-04-15 11:49:51,928 INFO L87 Difference]: Start difference. First operand 328 states and 490 transitions. Second operand has 16 states, 16 states have (on average 4.0) internal successors, (64), 15 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:54,718 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:49:56,910 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-15 11:49:58,920 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-15 11:50:02,045 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:50:13,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:50:13,535 INFO L93 Difference]: Finished difference Result 665 states and 1008 transitions. [2022-04-15 11:50:13,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 11:50:13,535 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.0) internal successors, (64), 15 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-15 11:50:13,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:50:13,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 4.0) internal successors, (64), 15 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:13,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 649 transitions. [2022-04-15 11:50:13,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 4.0) internal successors, (64), 15 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:13,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 649 transitions. [2022-04-15 11:50:13,540 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 649 transitions. [2022-04-15 11:50:14,000 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 649 edges. 649 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:50:14,029 INFO L225 Difference]: With dead ends: 665 [2022-04-15 11:50:14,029 INFO L226 Difference]: Without dead ends: 505 [2022-04-15 11:50:14,029 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=57, Invalid=182, Unknown=1, NotChecked=0, Total=240 [2022-04-15 11:50:14,031 INFO L913 BasicCegarLoop]: 189 mSDtfsCounter, 159 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 1025 mSolverCounterSat, 26 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 977 SdHoareTripleChecker+Invalid, 1232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1025 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 180 IncrementalHoareTripleChecker+Unchecked, 9.7s IncrementalHoareTripleChecker+Time [2022-04-15 11:50:14,031 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [159 Valid, 977 Invalid, 1232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1025 Invalid, 1 Unknown, 180 Unchecked, 9.7s Time] [2022-04-15 11:50:14,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2022-04-15 11:50:14,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 483. [2022-04-15 11:50:14,054 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:50:14,055 INFO L82 GeneralOperation]: Start isEquivalent. First operand 505 states. Second operand has 483 states, 478 states have (on average 1.49581589958159) internal successors, (715), 478 states have internal predecessors, (715), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:14,055 INFO L74 IsIncluded]: Start isIncluded. First operand 505 states. Second operand has 483 states, 478 states have (on average 1.49581589958159) internal successors, (715), 478 states have internal predecessors, (715), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:14,056 INFO L87 Difference]: Start difference. First operand 505 states. Second operand has 483 states, 478 states have (on average 1.49581589958159) internal successors, (715), 478 states have internal predecessors, (715), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:14,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:50:14,069 INFO L93 Difference]: Finished difference Result 505 states and 746 transitions. [2022-04-15 11:50:14,069 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 746 transitions. [2022-04-15 11:50:14,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:50:14,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:50:14,071 INFO L74 IsIncluded]: Start isIncluded. First operand has 483 states, 478 states have (on average 1.49581589958159) internal successors, (715), 478 states have internal predecessors, (715), 3 states have call successors, (3), 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-15 11:50:14,071 INFO L87 Difference]: Start difference. First operand has 483 states, 478 states have (on average 1.49581589958159) internal successors, (715), 478 states have internal predecessors, (715), 3 states have call successors, (3), 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-15 11:50:14,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:50:14,084 INFO L93 Difference]: Finished difference Result 505 states and 746 transitions. [2022-04-15 11:50:14,084 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 746 transitions. [2022-04-15 11:50:14,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:50:14,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:50:14,085 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:50:14,085 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:50:14,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 478 states have (on average 1.49581589958159) internal successors, (715), 478 states have internal predecessors, (715), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:14,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 719 transitions. [2022-04-15 11:50:14,102 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 719 transitions. Word has length 68 [2022-04-15 11:50:14,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:50:14,103 INFO L478 AbstractCegarLoop]: Abstraction has 483 states and 719 transitions. [2022-04-15 11:50:14,103 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.0) internal successors, (64), 15 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:14,103 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 483 states and 719 transitions. [2022-04-15 11:50:17,073 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 719 edges. 718 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:50:17,074 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 719 transitions. [2022-04-15 11:50:17,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-15 11:50:17,075 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:50:17,075 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:50:17,075 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-15 11:50:17,075 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:50:17,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:50:17,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1132379676, now seen corresponding path program 1 times [2022-04-15 11:50:17,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:50:17,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1108650626] [2022-04-15 11:50:17,096 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:50:17,096 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:50:17,096 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:50:17,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1132379676, now seen corresponding path program 2 times [2022-04-15 11:50:17,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:50:17,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494986584] [2022-04-15 11:50:17,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:50:17,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:50:17,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:50:17,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:50:17,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:50:17,314 INFO L290 TraceCheckUtils]: 0: Hoare triple {32652#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {32645#true} is VALID [2022-04-15 11:50:17,314 INFO L290 TraceCheckUtils]: 1: Hoare triple {32645#true} assume true; {32645#true} is VALID [2022-04-15 11:50:17,314 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32645#true} {32645#true} #708#return; {32645#true} is VALID [2022-04-15 11:50:17,315 INFO L272 TraceCheckUtils]: 0: Hoare triple {32645#true} call ULTIMATE.init(); {32652#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:50:17,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {32652#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {32645#true} is VALID [2022-04-15 11:50:17,315 INFO L290 TraceCheckUtils]: 2: Hoare triple {32645#true} assume true; {32645#true} is VALID [2022-04-15 11:50:17,315 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32645#true} {32645#true} #708#return; {32645#true} is VALID [2022-04-15 11:50:17,315 INFO L272 TraceCheckUtils]: 4: Hoare triple {32645#true} call #t~ret161 := main(); {32645#true} is VALID [2022-04-15 11:50:17,315 INFO L290 TraceCheckUtils]: 5: Hoare triple {32645#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; {32645#true} is VALID [2022-04-15 11:50:17,315 INFO L290 TraceCheckUtils]: 6: Hoare triple {32645#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {32645#true} is VALID [2022-04-15 11:50:17,316 INFO L272 TraceCheckUtils]: 7: Hoare triple {32645#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {32645#true} is VALID [2022-04-15 11:50:17,316 INFO L290 TraceCheckUtils]: 8: Hoare triple {32645#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); {32645#true} is VALID [2022-04-15 11:50:17,316 INFO L290 TraceCheckUtils]: 9: Hoare triple {32645#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; {32645#true} is VALID [2022-04-15 11:50:17,316 INFO L290 TraceCheckUtils]: 10: Hoare triple {32645#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; {32645#true} is VALID [2022-04-15 11:50:17,316 INFO L290 TraceCheckUtils]: 11: Hoare triple {32645#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {32645#true} is VALID [2022-04-15 11:50:17,316 INFO L290 TraceCheckUtils]: 12: Hoare triple {32645#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {32645#true} is VALID [2022-04-15 11:50:17,316 INFO L290 TraceCheckUtils]: 13: Hoare triple {32645#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {32645#true} is VALID [2022-04-15 11:50:17,316 INFO L290 TraceCheckUtils]: 14: Hoare triple {32645#true} assume !false; {32645#true} is VALID [2022-04-15 11:50:17,316 INFO L290 TraceCheckUtils]: 15: Hoare triple {32645#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); {32645#true} is VALID [2022-04-15 11:50:17,317 INFO L290 TraceCheckUtils]: 16: Hoare triple {32645#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {32645#true} is VALID [2022-04-15 11:50:17,317 INFO L290 TraceCheckUtils]: 17: Hoare triple {32645#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {32645#true} is VALID [2022-04-15 11:50:17,317 INFO L290 TraceCheckUtils]: 18: Hoare triple {32645#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {32645#true} is VALID [2022-04-15 11:50:17,317 INFO L290 TraceCheckUtils]: 19: Hoare triple {32645#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {32645#true} is VALID [2022-04-15 11:50:17,317 INFO L290 TraceCheckUtils]: 20: Hoare triple {32645#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {32645#true} is VALID [2022-04-15 11:50:17,317 INFO L290 TraceCheckUtils]: 21: Hoare triple {32645#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {32645#true} is VALID [2022-04-15 11:50:17,317 INFO L290 TraceCheckUtils]: 22: Hoare triple {32645#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {32645#true} is VALID [2022-04-15 11:50:17,317 INFO L290 TraceCheckUtils]: 23: Hoare triple {32645#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {32645#true} is VALID [2022-04-15 11:50:17,317 INFO L290 TraceCheckUtils]: 24: Hoare triple {32645#true} assume 8464 == #t~mem55;havoc #t~mem55; {32645#true} is VALID [2022-04-15 11:50:17,318 INFO L290 TraceCheckUtils]: 25: Hoare triple {32645#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; {32645#true} is VALID [2022-04-15 11:50:17,319 INFO L290 TraceCheckUtils]: 26: Hoare triple {32645#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {32645#true} is VALID [2022-04-15 11:50:17,320 INFO L290 TraceCheckUtils]: 27: Hoare triple {32645#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); {32650#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:17,320 INFO L290 TraceCheckUtils]: 28: Hoare triple {32650#(= 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); {32650#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:17,321 INFO L290 TraceCheckUtils]: 29: Hoare triple {32650#(= 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; {32650#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:17,321 INFO L290 TraceCheckUtils]: 30: Hoare triple {32650#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {32650#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:17,322 INFO L290 TraceCheckUtils]: 31: Hoare triple {32650#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {32650#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:17,322 INFO L290 TraceCheckUtils]: 32: Hoare triple {32650#(= 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); {32650#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:17,323 INFO L290 TraceCheckUtils]: 33: Hoare triple {32650#(= 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); {32650#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:17,323 INFO L290 TraceCheckUtils]: 34: Hoare triple {32650#(= 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); {32650#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:17,324 INFO L290 TraceCheckUtils]: 35: Hoare triple {32650#(= 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); {32650#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:17,324 INFO L290 TraceCheckUtils]: 36: Hoare triple {32650#(= 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); {32650#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:17,324 INFO L290 TraceCheckUtils]: 37: Hoare triple {32650#(= 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); {32650#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:17,325 INFO L290 TraceCheckUtils]: 38: Hoare triple {32650#(= 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); {32650#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:17,325 INFO L290 TraceCheckUtils]: 39: Hoare triple {32650#(= 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); {32650#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:17,326 INFO L290 TraceCheckUtils]: 40: Hoare triple {32650#(= 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); {32650#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:17,326 INFO L290 TraceCheckUtils]: 41: Hoare triple {32650#(= 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); {32650#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:17,327 INFO L290 TraceCheckUtils]: 42: Hoare triple {32650#(= 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); {32650#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:17,327 INFO L290 TraceCheckUtils]: 43: Hoare triple {32650#(= 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); {32651#(= |ssl3_accept_#t~mem58| 8496)} is VALID [2022-04-15 11:50:17,328 INFO L290 TraceCheckUtils]: 44: Hoare triple {32651#(= |ssl3_accept_#t~mem58| 8496)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {32646#false} is VALID [2022-04-15 11:50:17,328 INFO L290 TraceCheckUtils]: 45: Hoare triple {32646#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {32646#false} is VALID [2022-04-15 11:50:17,328 INFO L290 TraceCheckUtils]: 46: Hoare triple {32646#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {32646#false} is VALID [2022-04-15 11:50:17,328 INFO L290 TraceCheckUtils]: 47: Hoare triple {32646#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {32646#false} is VALID [2022-04-15 11:50:17,328 INFO L290 TraceCheckUtils]: 48: Hoare triple {32646#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {32646#false} is VALID [2022-04-15 11:50:17,328 INFO L290 TraceCheckUtils]: 49: Hoare triple {32646#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {32646#false} is VALID [2022-04-15 11:50:17,328 INFO L290 TraceCheckUtils]: 50: Hoare triple {32646#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {32646#false} is VALID [2022-04-15 11:50:17,328 INFO L290 TraceCheckUtils]: 51: Hoare triple {32646#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {32646#false} is VALID [2022-04-15 11:50:17,329 INFO L290 TraceCheckUtils]: 52: Hoare triple {32646#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {32646#false} is VALID [2022-04-15 11:50:17,329 INFO L290 TraceCheckUtils]: 53: Hoare triple {32646#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {32646#false} is VALID [2022-04-15 11:50:17,329 INFO L290 TraceCheckUtils]: 54: Hoare triple {32646#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {32646#false} is VALID [2022-04-15 11:50:17,329 INFO L290 TraceCheckUtils]: 55: Hoare triple {32646#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {32646#false} is VALID [2022-04-15 11:50:17,329 INFO L290 TraceCheckUtils]: 56: Hoare triple {32646#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {32646#false} is VALID [2022-04-15 11:50:17,329 INFO L290 TraceCheckUtils]: 57: Hoare triple {32646#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {32646#false} is VALID [2022-04-15 11:50:17,329 INFO L290 TraceCheckUtils]: 58: Hoare triple {32646#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {32646#false} is VALID [2022-04-15 11:50:17,329 INFO L290 TraceCheckUtils]: 59: Hoare triple {32646#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {32646#false} is VALID [2022-04-15 11:50:17,329 INFO L290 TraceCheckUtils]: 60: Hoare triple {32646#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {32646#false} is VALID [2022-04-15 11:50:17,329 INFO L290 TraceCheckUtils]: 61: Hoare triple {32646#false} assume 8640 == #t~mem75;havoc #t~mem75; {32646#false} is VALID [2022-04-15 11:50:17,330 INFO L290 TraceCheckUtils]: 62: Hoare triple {32646#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {32646#false} is VALID [2022-04-15 11:50:17,330 INFO L290 TraceCheckUtils]: 63: Hoare triple {32646#false} assume !(4 == ~blastFlag~0); {32646#false} is VALID [2022-04-15 11:50:17,330 INFO L290 TraceCheckUtils]: 64: Hoare triple {32646#false} assume !(7 == ~blastFlag~0); {32646#false} is VALID [2022-04-15 11:50:17,330 INFO L290 TraceCheckUtils]: 65: Hoare triple {32646#false} assume !(10 == ~blastFlag~0); {32646#false} is VALID [2022-04-15 11:50:17,330 INFO L290 TraceCheckUtils]: 66: Hoare triple {32646#false} assume 13 == ~blastFlag~0; {32646#false} is VALID [2022-04-15 11:50:17,330 INFO L290 TraceCheckUtils]: 67: Hoare triple {32646#false} assume !false; {32646#false} is VALID [2022-04-15 11:50:17,330 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:50:17,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:50:17,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494986584] [2022-04-15 11:50:17,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494986584] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:50:17,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:50:17,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:50:17,331 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:50:17,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1108650626] [2022-04-15 11:50:17,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1108650626] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:50:17,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:50:17,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:50:17,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565605257] [2022-04-15 11:50:17,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:50:17,332 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-15 11:50:17,332 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:50:17,332 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:17,393 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:50:17,393 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:50:17,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:50:17,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:50:17,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:50:17,394 INFO L87 Difference]: Start difference. First operand 483 states and 719 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:19,232 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:50:32,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:50:32,053 INFO L93 Difference]: Finished difference Result 686 states and 1029 transitions. [2022-04-15 11:50:32,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:50:32,053 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-15 11:50:32,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:50:32,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:32,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 490 transitions. [2022-04-15 11:50:32,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:32,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 490 transitions. [2022-04-15 11:50:32,059 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 490 transitions. [2022-04-15 11:50:32,393 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 490 edges. 490 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:50:32,404 INFO L225 Difference]: With dead ends: 686 [2022-04-15 11:50:32,404 INFO L226 Difference]: Without dead ends: 526 [2022-04-15 11:50:32,405 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-15 11:50:32,405 INFO L913 BasicCegarLoop]: 247 mSDtfsCounter, 31 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-04-15 11:50:32,406 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 615 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-04-15 11:50:32,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2022-04-15 11:50:32,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 505. [2022-04-15 11:50:32,430 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:50:32,430 INFO L82 GeneralOperation]: Start isEquivalent. First operand 526 states. Second operand has 505 states, 500 states have (on average 1.5) internal successors, (750), 500 states have internal predecessors, (750), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:32,431 INFO L74 IsIncluded]: Start isIncluded. First operand 526 states. Second operand has 505 states, 500 states have (on average 1.5) internal successors, (750), 500 states have internal predecessors, (750), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:32,432 INFO L87 Difference]: Start difference. First operand 526 states. Second operand has 505 states, 500 states have (on average 1.5) internal successors, (750), 500 states have internal predecessors, (750), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:32,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:50:32,446 INFO L93 Difference]: Finished difference Result 526 states and 781 transitions. [2022-04-15 11:50:32,446 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 781 transitions. [2022-04-15 11:50:32,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:50:32,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:50:32,448 INFO L74 IsIncluded]: Start isIncluded. First operand has 505 states, 500 states have (on average 1.5) internal successors, (750), 500 states have internal predecessors, (750), 3 states have call successors, (3), 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 526 states. [2022-04-15 11:50:32,448 INFO L87 Difference]: Start difference. First operand has 505 states, 500 states have (on average 1.5) internal successors, (750), 500 states have internal predecessors, (750), 3 states have call successors, (3), 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 526 states. [2022-04-15 11:50:32,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:50:32,462 INFO L93 Difference]: Finished difference Result 526 states and 781 transitions. [2022-04-15 11:50:32,462 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 781 transitions. [2022-04-15 11:50:32,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:50:32,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:50:32,463 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:50:32,463 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:50:32,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 500 states have (on average 1.5) internal successors, (750), 500 states have internal predecessors, (750), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:32,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 754 transitions. [2022-04-15 11:50:32,482 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 754 transitions. Word has length 68 [2022-04-15 11:50:32,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:50:32,482 INFO L478 AbstractCegarLoop]: Abstraction has 505 states and 754 transitions. [2022-04-15 11:50:32,482 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:32,482 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 505 states and 754 transitions. [2022-04-15 11:50:35,476 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 754 edges. 753 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:50:35,476 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 754 transitions. [2022-04-15 11:50:35,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-15 11:50:35,477 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:50:35,477 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:50:35,478 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-15 11:50:35,478 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:50:35,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:50:35,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1067744169, now seen corresponding path program 1 times [2022-04-15 11:50:35,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:50:35,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1090048202] [2022-04-15 11:50:35,508 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:50:35,508 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:50:35,508 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:50:35,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1067744169, now seen corresponding path program 2 times [2022-04-15 11:50:35,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:50:35,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472759287] [2022-04-15 11:50:35,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:50:35,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:50:35,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:50:35,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:50:35,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:50:35,736 INFO L290 TraceCheckUtils]: 0: Hoare triple {36098#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {36091#true} is VALID [2022-04-15 11:50:35,736 INFO L290 TraceCheckUtils]: 1: Hoare triple {36091#true} assume true; {36091#true} is VALID [2022-04-15 11:50:35,737 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36091#true} {36091#true} #708#return; {36091#true} is VALID [2022-04-15 11:50:35,738 INFO L272 TraceCheckUtils]: 0: Hoare triple {36091#true} call ULTIMATE.init(); {36098#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:50:35,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {36098#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {36091#true} is VALID [2022-04-15 11:50:35,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {36091#true} assume true; {36091#true} is VALID [2022-04-15 11:50:35,738 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36091#true} {36091#true} #708#return; {36091#true} is VALID [2022-04-15 11:50:35,738 INFO L272 TraceCheckUtils]: 4: Hoare triple {36091#true} call #t~ret161 := main(); {36091#true} is VALID [2022-04-15 11:50:35,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {36091#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; {36091#true} is VALID [2022-04-15 11:50:35,738 INFO L290 TraceCheckUtils]: 6: Hoare triple {36091#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {36091#true} is VALID [2022-04-15 11:50:35,738 INFO L272 TraceCheckUtils]: 7: Hoare triple {36091#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {36091#true} is VALID [2022-04-15 11:50:35,738 INFO L290 TraceCheckUtils]: 8: Hoare triple {36091#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); {36091#true} is VALID [2022-04-15 11:50:35,739 INFO L290 TraceCheckUtils]: 9: Hoare triple {36091#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; {36091#true} is VALID [2022-04-15 11:50:35,739 INFO L290 TraceCheckUtils]: 10: Hoare triple {36091#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; {36091#true} is VALID [2022-04-15 11:50:35,739 INFO L290 TraceCheckUtils]: 11: Hoare triple {36091#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {36091#true} is VALID [2022-04-15 11:50:35,739 INFO L290 TraceCheckUtils]: 12: Hoare triple {36091#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {36091#true} is VALID [2022-04-15 11:50:35,739 INFO L290 TraceCheckUtils]: 13: Hoare triple {36091#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {36091#true} is VALID [2022-04-15 11:50:35,739 INFO L290 TraceCheckUtils]: 14: Hoare triple {36091#true} assume !false; {36091#true} is VALID [2022-04-15 11:50:35,739 INFO L290 TraceCheckUtils]: 15: Hoare triple {36091#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); {36091#true} is VALID [2022-04-15 11:50:35,739 INFO L290 TraceCheckUtils]: 16: Hoare triple {36091#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {36091#true} is VALID [2022-04-15 11:50:35,739 INFO L290 TraceCheckUtils]: 17: Hoare triple {36091#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {36091#true} is VALID [2022-04-15 11:50:35,739 INFO L290 TraceCheckUtils]: 18: Hoare triple {36091#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {36091#true} is VALID [2022-04-15 11:50:35,740 INFO L290 TraceCheckUtils]: 19: Hoare triple {36091#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {36091#true} is VALID [2022-04-15 11:50:35,740 INFO L290 TraceCheckUtils]: 20: Hoare triple {36091#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {36091#true} is VALID [2022-04-15 11:50:35,740 INFO L290 TraceCheckUtils]: 21: Hoare triple {36091#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {36091#true} is VALID [2022-04-15 11:50:35,740 INFO L290 TraceCheckUtils]: 22: Hoare triple {36091#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {36091#true} is VALID [2022-04-15 11:50:35,740 INFO L290 TraceCheckUtils]: 23: Hoare triple {36091#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {36091#true} is VALID [2022-04-15 11:50:35,740 INFO L290 TraceCheckUtils]: 24: Hoare triple {36091#true} assume 8464 == #t~mem55;havoc #t~mem55; {36091#true} is VALID [2022-04-15 11:50:35,740 INFO L290 TraceCheckUtils]: 25: Hoare triple {36091#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; {36091#true} is VALID [2022-04-15 11:50:35,740 INFO L290 TraceCheckUtils]: 26: Hoare triple {36091#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {36091#true} is VALID [2022-04-15 11:50:35,740 INFO L290 TraceCheckUtils]: 27: Hoare triple {36091#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); {36091#true} is VALID [2022-04-15 11:50:35,740 INFO L290 TraceCheckUtils]: 28: Hoare triple {36091#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); {36091#true} is VALID [2022-04-15 11:50:35,741 INFO L290 TraceCheckUtils]: 29: Hoare triple {36091#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {36091#true} is VALID [2022-04-15 11:50:35,741 INFO L290 TraceCheckUtils]: 30: Hoare triple {36091#true} ~skip~0 := 0; {36091#true} is VALID [2022-04-15 11:50:35,741 INFO L290 TraceCheckUtils]: 31: Hoare triple {36091#true} assume !false; {36091#true} is VALID [2022-04-15 11:50:35,741 INFO L290 TraceCheckUtils]: 32: Hoare triple {36091#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); {36091#true} is VALID [2022-04-15 11:50:35,741 INFO L290 TraceCheckUtils]: 33: Hoare triple {36091#true} assume 12292 == #t~mem47;havoc #t~mem47; {36091#true} is VALID [2022-04-15 11:50:35,741 INFO L290 TraceCheckUtils]: 34: Hoare triple {36091#true} call write~int(1, ~s.base, 40 + ~s.offset, 4); {36091#true} is VALID [2022-04-15 11:50:35,741 INFO L290 TraceCheckUtils]: 35: Hoare triple {36091#true} call write~int(1, ~s.base, 36 + ~s.offset, 4); {36091#true} is VALID [2022-04-15 11:50:35,741 INFO L290 TraceCheckUtils]: 36: Hoare triple {36091#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {36091#true} is VALID [2022-04-15 11:50:35,741 INFO L290 TraceCheckUtils]: 37: Hoare triple {36091#true} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {36091#true} is VALID [2022-04-15 11:50:35,741 INFO L290 TraceCheckUtils]: 38: Hoare triple {36091#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); {36091#true} is VALID [2022-04-15 11:50:35,742 INFO L290 TraceCheckUtils]: 39: Hoare triple {36091#true} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {36091#true} is VALID [2022-04-15 11:50:35,742 INFO L290 TraceCheckUtils]: 40: Hoare triple {36091#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); {36091#true} is VALID [2022-04-15 11:50:35,743 INFO L290 TraceCheckUtils]: 41: Hoare triple {36091#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); {36096#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:35,744 INFO L290 TraceCheckUtils]: 42: Hoare triple {36096#(= 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); {36096#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:35,744 INFO L290 TraceCheckUtils]: 43: Hoare triple {36096#(= 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; {36096#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:35,744 INFO L290 TraceCheckUtils]: 44: Hoare triple {36096#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {36096#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:35,745 INFO L290 TraceCheckUtils]: 45: Hoare triple {36096#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {36096#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:35,745 INFO L290 TraceCheckUtils]: 46: Hoare triple {36096#(= 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); {36096#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:35,746 INFO L290 TraceCheckUtils]: 47: Hoare triple {36096#(= 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); {36096#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:35,746 INFO L290 TraceCheckUtils]: 48: Hoare triple {36096#(= 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); {36096#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:35,747 INFO L290 TraceCheckUtils]: 49: Hoare triple {36096#(= 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); {36096#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:35,747 INFO L290 TraceCheckUtils]: 50: Hoare triple {36096#(= 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); {36096#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:35,748 INFO L290 TraceCheckUtils]: 51: Hoare triple {36096#(= 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); {36097#(= |ssl3_accept_#t~mem52| 8480)} is VALID [2022-04-15 11:50:35,748 INFO L290 TraceCheckUtils]: 52: Hoare triple {36097#(= |ssl3_accept_#t~mem52| 8480)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {36092#false} is VALID [2022-04-15 11:50:35,748 INFO L290 TraceCheckUtils]: 53: Hoare triple {36092#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {36092#false} is VALID [2022-04-15 11:50:35,748 INFO L290 TraceCheckUtils]: 54: Hoare triple {36092#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {36092#false} is VALID [2022-04-15 11:50:35,748 INFO L290 TraceCheckUtils]: 55: Hoare triple {36092#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {36092#false} is VALID [2022-04-15 11:50:35,748 INFO L290 TraceCheckUtils]: 56: Hoare triple {36092#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {36092#false} is VALID [2022-04-15 11:50:35,748 INFO L290 TraceCheckUtils]: 57: Hoare triple {36092#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {36092#false} is VALID [2022-04-15 11:50:35,749 INFO L290 TraceCheckUtils]: 58: Hoare triple {36092#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {36092#false} is VALID [2022-04-15 11:50:35,749 INFO L290 TraceCheckUtils]: 59: Hoare triple {36092#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {36092#false} is VALID [2022-04-15 11:50:35,749 INFO L290 TraceCheckUtils]: 60: Hoare triple {36092#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {36092#false} is VALID [2022-04-15 11:50:35,749 INFO L290 TraceCheckUtils]: 61: Hoare triple {36092#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {36092#false} is VALID [2022-04-15 11:50:35,749 INFO L290 TraceCheckUtils]: 62: Hoare triple {36092#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {36092#false} is VALID [2022-04-15 11:50:35,749 INFO L290 TraceCheckUtils]: 63: Hoare triple {36092#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {36092#false} is VALID [2022-04-15 11:50:35,749 INFO L290 TraceCheckUtils]: 64: Hoare triple {36092#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {36092#false} is VALID [2022-04-15 11:50:35,749 INFO L290 TraceCheckUtils]: 65: Hoare triple {36092#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {36092#false} is VALID [2022-04-15 11:50:35,750 INFO L290 TraceCheckUtils]: 66: Hoare triple {36092#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {36092#false} is VALID [2022-04-15 11:50:35,750 INFO L290 TraceCheckUtils]: 67: Hoare triple {36092#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {36092#false} is VALID [2022-04-15 11:50:35,750 INFO L290 TraceCheckUtils]: 68: Hoare triple {36092#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {36092#false} is VALID [2022-04-15 11:50:35,750 INFO L290 TraceCheckUtils]: 69: Hoare triple {36092#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {36092#false} is VALID [2022-04-15 11:50:35,750 INFO L290 TraceCheckUtils]: 70: Hoare triple {36092#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {36092#false} is VALID [2022-04-15 11:50:35,750 INFO L290 TraceCheckUtils]: 71: Hoare triple {36092#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {36092#false} is VALID [2022-04-15 11:50:35,750 INFO L290 TraceCheckUtils]: 72: Hoare triple {36092#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {36092#false} is VALID [2022-04-15 11:50:35,750 INFO L290 TraceCheckUtils]: 73: Hoare triple {36092#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {36092#false} is VALID [2022-04-15 11:50:35,750 INFO L290 TraceCheckUtils]: 74: Hoare triple {36092#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {36092#false} is VALID [2022-04-15 11:50:35,751 INFO L290 TraceCheckUtils]: 75: Hoare triple {36092#false} assume 8640 == #t~mem75;havoc #t~mem75; {36092#false} is VALID [2022-04-15 11:50:35,751 INFO L290 TraceCheckUtils]: 76: Hoare triple {36092#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {36092#false} is VALID [2022-04-15 11:50:35,751 INFO L290 TraceCheckUtils]: 77: Hoare triple {36092#false} assume !(4 == ~blastFlag~0); {36092#false} is VALID [2022-04-15 11:50:35,751 INFO L290 TraceCheckUtils]: 78: Hoare triple {36092#false} assume !(7 == ~blastFlag~0); {36092#false} is VALID [2022-04-15 11:50:35,751 INFO L290 TraceCheckUtils]: 79: Hoare triple {36092#false} assume !(10 == ~blastFlag~0); {36092#false} is VALID [2022-04-15 11:50:35,751 INFO L290 TraceCheckUtils]: 80: Hoare triple {36092#false} assume 13 == ~blastFlag~0; {36092#false} is VALID [2022-04-15 11:50:35,751 INFO L290 TraceCheckUtils]: 81: Hoare triple {36092#false} assume !false; {36092#false} is VALID [2022-04-15 11:50:35,752 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 11:50:35,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:50:35,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472759287] [2022-04-15 11:50:35,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472759287] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:50:35,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:50:35,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:50:35,752 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:50:35,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1090048202] [2022-04-15 11:50:35,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1090048202] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:50:35,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:50:35,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:50:35,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080264407] [2022-04-15 11:50:35,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:50:35,753 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 82 [2022-04-15 11:50:35,754 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:50:35,754 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:35,815 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:50:35,815 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:50:35,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:50:35,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:50:35,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:50:35,816 INFO L87 Difference]: Start difference. First operand 505 states and 754 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:37,896 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-15 11:50:42,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:50:42,645 INFO L93 Difference]: Finished difference Result 890 states and 1329 transitions. [2022-04-15 11:50:42,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:50:42,645 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 82 [2022-04-15 11:50:42,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:50:42,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:42,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 468 transitions. [2022-04-15 11:50:42,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:42,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 468 transitions. [2022-04-15 11:50:42,649 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 468 transitions. [2022-04-15 11:50:42,966 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 468 edges. 468 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:50:42,977 INFO L225 Difference]: With dead ends: 890 [2022-04-15 11:50:42,978 INFO L226 Difference]: Without dead ends: 544 [2022-04-15 11:50:42,978 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-15 11:50:42,979 INFO L913 BasicCegarLoop]: 238 mSDtfsCounter, 20 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:50:42,979 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 598 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 404 Invalid, 1 Unknown, 0 Unchecked, 3.4s Time] [2022-04-15 11:50:42,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2022-04-15 11:50:43,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 511. [2022-04-15 11:50:43,004 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:50:43,005 INFO L82 GeneralOperation]: Start isEquivalent. First operand 544 states. Second operand has 511 states, 506 states have (on average 1.5019762845849802) internal successors, (760), 506 states have internal predecessors, (760), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:43,005 INFO L74 IsIncluded]: Start isIncluded. First operand 544 states. Second operand has 511 states, 506 states have (on average 1.5019762845849802) internal successors, (760), 506 states have internal predecessors, (760), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:43,006 INFO L87 Difference]: Start difference. First operand 544 states. Second operand has 511 states, 506 states have (on average 1.5019762845849802) internal successors, (760), 506 states have internal predecessors, (760), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:43,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:50:43,021 INFO L93 Difference]: Finished difference Result 544 states and 805 transitions. [2022-04-15 11:50:43,021 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 805 transitions. [2022-04-15 11:50:43,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:50:43,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:50:43,022 INFO L74 IsIncluded]: Start isIncluded. First operand has 511 states, 506 states have (on average 1.5019762845849802) internal successors, (760), 506 states have internal predecessors, (760), 3 states have call successors, (3), 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 544 states. [2022-04-15 11:50:43,023 INFO L87 Difference]: Start difference. First operand has 511 states, 506 states have (on average 1.5019762845849802) internal successors, (760), 506 states have internal predecessors, (760), 3 states have call successors, (3), 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 544 states. [2022-04-15 11:50:43,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:50:43,039 INFO L93 Difference]: Finished difference Result 544 states and 805 transitions. [2022-04-15 11:50:43,039 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 805 transitions. [2022-04-15 11:50:43,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:50:43,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:50:43,040 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:50:43,040 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:50:43,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 506 states have (on average 1.5019762845849802) internal successors, (760), 506 states have internal predecessors, (760), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:43,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 764 transitions. [2022-04-15 11:50:43,059 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 764 transitions. Word has length 82 [2022-04-15 11:50:43,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:50:43,059 INFO L478 AbstractCegarLoop]: Abstraction has 511 states and 764 transitions. [2022-04-15 11:50:43,059 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:43,060 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 511 states and 764 transitions. [2022-04-15 11:50:46,086 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 764 edges. 763 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:50:46,086 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 764 transitions. [2022-04-15 11:50:46,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-15 11:50:46,087 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:50:46,087 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:50:46,087 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-15 11:50:46,087 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:50:46,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:50:46,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1797161388, now seen corresponding path program 1 times [2022-04-15 11:50:46,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:50:46,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [961543767] [2022-04-15 11:50:46,131 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:50:46,132 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:50:46,132 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:50:46,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1797161388, now seen corresponding path program 2 times [2022-04-15 11:50:46,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:50:46,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321379290] [2022-04-15 11:50:46,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:50:46,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:50:46,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:50:46,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:50:46,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:50:46,381 INFO L290 TraceCheckUtils]: 0: Hoare triple {40000#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {39993#true} is VALID [2022-04-15 11:50:46,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {39993#true} assume true; {39993#true} is VALID [2022-04-15 11:50:46,381 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39993#true} {39993#true} #708#return; {39993#true} is VALID [2022-04-15 11:50:46,382 INFO L272 TraceCheckUtils]: 0: Hoare triple {39993#true} call ULTIMATE.init(); {40000#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:50:46,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {40000#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {39993#true} is VALID [2022-04-15 11:50:46,383 INFO L290 TraceCheckUtils]: 2: Hoare triple {39993#true} assume true; {39993#true} is VALID [2022-04-15 11:50:46,383 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39993#true} {39993#true} #708#return; {39993#true} is VALID [2022-04-15 11:50:46,383 INFO L272 TraceCheckUtils]: 4: Hoare triple {39993#true} call #t~ret161 := main(); {39993#true} is VALID [2022-04-15 11:50:46,383 INFO L290 TraceCheckUtils]: 5: Hoare triple {39993#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; {39993#true} is VALID [2022-04-15 11:50:46,383 INFO L290 TraceCheckUtils]: 6: Hoare triple {39993#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {39993#true} is VALID [2022-04-15 11:50:46,383 INFO L272 TraceCheckUtils]: 7: Hoare triple {39993#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {39993#true} is VALID [2022-04-15 11:50:46,383 INFO L290 TraceCheckUtils]: 8: Hoare triple {39993#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); {39993#true} is VALID [2022-04-15 11:50:46,383 INFO L290 TraceCheckUtils]: 9: Hoare triple {39993#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; {39993#true} is VALID [2022-04-15 11:50:46,383 INFO L290 TraceCheckUtils]: 10: Hoare triple {39993#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; {39993#true} is VALID [2022-04-15 11:50:46,383 INFO L290 TraceCheckUtils]: 11: Hoare triple {39993#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {39993#true} is VALID [2022-04-15 11:50:46,384 INFO L290 TraceCheckUtils]: 12: Hoare triple {39993#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {39993#true} is VALID [2022-04-15 11:50:46,384 INFO L290 TraceCheckUtils]: 13: Hoare triple {39993#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {39993#true} is VALID [2022-04-15 11:50:46,384 INFO L290 TraceCheckUtils]: 14: Hoare triple {39993#true} assume !false; {39993#true} is VALID [2022-04-15 11:50:46,384 INFO L290 TraceCheckUtils]: 15: Hoare triple {39993#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); {39993#true} is VALID [2022-04-15 11:50:46,384 INFO L290 TraceCheckUtils]: 16: Hoare triple {39993#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {39993#true} is VALID [2022-04-15 11:50:46,384 INFO L290 TraceCheckUtils]: 17: Hoare triple {39993#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {39993#true} is VALID [2022-04-15 11:50:46,384 INFO L290 TraceCheckUtils]: 18: Hoare triple {39993#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {39993#true} is VALID [2022-04-15 11:50:46,384 INFO L290 TraceCheckUtils]: 19: Hoare triple {39993#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {39993#true} is VALID [2022-04-15 11:50:46,384 INFO L290 TraceCheckUtils]: 20: Hoare triple {39993#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {39993#true} is VALID [2022-04-15 11:50:46,384 INFO L290 TraceCheckUtils]: 21: Hoare triple {39993#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {39993#true} is VALID [2022-04-15 11:50:46,384 INFO L290 TraceCheckUtils]: 22: Hoare triple {39993#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {39993#true} is VALID [2022-04-15 11:50:46,385 INFO L290 TraceCheckUtils]: 23: Hoare triple {39993#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {39993#true} is VALID [2022-04-15 11:50:46,385 INFO L290 TraceCheckUtils]: 24: Hoare triple {39993#true} assume 8464 == #t~mem55;havoc #t~mem55; {39993#true} is VALID [2022-04-15 11:50:46,385 INFO L290 TraceCheckUtils]: 25: Hoare triple {39993#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; {39993#true} is VALID [2022-04-15 11:50:46,385 INFO L290 TraceCheckUtils]: 26: Hoare triple {39993#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {39993#true} is VALID [2022-04-15 11:50:46,386 INFO L290 TraceCheckUtils]: 27: Hoare triple {39993#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); {39998#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:46,387 INFO L290 TraceCheckUtils]: 28: Hoare triple {39998#(= 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); {39998#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:46,387 INFO L290 TraceCheckUtils]: 29: Hoare triple {39998#(= 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; {39998#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:46,388 INFO L290 TraceCheckUtils]: 30: Hoare triple {39998#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {39998#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:46,388 INFO L290 TraceCheckUtils]: 31: Hoare triple {39998#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {39998#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:46,388 INFO L290 TraceCheckUtils]: 32: Hoare triple {39998#(= 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); {39998#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:46,389 INFO L290 TraceCheckUtils]: 33: Hoare triple {39998#(= 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); {39998#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:46,389 INFO L290 TraceCheckUtils]: 34: Hoare triple {39998#(= 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); {39998#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:46,390 INFO L290 TraceCheckUtils]: 35: Hoare triple {39998#(= 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); {39998#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:46,390 INFO L290 TraceCheckUtils]: 36: Hoare triple {39998#(= 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); {39998#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:46,391 INFO L290 TraceCheckUtils]: 37: Hoare triple {39998#(= 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); {39998#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:46,391 INFO L290 TraceCheckUtils]: 38: Hoare triple {39998#(= 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); {39999#(= |ssl3_accept_#t~mem53| 8496)} is VALID [2022-04-15 11:50:46,392 INFO L290 TraceCheckUtils]: 39: Hoare triple {39999#(= |ssl3_accept_#t~mem53| 8496)} assume 8481 == #t~mem53;havoc #t~mem53; {39994#false} is VALID [2022-04-15 11:50:46,392 INFO L290 TraceCheckUtils]: 40: Hoare triple {39994#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; {39994#false} is VALID [2022-04-15 11:50:46,392 INFO L290 TraceCheckUtils]: 41: Hoare triple {39994#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); {39994#false} is VALID [2022-04-15 11:50:46,392 INFO L290 TraceCheckUtils]: 42: Hoare triple {39994#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); {39994#false} is VALID [2022-04-15 11:50:46,392 INFO L290 TraceCheckUtils]: 43: Hoare triple {39994#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {39994#false} is VALID [2022-04-15 11:50:46,392 INFO L290 TraceCheckUtils]: 44: Hoare triple {39994#false} ~skip~0 := 0; {39994#false} is VALID [2022-04-15 11:50:46,392 INFO L290 TraceCheckUtils]: 45: Hoare triple {39994#false} assume !false; {39994#false} is VALID [2022-04-15 11:50:46,392 INFO L290 TraceCheckUtils]: 46: Hoare triple {39994#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); {39994#false} is VALID [2022-04-15 11:50:46,393 INFO L290 TraceCheckUtils]: 47: Hoare triple {39994#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-15 11:50:46,393 INFO L290 TraceCheckUtils]: 48: Hoare triple {39994#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-15 11:50:46,393 INFO L290 TraceCheckUtils]: 49: Hoare triple {39994#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-15 11:50:46,393 INFO L290 TraceCheckUtils]: 50: Hoare triple {39994#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-15 11:50:46,393 INFO L290 TraceCheckUtils]: 51: Hoare triple {39994#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-15 11:50:46,393 INFO L290 TraceCheckUtils]: 52: Hoare triple {39994#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-15 11:50:46,393 INFO L290 TraceCheckUtils]: 53: Hoare triple {39994#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-15 11:50:46,393 INFO L290 TraceCheckUtils]: 54: Hoare triple {39994#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-15 11:50:46,393 INFO L290 TraceCheckUtils]: 55: Hoare triple {39994#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-15 11:50:46,393 INFO L290 TraceCheckUtils]: 56: Hoare triple {39994#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-15 11:50:46,393 INFO L290 TraceCheckUtils]: 57: Hoare triple {39994#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-15 11:50:46,394 INFO L290 TraceCheckUtils]: 58: Hoare triple {39994#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-15 11:50:46,394 INFO L290 TraceCheckUtils]: 59: Hoare triple {39994#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-15 11:50:46,394 INFO L290 TraceCheckUtils]: 60: Hoare triple {39994#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-15 11:50:46,394 INFO L290 TraceCheckUtils]: 61: Hoare triple {39994#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-15 11:50:46,394 INFO L290 TraceCheckUtils]: 62: Hoare triple {39994#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-15 11:50:46,394 INFO L290 TraceCheckUtils]: 63: Hoare triple {39994#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-15 11:50:46,394 INFO L290 TraceCheckUtils]: 64: Hoare triple {39994#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-15 11:50:46,394 INFO L290 TraceCheckUtils]: 65: Hoare triple {39994#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-15 11:50:46,394 INFO L290 TraceCheckUtils]: 66: Hoare triple {39994#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-15 11:50:46,394 INFO L290 TraceCheckUtils]: 67: Hoare triple {39994#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-15 11:50:46,395 INFO L290 TraceCheckUtils]: 68: Hoare triple {39994#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-15 11:50:46,395 INFO L290 TraceCheckUtils]: 69: Hoare triple {39994#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-15 11:50:46,395 INFO L290 TraceCheckUtils]: 70: Hoare triple {39994#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-15 11:50:46,395 INFO L290 TraceCheckUtils]: 71: Hoare triple {39994#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-15 11:50:46,395 INFO L290 TraceCheckUtils]: 72: Hoare triple {39994#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-15 11:50:46,395 INFO L290 TraceCheckUtils]: 73: Hoare triple {39994#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-15 11:50:46,395 INFO L290 TraceCheckUtils]: 74: Hoare triple {39994#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-15 11:50:46,395 INFO L290 TraceCheckUtils]: 75: Hoare triple {39994#false} assume 8640 == #t~mem75;havoc #t~mem75; {39994#false} is VALID [2022-04-15 11:50:46,395 INFO L290 TraceCheckUtils]: 76: Hoare triple {39994#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {39994#false} is VALID [2022-04-15 11:50:46,395 INFO L290 TraceCheckUtils]: 77: Hoare triple {39994#false} assume !(4 == ~blastFlag~0); {39994#false} is VALID [2022-04-15 11:50:46,396 INFO L290 TraceCheckUtils]: 78: Hoare triple {39994#false} assume !(7 == ~blastFlag~0); {39994#false} is VALID [2022-04-15 11:50:46,396 INFO L290 TraceCheckUtils]: 79: Hoare triple {39994#false} assume !(10 == ~blastFlag~0); {39994#false} is VALID [2022-04-15 11:50:46,396 INFO L290 TraceCheckUtils]: 80: Hoare triple {39994#false} assume 13 == ~blastFlag~0; {39994#false} is VALID [2022-04-15 11:50:46,396 INFO L290 TraceCheckUtils]: 81: Hoare triple {39994#false} assume !false; {39994#false} is VALID [2022-04-15 11:50:46,396 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:50:46,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:50:46,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321379290] [2022-04-15 11:50:46,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321379290] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:50:46,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:50:46,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:50:46,397 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:50:46,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [961543767] [2022-04-15 11:50:46,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [961543767] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:50:46,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:50:46,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:50:46,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119214588] [2022-04-15 11:50:46,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:50:46,398 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 82 [2022-04-15 11:50:46,398 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:50:46,398 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:46,465 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:50:46,465 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:50:46,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:50:46,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:50:46,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:50:46,466 INFO L87 Difference]: Start difference. First operand 511 states and 764 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:56,888 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:51:02,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:51:02,262 INFO L93 Difference]: Finished difference Result 715 states and 1076 transitions. [2022-04-15 11:51:02,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:51:02,262 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 82 [2022-04-15 11:51:02,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:51:02,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:02,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 487 transitions. [2022-04-15 11:51:02,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:02,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 487 transitions. [2022-04-15 11:51:02,266 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 487 transitions. [2022-04-15 11:51:02,588 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 487 edges. 487 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:51:02,600 INFO L225 Difference]: With dead ends: 715 [2022-04-15 11:51:02,600 INFO L226 Difference]: Without dead ends: 530 [2022-04-15 11:51:02,601 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:51:02,601 INFO L913 BasicCegarLoop]: 247 mSDtfsCounter, 35 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:51:02,602 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 615 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-04-15 11:51:02,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2022-04-15 11:51:02,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 511. [2022-04-15 11:51:02,625 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:51:02,626 INFO L82 GeneralOperation]: Start isEquivalent. First operand 530 states. Second operand has 511 states, 506 states have (on average 1.5) internal successors, (759), 506 states have internal predecessors, (759), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:02,626 INFO L74 IsIncluded]: Start isIncluded. First operand 530 states. Second operand has 511 states, 506 states have (on average 1.5) internal successors, (759), 506 states have internal predecessors, (759), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:02,627 INFO L87 Difference]: Start difference. First operand 530 states. Second operand has 511 states, 506 states have (on average 1.5) internal successors, (759), 506 states have internal predecessors, (759), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:02,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:51:02,641 INFO L93 Difference]: Finished difference Result 530 states and 788 transitions. [2022-04-15 11:51:02,641 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 788 transitions. [2022-04-15 11:51:02,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:51:02,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:51:02,643 INFO L74 IsIncluded]: Start isIncluded. First operand has 511 states, 506 states have (on average 1.5) internal successors, (759), 506 states have internal predecessors, (759), 3 states have call successors, (3), 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 530 states. [2022-04-15 11:51:02,643 INFO L87 Difference]: Start difference. First operand has 511 states, 506 states have (on average 1.5) internal successors, (759), 506 states have internal predecessors, (759), 3 states have call successors, (3), 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 530 states. [2022-04-15 11:51:02,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:51:02,658 INFO L93 Difference]: Finished difference Result 530 states and 788 transitions. [2022-04-15 11:51:02,658 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 788 transitions. [2022-04-15 11:51:02,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:51:02,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:51:02,659 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:51:02,659 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:51:02,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 506 states have (on average 1.5) internal successors, (759), 506 states have internal predecessors, (759), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:02,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 763 transitions. [2022-04-15 11:51:02,677 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 763 transitions. Word has length 82 [2022-04-15 11:51:02,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:51:02,677 INFO L478 AbstractCegarLoop]: Abstraction has 511 states and 763 transitions. [2022-04-15 11:51:02,677 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:02,677 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 511 states and 763 transitions. [2022-04-15 11:51:05,672 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 763 edges. 762 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:51:05,673 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 763 transitions. [2022-04-15 11:51:05,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-15 11:51:05,673 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:51:05,674 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:51:05,674 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-15 11:51:05,674 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:51:05,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:51:05,674 INFO L85 PathProgramCache]: Analyzing trace with hash -403445877, now seen corresponding path program 1 times [2022-04-15 11:51:05,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:51:05,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1389688897] [2022-04-15 11:51:05,699 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:51:05,699 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:51:05,700 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:51:05,700 INFO L85 PathProgramCache]: Analyzing trace with hash -403445877, now seen corresponding path program 2 times [2022-04-15 11:51:05,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:51:05,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40293715] [2022-04-15 11:51:05,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:51:05,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:51:05,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:51:05,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:51:05,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:51:05,926 INFO L290 TraceCheckUtils]: 0: Hoare triple {43524#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {43517#true} is VALID [2022-04-15 11:51:05,927 INFO L290 TraceCheckUtils]: 1: Hoare triple {43517#true} assume true; {43517#true} is VALID [2022-04-15 11:51:05,927 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43517#true} {43517#true} #708#return; {43517#true} is VALID [2022-04-15 11:51:05,928 INFO L272 TraceCheckUtils]: 0: Hoare triple {43517#true} call ULTIMATE.init(); {43524#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:51:05,928 INFO L290 TraceCheckUtils]: 1: Hoare triple {43524#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {43517#true} is VALID [2022-04-15 11:51:05,928 INFO L290 TraceCheckUtils]: 2: Hoare triple {43517#true} assume true; {43517#true} is VALID [2022-04-15 11:51:05,928 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43517#true} {43517#true} #708#return; {43517#true} is VALID [2022-04-15 11:51:05,928 INFO L272 TraceCheckUtils]: 4: Hoare triple {43517#true} call #t~ret161 := main(); {43517#true} is VALID [2022-04-15 11:51:05,928 INFO L290 TraceCheckUtils]: 5: Hoare triple {43517#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; {43517#true} is VALID [2022-04-15 11:51:05,928 INFO L290 TraceCheckUtils]: 6: Hoare triple {43517#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {43517#true} is VALID [2022-04-15 11:51:05,928 INFO L272 TraceCheckUtils]: 7: Hoare triple {43517#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {43517#true} is VALID [2022-04-15 11:51:05,928 INFO L290 TraceCheckUtils]: 8: Hoare triple {43517#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); {43517#true} is VALID [2022-04-15 11:51:05,928 INFO L290 TraceCheckUtils]: 9: Hoare triple {43517#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; {43517#true} is VALID [2022-04-15 11:51:05,928 INFO L290 TraceCheckUtils]: 10: Hoare triple {43517#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; {43517#true} is VALID [2022-04-15 11:51:05,929 INFO L290 TraceCheckUtils]: 11: Hoare triple {43517#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {43517#true} is VALID [2022-04-15 11:51:05,929 INFO L290 TraceCheckUtils]: 12: Hoare triple {43517#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {43517#true} is VALID [2022-04-15 11:51:05,929 INFO L290 TraceCheckUtils]: 13: Hoare triple {43517#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {43517#true} is VALID [2022-04-15 11:51:05,929 INFO L290 TraceCheckUtils]: 14: Hoare triple {43517#true} assume !false; {43517#true} is VALID [2022-04-15 11:51:05,929 INFO L290 TraceCheckUtils]: 15: Hoare triple {43517#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); {43517#true} is VALID [2022-04-15 11:51:05,929 INFO L290 TraceCheckUtils]: 16: Hoare triple {43517#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {43517#true} is VALID [2022-04-15 11:51:05,929 INFO L290 TraceCheckUtils]: 17: Hoare triple {43517#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {43517#true} is VALID [2022-04-15 11:51:05,929 INFO L290 TraceCheckUtils]: 18: Hoare triple {43517#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {43517#true} is VALID [2022-04-15 11:51:05,929 INFO L290 TraceCheckUtils]: 19: Hoare triple {43517#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {43517#true} is VALID [2022-04-15 11:51:05,929 INFO L290 TraceCheckUtils]: 20: Hoare triple {43517#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {43517#true} is VALID [2022-04-15 11:51:05,929 INFO L290 TraceCheckUtils]: 21: Hoare triple {43517#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {43517#true} is VALID [2022-04-15 11:51:05,930 INFO L290 TraceCheckUtils]: 22: Hoare triple {43517#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {43517#true} is VALID [2022-04-15 11:51:05,930 INFO L290 TraceCheckUtils]: 23: Hoare triple {43517#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {43517#true} is VALID [2022-04-15 11:51:05,930 INFO L290 TraceCheckUtils]: 24: Hoare triple {43517#true} assume 8464 == #t~mem55;havoc #t~mem55; {43517#true} is VALID [2022-04-15 11:51:05,930 INFO L290 TraceCheckUtils]: 25: Hoare triple {43517#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; {43517#true} is VALID [2022-04-15 11:51:05,930 INFO L290 TraceCheckUtils]: 26: Hoare triple {43517#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {43517#true} is VALID [2022-04-15 11:51:05,931 INFO L290 TraceCheckUtils]: 27: Hoare triple {43517#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); {43522#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:05,932 INFO L290 TraceCheckUtils]: 28: Hoare triple {43522#(= 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); {43522#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:05,932 INFO L290 TraceCheckUtils]: 29: Hoare triple {43522#(= 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; {43522#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:05,933 INFO L290 TraceCheckUtils]: 30: Hoare triple {43522#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {43522#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:05,933 INFO L290 TraceCheckUtils]: 31: Hoare triple {43522#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {43522#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:05,933 INFO L290 TraceCheckUtils]: 32: Hoare triple {43522#(= 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); {43522#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:05,934 INFO L290 TraceCheckUtils]: 33: Hoare triple {43522#(= 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); {43522#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:05,934 INFO L290 TraceCheckUtils]: 34: Hoare triple {43522#(= 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); {43522#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:05,935 INFO L290 TraceCheckUtils]: 35: Hoare triple {43522#(= 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); {43522#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:05,935 INFO L290 TraceCheckUtils]: 36: Hoare triple {43522#(= 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); {43522#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:05,936 INFO L290 TraceCheckUtils]: 37: Hoare triple {43522#(= 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); {43522#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:05,936 INFO L290 TraceCheckUtils]: 38: Hoare triple {43522#(= 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); {43522#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:05,937 INFO L290 TraceCheckUtils]: 39: Hoare triple {43522#(= 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); {43523#(= |ssl3_accept_#t~mem54| 8496)} is VALID [2022-04-15 11:51:05,937 INFO L290 TraceCheckUtils]: 40: Hoare triple {43523#(= |ssl3_accept_#t~mem54| 8496)} assume 8482 == #t~mem54;havoc #t~mem54; {43518#false} is VALID [2022-04-15 11:51:05,937 INFO L290 TraceCheckUtils]: 41: Hoare triple {43518#false} call write~int(3, ~s.base, 52 + ~s.offset, 4); {43518#false} is VALID [2022-04-15 11:51:05,937 INFO L290 TraceCheckUtils]: 42: Hoare triple {43518#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); {43518#false} is VALID [2022-04-15 11:51:05,937 INFO L290 TraceCheckUtils]: 43: Hoare triple {43518#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {43518#false} is VALID [2022-04-15 11:51:05,937 INFO L290 TraceCheckUtils]: 44: Hoare triple {43518#false} ~skip~0 := 0; {43518#false} is VALID [2022-04-15 11:51:05,937 INFO L290 TraceCheckUtils]: 45: Hoare triple {43518#false} assume !false; {43518#false} is VALID [2022-04-15 11:51:05,938 INFO L290 TraceCheckUtils]: 46: Hoare triple {43518#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); {43518#false} is VALID [2022-04-15 11:51:05,938 INFO L290 TraceCheckUtils]: 47: Hoare triple {43518#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {43518#false} is VALID [2022-04-15 11:51:05,938 INFO L290 TraceCheckUtils]: 48: Hoare triple {43518#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {43518#false} is VALID [2022-04-15 11:51:05,938 INFO L290 TraceCheckUtils]: 49: Hoare triple {43518#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {43518#false} is VALID [2022-04-15 11:51:05,938 INFO L290 TraceCheckUtils]: 50: Hoare triple {43518#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {43518#false} is VALID [2022-04-15 11:51:05,938 INFO L290 TraceCheckUtils]: 51: Hoare triple {43518#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {43518#false} is VALID [2022-04-15 11:51:05,938 INFO L290 TraceCheckUtils]: 52: Hoare triple {43518#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {43518#false} is VALID [2022-04-15 11:51:05,938 INFO L290 TraceCheckUtils]: 53: Hoare triple {43518#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {43518#false} is VALID [2022-04-15 11:51:05,938 INFO L290 TraceCheckUtils]: 54: Hoare triple {43518#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {43518#false} is VALID [2022-04-15 11:51:05,938 INFO L290 TraceCheckUtils]: 55: Hoare triple {43518#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {43518#false} is VALID [2022-04-15 11:51:05,939 INFO L290 TraceCheckUtils]: 56: Hoare triple {43518#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {43518#false} is VALID [2022-04-15 11:51:05,939 INFO L290 TraceCheckUtils]: 57: Hoare triple {43518#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {43518#false} is VALID [2022-04-15 11:51:05,939 INFO L290 TraceCheckUtils]: 58: Hoare triple {43518#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {43518#false} is VALID [2022-04-15 11:51:05,939 INFO L290 TraceCheckUtils]: 59: Hoare triple {43518#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {43518#false} is VALID [2022-04-15 11:51:05,939 INFO L290 TraceCheckUtils]: 60: Hoare triple {43518#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {43518#false} is VALID [2022-04-15 11:51:05,939 INFO L290 TraceCheckUtils]: 61: Hoare triple {43518#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {43518#false} is VALID [2022-04-15 11:51:05,939 INFO L290 TraceCheckUtils]: 62: Hoare triple {43518#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {43518#false} is VALID [2022-04-15 11:51:05,939 INFO L290 TraceCheckUtils]: 63: Hoare triple {43518#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {43518#false} is VALID [2022-04-15 11:51:05,939 INFO L290 TraceCheckUtils]: 64: Hoare triple {43518#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {43518#false} is VALID [2022-04-15 11:51:05,939 INFO L290 TraceCheckUtils]: 65: Hoare triple {43518#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {43518#false} is VALID [2022-04-15 11:51:05,940 INFO L290 TraceCheckUtils]: 66: Hoare triple {43518#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {43518#false} is VALID [2022-04-15 11:51:05,940 INFO L290 TraceCheckUtils]: 67: Hoare triple {43518#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {43518#false} is VALID [2022-04-15 11:51:05,940 INFO L290 TraceCheckUtils]: 68: Hoare triple {43518#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {43518#false} is VALID [2022-04-15 11:51:05,940 INFO L290 TraceCheckUtils]: 69: Hoare triple {43518#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {43518#false} is VALID [2022-04-15 11:51:05,940 INFO L290 TraceCheckUtils]: 70: Hoare triple {43518#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {43518#false} is VALID [2022-04-15 11:51:05,940 INFO L290 TraceCheckUtils]: 71: Hoare triple {43518#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {43518#false} is VALID [2022-04-15 11:51:05,940 INFO L290 TraceCheckUtils]: 72: Hoare triple {43518#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {43518#false} is VALID [2022-04-15 11:51:05,940 INFO L290 TraceCheckUtils]: 73: Hoare triple {43518#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {43518#false} is VALID [2022-04-15 11:51:05,940 INFO L290 TraceCheckUtils]: 74: Hoare triple {43518#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {43518#false} is VALID [2022-04-15 11:51:05,940 INFO L290 TraceCheckUtils]: 75: Hoare triple {43518#false} assume 8640 == #t~mem75;havoc #t~mem75; {43518#false} is VALID [2022-04-15 11:51:05,941 INFO L290 TraceCheckUtils]: 76: Hoare triple {43518#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {43518#false} is VALID [2022-04-15 11:51:05,941 INFO L290 TraceCheckUtils]: 77: Hoare triple {43518#false} assume !(4 == ~blastFlag~0); {43518#false} is VALID [2022-04-15 11:51:05,941 INFO L290 TraceCheckUtils]: 78: Hoare triple {43518#false} assume !(7 == ~blastFlag~0); {43518#false} is VALID [2022-04-15 11:51:05,941 INFO L290 TraceCheckUtils]: 79: Hoare triple {43518#false} assume !(10 == ~blastFlag~0); {43518#false} is VALID [2022-04-15 11:51:05,941 INFO L290 TraceCheckUtils]: 80: Hoare triple {43518#false} assume 13 == ~blastFlag~0; {43518#false} is VALID [2022-04-15 11:51:05,941 INFO L290 TraceCheckUtils]: 81: Hoare triple {43518#false} assume !false; {43518#false} is VALID [2022-04-15 11:51:05,941 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:51:05,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:51:05,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40293715] [2022-04-15 11:51:05,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40293715] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:51:05,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:51:05,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:51:05,942 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:51:05,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1389688897] [2022-04-15 11:51:05,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1389688897] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:51:05,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:51:05,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:51:05,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908333851] [2022-04-15 11:51:05,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:51:05,943 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 82 [2022-04-15 11:51:05,943 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:51:05,943 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:06,019 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:51:06,019 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:51:06,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:51:06,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:51:06,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:51:06,020 INFO L87 Difference]: Start difference. First operand 511 states and 763 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:08,110 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:51:10,115 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-15 11:51:14,230 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:51:19,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:51:19,474 INFO L93 Difference]: Finished difference Result 714 states and 1073 transitions. [2022-04-15 11:51:19,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:51:19,474 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 82 [2022-04-15 11:51:19,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:51:19,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:19,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 485 transitions. [2022-04-15 11:51:19,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:19,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 485 transitions. [2022-04-15 11:51:19,478 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 485 transitions. [2022-04-15 11:51:19,789 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 485 edges. 485 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:51:19,800 INFO L225 Difference]: With dead ends: 714 [2022-04-15 11:51:19,800 INFO L226 Difference]: Without dead ends: 529 [2022-04-15 11:51:19,801 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:51:19,801 INFO L913 BasicCegarLoop]: 246 mSDtfsCounter, 33 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-04-15 11:51:19,801 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 613 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 442 Invalid, 1 Unknown, 0 Unchecked, 6.6s Time] [2022-04-15 11:51:19,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2022-04-15 11:51:19,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 511. [2022-04-15 11:51:19,824 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:51:19,825 INFO L82 GeneralOperation]: Start isEquivalent. First operand 529 states. Second operand has 511 states, 506 states have (on average 1.4980237154150198) internal successors, (758), 506 states have internal predecessors, (758), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:19,825 INFO L74 IsIncluded]: Start isIncluded. First operand 529 states. Second operand has 511 states, 506 states have (on average 1.4980237154150198) internal successors, (758), 506 states have internal predecessors, (758), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:19,826 INFO L87 Difference]: Start difference. First operand 529 states. Second operand has 511 states, 506 states have (on average 1.4980237154150198) internal successors, (758), 506 states have internal predecessors, (758), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:19,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:51:19,840 INFO L93 Difference]: Finished difference Result 529 states and 786 transitions. [2022-04-15 11:51:19,840 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 786 transitions. [2022-04-15 11:51:19,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:51:19,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:51:19,841 INFO L74 IsIncluded]: Start isIncluded. First operand has 511 states, 506 states have (on average 1.4980237154150198) internal successors, (758), 506 states have internal predecessors, (758), 3 states have call successors, (3), 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 529 states. [2022-04-15 11:51:19,842 INFO L87 Difference]: Start difference. First operand has 511 states, 506 states have (on average 1.4980237154150198) internal successors, (758), 506 states have internal predecessors, (758), 3 states have call successors, (3), 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 529 states. [2022-04-15 11:51:19,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:51:19,856 INFO L93 Difference]: Finished difference Result 529 states and 786 transitions. [2022-04-15 11:51:19,856 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 786 transitions. [2022-04-15 11:51:19,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:51:19,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:51:19,857 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:51:19,857 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:51:19,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 506 states have (on average 1.4980237154150198) internal successors, (758), 506 states have internal predecessors, (758), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:19,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 762 transitions. [2022-04-15 11:51:19,882 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 762 transitions. Word has length 82 [2022-04-15 11:51:19,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:51:19,882 INFO L478 AbstractCegarLoop]: Abstraction has 511 states and 762 transitions. [2022-04-15 11:51:19,882 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:19,883 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 511 states and 762 transitions. [2022-04-15 11:51:23,104 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 762 edges. 761 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:51:23,104 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 762 transitions. [2022-04-15 11:51:23,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-04-15 11:51:23,105 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:51:23,105 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:51:23,105 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-15 11:51:23,105 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:51:23,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:51:23,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1485544258, now seen corresponding path program 1 times [2022-04-15 11:51:23,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:51:23,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1417623508] [2022-04-15 11:51:23,138 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:51:23,138 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:51:23,138 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:51:23,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1485544258, now seen corresponding path program 2 times [2022-04-15 11:51:23,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:51:23,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726967754] [2022-04-15 11:51:23,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:51:23,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:51:23,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:51:23,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:51:23,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:51:23,430 INFO L290 TraceCheckUtils]: 0: Hoare triple {47045#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {47037#true} is VALID [2022-04-15 11:51:23,430 INFO L290 TraceCheckUtils]: 1: Hoare triple {47037#true} assume true; {47037#true} is VALID [2022-04-15 11:51:23,430 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {47037#true} {47037#true} #708#return; {47037#true} is VALID [2022-04-15 11:51:23,431 INFO L272 TraceCheckUtils]: 0: Hoare triple {47037#true} call ULTIMATE.init(); {47045#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:51:23,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {47045#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {47037#true} is VALID [2022-04-15 11:51:23,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {47037#true} assume true; {47037#true} is VALID [2022-04-15 11:51:23,432 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47037#true} {47037#true} #708#return; {47037#true} is VALID [2022-04-15 11:51:23,432 INFO L272 TraceCheckUtils]: 4: Hoare triple {47037#true} call #t~ret161 := main(); {47037#true} is VALID [2022-04-15 11:51:23,432 INFO L290 TraceCheckUtils]: 5: Hoare triple {47037#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; {47037#true} is VALID [2022-04-15 11:51:23,432 INFO L290 TraceCheckUtils]: 6: Hoare triple {47037#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {47037#true} is VALID [2022-04-15 11:51:23,432 INFO L272 TraceCheckUtils]: 7: Hoare triple {47037#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {47037#true} is VALID [2022-04-15 11:51:23,432 INFO L290 TraceCheckUtils]: 8: Hoare triple {47037#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); {47037#true} is VALID [2022-04-15 11:51:23,432 INFO L290 TraceCheckUtils]: 9: Hoare triple {47037#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; {47037#true} is VALID [2022-04-15 11:51:23,432 INFO L290 TraceCheckUtils]: 10: Hoare triple {47037#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; {47037#true} is VALID [2022-04-15 11:51:23,433 INFO L290 TraceCheckUtils]: 11: Hoare triple {47037#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {47037#true} is VALID [2022-04-15 11:51:23,433 INFO L290 TraceCheckUtils]: 12: Hoare triple {47037#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {47037#true} is VALID [2022-04-15 11:51:23,433 INFO L290 TraceCheckUtils]: 13: Hoare triple {47037#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {47037#true} is VALID [2022-04-15 11:51:23,433 INFO L290 TraceCheckUtils]: 14: Hoare triple {47037#true} assume !false; {47037#true} is VALID [2022-04-15 11:51:23,433 INFO L290 TraceCheckUtils]: 15: Hoare triple {47037#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); {47037#true} is VALID [2022-04-15 11:51:23,433 INFO L290 TraceCheckUtils]: 16: Hoare triple {47037#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {47037#true} is VALID [2022-04-15 11:51:23,433 INFO L290 TraceCheckUtils]: 17: Hoare triple {47037#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {47037#true} is VALID [2022-04-15 11:51:23,433 INFO L290 TraceCheckUtils]: 18: Hoare triple {47037#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {47037#true} is VALID [2022-04-15 11:51:23,433 INFO L290 TraceCheckUtils]: 19: Hoare triple {47037#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {47037#true} is VALID [2022-04-15 11:51:23,434 INFO L290 TraceCheckUtils]: 20: Hoare triple {47037#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {47037#true} is VALID [2022-04-15 11:51:23,434 INFO L290 TraceCheckUtils]: 21: Hoare triple {47037#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {47037#true} is VALID [2022-04-15 11:51:23,434 INFO L290 TraceCheckUtils]: 22: Hoare triple {47037#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {47037#true} is VALID [2022-04-15 11:51:23,434 INFO L290 TraceCheckUtils]: 23: Hoare triple {47037#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {47037#true} is VALID [2022-04-15 11:51:23,434 INFO L290 TraceCheckUtils]: 24: Hoare triple {47037#true} assume 8464 == #t~mem55;havoc #t~mem55; {47037#true} is VALID [2022-04-15 11:51:23,434 INFO L290 TraceCheckUtils]: 25: Hoare triple {47037#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; {47037#true} is VALID [2022-04-15 11:51:23,434 INFO L290 TraceCheckUtils]: 26: Hoare triple {47037#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {47037#true} is VALID [2022-04-15 11:51:23,434 INFO L290 TraceCheckUtils]: 27: Hoare triple {47037#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); {47037#true} is VALID [2022-04-15 11:51:23,434 INFO L290 TraceCheckUtils]: 28: Hoare triple {47037#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); {47037#true} is VALID [2022-04-15 11:51:23,435 INFO L290 TraceCheckUtils]: 29: Hoare triple {47037#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {47037#true} is VALID [2022-04-15 11:51:23,435 INFO L290 TraceCheckUtils]: 30: Hoare triple {47037#true} ~skip~0 := 0; {47037#true} is VALID [2022-04-15 11:51:23,435 INFO L290 TraceCheckUtils]: 31: Hoare triple {47037#true} assume !false; {47037#true} is VALID [2022-04-15 11:51:23,435 INFO L290 TraceCheckUtils]: 32: Hoare triple {47037#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); {47042#(= |ssl3_accept_#t~mem47| (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:23,436 INFO L290 TraceCheckUtils]: 33: Hoare triple {47042#(= |ssl3_accept_#t~mem47| (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 12292 == #t~mem47;havoc #t~mem47; {47043#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:23,437 INFO L290 TraceCheckUtils]: 34: Hoare triple {47043#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(1, ~s.base, 40 + ~s.offset, 4); {47043#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:23,438 INFO L290 TraceCheckUtils]: 35: Hoare triple {47043#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(1, ~s.base, 36 + ~s.offset, 4); {47043#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:23,438 INFO L290 TraceCheckUtils]: 36: Hoare triple {47043#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {47043#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:23,439 INFO L290 TraceCheckUtils]: 37: Hoare triple {47043#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {47043#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:23,440 INFO L290 TraceCheckUtils]: 38: Hoare triple {47043#(= 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); {47043#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:23,440 INFO L290 TraceCheckUtils]: 39: Hoare triple {47043#(= 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; {47043#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:23,441 INFO L290 TraceCheckUtils]: 40: Hoare triple {47043#(= 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); {47044#(= 12292 |ssl3_accept_#t~mem85|)} is VALID [2022-04-15 11:51:23,442 INFO L290 TraceCheckUtils]: 41: Hoare triple {47044#(= 12292 |ssl3_accept_#t~mem85|)} assume 12292 != #t~mem85;havoc #t~mem85; {47038#false} is VALID [2022-04-15 11:51:23,442 INFO L290 TraceCheckUtils]: 42: Hoare triple {47038#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; {47038#false} is VALID [2022-04-15 11:51:23,442 INFO L290 TraceCheckUtils]: 43: Hoare triple {47038#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); {47038#false} is VALID [2022-04-15 11:51:23,442 INFO L290 TraceCheckUtils]: 44: Hoare triple {47038#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {47038#false} is VALID [2022-04-15 11:51:23,442 INFO L290 TraceCheckUtils]: 45: Hoare triple {47038#false} ~skip~0 := 0; {47038#false} is VALID [2022-04-15 11:51:23,442 INFO L290 TraceCheckUtils]: 46: Hoare triple {47038#false} assume !false; {47038#false} is VALID [2022-04-15 11:51:23,442 INFO L290 TraceCheckUtils]: 47: Hoare triple {47038#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); {47038#false} is VALID [2022-04-15 11:51:23,442 INFO L290 TraceCheckUtils]: 48: Hoare triple {47038#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {47038#false} is VALID [2022-04-15 11:51:23,443 INFO L290 TraceCheckUtils]: 49: Hoare triple {47038#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {47038#false} is VALID [2022-04-15 11:51:23,443 INFO L290 TraceCheckUtils]: 50: Hoare triple {47038#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {47038#false} is VALID [2022-04-15 11:51:23,443 INFO L290 TraceCheckUtils]: 51: Hoare triple {47038#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {47038#false} is VALID [2022-04-15 11:51:23,443 INFO L290 TraceCheckUtils]: 52: Hoare triple {47038#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {47038#false} is VALID [2022-04-15 11:51:23,443 INFO L290 TraceCheckUtils]: 53: Hoare triple {47038#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {47038#false} is VALID [2022-04-15 11:51:23,443 INFO L290 TraceCheckUtils]: 54: Hoare triple {47038#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {47038#false} is VALID [2022-04-15 11:51:23,443 INFO L290 TraceCheckUtils]: 55: Hoare triple {47038#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {47038#false} is VALID [2022-04-15 11:51:23,443 INFO L290 TraceCheckUtils]: 56: Hoare triple {47038#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {47038#false} is VALID [2022-04-15 11:51:23,443 INFO L290 TraceCheckUtils]: 57: Hoare triple {47038#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {47038#false} is VALID [2022-04-15 11:51:23,443 INFO L290 TraceCheckUtils]: 58: Hoare triple {47038#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {47038#false} is VALID [2022-04-15 11:51:23,443 INFO L290 TraceCheckUtils]: 59: Hoare triple {47038#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {47038#false} is VALID [2022-04-15 11:51:23,444 INFO L290 TraceCheckUtils]: 60: Hoare triple {47038#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {47038#false} is VALID [2022-04-15 11:51:23,444 INFO L290 TraceCheckUtils]: 61: Hoare triple {47038#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {47038#false} is VALID [2022-04-15 11:51:23,444 INFO L290 TraceCheckUtils]: 62: Hoare triple {47038#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {47038#false} is VALID [2022-04-15 11:51:23,444 INFO L290 TraceCheckUtils]: 63: Hoare triple {47038#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {47038#false} is VALID [2022-04-15 11:51:23,444 INFO L290 TraceCheckUtils]: 64: Hoare triple {47038#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {47038#false} is VALID [2022-04-15 11:51:23,444 INFO L290 TraceCheckUtils]: 65: Hoare triple {47038#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {47038#false} is VALID [2022-04-15 11:51:23,444 INFO L290 TraceCheckUtils]: 66: Hoare triple {47038#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {47038#false} is VALID [2022-04-15 11:51:23,444 INFO L290 TraceCheckUtils]: 67: Hoare triple {47038#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {47038#false} is VALID [2022-04-15 11:51:23,444 INFO L290 TraceCheckUtils]: 68: Hoare triple {47038#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {47038#false} is VALID [2022-04-15 11:51:23,444 INFO L290 TraceCheckUtils]: 69: Hoare triple {47038#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {47038#false} is VALID [2022-04-15 11:51:23,444 INFO L290 TraceCheckUtils]: 70: Hoare triple {47038#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {47038#false} is VALID [2022-04-15 11:51:23,445 INFO L290 TraceCheckUtils]: 71: Hoare triple {47038#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {47038#false} is VALID [2022-04-15 11:51:23,445 INFO L290 TraceCheckUtils]: 72: Hoare triple {47038#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {47038#false} is VALID [2022-04-15 11:51:23,445 INFO L290 TraceCheckUtils]: 73: Hoare triple {47038#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {47038#false} is VALID [2022-04-15 11:51:23,445 INFO L290 TraceCheckUtils]: 74: Hoare triple {47038#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {47038#false} is VALID [2022-04-15 11:51:23,445 INFO L290 TraceCheckUtils]: 75: Hoare triple {47038#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {47038#false} is VALID [2022-04-15 11:51:23,445 INFO L290 TraceCheckUtils]: 76: Hoare triple {47038#false} assume 8640 == #t~mem75;havoc #t~mem75; {47038#false} is VALID [2022-04-15 11:51:23,445 INFO L290 TraceCheckUtils]: 77: Hoare triple {47038#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {47038#false} is VALID [2022-04-15 11:51:23,445 INFO L290 TraceCheckUtils]: 78: Hoare triple {47038#false} assume !(4 == ~blastFlag~0); {47038#false} is VALID [2022-04-15 11:51:23,445 INFO L290 TraceCheckUtils]: 79: Hoare triple {47038#false} assume !(7 == ~blastFlag~0); {47038#false} is VALID [2022-04-15 11:51:23,445 INFO L290 TraceCheckUtils]: 80: Hoare triple {47038#false} assume !(10 == ~blastFlag~0); {47038#false} is VALID [2022-04-15 11:51:23,446 INFO L290 TraceCheckUtils]: 81: Hoare triple {47038#false} assume 13 == ~blastFlag~0; {47038#false} is VALID [2022-04-15 11:51:23,446 INFO L290 TraceCheckUtils]: 82: Hoare triple {47038#false} assume !false; {47038#false} is VALID [2022-04-15 11:51:23,446 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 11:51:23,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:51:23,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726967754] [2022-04-15 11:51:23,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726967754] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:51:23,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:51:23,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:51:23,447 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:51:23,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1417623508] [2022-04-15 11:51:23,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1417623508] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:51:23,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:51:23,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:51:23,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599176974] [2022-04-15 11:51:23,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:51:23,447 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 83 [2022-04-15 11:51:23,448 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:51:23,448 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:23,521 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:51:23,522 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 11:51:23,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:51:23,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 11:51:23,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:51:23,522 INFO L87 Difference]: Start difference. First operand 511 states and 762 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:28,483 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:51:35,020 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-15 11:51:40,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:51:40,811 INFO L93 Difference]: Finished difference Result 881 states and 1316 transitions. [2022-04-15 11:51:40,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 11:51:40,811 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 83 [2022-04-15 11:51:40,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:51:40,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:40,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 439 transitions. [2022-04-15 11:51:40,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:40,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 439 transitions. [2022-04-15 11:51:40,816 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 439 transitions. [2022-04-15 11:51:41,111 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-15 11:51:41,122 INFO L225 Difference]: With dead ends: 881 [2022-04-15 11:51:41,122 INFO L226 Difference]: Without dead ends: 529 [2022-04-15 11:51:41,122 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-15 11:51:41,123 INFO L913 BasicCegarLoop]: 222 mSDtfsCounter, 3 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-04-15 11:51:41,123 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 690 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 462 Invalid, 1 Unknown, 0 Unchecked, 6.9s Time] [2022-04-15 11:51:41,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2022-04-15 11:51:41,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 529. [2022-04-15 11:51:41,145 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:51:41,146 INFO L82 GeneralOperation]: Start isEquivalent. First operand 529 states. Second operand has 529 states, 524 states have (on average 1.4885496183206106) internal successors, (780), 524 states have internal predecessors, (780), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:41,147 INFO L74 IsIncluded]: Start isIncluded. First operand 529 states. Second operand has 529 states, 524 states have (on average 1.4885496183206106) internal successors, (780), 524 states have internal predecessors, (780), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:41,148 INFO L87 Difference]: Start difference. First operand 529 states. Second operand has 529 states, 524 states have (on average 1.4885496183206106) internal successors, (780), 524 states have internal predecessors, (780), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:41,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:51:41,161 INFO L93 Difference]: Finished difference Result 529 states and 784 transitions. [2022-04-15 11:51:41,161 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 784 transitions. [2022-04-15 11:51:41,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:51:41,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:51:41,162 INFO L74 IsIncluded]: Start isIncluded. First operand has 529 states, 524 states have (on average 1.4885496183206106) internal successors, (780), 524 states have internal predecessors, (780), 3 states have call successors, (3), 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 529 states. [2022-04-15 11:51:41,163 INFO L87 Difference]: Start difference. First operand has 529 states, 524 states have (on average 1.4885496183206106) internal successors, (780), 524 states have internal predecessors, (780), 3 states have call successors, (3), 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 529 states. [2022-04-15 11:51:41,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:51:41,176 INFO L93 Difference]: Finished difference Result 529 states and 784 transitions. [2022-04-15 11:51:41,176 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 784 transitions. [2022-04-15 11:51:41,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:51:41,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:51:41,177 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:51:41,177 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:51:41,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 524 states have (on average 1.4885496183206106) internal successors, (780), 524 states have internal predecessors, (780), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:41,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 784 transitions. [2022-04-15 11:51:41,197 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 784 transitions. Word has length 83 [2022-04-15 11:51:41,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:51:41,198 INFO L478 AbstractCegarLoop]: Abstraction has 529 states and 784 transitions. [2022-04-15 11:51:41,198 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:41,198 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 529 states and 784 transitions. [2022-04-15 11:51:44,396 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 784 edges. 783 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:51:44,396 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 784 transitions. [2022-04-15 11:51:44,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-15 11:51:44,397 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:51:44,397 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:51:44,397 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-15 11:51:44,398 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:51:44,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:51:44,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1443200503, now seen corresponding path program 1 times [2022-04-15 11:51:44,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:51:44,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1112842935] [2022-04-15 11:51:44,440 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:51:44,440 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:51:44,440 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:51:44,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1443200503, now seen corresponding path program 2 times [2022-04-15 11:51:44,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:51:44,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734180360] [2022-04-15 11:51:44,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:51:44,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:51:44,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:51:44,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:51:44,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:51:44,674 INFO L290 TraceCheckUtils]: 0: Hoare triple {50935#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {50928#true} is VALID [2022-04-15 11:51:44,674 INFO L290 TraceCheckUtils]: 1: Hoare triple {50928#true} assume true; {50928#true} is VALID [2022-04-15 11:51:44,674 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {50928#true} {50928#true} #708#return; {50928#true} is VALID [2022-04-15 11:51:44,675 INFO L272 TraceCheckUtils]: 0: Hoare triple {50928#true} call ULTIMATE.init(); {50935#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:51:44,675 INFO L290 TraceCheckUtils]: 1: Hoare triple {50935#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {50928#true} is VALID [2022-04-15 11:51:44,675 INFO L290 TraceCheckUtils]: 2: Hoare triple {50928#true} assume true; {50928#true} is VALID [2022-04-15 11:51:44,675 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50928#true} {50928#true} #708#return; {50928#true} is VALID [2022-04-15 11:51:44,676 INFO L272 TraceCheckUtils]: 4: Hoare triple {50928#true} call #t~ret161 := main(); {50928#true} is VALID [2022-04-15 11:51:44,676 INFO L290 TraceCheckUtils]: 5: Hoare triple {50928#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; {50928#true} is VALID [2022-04-15 11:51:44,676 INFO L290 TraceCheckUtils]: 6: Hoare triple {50928#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {50928#true} is VALID [2022-04-15 11:51:44,676 INFO L272 TraceCheckUtils]: 7: Hoare triple {50928#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {50928#true} is VALID [2022-04-15 11:51:44,676 INFO L290 TraceCheckUtils]: 8: Hoare triple {50928#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); {50928#true} is VALID [2022-04-15 11:51:44,676 INFO L290 TraceCheckUtils]: 9: Hoare triple {50928#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; {50928#true} is VALID [2022-04-15 11:51:44,676 INFO L290 TraceCheckUtils]: 10: Hoare triple {50928#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; {50928#true} is VALID [2022-04-15 11:51:44,676 INFO L290 TraceCheckUtils]: 11: Hoare triple {50928#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {50928#true} is VALID [2022-04-15 11:51:44,676 INFO L290 TraceCheckUtils]: 12: Hoare triple {50928#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {50928#true} is VALID [2022-04-15 11:51:44,677 INFO L290 TraceCheckUtils]: 13: Hoare triple {50928#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {50928#true} is VALID [2022-04-15 11:51:44,677 INFO L290 TraceCheckUtils]: 14: Hoare triple {50928#true} assume !false; {50928#true} is VALID [2022-04-15 11:51:44,677 INFO L290 TraceCheckUtils]: 15: Hoare triple {50928#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); {50928#true} is VALID [2022-04-15 11:51:44,677 INFO L290 TraceCheckUtils]: 16: Hoare triple {50928#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {50928#true} is VALID [2022-04-15 11:51:44,677 INFO L290 TraceCheckUtils]: 17: Hoare triple {50928#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {50928#true} is VALID [2022-04-15 11:51:44,677 INFO L290 TraceCheckUtils]: 18: Hoare triple {50928#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {50928#true} is VALID [2022-04-15 11:51:44,677 INFO L290 TraceCheckUtils]: 19: Hoare triple {50928#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {50928#true} is VALID [2022-04-15 11:51:44,677 INFO L290 TraceCheckUtils]: 20: Hoare triple {50928#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {50928#true} is VALID [2022-04-15 11:51:44,678 INFO L290 TraceCheckUtils]: 21: Hoare triple {50928#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {50928#true} is VALID [2022-04-15 11:51:44,678 INFO L290 TraceCheckUtils]: 22: Hoare triple {50928#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {50928#true} is VALID [2022-04-15 11:51:44,678 INFO L290 TraceCheckUtils]: 23: Hoare triple {50928#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {50928#true} is VALID [2022-04-15 11:51:44,678 INFO L290 TraceCheckUtils]: 24: Hoare triple {50928#true} assume 8464 == #t~mem55;havoc #t~mem55; {50928#true} is VALID [2022-04-15 11:51:44,678 INFO L290 TraceCheckUtils]: 25: Hoare triple {50928#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; {50928#true} is VALID [2022-04-15 11:51:44,678 INFO L290 TraceCheckUtils]: 26: Hoare triple {50928#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {50928#true} is VALID [2022-04-15 11:51:44,679 INFO L290 TraceCheckUtils]: 27: Hoare triple {50928#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); {50933#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:44,680 INFO L290 TraceCheckUtils]: 28: Hoare triple {50933#(not (= 24576 (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); {50933#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:44,681 INFO L290 TraceCheckUtils]: 29: Hoare triple {50933#(not (= 24576 (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; {50933#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:44,681 INFO L290 TraceCheckUtils]: 30: Hoare triple {50933#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {50933#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:44,681 INFO L290 TraceCheckUtils]: 31: Hoare triple {50933#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {50933#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:44,682 INFO L290 TraceCheckUtils]: 32: Hoare triple {50933#(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); {50933#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:44,682 INFO L290 TraceCheckUtils]: 33: Hoare triple {50933#(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); {50933#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:44,683 INFO L290 TraceCheckUtils]: 34: Hoare triple {50933#(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); {50933#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:44,683 INFO L290 TraceCheckUtils]: 35: Hoare triple {50933#(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); {50934#(not (= 24576 |ssl3_accept_#t~mem50|))} is VALID [2022-04-15 11:51:44,684 INFO L290 TraceCheckUtils]: 36: Hoare triple {50934#(not (= 24576 |ssl3_accept_#t~mem50|))} assume 24576 == #t~mem50;havoc #t~mem50; {50929#false} is VALID [2022-04-15 11:51:44,684 INFO L290 TraceCheckUtils]: 37: Hoare triple {50929#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {50929#false} is VALID [2022-04-15 11:51:44,684 INFO L290 TraceCheckUtils]: 38: Hoare triple {50929#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {50929#false} is VALID [2022-04-15 11:51:44,684 INFO L290 TraceCheckUtils]: 39: Hoare triple {50929#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {50929#false} is VALID [2022-04-15 11:51:44,684 INFO L290 TraceCheckUtils]: 40: Hoare triple {50929#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); {50929#false} is VALID [2022-04-15 11:51:44,684 INFO L290 TraceCheckUtils]: 41: Hoare triple {50929#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {50929#false} is VALID [2022-04-15 11:51:44,684 INFO L290 TraceCheckUtils]: 42: Hoare triple {50929#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); {50929#false} is VALID [2022-04-15 11:51:44,684 INFO L290 TraceCheckUtils]: 43: Hoare triple {50929#false} assume 12292 != #t~mem85;havoc #t~mem85; {50929#false} is VALID [2022-04-15 11:51:44,684 INFO L290 TraceCheckUtils]: 44: Hoare triple {50929#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; {50929#false} is VALID [2022-04-15 11:51:44,685 INFO L290 TraceCheckUtils]: 45: Hoare triple {50929#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); {50929#false} is VALID [2022-04-15 11:51:44,685 INFO L290 TraceCheckUtils]: 46: Hoare triple {50929#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {50929#false} is VALID [2022-04-15 11:51:44,685 INFO L290 TraceCheckUtils]: 47: Hoare triple {50929#false} ~skip~0 := 0; {50929#false} is VALID [2022-04-15 11:51:44,685 INFO L290 TraceCheckUtils]: 48: Hoare triple {50929#false} assume !false; {50929#false} is VALID [2022-04-15 11:51:44,685 INFO L290 TraceCheckUtils]: 49: Hoare triple {50929#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); {50929#false} is VALID [2022-04-15 11:51:44,685 INFO L290 TraceCheckUtils]: 50: Hoare triple {50929#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {50929#false} is VALID [2022-04-15 11:51:44,685 INFO L290 TraceCheckUtils]: 51: Hoare triple {50929#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {50929#false} is VALID [2022-04-15 11:51:44,685 INFO L290 TraceCheckUtils]: 52: Hoare triple {50929#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {50929#false} is VALID [2022-04-15 11:51:44,685 INFO L290 TraceCheckUtils]: 53: Hoare triple {50929#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {50929#false} is VALID [2022-04-15 11:51:44,685 INFO L290 TraceCheckUtils]: 54: Hoare triple {50929#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {50929#false} is VALID [2022-04-15 11:51:44,686 INFO L290 TraceCheckUtils]: 55: Hoare triple {50929#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {50929#false} is VALID [2022-04-15 11:51:44,686 INFO L290 TraceCheckUtils]: 56: Hoare triple {50929#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {50929#false} is VALID [2022-04-15 11:51:44,686 INFO L290 TraceCheckUtils]: 57: Hoare triple {50929#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {50929#false} is VALID [2022-04-15 11:51:44,686 INFO L290 TraceCheckUtils]: 58: Hoare triple {50929#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {50929#false} is VALID [2022-04-15 11:51:44,686 INFO L290 TraceCheckUtils]: 59: Hoare triple {50929#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {50929#false} is VALID [2022-04-15 11:51:44,686 INFO L290 TraceCheckUtils]: 60: Hoare triple {50929#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {50929#false} is VALID [2022-04-15 11:51:44,686 INFO L290 TraceCheckUtils]: 61: Hoare triple {50929#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {50929#false} is VALID [2022-04-15 11:51:44,686 INFO L290 TraceCheckUtils]: 62: Hoare triple {50929#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {50929#false} is VALID [2022-04-15 11:51:44,686 INFO L290 TraceCheckUtils]: 63: Hoare triple {50929#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {50929#false} is VALID [2022-04-15 11:51:44,686 INFO L290 TraceCheckUtils]: 64: Hoare triple {50929#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {50929#false} is VALID [2022-04-15 11:51:44,686 INFO L290 TraceCheckUtils]: 65: Hoare triple {50929#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {50929#false} is VALID [2022-04-15 11:51:44,687 INFO L290 TraceCheckUtils]: 66: Hoare triple {50929#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {50929#false} is VALID [2022-04-15 11:51:44,687 INFO L290 TraceCheckUtils]: 67: Hoare triple {50929#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {50929#false} is VALID [2022-04-15 11:51:44,687 INFO L290 TraceCheckUtils]: 68: Hoare triple {50929#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {50929#false} is VALID [2022-04-15 11:51:44,687 INFO L290 TraceCheckUtils]: 69: Hoare triple {50929#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {50929#false} is VALID [2022-04-15 11:51:44,687 INFO L290 TraceCheckUtils]: 70: Hoare triple {50929#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {50929#false} is VALID [2022-04-15 11:51:44,687 INFO L290 TraceCheckUtils]: 71: Hoare triple {50929#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {50929#false} is VALID [2022-04-15 11:51:44,687 INFO L290 TraceCheckUtils]: 72: Hoare triple {50929#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {50929#false} is VALID [2022-04-15 11:51:44,687 INFO L290 TraceCheckUtils]: 73: Hoare triple {50929#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {50929#false} is VALID [2022-04-15 11:51:44,687 INFO L290 TraceCheckUtils]: 74: Hoare triple {50929#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {50929#false} is VALID [2022-04-15 11:51:44,687 INFO L290 TraceCheckUtils]: 75: Hoare triple {50929#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {50929#false} is VALID [2022-04-15 11:51:44,688 INFO L290 TraceCheckUtils]: 76: Hoare triple {50929#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {50929#false} is VALID [2022-04-15 11:51:44,688 INFO L290 TraceCheckUtils]: 77: Hoare triple {50929#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {50929#false} is VALID [2022-04-15 11:51:44,688 INFO L290 TraceCheckUtils]: 78: Hoare triple {50929#false} assume 8640 == #t~mem75;havoc #t~mem75; {50929#false} is VALID [2022-04-15 11:51:44,688 INFO L290 TraceCheckUtils]: 79: Hoare triple {50929#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {50929#false} is VALID [2022-04-15 11:51:44,688 INFO L290 TraceCheckUtils]: 80: Hoare triple {50929#false} assume !(4 == ~blastFlag~0); {50929#false} is VALID [2022-04-15 11:51:44,688 INFO L290 TraceCheckUtils]: 81: Hoare triple {50929#false} assume !(7 == ~blastFlag~0); {50929#false} is VALID [2022-04-15 11:51:44,688 INFO L290 TraceCheckUtils]: 82: Hoare triple {50929#false} assume !(10 == ~blastFlag~0); {50929#false} is VALID [2022-04-15 11:51:44,688 INFO L290 TraceCheckUtils]: 83: Hoare triple {50929#false} assume 13 == ~blastFlag~0; {50929#false} is VALID [2022-04-15 11:51:44,688 INFO L290 TraceCheckUtils]: 84: Hoare triple {50929#false} assume !false; {50929#false} is VALID [2022-04-15 11:51:44,689 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:51:44,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:51:44,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734180360] [2022-04-15 11:51:44,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734180360] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:51:44,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:51:44,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:51:44,689 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:51:44,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1112842935] [2022-04-15 11:51:44,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1112842935] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:51:44,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:51:44,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:51:44,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382085535] [2022-04-15 11:51:44,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:51:44,692 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2022-04-15 11:51:44,692 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:51:44,692 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-15 11:51:44,764 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-15 11:51:44,764 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:51:44,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:51:44,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:51:44,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:51:44,765 INFO L87 Difference]: Start difference. First operand 529 states and 784 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-15 11:51:46,848 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-15 11:51:51,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:51:51,979 INFO L93 Difference]: Finished difference Result 1217 states and 1810 transitions. [2022-04-15 11:51:51,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:51:51,979 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2022-04-15 11:51:51,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:51:51,979 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-15 11:51:51,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 613 transitions. [2022-04-15 11:51:51,982 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-15 11:51:51,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 613 transitions. [2022-04-15 11:51:51,984 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 613 transitions. [2022-04-15 11:51:52,404 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 613 edges. 613 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:51:52,433 INFO L225 Difference]: With dead ends: 1217 [2022-04-15 11:51:52,433 INFO L226 Difference]: Without dead ends: 847 [2022-04-15 11:51:52,434 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-15 11:51:52,434 INFO L913 BasicCegarLoop]: 125 mSDtfsCounter, 150 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 64 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-04-15 11:51:52,435 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 366 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 481 Invalid, 1 Unknown, 0 Unchecked, 3.8s Time] [2022-04-15 11:51:52,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2022-04-15 11:51:52,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 529. [2022-04-15 11:51:52,472 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:51:52,474 INFO L82 GeneralOperation]: Start isEquivalent. First operand 847 states. Second operand has 529 states, 524 states have (on average 1.4770992366412214) internal successors, (774), 524 states have internal predecessors, (774), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:52,475 INFO L74 IsIncluded]: Start isIncluded. First operand 847 states. Second operand has 529 states, 524 states have (on average 1.4770992366412214) internal successors, (774), 524 states have internal predecessors, (774), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:52,475 INFO L87 Difference]: Start difference. First operand 847 states. Second operand has 529 states, 524 states have (on average 1.4770992366412214) internal successors, (774), 524 states have internal predecessors, (774), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:52,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:51:52,499 INFO L93 Difference]: Finished difference Result 847 states and 1252 transitions. [2022-04-15 11:51:52,499 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1252 transitions. [2022-04-15 11:51:52,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:51:52,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:51:52,501 INFO L74 IsIncluded]: Start isIncluded. First operand has 529 states, 524 states have (on average 1.4770992366412214) internal successors, (774), 524 states have internal predecessors, (774), 3 states have call successors, (3), 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 847 states. [2022-04-15 11:51:52,501 INFO L87 Difference]: Start difference. First operand has 529 states, 524 states have (on average 1.4770992366412214) internal successors, (774), 524 states have internal predecessors, (774), 3 states have call successors, (3), 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 847 states. [2022-04-15 11:51:52,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:51:52,534 INFO L93 Difference]: Finished difference Result 847 states and 1252 transitions. [2022-04-15 11:51:52,535 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1252 transitions. [2022-04-15 11:51:52,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:51:52,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:51:52,536 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:51:52,536 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:51:52,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 524 states have (on average 1.4770992366412214) internal successors, (774), 524 states have internal predecessors, (774), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:52,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 778 transitions. [2022-04-15 11:51:52,548 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 778 transitions. Word has length 85 [2022-04-15 11:51:52,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:51:52,549 INFO L478 AbstractCegarLoop]: Abstraction has 529 states and 778 transitions. [2022-04-15 11:51:52,549 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-15 11:51:52,549 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 529 states and 778 transitions. [2022-04-15 11:51:55,490 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 778 edges. 777 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:51:55,491 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 778 transitions. [2022-04-15 11:51:55,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-15 11:51:55,491 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:51:55,491 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:51:55,492 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-15 11:51:55,492 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:51:55,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:51:55,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1206059988, now seen corresponding path program 1 times [2022-04-15 11:51:55,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:51:55,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1093133617] [2022-04-15 11:51:55,522 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:51:55,522 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:51:55,523 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:51:55,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1206059988, now seen corresponding path program 2 times [2022-04-15 11:51:55,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:51:55,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421724602] [2022-04-15 11:51:55,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:51:55,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:51:55,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:51:55,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:51:55,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:51:55,758 INFO L290 TraceCheckUtils]: 0: Hoare triple {56133#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {56126#true} is VALID [2022-04-15 11:51:55,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {56126#true} assume true; {56126#true} is VALID [2022-04-15 11:51:55,758 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {56126#true} {56126#true} #708#return; {56126#true} is VALID [2022-04-15 11:51:55,759 INFO L272 TraceCheckUtils]: 0: Hoare triple {56126#true} call ULTIMATE.init(); {56133#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:51:55,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {56133#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {56126#true} is VALID [2022-04-15 11:51:55,759 INFO L290 TraceCheckUtils]: 2: Hoare triple {56126#true} assume true; {56126#true} is VALID [2022-04-15 11:51:55,759 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56126#true} {56126#true} #708#return; {56126#true} is VALID [2022-04-15 11:51:55,759 INFO L272 TraceCheckUtils]: 4: Hoare triple {56126#true} call #t~ret161 := main(); {56126#true} is VALID [2022-04-15 11:51:55,759 INFO L290 TraceCheckUtils]: 5: Hoare triple {56126#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; {56126#true} is VALID [2022-04-15 11:51:55,759 INFO L290 TraceCheckUtils]: 6: Hoare triple {56126#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {56126#true} is VALID [2022-04-15 11:51:55,760 INFO L272 TraceCheckUtils]: 7: Hoare triple {56126#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {56126#true} is VALID [2022-04-15 11:51:55,760 INFO L290 TraceCheckUtils]: 8: Hoare triple {56126#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); {56126#true} is VALID [2022-04-15 11:51:55,760 INFO L290 TraceCheckUtils]: 9: Hoare triple {56126#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; {56126#true} is VALID [2022-04-15 11:51:55,760 INFO L290 TraceCheckUtils]: 10: Hoare triple {56126#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; {56126#true} is VALID [2022-04-15 11:51:55,760 INFO L290 TraceCheckUtils]: 11: Hoare triple {56126#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {56126#true} is VALID [2022-04-15 11:51:55,760 INFO L290 TraceCheckUtils]: 12: Hoare triple {56126#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {56126#true} is VALID [2022-04-15 11:51:55,760 INFO L290 TraceCheckUtils]: 13: Hoare triple {56126#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {56126#true} is VALID [2022-04-15 11:51:55,760 INFO L290 TraceCheckUtils]: 14: Hoare triple {56126#true} assume !false; {56126#true} is VALID [2022-04-15 11:51:55,760 INFO L290 TraceCheckUtils]: 15: Hoare triple {56126#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); {56126#true} is VALID [2022-04-15 11:51:55,760 INFO L290 TraceCheckUtils]: 16: Hoare triple {56126#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {56126#true} is VALID [2022-04-15 11:51:55,761 INFO L290 TraceCheckUtils]: 17: Hoare triple {56126#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {56126#true} is VALID [2022-04-15 11:51:55,761 INFO L290 TraceCheckUtils]: 18: Hoare triple {56126#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {56126#true} is VALID [2022-04-15 11:51:55,761 INFO L290 TraceCheckUtils]: 19: Hoare triple {56126#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {56126#true} is VALID [2022-04-15 11:51:55,761 INFO L290 TraceCheckUtils]: 20: Hoare triple {56126#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {56126#true} is VALID [2022-04-15 11:51:55,761 INFO L290 TraceCheckUtils]: 21: Hoare triple {56126#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {56126#true} is VALID [2022-04-15 11:51:55,761 INFO L290 TraceCheckUtils]: 22: Hoare triple {56126#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {56126#true} is VALID [2022-04-15 11:51:55,761 INFO L290 TraceCheckUtils]: 23: Hoare triple {56126#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {56126#true} is VALID [2022-04-15 11:51:55,761 INFO L290 TraceCheckUtils]: 24: Hoare triple {56126#true} assume 8464 == #t~mem55;havoc #t~mem55; {56126#true} is VALID [2022-04-15 11:51:55,761 INFO L290 TraceCheckUtils]: 25: Hoare triple {56126#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; {56126#true} is VALID [2022-04-15 11:51:55,761 INFO L290 TraceCheckUtils]: 26: Hoare triple {56126#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {56126#true} is VALID [2022-04-15 11:51:55,763 INFO L290 TraceCheckUtils]: 27: Hoare triple {56126#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); {56131#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:55,763 INFO L290 TraceCheckUtils]: 28: Hoare triple {56131#(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); {56131#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:55,764 INFO L290 TraceCheckUtils]: 29: Hoare triple {56131#(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; {56131#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:55,764 INFO L290 TraceCheckUtils]: 30: Hoare triple {56131#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {56131#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:55,765 INFO L290 TraceCheckUtils]: 31: Hoare triple {56131#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {56131#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:55,765 INFO L290 TraceCheckUtils]: 32: Hoare triple {56131#(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); {56131#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:55,766 INFO L290 TraceCheckUtils]: 33: Hoare triple {56131#(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); {56131#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:55,766 INFO L290 TraceCheckUtils]: 34: Hoare triple {56131#(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); {56131#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:55,766 INFO L290 TraceCheckUtils]: 35: Hoare triple {56131#(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); {56131#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:55,767 INFO L290 TraceCheckUtils]: 36: Hoare triple {56131#(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); {56132#(not (= |ssl3_accept_#t~mem51| 8195))} is VALID [2022-04-15 11:51:55,767 INFO L290 TraceCheckUtils]: 37: Hoare triple {56132#(not (= |ssl3_accept_#t~mem51| 8195))} assume 8195 == #t~mem51;havoc #t~mem51; {56127#false} is VALID [2022-04-15 11:51:55,767 INFO L290 TraceCheckUtils]: 38: Hoare triple {56127#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {56127#false} is VALID [2022-04-15 11:51:55,768 INFO L290 TraceCheckUtils]: 39: Hoare triple {56127#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {56127#false} is VALID [2022-04-15 11:51:55,768 INFO L290 TraceCheckUtils]: 40: Hoare triple {56127#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {56127#false} is VALID [2022-04-15 11:51:55,768 INFO L290 TraceCheckUtils]: 41: Hoare triple {56127#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); {56127#false} is VALID [2022-04-15 11:51:55,768 INFO L290 TraceCheckUtils]: 42: Hoare triple {56127#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {56127#false} is VALID [2022-04-15 11:51:55,768 INFO L290 TraceCheckUtils]: 43: Hoare triple {56127#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); {56127#false} is VALID [2022-04-15 11:51:55,768 INFO L290 TraceCheckUtils]: 44: Hoare triple {56127#false} assume 12292 != #t~mem85;havoc #t~mem85; {56127#false} is VALID [2022-04-15 11:51:55,768 INFO L290 TraceCheckUtils]: 45: Hoare triple {56127#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; {56127#false} is VALID [2022-04-15 11:51:55,768 INFO L290 TraceCheckUtils]: 46: Hoare triple {56127#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); {56127#false} is VALID [2022-04-15 11:51:55,768 INFO L290 TraceCheckUtils]: 47: Hoare triple {56127#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {56127#false} is VALID [2022-04-15 11:51:55,768 INFO L290 TraceCheckUtils]: 48: Hoare triple {56127#false} ~skip~0 := 0; {56127#false} is VALID [2022-04-15 11:51:55,769 INFO L290 TraceCheckUtils]: 49: Hoare triple {56127#false} assume !false; {56127#false} is VALID [2022-04-15 11:51:55,769 INFO L290 TraceCheckUtils]: 50: Hoare triple {56127#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); {56127#false} is VALID [2022-04-15 11:51:55,769 INFO L290 TraceCheckUtils]: 51: Hoare triple {56127#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {56127#false} is VALID [2022-04-15 11:51:55,769 INFO L290 TraceCheckUtils]: 52: Hoare triple {56127#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {56127#false} is VALID [2022-04-15 11:51:55,769 INFO L290 TraceCheckUtils]: 53: Hoare triple {56127#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {56127#false} is VALID [2022-04-15 11:51:55,769 INFO L290 TraceCheckUtils]: 54: Hoare triple {56127#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {56127#false} is VALID [2022-04-15 11:51:55,769 INFO L290 TraceCheckUtils]: 55: Hoare triple {56127#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {56127#false} is VALID [2022-04-15 11:51:55,769 INFO L290 TraceCheckUtils]: 56: Hoare triple {56127#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {56127#false} is VALID [2022-04-15 11:51:55,769 INFO L290 TraceCheckUtils]: 57: Hoare triple {56127#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {56127#false} is VALID [2022-04-15 11:51:55,769 INFO L290 TraceCheckUtils]: 58: Hoare triple {56127#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {56127#false} is VALID [2022-04-15 11:51:55,770 INFO L290 TraceCheckUtils]: 59: Hoare triple {56127#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {56127#false} is VALID [2022-04-15 11:51:55,770 INFO L290 TraceCheckUtils]: 60: Hoare triple {56127#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {56127#false} is VALID [2022-04-15 11:51:55,770 INFO L290 TraceCheckUtils]: 61: Hoare triple {56127#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {56127#false} is VALID [2022-04-15 11:51:55,770 INFO L290 TraceCheckUtils]: 62: Hoare triple {56127#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {56127#false} is VALID [2022-04-15 11:51:55,770 INFO L290 TraceCheckUtils]: 63: Hoare triple {56127#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {56127#false} is VALID [2022-04-15 11:51:55,770 INFO L290 TraceCheckUtils]: 64: Hoare triple {56127#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {56127#false} is VALID [2022-04-15 11:51:55,770 INFO L290 TraceCheckUtils]: 65: Hoare triple {56127#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {56127#false} is VALID [2022-04-15 11:51:55,770 INFO L290 TraceCheckUtils]: 66: Hoare triple {56127#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {56127#false} is VALID [2022-04-15 11:51:55,770 INFO L290 TraceCheckUtils]: 67: Hoare triple {56127#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {56127#false} is VALID [2022-04-15 11:51:55,770 INFO L290 TraceCheckUtils]: 68: Hoare triple {56127#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {56127#false} is VALID [2022-04-15 11:51:55,771 INFO L290 TraceCheckUtils]: 69: Hoare triple {56127#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {56127#false} is VALID [2022-04-15 11:51:55,771 INFO L290 TraceCheckUtils]: 70: Hoare triple {56127#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {56127#false} is VALID [2022-04-15 11:51:55,771 INFO L290 TraceCheckUtils]: 71: Hoare triple {56127#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {56127#false} is VALID [2022-04-15 11:51:55,771 INFO L290 TraceCheckUtils]: 72: Hoare triple {56127#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {56127#false} is VALID [2022-04-15 11:51:55,771 INFO L290 TraceCheckUtils]: 73: Hoare triple {56127#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {56127#false} is VALID [2022-04-15 11:51:55,771 INFO L290 TraceCheckUtils]: 74: Hoare triple {56127#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {56127#false} is VALID [2022-04-15 11:51:55,771 INFO L290 TraceCheckUtils]: 75: Hoare triple {56127#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {56127#false} is VALID [2022-04-15 11:51:55,771 INFO L290 TraceCheckUtils]: 76: Hoare triple {56127#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {56127#false} is VALID [2022-04-15 11:51:55,771 INFO L290 TraceCheckUtils]: 77: Hoare triple {56127#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {56127#false} is VALID [2022-04-15 11:51:55,771 INFO L290 TraceCheckUtils]: 78: Hoare triple {56127#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {56127#false} is VALID [2022-04-15 11:51:55,772 INFO L290 TraceCheckUtils]: 79: Hoare triple {56127#false} assume 8640 == #t~mem75;havoc #t~mem75; {56127#false} is VALID [2022-04-15 11:51:55,772 INFO L290 TraceCheckUtils]: 80: Hoare triple {56127#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {56127#false} is VALID [2022-04-15 11:51:55,772 INFO L290 TraceCheckUtils]: 81: Hoare triple {56127#false} assume !(4 == ~blastFlag~0); {56127#false} is VALID [2022-04-15 11:51:55,772 INFO L290 TraceCheckUtils]: 82: Hoare triple {56127#false} assume !(7 == ~blastFlag~0); {56127#false} is VALID [2022-04-15 11:51:55,772 INFO L290 TraceCheckUtils]: 83: Hoare triple {56127#false} assume !(10 == ~blastFlag~0); {56127#false} is VALID [2022-04-15 11:51:55,772 INFO L290 TraceCheckUtils]: 84: Hoare triple {56127#false} assume 13 == ~blastFlag~0; {56127#false} is VALID [2022-04-15 11:51:55,772 INFO L290 TraceCheckUtils]: 85: Hoare triple {56127#false} assume !false; {56127#false} is VALID [2022-04-15 11:51:55,773 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:51:55,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:51:55,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421724602] [2022-04-15 11:51:55,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421724602] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:51:55,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:51:55,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:51:55,773 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:51:55,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1093133617] [2022-04-15 11:51:55,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1093133617] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:51:55,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:51:55,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:51:55,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975126757] [2022-04-15 11:51:55,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:51:55,774 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 86 [2022-04-15 11:51:55,774 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:51:55,775 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-15 11:51:55,861 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-15 11:51:55,862 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:51:55,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:51:55,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:51:55,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:51:55,862 INFO L87 Difference]: Start difference. First operand 529 states and 778 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-15 11:51:57,956 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:51:59,968 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-15 11:52:02,050 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:52:05,258 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:52:10,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:52:10,398 INFO L93 Difference]: Finished difference Result 1192 states and 1767 transitions. [2022-04-15 11:52:10,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:52:10,398 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 86 [2022-04-15 11:52:10,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:52:10,398 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-15 11:52:10,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 610 transitions. [2022-04-15 11:52:10,401 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-15 11:52:10,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 610 transitions. [2022-04-15 11:52:10,403 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 610 transitions. [2022-04-15 11:52:10,817 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 610 edges. 610 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:52:10,844 INFO L225 Difference]: With dead ends: 1192 [2022-04-15 11:52:10,844 INFO L226 Difference]: Without dead ends: 820 [2022-04-15 11:52:10,845 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:52:10,845 INFO L913 BasicCegarLoop]: 126 mSDtfsCounter, 147 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 63 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:52:10,845 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 368 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 481 Invalid, 2 Unknown, 0 Unchecked, 8.3s Time] [2022-04-15 11:52:10,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2022-04-15 11:52:10,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 529. [2022-04-15 11:52:10,885 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:52:10,886 INFO L82 GeneralOperation]: Start isEquivalent. First operand 820 states. Second operand has 529 states, 524 states have (on average 1.463740458015267) internal successors, (767), 524 states have internal predecessors, (767), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:10,886 INFO L74 IsIncluded]: Start isIncluded. First operand 820 states. Second operand has 529 states, 524 states have (on average 1.463740458015267) internal successors, (767), 524 states have internal predecessors, (767), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:10,887 INFO L87 Difference]: Start difference. First operand 820 states. Second operand has 529 states, 524 states have (on average 1.463740458015267) internal successors, (767), 524 states have internal predecessors, (767), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:10,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:52:10,918 INFO L93 Difference]: Finished difference Result 820 states and 1210 transitions. [2022-04-15 11:52:10,918 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1210 transitions. [2022-04-15 11:52:10,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:52:10,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:52:10,920 INFO L74 IsIncluded]: Start isIncluded. First operand has 529 states, 524 states have (on average 1.463740458015267) internal successors, (767), 524 states have internal predecessors, (767), 3 states have call successors, (3), 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 820 states. [2022-04-15 11:52:10,920 INFO L87 Difference]: Start difference. First operand has 529 states, 524 states have (on average 1.463740458015267) internal successors, (767), 524 states have internal predecessors, (767), 3 states have call successors, (3), 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 820 states. [2022-04-15 11:52:10,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:52:10,951 INFO L93 Difference]: Finished difference Result 820 states and 1210 transitions. [2022-04-15 11:52:10,951 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1210 transitions. [2022-04-15 11:52:10,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:52:10,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:52:10,952 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:52:10,953 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:52:10,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 524 states have (on average 1.463740458015267) internal successors, (767), 524 states have internal predecessors, (767), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:10,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 771 transitions. [2022-04-15 11:52:10,972 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 771 transitions. Word has length 86 [2022-04-15 11:52:10,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:52:10,972 INFO L478 AbstractCegarLoop]: Abstraction has 529 states and 771 transitions. [2022-04-15 11:52:10,973 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-15 11:52:10,973 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 529 states and 771 transitions. [2022-04-15 11:52:14,003 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 771 edges. 770 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:52:14,003 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 771 transitions. [2022-04-15 11:52:14,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-04-15 11:52:14,004 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:52:14,004 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:52:14,004 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-15 11:52:14,004 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:52:14,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:52:14,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1811938044, now seen corresponding path program 1 times [2022-04-15 11:52:14,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:52:14,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [13637066] [2022-04-15 11:52:14,036 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:52:14,036 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:52:14,036 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:52:14,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1811938044, now seen corresponding path program 2 times [2022-04-15 11:52:14,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:52:14,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572277264] [2022-04-15 11:52:14,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:52:14,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:52:14,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:52:14,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:52:14,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:52:14,276 INFO L290 TraceCheckUtils]: 0: Hoare triple {61227#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {61220#true} is VALID [2022-04-15 11:52:14,276 INFO L290 TraceCheckUtils]: 1: Hoare triple {61220#true} assume true; {61220#true} is VALID [2022-04-15 11:52:14,276 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {61220#true} {61220#true} #708#return; {61220#true} is VALID [2022-04-15 11:52:14,277 INFO L272 TraceCheckUtils]: 0: Hoare triple {61220#true} call ULTIMATE.init(); {61227#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:52:14,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {61227#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {61220#true} is VALID [2022-04-15 11:52:14,277 INFO L290 TraceCheckUtils]: 2: Hoare triple {61220#true} assume true; {61220#true} is VALID [2022-04-15 11:52:14,277 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61220#true} {61220#true} #708#return; {61220#true} is VALID [2022-04-15 11:52:14,277 INFO L272 TraceCheckUtils]: 4: Hoare triple {61220#true} call #t~ret161 := main(); {61220#true} is VALID [2022-04-15 11:52:14,278 INFO L290 TraceCheckUtils]: 5: Hoare triple {61220#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; {61220#true} is VALID [2022-04-15 11:52:14,278 INFO L290 TraceCheckUtils]: 6: Hoare triple {61220#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {61220#true} is VALID [2022-04-15 11:52:14,278 INFO L272 TraceCheckUtils]: 7: Hoare triple {61220#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {61220#true} is VALID [2022-04-15 11:52:14,278 INFO L290 TraceCheckUtils]: 8: Hoare triple {61220#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); {61220#true} is VALID [2022-04-15 11:52:14,278 INFO L290 TraceCheckUtils]: 9: Hoare triple {61220#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; {61220#true} is VALID [2022-04-15 11:52:14,278 INFO L290 TraceCheckUtils]: 10: Hoare triple {61220#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; {61220#true} is VALID [2022-04-15 11:52:14,278 INFO L290 TraceCheckUtils]: 11: Hoare triple {61220#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {61220#true} is VALID [2022-04-15 11:52:14,278 INFO L290 TraceCheckUtils]: 12: Hoare triple {61220#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {61220#true} is VALID [2022-04-15 11:52:14,278 INFO L290 TraceCheckUtils]: 13: Hoare triple {61220#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {61220#true} is VALID [2022-04-15 11:52:14,278 INFO L290 TraceCheckUtils]: 14: Hoare triple {61220#true} assume !false; {61220#true} is VALID [2022-04-15 11:52:14,279 INFO L290 TraceCheckUtils]: 15: Hoare triple {61220#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); {61220#true} is VALID [2022-04-15 11:52:14,279 INFO L290 TraceCheckUtils]: 16: Hoare triple {61220#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {61220#true} is VALID [2022-04-15 11:52:14,279 INFO L290 TraceCheckUtils]: 17: Hoare triple {61220#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {61220#true} is VALID [2022-04-15 11:52:14,279 INFO L290 TraceCheckUtils]: 18: Hoare triple {61220#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {61220#true} is VALID [2022-04-15 11:52:14,279 INFO L290 TraceCheckUtils]: 19: Hoare triple {61220#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {61220#true} is VALID [2022-04-15 11:52:14,279 INFO L290 TraceCheckUtils]: 20: Hoare triple {61220#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {61220#true} is VALID [2022-04-15 11:52:14,279 INFO L290 TraceCheckUtils]: 21: Hoare triple {61220#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {61220#true} is VALID [2022-04-15 11:52:14,279 INFO L290 TraceCheckUtils]: 22: Hoare triple {61220#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {61220#true} is VALID [2022-04-15 11:52:14,279 INFO L290 TraceCheckUtils]: 23: Hoare triple {61220#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {61220#true} is VALID [2022-04-15 11:52:14,279 INFO L290 TraceCheckUtils]: 24: Hoare triple {61220#true} assume 8464 == #t~mem55;havoc #t~mem55; {61220#true} is VALID [2022-04-15 11:52:14,279 INFO L290 TraceCheckUtils]: 25: Hoare triple {61220#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; {61220#true} is VALID [2022-04-15 11:52:14,280 INFO L290 TraceCheckUtils]: 26: Hoare triple {61220#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {61220#true} is VALID [2022-04-15 11:52:14,280 INFO L290 TraceCheckUtils]: 27: Hoare triple {61220#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); {61220#true} is VALID [2022-04-15 11:52:14,280 INFO L290 TraceCheckUtils]: 28: Hoare triple {61220#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); {61220#true} is VALID [2022-04-15 11:52:14,280 INFO L290 TraceCheckUtils]: 29: Hoare triple {61220#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {61220#true} is VALID [2022-04-15 11:52:14,280 INFO L290 TraceCheckUtils]: 30: Hoare triple {61220#true} ~skip~0 := 0; {61220#true} is VALID [2022-04-15 11:52:14,280 INFO L290 TraceCheckUtils]: 31: Hoare triple {61220#true} assume !false; {61220#true} is VALID [2022-04-15 11:52:14,280 INFO L290 TraceCheckUtils]: 32: Hoare triple {61220#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); {61220#true} is VALID [2022-04-15 11:52:14,280 INFO L290 TraceCheckUtils]: 33: Hoare triple {61220#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {61220#true} is VALID [2022-04-15 11:52:14,280 INFO L290 TraceCheckUtils]: 34: Hoare triple {61220#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {61220#true} is VALID [2022-04-15 11:52:14,280 INFO L290 TraceCheckUtils]: 35: Hoare triple {61220#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {61220#true} is VALID [2022-04-15 11:52:14,281 INFO L290 TraceCheckUtils]: 36: Hoare triple {61220#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {61220#true} is VALID [2022-04-15 11:52:14,281 INFO L290 TraceCheckUtils]: 37: Hoare triple {61220#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {61220#true} is VALID [2022-04-15 11:52:14,281 INFO L290 TraceCheckUtils]: 38: Hoare triple {61220#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {61220#true} is VALID [2022-04-15 11:52:14,281 INFO L290 TraceCheckUtils]: 39: Hoare triple {61220#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {61220#true} is VALID [2022-04-15 11:52:14,281 INFO L290 TraceCheckUtils]: 40: Hoare triple {61220#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {61220#true} is VALID [2022-04-15 11:52:14,281 INFO L290 TraceCheckUtils]: 41: Hoare triple {61220#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {61220#true} is VALID [2022-04-15 11:52:14,281 INFO L290 TraceCheckUtils]: 42: Hoare triple {61220#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {61220#true} is VALID [2022-04-15 11:52:14,281 INFO L290 TraceCheckUtils]: 43: Hoare triple {61220#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {61220#true} is VALID [2022-04-15 11:52:14,281 INFO L290 TraceCheckUtils]: 44: Hoare triple {61220#true} assume 8496 == #t~mem58;havoc #t~mem58; {61220#true} is VALID [2022-04-15 11:52:14,281 INFO L290 TraceCheckUtils]: 45: Hoare triple {61220#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {61220#true} is VALID [2022-04-15 11:52:14,281 INFO L290 TraceCheckUtils]: 46: Hoare triple {61220#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {61220#true} is VALID [2022-04-15 11:52:14,281 INFO L290 TraceCheckUtils]: 47: Hoare triple {61220#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {61220#true} is VALID [2022-04-15 11:52:14,282 INFO L290 TraceCheckUtils]: 48: Hoare triple {61220#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {61225#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:14,283 INFO L290 TraceCheckUtils]: 49: Hoare triple {61225#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {61225#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:14,283 INFO L290 TraceCheckUtils]: 50: Hoare triple {61225#(not (= 8640 (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); {61225#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:14,284 INFO L290 TraceCheckUtils]: 51: Hoare triple {61225#(not (= 8640 (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; {61225#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:14,284 INFO L290 TraceCheckUtils]: 52: Hoare triple {61225#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {61225#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:14,284 INFO L290 TraceCheckUtils]: 53: Hoare triple {61225#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {61225#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:14,285 INFO L290 TraceCheckUtils]: 54: Hoare triple {61225#(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); {61225#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:14,285 INFO L290 TraceCheckUtils]: 55: Hoare triple {61225#(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); {61225#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:14,286 INFO L290 TraceCheckUtils]: 56: Hoare triple {61225#(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); {61225#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:14,286 INFO L290 TraceCheckUtils]: 57: Hoare triple {61225#(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); {61225#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:14,287 INFO L290 TraceCheckUtils]: 58: Hoare triple {61225#(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); {61225#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:14,287 INFO L290 TraceCheckUtils]: 59: Hoare triple {61225#(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); {61225#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:14,288 INFO L290 TraceCheckUtils]: 60: Hoare triple {61225#(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); {61225#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:14,288 INFO L290 TraceCheckUtils]: 61: Hoare triple {61225#(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); {61225#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:14,289 INFO L290 TraceCheckUtils]: 62: Hoare triple {61225#(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); {61225#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:14,289 INFO L290 TraceCheckUtils]: 63: Hoare triple {61225#(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); {61225#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:14,290 INFO L290 TraceCheckUtils]: 64: Hoare triple {61225#(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); {61225#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:14,290 INFO L290 TraceCheckUtils]: 65: Hoare triple {61225#(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); {61225#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:14,291 INFO L290 TraceCheckUtils]: 66: Hoare triple {61225#(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); {61225#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:14,291 INFO L290 TraceCheckUtils]: 67: Hoare triple {61225#(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); {61225#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:14,291 INFO L290 TraceCheckUtils]: 68: Hoare triple {61225#(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); {61225#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:14,292 INFO L290 TraceCheckUtils]: 69: Hoare triple {61225#(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); {61225#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:14,292 INFO L290 TraceCheckUtils]: 70: Hoare triple {61225#(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); {61225#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:14,293 INFO L290 TraceCheckUtils]: 71: Hoare triple {61225#(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); {61225#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:14,293 INFO L290 TraceCheckUtils]: 72: Hoare triple {61225#(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); {61225#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:14,294 INFO L290 TraceCheckUtils]: 73: Hoare triple {61225#(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); {61225#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:14,294 INFO L290 TraceCheckUtils]: 74: Hoare triple {61225#(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); {61225#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:14,295 INFO L290 TraceCheckUtils]: 75: Hoare triple {61225#(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); {61225#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:14,295 INFO L290 TraceCheckUtils]: 76: Hoare triple {61225#(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); {61225#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:14,296 INFO L290 TraceCheckUtils]: 77: Hoare triple {61225#(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); {61225#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:14,296 INFO L290 TraceCheckUtils]: 78: Hoare triple {61225#(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); {61225#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:14,297 INFO L290 TraceCheckUtils]: 79: Hoare triple {61225#(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); {61225#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:14,297 INFO L290 TraceCheckUtils]: 80: Hoare triple {61225#(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); {61225#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:14,298 INFO L290 TraceCheckUtils]: 81: Hoare triple {61225#(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); {61225#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:14,298 INFO L290 TraceCheckUtils]: 82: Hoare triple {61225#(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); {61226#(not (= |ssl3_accept_#t~mem75| 8640))} is VALID [2022-04-15 11:52:14,299 INFO L290 TraceCheckUtils]: 83: Hoare triple {61226#(not (= |ssl3_accept_#t~mem75| 8640))} assume 8640 == #t~mem75;havoc #t~mem75; {61221#false} is VALID [2022-04-15 11:52:14,299 INFO L290 TraceCheckUtils]: 84: Hoare triple {61221#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {61221#false} is VALID [2022-04-15 11:52:14,299 INFO L290 TraceCheckUtils]: 85: Hoare triple {61221#false} assume !(4 == ~blastFlag~0); {61221#false} is VALID [2022-04-15 11:52:14,299 INFO L290 TraceCheckUtils]: 86: Hoare triple {61221#false} assume !(7 == ~blastFlag~0); {61221#false} is VALID [2022-04-15 11:52:14,299 INFO L290 TraceCheckUtils]: 87: Hoare triple {61221#false} assume !(10 == ~blastFlag~0); {61221#false} is VALID [2022-04-15 11:52:14,299 INFO L290 TraceCheckUtils]: 88: Hoare triple {61221#false} assume 13 == ~blastFlag~0; {61221#false} is VALID [2022-04-15 11:52:14,299 INFO L290 TraceCheckUtils]: 89: Hoare triple {61221#false} assume !false; {61221#false} is VALID [2022-04-15 11:52:14,300 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-15 11:52:14,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:52:14,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572277264] [2022-04-15 11:52:14,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572277264] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:52:14,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:52:14,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:52:14,300 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:52:14,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [13637066] [2022-04-15 11:52:14,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [13637066] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:52:14,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:52:14,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:52:14,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803083337] [2022-04-15 11:52:14,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:52:14,301 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 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 90 [2022-04-15 11:52:14,301 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:52:14,302 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:14,366 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:52:14,366 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:52:14,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:52:14,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:52:14,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:52:14,367 INFO L87 Difference]: Start difference. First operand 529 states and 771 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:19,152 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-15 11:52:20,987 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:52:27,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:52:27,608 INFO L93 Difference]: Finished difference Result 1374 states and 2018 transitions. [2022-04-15 11:52:27,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:52:27,608 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 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 90 [2022-04-15 11:52:27,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:52:27,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:27,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 610 transitions. [2022-04-15 11:52:27,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:27,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 610 transitions. [2022-04-15 11:52:27,613 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 610 transitions. [2022-04-15 11:52:28,035 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 610 edges. 610 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:52:28,074 INFO L225 Difference]: With dead ends: 1374 [2022-04-15 11:52:28,074 INFO L226 Difference]: Without dead ends: 871 [2022-04-15 11:52:28,074 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-15 11:52:28,075 INFO L913 BasicCegarLoop]: 127 mSDtfsCounter, 122 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-04-15 11:52:28,075 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 370 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2022-04-15 11:52:28,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2022-04-15 11:52:28,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 649. [2022-04-15 11:52:28,116 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:52:28,116 INFO L82 GeneralOperation]: Start isEquivalent. First operand 871 states. Second operand has 649 states, 644 states have (on average 1.5077639751552796) internal successors, (971), 644 states have internal predecessors, (971), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:28,117 INFO L74 IsIncluded]: Start isIncluded. First operand 871 states. Second operand has 649 states, 644 states have (on average 1.5077639751552796) internal successors, (971), 644 states have internal predecessors, (971), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:28,118 INFO L87 Difference]: Start difference. First operand 871 states. Second operand has 649 states, 644 states have (on average 1.5077639751552796) internal successors, (971), 644 states have internal predecessors, (971), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:28,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:52:28,147 INFO L93 Difference]: Finished difference Result 871 states and 1276 transitions. [2022-04-15 11:52:28,147 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1276 transitions. [2022-04-15 11:52:28,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:52:28,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:52:28,148 INFO L74 IsIncluded]: Start isIncluded. First operand has 649 states, 644 states have (on average 1.5077639751552796) internal successors, (971), 644 states have internal predecessors, (971), 3 states have call successors, (3), 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 871 states. [2022-04-15 11:52:28,149 INFO L87 Difference]: Start difference. First operand has 649 states, 644 states have (on average 1.5077639751552796) internal successors, (971), 644 states have internal predecessors, (971), 3 states have call successors, (3), 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 871 states. [2022-04-15 11:52:28,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:52:28,171 INFO L93 Difference]: Finished difference Result 871 states and 1276 transitions. [2022-04-15 11:52:28,171 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1276 transitions. [2022-04-15 11:52:28,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:52:28,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:52:28,172 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:52:28,172 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:52:28,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 644 states have (on average 1.5077639751552796) internal successors, (971), 644 states have internal predecessors, (971), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:28,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 975 transitions. [2022-04-15 11:52:28,190 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 975 transitions. Word has length 90 [2022-04-15 11:52:28,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:52:28,190 INFO L478 AbstractCegarLoop]: Abstraction has 649 states and 975 transitions. [2022-04-15 11:52:28,190 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:28,190 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 649 states and 975 transitions. [2022-04-15 11:52:31,345 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 975 edges. 974 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:52:31,346 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 975 transitions. [2022-04-15 11:52:31,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-15 11:52:31,346 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:52:31,347 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:52:31,347 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-15 11:52:31,347 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:52:31,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:52:31,347 INFO L85 PathProgramCache]: Analyzing trace with hash -14689004, now seen corresponding path program 1 times [2022-04-15 11:52:31,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:52:31,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [30980428] [2022-04-15 11:52:31,379 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:52:31,380 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:52:31,380 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:52:31,380 INFO L85 PathProgramCache]: Analyzing trace with hash -14689004, now seen corresponding path program 2 times [2022-04-15 11:52:31,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:52:31,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086112326] [2022-04-15 11:52:31,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:52:31,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:52:31,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:52:31,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:52:31,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:52:31,610 INFO L290 TraceCheckUtils]: 0: Hoare triple {67027#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {67020#true} is VALID [2022-04-15 11:52:31,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {67020#true} assume true; {67020#true} is VALID [2022-04-15 11:52:31,611 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67020#true} {67020#true} #708#return; {67020#true} is VALID [2022-04-15 11:52:31,611 INFO L272 TraceCheckUtils]: 0: Hoare triple {67020#true} call ULTIMATE.init(); {67027#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:52:31,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {67027#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {67020#true} is VALID [2022-04-15 11:52:31,612 INFO L290 TraceCheckUtils]: 2: Hoare triple {67020#true} assume true; {67020#true} is VALID [2022-04-15 11:52:31,612 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67020#true} {67020#true} #708#return; {67020#true} is VALID [2022-04-15 11:52:31,612 INFO L272 TraceCheckUtils]: 4: Hoare triple {67020#true} call #t~ret161 := main(); {67020#true} is VALID [2022-04-15 11:52:31,612 INFO L290 TraceCheckUtils]: 5: Hoare triple {67020#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; {67020#true} is VALID [2022-04-15 11:52:31,612 INFO L290 TraceCheckUtils]: 6: Hoare triple {67020#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {67020#true} is VALID [2022-04-15 11:52:31,612 INFO L272 TraceCheckUtils]: 7: Hoare triple {67020#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {67020#true} is VALID [2022-04-15 11:52:31,612 INFO L290 TraceCheckUtils]: 8: Hoare triple {67020#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); {67020#true} is VALID [2022-04-15 11:52:31,612 INFO L290 TraceCheckUtils]: 9: Hoare triple {67020#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; {67020#true} is VALID [2022-04-15 11:52:31,612 INFO L290 TraceCheckUtils]: 10: Hoare triple {67020#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; {67020#true} is VALID [2022-04-15 11:52:31,612 INFO L290 TraceCheckUtils]: 11: Hoare triple {67020#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {67020#true} is VALID [2022-04-15 11:52:31,613 INFO L290 TraceCheckUtils]: 12: Hoare triple {67020#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {67020#true} is VALID [2022-04-15 11:52:31,613 INFO L290 TraceCheckUtils]: 13: Hoare triple {67020#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {67020#true} is VALID [2022-04-15 11:52:31,613 INFO L290 TraceCheckUtils]: 14: Hoare triple {67020#true} assume !false; {67020#true} is VALID [2022-04-15 11:52:31,613 INFO L290 TraceCheckUtils]: 15: Hoare triple {67020#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); {67020#true} is VALID [2022-04-15 11:52:31,613 INFO L290 TraceCheckUtils]: 16: Hoare triple {67020#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {67020#true} is VALID [2022-04-15 11:52:31,613 INFO L290 TraceCheckUtils]: 17: Hoare triple {67020#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {67020#true} is VALID [2022-04-15 11:52:31,613 INFO L290 TraceCheckUtils]: 18: Hoare triple {67020#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {67020#true} is VALID [2022-04-15 11:52:31,613 INFO L290 TraceCheckUtils]: 19: Hoare triple {67020#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {67020#true} is VALID [2022-04-15 11:52:31,613 INFO L290 TraceCheckUtils]: 20: Hoare triple {67020#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {67020#true} is VALID [2022-04-15 11:52:31,613 INFO L290 TraceCheckUtils]: 21: Hoare triple {67020#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {67020#true} is VALID [2022-04-15 11:52:31,614 INFO L290 TraceCheckUtils]: 22: Hoare triple {67020#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {67020#true} is VALID [2022-04-15 11:52:31,614 INFO L290 TraceCheckUtils]: 23: Hoare triple {67020#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {67020#true} is VALID [2022-04-15 11:52:31,614 INFO L290 TraceCheckUtils]: 24: Hoare triple {67020#true} assume 8464 == #t~mem55;havoc #t~mem55; {67020#true} is VALID [2022-04-15 11:52:31,614 INFO L290 TraceCheckUtils]: 25: Hoare triple {67020#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; {67020#true} is VALID [2022-04-15 11:52:31,614 INFO L290 TraceCheckUtils]: 26: Hoare triple {67020#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {67020#true} is VALID [2022-04-15 11:52:31,614 INFO L290 TraceCheckUtils]: 27: Hoare triple {67020#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); {67020#true} is VALID [2022-04-15 11:52:31,614 INFO L290 TraceCheckUtils]: 28: Hoare triple {67020#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); {67020#true} is VALID [2022-04-15 11:52:31,614 INFO L290 TraceCheckUtils]: 29: Hoare triple {67020#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {67020#true} is VALID [2022-04-15 11:52:31,614 INFO L290 TraceCheckUtils]: 30: Hoare triple {67020#true} ~skip~0 := 0; {67020#true} is VALID [2022-04-15 11:52:31,614 INFO L290 TraceCheckUtils]: 31: Hoare triple {67020#true} assume !false; {67020#true} is VALID [2022-04-15 11:52:31,614 INFO L290 TraceCheckUtils]: 32: Hoare triple {67020#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); {67020#true} is VALID [2022-04-15 11:52:31,614 INFO L290 TraceCheckUtils]: 33: Hoare triple {67020#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {67020#true} is VALID [2022-04-15 11:52:31,614 INFO L290 TraceCheckUtils]: 34: Hoare triple {67020#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {67020#true} is VALID [2022-04-15 11:52:31,615 INFO L290 TraceCheckUtils]: 35: Hoare triple {67020#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {67020#true} is VALID [2022-04-15 11:52:31,615 INFO L290 TraceCheckUtils]: 36: Hoare triple {67020#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {67020#true} is VALID [2022-04-15 11:52:31,615 INFO L290 TraceCheckUtils]: 37: Hoare triple {67020#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {67020#true} is VALID [2022-04-15 11:52:31,615 INFO L290 TraceCheckUtils]: 38: Hoare triple {67020#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {67020#true} is VALID [2022-04-15 11:52:31,615 INFO L290 TraceCheckUtils]: 39: Hoare triple {67020#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {67020#true} is VALID [2022-04-15 11:52:31,615 INFO L290 TraceCheckUtils]: 40: Hoare triple {67020#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {67020#true} is VALID [2022-04-15 11:52:31,615 INFO L290 TraceCheckUtils]: 41: Hoare triple {67020#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {67020#true} is VALID [2022-04-15 11:52:31,615 INFO L290 TraceCheckUtils]: 42: Hoare triple {67020#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {67020#true} is VALID [2022-04-15 11:52:31,615 INFO L290 TraceCheckUtils]: 43: Hoare triple {67020#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {67020#true} is VALID [2022-04-15 11:52:31,615 INFO L290 TraceCheckUtils]: 44: Hoare triple {67020#true} assume 8496 == #t~mem58;havoc #t~mem58; {67020#true} is VALID [2022-04-15 11:52:31,616 INFO L290 TraceCheckUtils]: 45: Hoare triple {67020#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {67020#true} is VALID [2022-04-15 11:52:31,616 INFO L290 TraceCheckUtils]: 46: Hoare triple {67020#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {67020#true} is VALID [2022-04-15 11:52:31,616 INFO L290 TraceCheckUtils]: 47: Hoare triple {67020#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {67020#true} is VALID [2022-04-15 11:52:31,617 INFO L290 TraceCheckUtils]: 48: Hoare triple {67020#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {67025#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:52:31,618 INFO L290 TraceCheckUtils]: 49: Hoare triple {67025#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {67025#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:52:31,618 INFO L290 TraceCheckUtils]: 50: Hoare triple {67025#(= 8656 (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); {67025#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:52:31,619 INFO L290 TraceCheckUtils]: 51: Hoare triple {67025#(= 8656 (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; {67025#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:52:31,619 INFO L290 TraceCheckUtils]: 52: Hoare triple {67025#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {67025#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:52:31,619 INFO L290 TraceCheckUtils]: 53: Hoare triple {67025#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {67025#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:52:31,620 INFO L290 TraceCheckUtils]: 54: Hoare triple {67025#(= 8656 (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); {67025#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:52:31,620 INFO L290 TraceCheckUtils]: 55: Hoare triple {67025#(= 8656 (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); {67025#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:52:31,621 INFO L290 TraceCheckUtils]: 56: Hoare triple {67025#(= 8656 (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); {67025#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:52:31,621 INFO L290 TraceCheckUtils]: 57: Hoare triple {67025#(= 8656 (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); {67025#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:52:31,622 INFO L290 TraceCheckUtils]: 58: Hoare triple {67025#(= 8656 (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); {67025#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:52:31,622 INFO L290 TraceCheckUtils]: 59: Hoare triple {67025#(= 8656 (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); {67025#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:52:31,622 INFO L290 TraceCheckUtils]: 60: Hoare triple {67025#(= 8656 (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); {67025#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:52:31,623 INFO L290 TraceCheckUtils]: 61: Hoare triple {67025#(= 8656 (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); {67025#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:52:31,623 INFO L290 TraceCheckUtils]: 62: Hoare triple {67025#(= 8656 (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); {67025#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:52:31,623 INFO L290 TraceCheckUtils]: 63: Hoare triple {67025#(= 8656 (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); {67025#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:52:31,624 INFO L290 TraceCheckUtils]: 64: Hoare triple {67025#(= 8656 (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); {67025#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:52:31,624 INFO L290 TraceCheckUtils]: 65: Hoare triple {67025#(= 8656 (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); {67025#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:52:31,624 INFO L290 TraceCheckUtils]: 66: Hoare triple {67025#(= 8656 (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); {67025#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:52:31,625 INFO L290 TraceCheckUtils]: 67: Hoare triple {67025#(= 8656 (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); {67025#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:52:31,625 INFO L290 TraceCheckUtils]: 68: Hoare triple {67025#(= 8656 (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); {67025#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:52:31,625 INFO L290 TraceCheckUtils]: 69: Hoare triple {67025#(= 8656 (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); {67025#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:52:31,626 INFO L290 TraceCheckUtils]: 70: Hoare triple {67025#(= 8656 (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); {67025#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:52:31,626 INFO L290 TraceCheckUtils]: 71: Hoare triple {67025#(= 8656 (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); {67025#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:52:31,626 INFO L290 TraceCheckUtils]: 72: Hoare triple {67025#(= 8656 (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); {67025#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:52:31,627 INFO L290 TraceCheckUtils]: 73: Hoare triple {67025#(= 8656 (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); {67025#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:52:31,627 INFO L290 TraceCheckUtils]: 74: Hoare triple {67025#(= 8656 (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); {67025#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:52:31,628 INFO L290 TraceCheckUtils]: 75: Hoare triple {67025#(= 8656 (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); {67025#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:52:31,628 INFO L290 TraceCheckUtils]: 76: Hoare triple {67025#(= 8656 (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); {67025#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:52:31,628 INFO L290 TraceCheckUtils]: 77: Hoare triple {67025#(= 8656 (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); {67025#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:52:31,629 INFO L290 TraceCheckUtils]: 78: Hoare triple {67025#(= 8656 (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); {67025#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:52:31,629 INFO L290 TraceCheckUtils]: 79: Hoare triple {67025#(= 8656 (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); {67025#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:52:31,629 INFO L290 TraceCheckUtils]: 80: Hoare triple {67025#(= 8656 (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); {67025#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:52:31,630 INFO L290 TraceCheckUtils]: 81: Hoare triple {67025#(= 8656 (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); {67025#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:52:31,630 INFO L290 TraceCheckUtils]: 82: Hoare triple {67025#(= 8656 (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); {67025#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:52:31,630 INFO L290 TraceCheckUtils]: 83: Hoare triple {67025#(= 8656 (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); {67026#(= |ssl3_accept_#t~mem76| 8656)} is VALID [2022-04-15 11:52:31,631 INFO L290 TraceCheckUtils]: 84: Hoare triple {67026#(= |ssl3_accept_#t~mem76| 8656)} assume 8641 == #t~mem76;havoc #t~mem76; {67021#false} is VALID [2022-04-15 11:52:31,631 INFO L290 TraceCheckUtils]: 85: Hoare triple {67021#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {67021#false} is VALID [2022-04-15 11:52:31,631 INFO L290 TraceCheckUtils]: 86: Hoare triple {67021#false} assume !(4 == ~blastFlag~0); {67021#false} is VALID [2022-04-15 11:52:31,631 INFO L290 TraceCheckUtils]: 87: Hoare triple {67021#false} assume !(7 == ~blastFlag~0); {67021#false} is VALID [2022-04-15 11:52:31,631 INFO L290 TraceCheckUtils]: 88: Hoare triple {67021#false} assume !(10 == ~blastFlag~0); {67021#false} is VALID [2022-04-15 11:52:31,631 INFO L290 TraceCheckUtils]: 89: Hoare triple {67021#false} assume 13 == ~blastFlag~0; {67021#false} is VALID [2022-04-15 11:52:31,631 INFO L290 TraceCheckUtils]: 90: Hoare triple {67021#false} assume !false; {67021#false} is VALID [2022-04-15 11:52:31,631 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-15 11:52:31,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:52:31,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086112326] [2022-04-15 11:52:31,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086112326] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:52:31,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:52:31,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:52:31,632 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:52:31,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [30980428] [2022-04-15 11:52:31,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [30980428] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:52:31,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:52:31,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:52:31,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184681198] [2022-04-15 11:52:31,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:52:31,633 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 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-15 11:52:31,633 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:52:31,633 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:31,690 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:52:31,690 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:52:31,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:52:31,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:52:31,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:52:31,691 INFO L87 Difference]: Start difference. First operand 649 states and 975 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:38,710 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:52:49,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:52:49,208 INFO L93 Difference]: Finished difference Result 1558 states and 2340 transitions. [2022-04-15 11:52:49,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:52:49,208 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 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-15 11:52:49,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:52:49,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:49,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 577 transitions. [2022-04-15 11:52:49,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:49,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 577 transitions. [2022-04-15 11:52:49,214 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 577 transitions. [2022-04-15 11:52:49,609 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-15 11:52:49,642 INFO L225 Difference]: With dead ends: 1558 [2022-04-15 11:52:49,642 INFO L226 Difference]: Without dead ends: 935 [2022-04-15 11:52:49,642 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-15 11:52:49,643 INFO L913 BasicCegarLoop]: 285 mSDtfsCounter, 82 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-04-15 11:52:49,643 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 691 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 647 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2022-04-15 11:52:49,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2022-04-15 11:52:49,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 775. [2022-04-15 11:52:49,701 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:52:49,702 INFO L82 GeneralOperation]: Start isEquivalent. First operand 935 states. Second operand has 775 states, 770 states have (on average 1.5337662337662337) internal successors, (1181), 770 states have internal predecessors, (1181), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:49,703 INFO L74 IsIncluded]: Start isIncluded. First operand 935 states. Second operand has 775 states, 770 states have (on average 1.5337662337662337) internal successors, (1181), 770 states have internal predecessors, (1181), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:49,704 INFO L87 Difference]: Start difference. First operand 935 states. Second operand has 775 states, 770 states have (on average 1.5337662337662337) internal successors, (1181), 770 states have internal predecessors, (1181), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:49,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:52:49,743 INFO L93 Difference]: Finished difference Result 935 states and 1394 transitions. [2022-04-15 11:52:49,743 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1394 transitions. [2022-04-15 11:52:49,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:52:49,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:52:49,746 INFO L74 IsIncluded]: Start isIncluded. First operand has 775 states, 770 states have (on average 1.5337662337662337) internal successors, (1181), 770 states have internal predecessors, (1181), 3 states have call successors, (3), 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 935 states. [2022-04-15 11:52:49,746 INFO L87 Difference]: Start difference. First operand has 775 states, 770 states have (on average 1.5337662337662337) internal successors, (1181), 770 states have internal predecessors, (1181), 3 states have call successors, (3), 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 935 states. [2022-04-15 11:52:49,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:52:49,785 INFO L93 Difference]: Finished difference Result 935 states and 1394 transitions. [2022-04-15 11:52:49,785 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1394 transitions. [2022-04-15 11:52:49,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:52:49,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:52:49,786 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:52:49,786 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:52:49,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 775 states, 770 states have (on average 1.5337662337662337) internal successors, (1181), 770 states have internal predecessors, (1181), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:49,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1185 transitions. [2022-04-15 11:52:49,828 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1185 transitions. Word has length 91 [2022-04-15 11:52:49,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:52:49,828 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 1185 transitions. [2022-04-15 11:52:49,829 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:49,829 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 775 states and 1185 transitions. [2022-04-15 11:52:53,170 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1185 edges. 1184 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:52:53,171 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1185 transitions. [2022-04-15 11:52:53,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-15 11:52:53,172 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:52:53,172 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:52:53,172 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-15 11:52:53,172 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:52:53,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:52:53,173 INFO L85 PathProgramCache]: Analyzing trace with hash -912082282, now seen corresponding path program 1 times [2022-04-15 11:52:53,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:52:53,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1751303654] [2022-04-15 11:52:53,213 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:52:53,213 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:52:53,213 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:52:53,213 INFO L85 PathProgramCache]: Analyzing trace with hash -912082282, now seen corresponding path program 2 times [2022-04-15 11:52:53,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:52:53,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620461367] [2022-04-15 11:52:53,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:52:53,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:52:53,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:52:53,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:52:53,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:52:53,453 INFO L290 TraceCheckUtils]: 0: Hoare triple {73575#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {73568#true} is VALID [2022-04-15 11:52:53,453 INFO L290 TraceCheckUtils]: 1: Hoare triple {73568#true} assume true; {73568#true} is VALID [2022-04-15 11:52:53,453 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {73568#true} {73568#true} #708#return; {73568#true} is VALID [2022-04-15 11:52:53,453 INFO L272 TraceCheckUtils]: 0: Hoare triple {73568#true} call ULTIMATE.init(); {73575#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:52:53,453 INFO L290 TraceCheckUtils]: 1: Hoare triple {73575#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {73568#true} is VALID [2022-04-15 11:52:53,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {73568#true} assume true; {73568#true} is VALID [2022-04-15 11:52:53,454 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {73568#true} {73568#true} #708#return; {73568#true} is VALID [2022-04-15 11:52:53,454 INFO L272 TraceCheckUtils]: 4: Hoare triple {73568#true} call #t~ret161 := main(); {73568#true} is VALID [2022-04-15 11:52:53,454 INFO L290 TraceCheckUtils]: 5: Hoare triple {73568#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; {73568#true} is VALID [2022-04-15 11:52:53,454 INFO L290 TraceCheckUtils]: 6: Hoare triple {73568#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {73568#true} is VALID [2022-04-15 11:52:53,454 INFO L272 TraceCheckUtils]: 7: Hoare triple {73568#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {73568#true} is VALID [2022-04-15 11:52:53,454 INFO L290 TraceCheckUtils]: 8: Hoare triple {73568#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); {73568#true} is VALID [2022-04-15 11:52:53,454 INFO L290 TraceCheckUtils]: 9: Hoare triple {73568#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; {73568#true} is VALID [2022-04-15 11:52:53,454 INFO L290 TraceCheckUtils]: 10: Hoare triple {73568#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; {73568#true} is VALID [2022-04-15 11:52:53,454 INFO L290 TraceCheckUtils]: 11: Hoare triple {73568#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {73568#true} is VALID [2022-04-15 11:52:53,454 INFO L290 TraceCheckUtils]: 12: Hoare triple {73568#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {73568#true} is VALID [2022-04-15 11:52:53,455 INFO L290 TraceCheckUtils]: 13: Hoare triple {73568#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {73568#true} is VALID [2022-04-15 11:52:53,455 INFO L290 TraceCheckUtils]: 14: Hoare triple {73568#true} assume !false; {73568#true} is VALID [2022-04-15 11:52:53,455 INFO L290 TraceCheckUtils]: 15: Hoare triple {73568#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); {73568#true} is VALID [2022-04-15 11:52:53,455 INFO L290 TraceCheckUtils]: 16: Hoare triple {73568#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {73568#true} is VALID [2022-04-15 11:52:53,455 INFO L290 TraceCheckUtils]: 17: Hoare triple {73568#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {73568#true} is VALID [2022-04-15 11:52:53,455 INFO L290 TraceCheckUtils]: 18: Hoare triple {73568#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {73568#true} is VALID [2022-04-15 11:52:53,455 INFO L290 TraceCheckUtils]: 19: Hoare triple {73568#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {73568#true} is VALID [2022-04-15 11:52:53,455 INFO L290 TraceCheckUtils]: 20: Hoare triple {73568#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {73568#true} is VALID [2022-04-15 11:52:53,455 INFO L290 TraceCheckUtils]: 21: Hoare triple {73568#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {73568#true} is VALID [2022-04-15 11:52:53,456 INFO L290 TraceCheckUtils]: 22: Hoare triple {73568#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {73568#true} is VALID [2022-04-15 11:52:53,456 INFO L290 TraceCheckUtils]: 23: Hoare triple {73568#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {73568#true} is VALID [2022-04-15 11:52:53,456 INFO L290 TraceCheckUtils]: 24: Hoare triple {73568#true} assume 8464 == #t~mem55;havoc #t~mem55; {73568#true} is VALID [2022-04-15 11:52:53,456 INFO L290 TraceCheckUtils]: 25: Hoare triple {73568#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; {73568#true} is VALID [2022-04-15 11:52:53,456 INFO L290 TraceCheckUtils]: 26: Hoare triple {73568#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {73568#true} is VALID [2022-04-15 11:52:53,456 INFO L290 TraceCheckUtils]: 27: Hoare triple {73568#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); {73568#true} is VALID [2022-04-15 11:52:53,456 INFO L290 TraceCheckUtils]: 28: Hoare triple {73568#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); {73568#true} is VALID [2022-04-15 11:52:53,456 INFO L290 TraceCheckUtils]: 29: Hoare triple {73568#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {73568#true} is VALID [2022-04-15 11:52:53,456 INFO L290 TraceCheckUtils]: 30: Hoare triple {73568#true} ~skip~0 := 0; {73568#true} is VALID [2022-04-15 11:52:53,457 INFO L290 TraceCheckUtils]: 31: Hoare triple {73568#true} assume !false; {73568#true} is VALID [2022-04-15 11:52:53,457 INFO L290 TraceCheckUtils]: 32: Hoare triple {73568#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); {73568#true} is VALID [2022-04-15 11:52:53,457 INFO L290 TraceCheckUtils]: 33: Hoare triple {73568#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {73568#true} is VALID [2022-04-15 11:52:53,457 INFO L290 TraceCheckUtils]: 34: Hoare triple {73568#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {73568#true} is VALID [2022-04-15 11:52:53,457 INFO L290 TraceCheckUtils]: 35: Hoare triple {73568#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {73568#true} is VALID [2022-04-15 11:52:53,457 INFO L290 TraceCheckUtils]: 36: Hoare triple {73568#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {73568#true} is VALID [2022-04-15 11:52:53,457 INFO L290 TraceCheckUtils]: 37: Hoare triple {73568#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {73568#true} is VALID [2022-04-15 11:52:53,457 INFO L290 TraceCheckUtils]: 38: Hoare triple {73568#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {73568#true} is VALID [2022-04-15 11:52:53,457 INFO L290 TraceCheckUtils]: 39: Hoare triple {73568#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {73568#true} is VALID [2022-04-15 11:52:53,457 INFO L290 TraceCheckUtils]: 40: Hoare triple {73568#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {73568#true} is VALID [2022-04-15 11:52:53,458 INFO L290 TraceCheckUtils]: 41: Hoare triple {73568#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {73568#true} is VALID [2022-04-15 11:52:53,458 INFO L290 TraceCheckUtils]: 42: Hoare triple {73568#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {73568#true} is VALID [2022-04-15 11:52:53,458 INFO L290 TraceCheckUtils]: 43: Hoare triple {73568#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {73568#true} is VALID [2022-04-15 11:52:53,458 INFO L290 TraceCheckUtils]: 44: Hoare triple {73568#true} assume 8496 == #t~mem58;havoc #t~mem58; {73568#true} is VALID [2022-04-15 11:52:53,458 INFO L290 TraceCheckUtils]: 45: Hoare triple {73568#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {73568#true} is VALID [2022-04-15 11:52:53,458 INFO L290 TraceCheckUtils]: 46: Hoare triple {73568#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {73568#true} is VALID [2022-04-15 11:52:53,458 INFO L290 TraceCheckUtils]: 47: Hoare triple {73568#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {73568#true} is VALID [2022-04-15 11:52:53,460 INFO L290 TraceCheckUtils]: 48: Hoare triple {73568#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {73573#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:53,461 INFO L290 TraceCheckUtils]: 49: Hoare triple {73573#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {73573#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:53,461 INFO L290 TraceCheckUtils]: 50: Hoare triple {73573#(not (= 8641 (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); {73573#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:53,462 INFO L290 TraceCheckUtils]: 51: Hoare triple {73573#(not (= 8641 (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; {73573#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:53,462 INFO L290 TraceCheckUtils]: 52: Hoare triple {73573#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {73573#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:53,462 INFO L290 TraceCheckUtils]: 53: Hoare triple {73573#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {73573#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:53,463 INFO L290 TraceCheckUtils]: 54: Hoare triple {73573#(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); {73573#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:53,463 INFO L290 TraceCheckUtils]: 55: Hoare triple {73573#(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); {73573#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:53,464 INFO L290 TraceCheckUtils]: 56: Hoare triple {73573#(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); {73573#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:53,464 INFO L290 TraceCheckUtils]: 57: Hoare triple {73573#(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); {73573#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:53,465 INFO L290 TraceCheckUtils]: 58: Hoare triple {73573#(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); {73573#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:53,465 INFO L290 TraceCheckUtils]: 59: Hoare triple {73573#(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); {73573#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:53,466 INFO L290 TraceCheckUtils]: 60: Hoare triple {73573#(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); {73573#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:53,466 INFO L290 TraceCheckUtils]: 61: Hoare triple {73573#(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); {73573#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:53,466 INFO L290 TraceCheckUtils]: 62: Hoare triple {73573#(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); {73573#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:53,467 INFO L290 TraceCheckUtils]: 63: Hoare triple {73573#(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); {73573#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:53,467 INFO L290 TraceCheckUtils]: 64: Hoare triple {73573#(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); {73573#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:53,468 INFO L290 TraceCheckUtils]: 65: Hoare triple {73573#(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); {73573#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:53,468 INFO L290 TraceCheckUtils]: 66: Hoare triple {73573#(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); {73573#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:53,469 INFO L290 TraceCheckUtils]: 67: Hoare triple {73573#(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); {73573#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:53,469 INFO L290 TraceCheckUtils]: 68: Hoare triple {73573#(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); {73573#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:53,470 INFO L290 TraceCheckUtils]: 69: Hoare triple {73573#(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); {73573#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:53,470 INFO L290 TraceCheckUtils]: 70: Hoare triple {73573#(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); {73573#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:53,471 INFO L290 TraceCheckUtils]: 71: Hoare triple {73573#(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); {73573#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:53,471 INFO L290 TraceCheckUtils]: 72: Hoare triple {73573#(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); {73573#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:53,471 INFO L290 TraceCheckUtils]: 73: Hoare triple {73573#(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); {73573#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:53,472 INFO L290 TraceCheckUtils]: 74: Hoare triple {73573#(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); {73573#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:53,472 INFO L290 TraceCheckUtils]: 75: Hoare triple {73573#(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); {73573#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:53,473 INFO L290 TraceCheckUtils]: 76: Hoare triple {73573#(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); {73573#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:53,473 INFO L290 TraceCheckUtils]: 77: Hoare triple {73573#(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); {73573#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:53,474 INFO L290 TraceCheckUtils]: 78: Hoare triple {73573#(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); {73573#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:53,474 INFO L290 TraceCheckUtils]: 79: Hoare triple {73573#(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); {73573#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:53,475 INFO L290 TraceCheckUtils]: 80: Hoare triple {73573#(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); {73573#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:53,475 INFO L290 TraceCheckUtils]: 81: Hoare triple {73573#(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); {73573#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:53,476 INFO L290 TraceCheckUtils]: 82: Hoare triple {73573#(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); {73573#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:53,476 INFO L290 TraceCheckUtils]: 83: Hoare triple {73573#(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); {73574#(not (= |ssl3_accept_#t~mem76| 8641))} is VALID [2022-04-15 11:52:53,476 INFO L290 TraceCheckUtils]: 84: Hoare triple {73574#(not (= |ssl3_accept_#t~mem76| 8641))} assume 8641 == #t~mem76;havoc #t~mem76; {73569#false} is VALID [2022-04-15 11:52:53,477 INFO L290 TraceCheckUtils]: 85: Hoare triple {73569#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {73569#false} is VALID [2022-04-15 11:52:53,477 INFO L290 TraceCheckUtils]: 86: Hoare triple {73569#false} assume !(4 == ~blastFlag~0); {73569#false} is VALID [2022-04-15 11:52:53,477 INFO L290 TraceCheckUtils]: 87: Hoare triple {73569#false} assume !(7 == ~blastFlag~0); {73569#false} is VALID [2022-04-15 11:52:53,477 INFO L290 TraceCheckUtils]: 88: Hoare triple {73569#false} assume !(10 == ~blastFlag~0); {73569#false} is VALID [2022-04-15 11:52:53,477 INFO L290 TraceCheckUtils]: 89: Hoare triple {73569#false} assume 13 == ~blastFlag~0; {73569#false} is VALID [2022-04-15 11:52:53,477 INFO L290 TraceCheckUtils]: 90: Hoare triple {73569#false} assume !false; {73569#false} is VALID [2022-04-15 11:52:53,477 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-15 11:52:53,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:52:53,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620461367] [2022-04-15 11:52:53,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620461367] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:52:53,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:52:53,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:52:53,478 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:52:53,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1751303654] [2022-04-15 11:52:53,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1751303654] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:52:53,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:52:53,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:52:53,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168345778] [2022-04-15 11:52:53,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:52:53,479 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 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-15 11:52:53,479 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:52:53,479 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:53,537 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:52:53,537 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:52:53,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:52:53,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:52:53,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:52:53,538 INFO L87 Difference]: Start difference. First operand 775 states and 1185 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:58,484 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-15 11:53:00,537 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-15 11:53:05,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:53:05,923 INFO L93 Difference]: Finished difference Result 1815 states and 2777 transitions. [2022-04-15 11:53:05,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:53:05,924 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 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-15 11:53:05,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:53:05,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:53:05,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 609 transitions. [2022-04-15 11:53:05,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:53:05,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 609 transitions. [2022-04-15 11:53:05,931 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 609 transitions. [2022-04-15 11:53:06,365 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 609 edges. 609 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:53:06,414 INFO L225 Difference]: With dead ends: 1815 [2022-04-15 11:53:06,414 INFO L226 Difference]: Without dead ends: 1066 [2022-04-15 11:53:06,416 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-15 11:53:06,416 INFO L913 BasicCegarLoop]: 140 mSDtfsCounter, 121 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 60 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-04-15 11:53:06,416 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 396 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 495 Invalid, 2 Unknown, 0 Unchecked, 6.9s Time] [2022-04-15 11:53:06,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2022-04-15 11:53:06,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 721. [2022-04-15 11:53:06,468 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:53:06,469 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1066 states. Second operand has 721 states, 716 states have (on average 1.553072625698324) internal successors, (1112), 716 states have internal predecessors, (1112), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:53:06,470 INFO L74 IsIncluded]: Start isIncluded. First operand 1066 states. Second operand has 721 states, 716 states have (on average 1.553072625698324) internal successors, (1112), 716 states have internal predecessors, (1112), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:53:06,470 INFO L87 Difference]: Start difference. First operand 1066 states. Second operand has 721 states, 716 states have (on average 1.553072625698324) internal successors, (1112), 716 states have internal predecessors, (1112), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:53:06,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:53:06,500 INFO L93 Difference]: Finished difference Result 1066 states and 1621 transitions. [2022-04-15 11:53:06,500 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1621 transitions. [2022-04-15 11:53:06,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:53:06,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:53:06,501 INFO L74 IsIncluded]: Start isIncluded. First operand has 721 states, 716 states have (on average 1.553072625698324) internal successors, (1112), 716 states have internal predecessors, (1112), 3 states have call successors, (3), 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 1066 states. [2022-04-15 11:53:06,502 INFO L87 Difference]: Start difference. First operand has 721 states, 716 states have (on average 1.553072625698324) internal successors, (1112), 716 states have internal predecessors, (1112), 3 states have call successors, (3), 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 1066 states. [2022-04-15 11:53:06,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:53:06,543 INFO L93 Difference]: Finished difference Result 1066 states and 1621 transitions. [2022-04-15 11:53:06,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1621 transitions. [2022-04-15 11:53:06,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:53:06,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:53:06,544 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:53:06,544 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:53:06,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 721 states, 716 states have (on average 1.553072625698324) internal successors, (1112), 716 states have internal predecessors, (1112), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:53:06,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 1116 transitions. [2022-04-15 11:53:06,565 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 1116 transitions. Word has length 91 [2022-04-15 11:53:06,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:53:06,565 INFO L478 AbstractCegarLoop]: Abstraction has 721 states and 1116 transitions. [2022-04-15 11:53:06,565 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:53:06,565 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 721 states and 1116 transitions. [2022-04-15 11:53:09,922 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1116 edges. 1115 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:53:09,923 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 1116 transitions. [2022-04-15 11:53:09,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-04-15 11:53:09,924 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:53:09,924 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 11:53:09,924 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-15 11:53:09,924 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:53:09,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:53:09,924 INFO L85 PathProgramCache]: Analyzing trace with hash 393910684, now seen corresponding path program 1 times [2022-04-15 11:53:09,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:53:09,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1354581948] [2022-04-15 11:53:09,983 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:53:09,983 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:53:09,983 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:53:09,983 INFO L85 PathProgramCache]: Analyzing trace with hash 393910684, now seen corresponding path program 2 times [2022-04-15 11:53:09,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:53:09,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113947776] [2022-04-15 11:53:09,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:53:09,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:53:10,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:53:10,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:53:10,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:53:10,209 INFO L290 TraceCheckUtils]: 0: Hoare triple {80791#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {80784#true} is VALID [2022-04-15 11:53:10,210 INFO L290 TraceCheckUtils]: 1: Hoare triple {80784#true} assume true; {80784#true} is VALID [2022-04-15 11:53:10,210 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {80784#true} {80784#true} #708#return; {80784#true} is VALID [2022-04-15 11:53:10,211 INFO L272 TraceCheckUtils]: 0: Hoare triple {80784#true} call ULTIMATE.init(); {80791#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:53:10,211 INFO L290 TraceCheckUtils]: 1: Hoare triple {80791#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {80784#true} is VALID [2022-04-15 11:53:10,211 INFO L290 TraceCheckUtils]: 2: Hoare triple {80784#true} assume true; {80784#true} is VALID [2022-04-15 11:53:10,211 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {80784#true} {80784#true} #708#return; {80784#true} is VALID [2022-04-15 11:53:10,211 INFO L272 TraceCheckUtils]: 4: Hoare triple {80784#true} call #t~ret161 := main(); {80784#true} is VALID [2022-04-15 11:53:10,211 INFO L290 TraceCheckUtils]: 5: Hoare triple {80784#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; {80784#true} is VALID [2022-04-15 11:53:10,211 INFO L290 TraceCheckUtils]: 6: Hoare triple {80784#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {80784#true} is VALID [2022-04-15 11:53:10,211 INFO L272 TraceCheckUtils]: 7: Hoare triple {80784#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {80784#true} is VALID [2022-04-15 11:53:10,211 INFO L290 TraceCheckUtils]: 8: Hoare triple {80784#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); {80784#true} is VALID [2022-04-15 11:53:10,212 INFO L290 TraceCheckUtils]: 9: Hoare triple {80784#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; {80784#true} is VALID [2022-04-15 11:53:10,212 INFO L290 TraceCheckUtils]: 10: Hoare triple {80784#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; {80784#true} is VALID [2022-04-15 11:53:10,212 INFO L290 TraceCheckUtils]: 11: Hoare triple {80784#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {80784#true} is VALID [2022-04-15 11:53:10,212 INFO L290 TraceCheckUtils]: 12: Hoare triple {80784#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {80784#true} is VALID [2022-04-15 11:53:10,212 INFO L290 TraceCheckUtils]: 13: Hoare triple {80784#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {80784#true} is VALID [2022-04-15 11:53:10,212 INFO L290 TraceCheckUtils]: 14: Hoare triple {80784#true} assume !false; {80784#true} is VALID [2022-04-15 11:53:10,212 INFO L290 TraceCheckUtils]: 15: Hoare triple {80784#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); {80784#true} is VALID [2022-04-15 11:53:10,212 INFO L290 TraceCheckUtils]: 16: Hoare triple {80784#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {80784#true} is VALID [2022-04-15 11:53:10,212 INFO L290 TraceCheckUtils]: 17: Hoare triple {80784#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {80784#true} is VALID [2022-04-15 11:53:10,212 INFO L290 TraceCheckUtils]: 18: Hoare triple {80784#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {80784#true} is VALID [2022-04-15 11:53:10,213 INFO L290 TraceCheckUtils]: 19: Hoare triple {80784#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {80784#true} is VALID [2022-04-15 11:53:10,213 INFO L290 TraceCheckUtils]: 20: Hoare triple {80784#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {80784#true} is VALID [2022-04-15 11:53:10,213 INFO L290 TraceCheckUtils]: 21: Hoare triple {80784#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {80784#true} is VALID [2022-04-15 11:53:10,213 INFO L290 TraceCheckUtils]: 22: Hoare triple {80784#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {80784#true} is VALID [2022-04-15 11:53:10,213 INFO L290 TraceCheckUtils]: 23: Hoare triple {80784#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {80784#true} is VALID [2022-04-15 11:53:10,213 INFO L290 TraceCheckUtils]: 24: Hoare triple {80784#true} assume 8464 == #t~mem55;havoc #t~mem55; {80784#true} is VALID [2022-04-15 11:53:10,213 INFO L290 TraceCheckUtils]: 25: Hoare triple {80784#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; {80784#true} is VALID [2022-04-15 11:53:10,213 INFO L290 TraceCheckUtils]: 26: Hoare triple {80784#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {80784#true} is VALID [2022-04-15 11:53:10,213 INFO L290 TraceCheckUtils]: 27: Hoare triple {80784#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); {80784#true} is VALID [2022-04-15 11:53:10,213 INFO L290 TraceCheckUtils]: 28: Hoare triple {80784#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); {80784#true} is VALID [2022-04-15 11:53:10,214 INFO L290 TraceCheckUtils]: 29: Hoare triple {80784#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {80784#true} is VALID [2022-04-15 11:53:10,214 INFO L290 TraceCheckUtils]: 30: Hoare triple {80784#true} ~skip~0 := 0; {80784#true} is VALID [2022-04-15 11:53:10,214 INFO L290 TraceCheckUtils]: 31: Hoare triple {80784#true} assume !false; {80784#true} is VALID [2022-04-15 11:53:10,214 INFO L290 TraceCheckUtils]: 32: Hoare triple {80784#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); {80784#true} is VALID [2022-04-15 11:53:10,214 INFO L290 TraceCheckUtils]: 33: Hoare triple {80784#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {80784#true} is VALID [2022-04-15 11:53:10,214 INFO L290 TraceCheckUtils]: 34: Hoare triple {80784#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {80784#true} is VALID [2022-04-15 11:53:10,214 INFO L290 TraceCheckUtils]: 35: Hoare triple {80784#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {80784#true} is VALID [2022-04-15 11:53:10,214 INFO L290 TraceCheckUtils]: 36: Hoare triple {80784#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {80784#true} is VALID [2022-04-15 11:53:10,214 INFO L290 TraceCheckUtils]: 37: Hoare triple {80784#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {80784#true} is VALID [2022-04-15 11:53:10,214 INFO L290 TraceCheckUtils]: 38: Hoare triple {80784#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {80784#true} is VALID [2022-04-15 11:53:10,215 INFO L290 TraceCheckUtils]: 39: Hoare triple {80784#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {80784#true} is VALID [2022-04-15 11:53:10,215 INFO L290 TraceCheckUtils]: 40: Hoare triple {80784#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {80784#true} is VALID [2022-04-15 11:53:10,215 INFO L290 TraceCheckUtils]: 41: Hoare triple {80784#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {80784#true} is VALID [2022-04-15 11:53:10,215 INFO L290 TraceCheckUtils]: 42: Hoare triple {80784#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {80784#true} is VALID [2022-04-15 11:53:10,215 INFO L290 TraceCheckUtils]: 43: Hoare triple {80784#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {80784#true} is VALID [2022-04-15 11:53:10,215 INFO L290 TraceCheckUtils]: 44: Hoare triple {80784#true} assume 8496 == #t~mem58;havoc #t~mem58; {80784#true} is VALID [2022-04-15 11:53:10,215 INFO L290 TraceCheckUtils]: 45: Hoare triple {80784#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {80784#true} is VALID [2022-04-15 11:53:10,215 INFO L290 TraceCheckUtils]: 46: Hoare triple {80784#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {80784#true} is VALID [2022-04-15 11:53:10,215 INFO L290 TraceCheckUtils]: 47: Hoare triple {80784#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {80784#true} is VALID [2022-04-15 11:53:10,216 INFO L290 TraceCheckUtils]: 48: Hoare triple {80784#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {80789#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:53:10,217 INFO L290 TraceCheckUtils]: 49: Hoare triple {80789#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {80789#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:53:10,218 INFO L290 TraceCheckUtils]: 50: Hoare triple {80789#(= 8656 (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); {80789#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:53:10,218 INFO L290 TraceCheckUtils]: 51: Hoare triple {80789#(= 8656 (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; {80789#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:53:10,218 INFO L290 TraceCheckUtils]: 52: Hoare triple {80789#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {80789#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:53:10,219 INFO L290 TraceCheckUtils]: 53: Hoare triple {80789#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {80789#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:53:10,219 INFO L290 TraceCheckUtils]: 54: Hoare triple {80789#(= 8656 (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); {80789#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:53:10,219 INFO L290 TraceCheckUtils]: 55: Hoare triple {80789#(= 8656 (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); {80789#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:53:10,220 INFO L290 TraceCheckUtils]: 56: Hoare triple {80789#(= 8656 (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); {80789#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:53:10,220 INFO L290 TraceCheckUtils]: 57: Hoare triple {80789#(= 8656 (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); {80789#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:53:10,220 INFO L290 TraceCheckUtils]: 58: Hoare triple {80789#(= 8656 (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); {80789#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:53:10,221 INFO L290 TraceCheckUtils]: 59: Hoare triple {80789#(= 8656 (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); {80789#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:53:10,222 INFO L290 TraceCheckUtils]: 60: Hoare triple {80789#(= 8656 (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); {80789#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:53:10,222 INFO L290 TraceCheckUtils]: 61: Hoare triple {80789#(= 8656 (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); {80789#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:53:10,223 INFO L290 TraceCheckUtils]: 62: Hoare triple {80789#(= 8656 (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); {80789#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:53:10,223 INFO L290 TraceCheckUtils]: 63: Hoare triple {80789#(= 8656 (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); {80789#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:53:10,223 INFO L290 TraceCheckUtils]: 64: Hoare triple {80789#(= 8656 (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); {80789#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:53:10,224 INFO L290 TraceCheckUtils]: 65: Hoare triple {80789#(= 8656 (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); {80789#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:53:10,224 INFO L290 TraceCheckUtils]: 66: Hoare triple {80789#(= 8656 (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); {80789#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:53:10,224 INFO L290 TraceCheckUtils]: 67: Hoare triple {80789#(= 8656 (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); {80789#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:53:10,225 INFO L290 TraceCheckUtils]: 68: Hoare triple {80789#(= 8656 (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); {80789#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:53:10,225 INFO L290 TraceCheckUtils]: 69: Hoare triple {80789#(= 8656 (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); {80789#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:53:10,225 INFO L290 TraceCheckUtils]: 70: Hoare triple {80789#(= 8656 (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); {80789#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:53:10,226 INFO L290 TraceCheckUtils]: 71: Hoare triple {80789#(= 8656 (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); {80789#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:53:10,226 INFO L290 TraceCheckUtils]: 72: Hoare triple {80789#(= 8656 (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); {80789#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:53:10,226 INFO L290 TraceCheckUtils]: 73: Hoare triple {80789#(= 8656 (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); {80789#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:53:10,227 INFO L290 TraceCheckUtils]: 74: Hoare triple {80789#(= 8656 (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); {80789#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:53:10,227 INFO L290 TraceCheckUtils]: 75: Hoare triple {80789#(= 8656 (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); {80790#(= |ssl3_accept_#t~mem68| 8656)} is VALID [2022-04-15 11:53:10,227 INFO L290 TraceCheckUtils]: 76: Hoare triple {80790#(= |ssl3_accept_#t~mem68| 8656)} assume 8448 == #t~mem68;havoc #t~mem68; {80785#false} is VALID [2022-04-15 11:53:10,228 INFO L290 TraceCheckUtils]: 77: Hoare triple {80785#false} assume !(~num1~0 > 0); {80785#false} is VALID [2022-04-15 11:53:10,228 INFO L290 TraceCheckUtils]: 78: Hoare triple {80785#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; {80785#false} is VALID [2022-04-15 11:53:10,228 INFO L290 TraceCheckUtils]: 79: Hoare triple {80785#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); {80785#false} is VALID [2022-04-15 11:53:10,228 INFO L290 TraceCheckUtils]: 80: Hoare triple {80785#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {80785#false} is VALID [2022-04-15 11:53:10,228 INFO L290 TraceCheckUtils]: 81: Hoare triple {80785#false} ~skip~0 := 0; {80785#false} is VALID [2022-04-15 11:53:10,228 INFO L290 TraceCheckUtils]: 82: Hoare triple {80785#false} assume !false; {80785#false} is VALID [2022-04-15 11:53:10,228 INFO L290 TraceCheckUtils]: 83: Hoare triple {80785#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); {80785#false} is VALID [2022-04-15 11:53:10,228 INFO L290 TraceCheckUtils]: 84: Hoare triple {80785#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {80785#false} is VALID [2022-04-15 11:53:10,228 INFO L290 TraceCheckUtils]: 85: Hoare triple {80785#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {80785#false} is VALID [2022-04-15 11:53:10,228 INFO L290 TraceCheckUtils]: 86: Hoare triple {80785#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {80785#false} is VALID [2022-04-15 11:53:10,228 INFO L290 TraceCheckUtils]: 87: Hoare triple {80785#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {80785#false} is VALID [2022-04-15 11:53:10,228 INFO L290 TraceCheckUtils]: 88: Hoare triple {80785#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {80785#false} is VALID [2022-04-15 11:53:10,228 INFO L290 TraceCheckUtils]: 89: Hoare triple {80785#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {80785#false} is VALID [2022-04-15 11:53:10,228 INFO L290 TraceCheckUtils]: 90: Hoare triple {80785#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {80785#false} is VALID [2022-04-15 11:53:10,228 INFO L290 TraceCheckUtils]: 91: Hoare triple {80785#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {80785#false} is VALID [2022-04-15 11:53:10,229 INFO L290 TraceCheckUtils]: 92: Hoare triple {80785#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {80785#false} is VALID [2022-04-15 11:53:10,229 INFO L290 TraceCheckUtils]: 93: Hoare triple {80785#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {80785#false} is VALID [2022-04-15 11:53:10,229 INFO L290 TraceCheckUtils]: 94: Hoare triple {80785#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {80785#false} is VALID [2022-04-15 11:53:10,229 INFO L290 TraceCheckUtils]: 95: Hoare triple {80785#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {80785#false} is VALID [2022-04-15 11:53:10,229 INFO L290 TraceCheckUtils]: 96: Hoare triple {80785#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {80785#false} is VALID [2022-04-15 11:53:10,229 INFO L290 TraceCheckUtils]: 97: Hoare triple {80785#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {80785#false} is VALID [2022-04-15 11:53:10,229 INFO L290 TraceCheckUtils]: 98: Hoare triple {80785#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {80785#false} is VALID [2022-04-15 11:53:10,229 INFO L290 TraceCheckUtils]: 99: Hoare triple {80785#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {80785#false} is VALID [2022-04-15 11:53:10,229 INFO L290 TraceCheckUtils]: 100: Hoare triple {80785#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {80785#false} is VALID [2022-04-15 11:53:10,229 INFO L290 TraceCheckUtils]: 101: Hoare triple {80785#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {80785#false} is VALID [2022-04-15 11:53:10,229 INFO L290 TraceCheckUtils]: 102: Hoare triple {80785#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {80785#false} is VALID [2022-04-15 11:53:10,229 INFO L290 TraceCheckUtils]: 103: Hoare triple {80785#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {80785#false} is VALID [2022-04-15 11:53:10,229 INFO L290 TraceCheckUtils]: 104: Hoare triple {80785#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {80785#false} is VALID [2022-04-15 11:53:10,229 INFO L290 TraceCheckUtils]: 105: Hoare triple {80785#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {80785#false} is VALID [2022-04-15 11:53:10,229 INFO L290 TraceCheckUtils]: 106: Hoare triple {80785#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {80785#false} is VALID [2022-04-15 11:53:10,230 INFO L290 TraceCheckUtils]: 107: Hoare triple {80785#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {80785#false} is VALID [2022-04-15 11:53:10,230 INFO L290 TraceCheckUtils]: 108: Hoare triple {80785#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {80785#false} is VALID [2022-04-15 11:53:10,230 INFO L290 TraceCheckUtils]: 109: Hoare triple {80785#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {80785#false} is VALID [2022-04-15 11:53:10,230 INFO L290 TraceCheckUtils]: 110: Hoare triple {80785#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {80785#false} is VALID [2022-04-15 11:53:10,230 INFO L290 TraceCheckUtils]: 111: Hoare triple {80785#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {80785#false} is VALID [2022-04-15 11:53:10,230 INFO L290 TraceCheckUtils]: 112: Hoare triple {80785#false} assume 8640 == #t~mem75;havoc #t~mem75; {80785#false} is VALID [2022-04-15 11:53:10,230 INFO L290 TraceCheckUtils]: 113: Hoare triple {80785#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {80785#false} is VALID [2022-04-15 11:53:10,230 INFO L290 TraceCheckUtils]: 114: Hoare triple {80785#false} assume !(4 == ~blastFlag~0); {80785#false} is VALID [2022-04-15 11:53:10,230 INFO L290 TraceCheckUtils]: 115: Hoare triple {80785#false} assume !(7 == ~blastFlag~0); {80785#false} is VALID [2022-04-15 11:53:10,230 INFO L290 TraceCheckUtils]: 116: Hoare triple {80785#false} assume !(10 == ~blastFlag~0); {80785#false} is VALID [2022-04-15 11:53:10,230 INFO L290 TraceCheckUtils]: 117: Hoare triple {80785#false} assume 13 == ~blastFlag~0; {80785#false} is VALID [2022-04-15 11:53:10,230 INFO L290 TraceCheckUtils]: 118: Hoare triple {80785#false} assume !false; {80785#false} is VALID [2022-04-15 11:53:10,231 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-15 11:53:10,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:53:10,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113947776] [2022-04-15 11:53:10,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113947776] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:53:10,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:53:10,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:53:10,231 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:53:10,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1354581948] [2022-04-15 11:53:10,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1354581948] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:53:10,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:53:10,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:53:10,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807223410] [2022-04-15 11:53:10,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:53:10,232 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 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 119 [2022-04-15 11:53:10,232 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:53:10,232 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:53:10,311 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:53:10,311 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:53:10,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:53:10,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:53:10,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:53:10,312 INFO L87 Difference]: Start difference. First operand 721 states and 1116 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:53:14,640 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-15 11:53:20,659 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:53:27,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:53:27,976 INFO L93 Difference]: Finished difference Result 1693 states and 2607 transitions. [2022-04-15 11:53:27,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:53:27,976 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 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 119 [2022-04-15 11:53:27,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:53:27,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:53:27,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 572 transitions. [2022-04-15 11:53:27,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:53:27,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 572 transitions. [2022-04-15 11:53:27,980 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 572 transitions. [2022-04-15 11:53:28,371 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 572 edges. 572 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:53:28,411 INFO L225 Difference]: With dead ends: 1693 [2022-04-15 11:53:28,411 INFO L226 Difference]: Without dead ends: 998 [2022-04-15 11:53:28,412 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-15 11:53:28,412 INFO L913 BasicCegarLoop]: 283 mSDtfsCounter, 88 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 13 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2022-04-15 11:53:28,413 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 687 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 634 Invalid, 1 Unknown, 0 Unchecked, 7.6s Time] [2022-04-15 11:53:28,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2022-04-15 11:53:28,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 823. [2022-04-15 11:53:28,464 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:53:28,465 INFO L82 GeneralOperation]: Start isEquivalent. First operand 998 states. Second operand has 823 states, 818 states have (on average 1.561124694376528) internal successors, (1277), 818 states have internal predecessors, (1277), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:53:28,465 INFO L74 IsIncluded]: Start isIncluded. First operand 998 states. Second operand has 823 states, 818 states have (on average 1.561124694376528) internal successors, (1277), 818 states have internal predecessors, (1277), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:53:28,466 INFO L87 Difference]: Start difference. First operand 998 states. Second operand has 823 states, 818 states have (on average 1.561124694376528) internal successors, (1277), 818 states have internal predecessors, (1277), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:53:28,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:53:28,499 INFO L93 Difference]: Finished difference Result 998 states and 1520 transitions. [2022-04-15 11:53:28,499 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1520 transitions. [2022-04-15 11:53:28,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:53:28,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:53:28,501 INFO L74 IsIncluded]: Start isIncluded. First operand has 823 states, 818 states have (on average 1.561124694376528) internal successors, (1277), 818 states have internal predecessors, (1277), 3 states have call successors, (3), 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 998 states. [2022-04-15 11:53:28,501 INFO L87 Difference]: Start difference. First operand has 823 states, 818 states have (on average 1.561124694376528) internal successors, (1277), 818 states have internal predecessors, (1277), 3 states have call successors, (3), 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 998 states. [2022-04-15 11:53:28,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:53:28,533 INFO L93 Difference]: Finished difference Result 998 states and 1520 transitions. [2022-04-15 11:53:28,533 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1520 transitions. [2022-04-15 11:53:28,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:53:28,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:53:28,534 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:53:28,534 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:53:28,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 823 states, 818 states have (on average 1.561124694376528) internal successors, (1277), 818 states have internal predecessors, (1277), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:53:28,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1281 transitions. [2022-04-15 11:53:28,565 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1281 transitions. Word has length 119 [2022-04-15 11:53:28,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:53:28,565 INFO L478 AbstractCegarLoop]: Abstraction has 823 states and 1281 transitions. [2022-04-15 11:53:28,566 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:53:28,566 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 823 states and 1281 transitions. [2022-04-15 11:53:32,125 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1281 edges. 1280 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:53:32,125 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1281 transitions. [2022-04-15 11:53:32,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-04-15 11:53:32,126 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:53:32,126 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 11:53:32,126 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-15 11:53:32,126 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:53:32,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:53:32,127 INFO L85 PathProgramCache]: Analyzing trace with hash -573439970, now seen corresponding path program 1 times [2022-04-15 11:53:32,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:53:32,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [228655090] [2022-04-15 11:53:32,179 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:53:32,179 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:53:32,179 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:53:32,179 INFO L85 PathProgramCache]: Analyzing trace with hash -573439970, now seen corresponding path program 2 times [2022-04-15 11:53:32,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:53:32,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602454771] [2022-04-15 11:53:32,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:53:32,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:53:32,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:53:32,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:53:32,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:53:32,412 INFO L290 TraceCheckUtils]: 0: Hoare triple {87831#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {87824#true} is VALID [2022-04-15 11:53:32,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {87824#true} assume true; {87824#true} is VALID [2022-04-15 11:53:32,412 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {87824#true} {87824#true} #708#return; {87824#true} is VALID [2022-04-15 11:53:32,413 INFO L272 TraceCheckUtils]: 0: Hoare triple {87824#true} call ULTIMATE.init(); {87831#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:53:32,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {87831#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {87824#true} is VALID [2022-04-15 11:53:32,413 INFO L290 TraceCheckUtils]: 2: Hoare triple {87824#true} assume true; {87824#true} is VALID [2022-04-15 11:53:32,413 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {87824#true} {87824#true} #708#return; {87824#true} is VALID [2022-04-15 11:53:32,413 INFO L272 TraceCheckUtils]: 4: Hoare triple {87824#true} call #t~ret161 := main(); {87824#true} is VALID [2022-04-15 11:53:32,413 INFO L290 TraceCheckUtils]: 5: Hoare triple {87824#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; {87824#true} is VALID [2022-04-15 11:53:32,413 INFO L290 TraceCheckUtils]: 6: Hoare triple {87824#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {87824#true} is VALID [2022-04-15 11:53:32,413 INFO L272 TraceCheckUtils]: 7: Hoare triple {87824#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {87824#true} is VALID [2022-04-15 11:53:32,413 INFO L290 TraceCheckUtils]: 8: Hoare triple {87824#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); {87824#true} is VALID [2022-04-15 11:53:32,413 INFO L290 TraceCheckUtils]: 9: Hoare triple {87824#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; {87824#true} is VALID [2022-04-15 11:53:32,414 INFO L290 TraceCheckUtils]: 10: Hoare triple {87824#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; {87824#true} is VALID [2022-04-15 11:53:32,414 INFO L290 TraceCheckUtils]: 11: Hoare triple {87824#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {87824#true} is VALID [2022-04-15 11:53:32,414 INFO L290 TraceCheckUtils]: 12: Hoare triple {87824#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {87824#true} is VALID [2022-04-15 11:53:32,414 INFO L290 TraceCheckUtils]: 13: Hoare triple {87824#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {87824#true} is VALID [2022-04-15 11:53:32,414 INFO L290 TraceCheckUtils]: 14: Hoare triple {87824#true} assume !false; {87824#true} is VALID [2022-04-15 11:53:32,414 INFO L290 TraceCheckUtils]: 15: Hoare triple {87824#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); {87824#true} is VALID [2022-04-15 11:53:32,414 INFO L290 TraceCheckUtils]: 16: Hoare triple {87824#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {87824#true} is VALID [2022-04-15 11:53:32,414 INFO L290 TraceCheckUtils]: 17: Hoare triple {87824#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {87824#true} is VALID [2022-04-15 11:53:32,414 INFO L290 TraceCheckUtils]: 18: Hoare triple {87824#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {87824#true} is VALID [2022-04-15 11:53:32,414 INFO L290 TraceCheckUtils]: 19: Hoare triple {87824#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {87824#true} is VALID [2022-04-15 11:53:32,414 INFO L290 TraceCheckUtils]: 20: Hoare triple {87824#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {87824#true} is VALID [2022-04-15 11:53:32,414 INFO L290 TraceCheckUtils]: 21: Hoare triple {87824#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {87824#true} is VALID [2022-04-15 11:53:32,414 INFO L290 TraceCheckUtils]: 22: Hoare triple {87824#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {87824#true} is VALID [2022-04-15 11:53:32,414 INFO L290 TraceCheckUtils]: 23: Hoare triple {87824#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {87824#true} is VALID [2022-04-15 11:53:32,414 INFO L290 TraceCheckUtils]: 24: Hoare triple {87824#true} assume 8464 == #t~mem55;havoc #t~mem55; {87824#true} is VALID [2022-04-15 11:53:32,415 INFO L290 TraceCheckUtils]: 25: Hoare triple {87824#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; {87824#true} is VALID [2022-04-15 11:53:32,415 INFO L290 TraceCheckUtils]: 26: Hoare triple {87824#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {87824#true} is VALID [2022-04-15 11:53:32,415 INFO L290 TraceCheckUtils]: 27: Hoare triple {87824#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); {87824#true} is VALID [2022-04-15 11:53:32,415 INFO L290 TraceCheckUtils]: 28: Hoare triple {87824#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); {87824#true} is VALID [2022-04-15 11:53:32,415 INFO L290 TraceCheckUtils]: 29: Hoare triple {87824#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {87824#true} is VALID [2022-04-15 11:53:32,415 INFO L290 TraceCheckUtils]: 30: Hoare triple {87824#true} ~skip~0 := 0; {87824#true} is VALID [2022-04-15 11:53:32,415 INFO L290 TraceCheckUtils]: 31: Hoare triple {87824#true} assume !false; {87824#true} is VALID [2022-04-15 11:53:32,415 INFO L290 TraceCheckUtils]: 32: Hoare triple {87824#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); {87824#true} is VALID [2022-04-15 11:53:32,415 INFO L290 TraceCheckUtils]: 33: Hoare triple {87824#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {87824#true} is VALID [2022-04-15 11:53:32,415 INFO L290 TraceCheckUtils]: 34: Hoare triple {87824#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {87824#true} is VALID [2022-04-15 11:53:32,415 INFO L290 TraceCheckUtils]: 35: Hoare triple {87824#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {87824#true} is VALID [2022-04-15 11:53:32,415 INFO L290 TraceCheckUtils]: 36: Hoare triple {87824#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {87824#true} is VALID [2022-04-15 11:53:32,415 INFO L290 TraceCheckUtils]: 37: Hoare triple {87824#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {87824#true} is VALID [2022-04-15 11:53:32,415 INFO L290 TraceCheckUtils]: 38: Hoare triple {87824#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {87824#true} is VALID [2022-04-15 11:53:32,415 INFO L290 TraceCheckUtils]: 39: Hoare triple {87824#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {87824#true} is VALID [2022-04-15 11:53:32,416 INFO L290 TraceCheckUtils]: 40: Hoare triple {87824#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {87824#true} is VALID [2022-04-15 11:53:32,416 INFO L290 TraceCheckUtils]: 41: Hoare triple {87824#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {87824#true} is VALID [2022-04-15 11:53:32,416 INFO L290 TraceCheckUtils]: 42: Hoare triple {87824#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {87824#true} is VALID [2022-04-15 11:53:32,416 INFO L290 TraceCheckUtils]: 43: Hoare triple {87824#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {87824#true} is VALID [2022-04-15 11:53:32,416 INFO L290 TraceCheckUtils]: 44: Hoare triple {87824#true} assume 8496 == #t~mem58;havoc #t~mem58; {87824#true} is VALID [2022-04-15 11:53:32,416 INFO L290 TraceCheckUtils]: 45: Hoare triple {87824#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {87824#true} is VALID [2022-04-15 11:53:32,416 INFO L290 TraceCheckUtils]: 46: Hoare triple {87824#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {87824#true} is VALID [2022-04-15 11:53:32,416 INFO L290 TraceCheckUtils]: 47: Hoare triple {87824#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {87824#true} is VALID [2022-04-15 11:53:32,417 INFO L290 TraceCheckUtils]: 48: Hoare triple {87824#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {87829#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:32,417 INFO L290 TraceCheckUtils]: 49: Hoare triple {87829#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {87829#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:32,418 INFO L290 TraceCheckUtils]: 50: Hoare triple {87829#(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); {87829#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:32,418 INFO L290 TraceCheckUtils]: 51: Hoare triple {87829#(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; {87829#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:32,419 INFO L290 TraceCheckUtils]: 52: Hoare triple {87829#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {87829#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:32,419 INFO L290 TraceCheckUtils]: 53: Hoare triple {87829#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {87829#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:32,419 INFO L290 TraceCheckUtils]: 54: Hoare triple {87829#(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); {87829#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:32,420 INFO L290 TraceCheckUtils]: 55: Hoare triple {87829#(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); {87829#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:32,420 INFO L290 TraceCheckUtils]: 56: Hoare triple {87829#(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); {87829#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:32,420 INFO L290 TraceCheckUtils]: 57: Hoare triple {87829#(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); {87829#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:32,421 INFO L290 TraceCheckUtils]: 58: Hoare triple {87829#(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); {87829#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:32,421 INFO L290 TraceCheckUtils]: 59: Hoare triple {87829#(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); {87829#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:32,421 INFO L290 TraceCheckUtils]: 60: Hoare triple {87829#(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); {87829#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:32,422 INFO L290 TraceCheckUtils]: 61: Hoare triple {87829#(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); {87829#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:32,422 INFO L290 TraceCheckUtils]: 62: Hoare triple {87829#(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); {87829#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:32,422 INFO L290 TraceCheckUtils]: 63: Hoare triple {87829#(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); {87829#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:32,423 INFO L290 TraceCheckUtils]: 64: Hoare triple {87829#(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); {87829#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:32,423 INFO L290 TraceCheckUtils]: 65: Hoare triple {87829#(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); {87829#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:32,424 INFO L290 TraceCheckUtils]: 66: Hoare triple {87829#(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); {87829#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:32,424 INFO L290 TraceCheckUtils]: 67: Hoare triple {87829#(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); {87829#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:32,424 INFO L290 TraceCheckUtils]: 68: Hoare triple {87829#(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); {87829#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:32,425 INFO L290 TraceCheckUtils]: 69: Hoare triple {87829#(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); {87829#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:32,425 INFO L290 TraceCheckUtils]: 70: Hoare triple {87829#(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); {87829#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:32,425 INFO L290 TraceCheckUtils]: 71: Hoare triple {87829#(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); {87829#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:32,426 INFO L290 TraceCheckUtils]: 72: Hoare triple {87829#(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); {87829#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:32,426 INFO L290 TraceCheckUtils]: 73: Hoare triple {87829#(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); {87829#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:32,426 INFO L290 TraceCheckUtils]: 74: Hoare triple {87829#(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); {87829#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:32,427 INFO L290 TraceCheckUtils]: 75: Hoare triple {87829#(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); {87830#(not (= 8448 |ssl3_accept_#t~mem68|))} is VALID [2022-04-15 11:53:32,427 INFO L290 TraceCheckUtils]: 76: Hoare triple {87830#(not (= 8448 |ssl3_accept_#t~mem68|))} assume 8448 == #t~mem68;havoc #t~mem68; {87825#false} is VALID [2022-04-15 11:53:32,427 INFO L290 TraceCheckUtils]: 77: Hoare triple {87825#false} assume !(~num1~0 > 0); {87825#false} is VALID [2022-04-15 11:53:32,427 INFO L290 TraceCheckUtils]: 78: Hoare triple {87825#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; {87825#false} is VALID [2022-04-15 11:53:32,427 INFO L290 TraceCheckUtils]: 79: Hoare triple {87825#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); {87825#false} is VALID [2022-04-15 11:53:32,427 INFO L290 TraceCheckUtils]: 80: Hoare triple {87825#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {87825#false} is VALID [2022-04-15 11:53:32,427 INFO L290 TraceCheckUtils]: 81: Hoare triple {87825#false} ~skip~0 := 0; {87825#false} is VALID [2022-04-15 11:53:32,427 INFO L290 TraceCheckUtils]: 82: Hoare triple {87825#false} assume !false; {87825#false} is VALID [2022-04-15 11:53:32,427 INFO L290 TraceCheckUtils]: 83: Hoare triple {87825#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); {87825#false} is VALID [2022-04-15 11:53:32,428 INFO L290 TraceCheckUtils]: 84: Hoare triple {87825#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {87825#false} is VALID [2022-04-15 11:53:32,428 INFO L290 TraceCheckUtils]: 85: Hoare triple {87825#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {87825#false} is VALID [2022-04-15 11:53:32,428 INFO L290 TraceCheckUtils]: 86: Hoare triple {87825#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {87825#false} is VALID [2022-04-15 11:53:32,428 INFO L290 TraceCheckUtils]: 87: Hoare triple {87825#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {87825#false} is VALID [2022-04-15 11:53:32,428 INFO L290 TraceCheckUtils]: 88: Hoare triple {87825#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {87825#false} is VALID [2022-04-15 11:53:32,428 INFO L290 TraceCheckUtils]: 89: Hoare triple {87825#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {87825#false} is VALID [2022-04-15 11:53:32,428 INFO L290 TraceCheckUtils]: 90: Hoare triple {87825#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {87825#false} is VALID [2022-04-15 11:53:32,428 INFO L290 TraceCheckUtils]: 91: Hoare triple {87825#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {87825#false} is VALID [2022-04-15 11:53:32,428 INFO L290 TraceCheckUtils]: 92: Hoare triple {87825#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {87825#false} is VALID [2022-04-15 11:53:32,428 INFO L290 TraceCheckUtils]: 93: Hoare triple {87825#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {87825#false} is VALID [2022-04-15 11:53:32,428 INFO L290 TraceCheckUtils]: 94: Hoare triple {87825#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {87825#false} is VALID [2022-04-15 11:53:32,428 INFO L290 TraceCheckUtils]: 95: Hoare triple {87825#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {87825#false} is VALID [2022-04-15 11:53:32,428 INFO L290 TraceCheckUtils]: 96: Hoare triple {87825#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {87825#false} is VALID [2022-04-15 11:53:32,428 INFO L290 TraceCheckUtils]: 97: Hoare triple {87825#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {87825#false} is VALID [2022-04-15 11:53:32,428 INFO L290 TraceCheckUtils]: 98: Hoare triple {87825#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {87825#false} is VALID [2022-04-15 11:53:32,429 INFO L290 TraceCheckUtils]: 99: Hoare triple {87825#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {87825#false} is VALID [2022-04-15 11:53:32,429 INFO L290 TraceCheckUtils]: 100: Hoare triple {87825#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {87825#false} is VALID [2022-04-15 11:53:32,429 INFO L290 TraceCheckUtils]: 101: Hoare triple {87825#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {87825#false} is VALID [2022-04-15 11:53:32,429 INFO L290 TraceCheckUtils]: 102: Hoare triple {87825#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {87825#false} is VALID [2022-04-15 11:53:32,429 INFO L290 TraceCheckUtils]: 103: Hoare triple {87825#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {87825#false} is VALID [2022-04-15 11:53:32,429 INFO L290 TraceCheckUtils]: 104: Hoare triple {87825#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {87825#false} is VALID [2022-04-15 11:53:32,429 INFO L290 TraceCheckUtils]: 105: Hoare triple {87825#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {87825#false} is VALID [2022-04-15 11:53:32,429 INFO L290 TraceCheckUtils]: 106: Hoare triple {87825#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {87825#false} is VALID [2022-04-15 11:53:32,429 INFO L290 TraceCheckUtils]: 107: Hoare triple {87825#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {87825#false} is VALID [2022-04-15 11:53:32,429 INFO L290 TraceCheckUtils]: 108: Hoare triple {87825#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {87825#false} is VALID [2022-04-15 11:53:32,429 INFO L290 TraceCheckUtils]: 109: Hoare triple {87825#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {87825#false} is VALID [2022-04-15 11:53:32,429 INFO L290 TraceCheckUtils]: 110: Hoare triple {87825#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {87825#false} is VALID [2022-04-15 11:53:32,429 INFO L290 TraceCheckUtils]: 111: Hoare triple {87825#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {87825#false} is VALID [2022-04-15 11:53:32,429 INFO L290 TraceCheckUtils]: 112: Hoare triple {87825#false} assume 8640 == #t~mem75;havoc #t~mem75; {87825#false} is VALID [2022-04-15 11:53:32,429 INFO L290 TraceCheckUtils]: 113: Hoare triple {87825#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {87825#false} is VALID [2022-04-15 11:53:32,430 INFO L290 TraceCheckUtils]: 114: Hoare triple {87825#false} assume !(4 == ~blastFlag~0); {87825#false} is VALID [2022-04-15 11:53:32,430 INFO L290 TraceCheckUtils]: 115: Hoare triple {87825#false} assume !(7 == ~blastFlag~0); {87825#false} is VALID [2022-04-15 11:53:32,430 INFO L290 TraceCheckUtils]: 116: Hoare triple {87825#false} assume !(10 == ~blastFlag~0); {87825#false} is VALID [2022-04-15 11:53:32,430 INFO L290 TraceCheckUtils]: 117: Hoare triple {87825#false} assume 13 == ~blastFlag~0; {87825#false} is VALID [2022-04-15 11:53:32,430 INFO L290 TraceCheckUtils]: 118: Hoare triple {87825#false} assume !false; {87825#false} is VALID [2022-04-15 11:53:32,430 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-15 11:53:32,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:53:32,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602454771] [2022-04-15 11:53:32,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602454771] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:53:32,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:53:32,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:53:32,431 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:53:32,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [228655090] [2022-04-15 11:53:32,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [228655090] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:53:32,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:53:32,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:53:32,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492967833] [2022-04-15 11:53:32,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:53:32,431 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 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 119 [2022-04-15 11:53:32,432 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:53:32,432 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:53:32,504 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:53:32,504 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:53:32,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:53:32,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:53:32,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:53:32,505 INFO L87 Difference]: Start difference. First operand 823 states and 1281 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:53:34,854 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:53:41,085 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-15 11:53:48,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:53:48,570 INFO L93 Difference]: Finished difference Result 2067 states and 3221 transitions. [2022-04-15 11:53:48,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:53:48,570 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 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 119 [2022-04-15 11:53:48,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:53:48,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:53:48,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 604 transitions. [2022-04-15 11:53:48,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:53:48,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 604 transitions. [2022-04-15 11:53:48,575 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 604 transitions. [2022-04-15 11:53:48,996 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 604 edges. 604 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:53:49,053 INFO L225 Difference]: With dead ends: 2067 [2022-04-15 11:53:49,053 INFO L226 Difference]: Without dead ends: 1270 [2022-04-15 11:53:49,054 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-15 11:53:49,055 INFO L913 BasicCegarLoop]: 282 mSDtfsCounter, 127 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 36 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:53:49,055 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 678 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 632 Invalid, 1 Unknown, 0 Unchecked, 7.3s Time] [2022-04-15 11:53:49,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2022-04-15 11:53:49,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 913. [2022-04-15 11:53:49,109 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:53:49,110 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1270 states. Second operand has 913 states, 908 states have (on average 1.5748898678414096) internal successors, (1430), 908 states have internal predecessors, (1430), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:53:49,111 INFO L74 IsIncluded]: Start isIncluded. First operand 1270 states. Second operand has 913 states, 908 states have (on average 1.5748898678414096) internal successors, (1430), 908 states have internal predecessors, (1430), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:53:49,111 INFO L87 Difference]: Start difference. First operand 1270 states. Second operand has 913 states, 908 states have (on average 1.5748898678414096) internal successors, (1430), 908 states have internal predecessors, (1430), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:53:49,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:53:49,153 INFO L93 Difference]: Finished difference Result 1270 states and 1966 transitions. [2022-04-15 11:53:49,153 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1966 transitions. [2022-04-15 11:53:49,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:53:49,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:53:49,154 INFO L74 IsIncluded]: Start isIncluded. First operand has 913 states, 908 states have (on average 1.5748898678414096) internal successors, (1430), 908 states have internal predecessors, (1430), 3 states have call successors, (3), 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 1270 states. [2022-04-15 11:53:49,155 INFO L87 Difference]: Start difference. First operand has 913 states, 908 states have (on average 1.5748898678414096) internal successors, (1430), 908 states have internal predecessors, (1430), 3 states have call successors, (3), 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 1270 states. [2022-04-15 11:53:49,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:53:49,212 INFO L93 Difference]: Finished difference Result 1270 states and 1966 transitions. [2022-04-15 11:53:49,212 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1966 transitions. [2022-04-15 11:53:49,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:53:49,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:53:49,213 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:53:49,213 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:53:49,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 913 states, 908 states have (on average 1.5748898678414096) internal successors, (1430), 908 states have internal predecessors, (1430), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:53:49,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1434 transitions. [2022-04-15 11:53:49,261 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1434 transitions. Word has length 119 [2022-04-15 11:53:49,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:53:49,261 INFO L478 AbstractCegarLoop]: Abstraction has 913 states and 1434 transitions. [2022-04-15 11:53:49,262 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:53:49,262 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 913 states and 1434 transitions. [2022-04-15 11:53:52,949 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1434 edges. 1433 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:53:52,950 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1434 transitions. [2022-04-15 11:53:52,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-04-15 11:53:52,951 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:53:52,951 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, 1, 1] [2022-04-15 11:53:52,951 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-15 11:53:52,951 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:53:52,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:53:52,952 INFO L85 PathProgramCache]: Analyzing trace with hash -72062084, now seen corresponding path program 1 times [2022-04-15 11:53:52,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:53:52,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1241041391] [2022-04-15 11:53:53,032 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:53:53,032 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:53:53,032 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:53:53,033 INFO L85 PathProgramCache]: Analyzing trace with hash -72062084, now seen corresponding path program 2 times [2022-04-15 11:53:53,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:53:53,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367548661] [2022-04-15 11:53:53,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:53:53,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:53:53,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:53:53,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:53:53,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:53:53,285 INFO L290 TraceCheckUtils]: 0: Hoare triple {96343#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {96336#true} is VALID [2022-04-15 11:53:53,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {96336#true} assume true; {96336#true} is VALID [2022-04-15 11:53:53,285 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {96336#true} {96336#true} #708#return; {96336#true} is VALID [2022-04-15 11:53:53,286 INFO L272 TraceCheckUtils]: 0: Hoare triple {96336#true} call ULTIMATE.init(); {96343#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:53:53,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {96343#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {96336#true} is VALID [2022-04-15 11:53:53,287 INFO L290 TraceCheckUtils]: 2: Hoare triple {96336#true} assume true; {96336#true} is VALID [2022-04-15 11:53:53,287 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {96336#true} {96336#true} #708#return; {96336#true} is VALID [2022-04-15 11:53:53,287 INFO L272 TraceCheckUtils]: 4: Hoare triple {96336#true} call #t~ret161 := main(); {96336#true} is VALID [2022-04-15 11:53:53,287 INFO L290 TraceCheckUtils]: 5: Hoare triple {96336#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; {96336#true} is VALID [2022-04-15 11:53:53,287 INFO L290 TraceCheckUtils]: 6: Hoare triple {96336#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {96336#true} is VALID [2022-04-15 11:53:53,287 INFO L272 TraceCheckUtils]: 7: Hoare triple {96336#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {96336#true} is VALID [2022-04-15 11:53:53,287 INFO L290 TraceCheckUtils]: 8: Hoare triple {96336#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); {96336#true} is VALID [2022-04-15 11:53:53,287 INFO L290 TraceCheckUtils]: 9: Hoare triple {96336#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; {96336#true} is VALID [2022-04-15 11:53:53,287 INFO L290 TraceCheckUtils]: 10: Hoare triple {96336#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; {96336#true} is VALID [2022-04-15 11:53:53,287 INFO L290 TraceCheckUtils]: 11: Hoare triple {96336#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {96336#true} is VALID [2022-04-15 11:53:53,287 INFO L290 TraceCheckUtils]: 12: Hoare triple {96336#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {96336#true} is VALID [2022-04-15 11:53:53,288 INFO L290 TraceCheckUtils]: 13: Hoare triple {96336#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {96336#true} is VALID [2022-04-15 11:53:53,288 INFO L290 TraceCheckUtils]: 14: Hoare triple {96336#true} assume !false; {96336#true} is VALID [2022-04-15 11:53:53,288 INFO L290 TraceCheckUtils]: 15: Hoare triple {96336#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); {96336#true} is VALID [2022-04-15 11:53:53,288 INFO L290 TraceCheckUtils]: 16: Hoare triple {96336#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {96336#true} is VALID [2022-04-15 11:53:53,288 INFO L290 TraceCheckUtils]: 17: Hoare triple {96336#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {96336#true} is VALID [2022-04-15 11:53:53,288 INFO L290 TraceCheckUtils]: 18: Hoare triple {96336#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {96336#true} is VALID [2022-04-15 11:53:53,288 INFO L290 TraceCheckUtils]: 19: Hoare triple {96336#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {96336#true} is VALID [2022-04-15 11:53:53,288 INFO L290 TraceCheckUtils]: 20: Hoare triple {96336#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {96336#true} is VALID [2022-04-15 11:53:53,288 INFO L290 TraceCheckUtils]: 21: Hoare triple {96336#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {96336#true} is VALID [2022-04-15 11:53:53,288 INFO L290 TraceCheckUtils]: 22: Hoare triple {96336#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {96336#true} is VALID [2022-04-15 11:53:53,289 INFO L290 TraceCheckUtils]: 23: Hoare triple {96336#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {96336#true} is VALID [2022-04-15 11:53:53,289 INFO L290 TraceCheckUtils]: 24: Hoare triple {96336#true} assume 8464 == #t~mem55;havoc #t~mem55; {96336#true} is VALID [2022-04-15 11:53:53,289 INFO L290 TraceCheckUtils]: 25: Hoare triple {96336#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; {96336#true} is VALID [2022-04-15 11:53:53,289 INFO L290 TraceCheckUtils]: 26: Hoare triple {96336#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {96336#true} is VALID [2022-04-15 11:53:53,290 INFO L290 TraceCheckUtils]: 27: Hoare triple {96336#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); {96341#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:53,291 INFO L290 TraceCheckUtils]: 28: Hoare triple {96341#(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); {96341#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:53,291 INFO L290 TraceCheckUtils]: 29: Hoare triple {96341#(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; {96341#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:53,292 INFO L290 TraceCheckUtils]: 30: Hoare triple {96341#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {96341#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:53,292 INFO L290 TraceCheckUtils]: 31: Hoare triple {96341#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {96341#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:53,292 INFO L290 TraceCheckUtils]: 32: Hoare triple {96341#(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); {96342#(not (= 12292 |ssl3_accept_#t~mem47|))} is VALID [2022-04-15 11:53:53,293 INFO L290 TraceCheckUtils]: 33: Hoare triple {96342#(not (= 12292 |ssl3_accept_#t~mem47|))} assume 12292 == #t~mem47;havoc #t~mem47; {96337#false} is VALID [2022-04-15 11:53:53,293 INFO L290 TraceCheckUtils]: 34: Hoare triple {96337#false} call write~int(1, ~s.base, 40 + ~s.offset, 4); {96337#false} is VALID [2022-04-15 11:53:53,293 INFO L290 TraceCheckUtils]: 35: Hoare triple {96337#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {96337#false} is VALID [2022-04-15 11:53:53,293 INFO L290 TraceCheckUtils]: 36: Hoare triple {96337#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {96337#false} is VALID [2022-04-15 11:53:53,293 INFO L290 TraceCheckUtils]: 37: Hoare triple {96337#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {96337#false} is VALID [2022-04-15 11:53:53,293 INFO L290 TraceCheckUtils]: 38: Hoare triple {96337#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); {96337#false} is VALID [2022-04-15 11:53:53,293 INFO L290 TraceCheckUtils]: 39: Hoare triple {96337#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {96337#false} is VALID [2022-04-15 11:53:53,293 INFO L290 TraceCheckUtils]: 40: Hoare triple {96337#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); {96337#false} is VALID [2022-04-15 11:53:53,294 INFO L290 TraceCheckUtils]: 41: Hoare triple {96337#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); {96337#false} is VALID [2022-04-15 11:53:53,294 INFO L290 TraceCheckUtils]: 42: Hoare triple {96337#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); {96337#false} is VALID [2022-04-15 11:53:53,294 INFO L290 TraceCheckUtils]: 43: Hoare triple {96337#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {96337#false} is VALID [2022-04-15 11:53:53,294 INFO L290 TraceCheckUtils]: 44: Hoare triple {96337#false} ~skip~0 := 0; {96337#false} is VALID [2022-04-15 11:53:53,294 INFO L290 TraceCheckUtils]: 45: Hoare triple {96337#false} assume !false; {96337#false} is VALID [2022-04-15 11:53:53,294 INFO L290 TraceCheckUtils]: 46: Hoare triple {96337#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); {96337#false} is VALID [2022-04-15 11:53:53,294 INFO L290 TraceCheckUtils]: 47: Hoare triple {96337#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-15 11:53:53,294 INFO L290 TraceCheckUtils]: 48: Hoare triple {96337#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-15 11:53:53,294 INFO L290 TraceCheckUtils]: 49: Hoare triple {96337#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-15 11:53:53,294 INFO L290 TraceCheckUtils]: 50: Hoare triple {96337#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-15 11:53:53,294 INFO L290 TraceCheckUtils]: 51: Hoare triple {96337#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-15 11:53:53,295 INFO L290 TraceCheckUtils]: 52: Hoare triple {96337#false} assume 8480 == #t~mem52;havoc #t~mem52; {96337#false} is VALID [2022-04-15 11:53:53,295 INFO L290 TraceCheckUtils]: 53: Hoare triple {96337#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; {96337#false} is VALID [2022-04-15 11:53:53,295 INFO L290 TraceCheckUtils]: 54: Hoare triple {96337#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); {96337#false} is VALID [2022-04-15 11:53:53,295 INFO L290 TraceCheckUtils]: 55: Hoare triple {96337#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); {96337#false} is VALID [2022-04-15 11:53:53,295 INFO L290 TraceCheckUtils]: 56: Hoare triple {96337#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {96337#false} is VALID [2022-04-15 11:53:53,295 INFO L290 TraceCheckUtils]: 57: Hoare triple {96337#false} ~skip~0 := 0; {96337#false} is VALID [2022-04-15 11:53:53,295 INFO L290 TraceCheckUtils]: 58: Hoare triple {96337#false} assume !false; {96337#false} is VALID [2022-04-15 11:53:53,295 INFO L290 TraceCheckUtils]: 59: Hoare triple {96337#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); {96337#false} is VALID [2022-04-15 11:53:53,295 INFO L290 TraceCheckUtils]: 60: Hoare triple {96337#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-15 11:53:53,295 INFO L290 TraceCheckUtils]: 61: Hoare triple {96337#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-15 11:53:53,295 INFO L290 TraceCheckUtils]: 62: Hoare triple {96337#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-15 11:53:53,296 INFO L290 TraceCheckUtils]: 63: Hoare triple {96337#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-15 11:53:53,296 INFO L290 TraceCheckUtils]: 64: Hoare triple {96337#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-15 11:53:53,296 INFO L290 TraceCheckUtils]: 65: Hoare triple {96337#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-15 11:53:53,296 INFO L290 TraceCheckUtils]: 66: Hoare triple {96337#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-15 11:53:53,296 INFO L290 TraceCheckUtils]: 67: Hoare triple {96337#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-15 11:53:53,296 INFO L290 TraceCheckUtils]: 68: Hoare triple {96337#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-15 11:53:53,296 INFO L290 TraceCheckUtils]: 69: Hoare triple {96337#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-15 11:53:53,296 INFO L290 TraceCheckUtils]: 70: Hoare triple {96337#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-15 11:53:53,296 INFO L290 TraceCheckUtils]: 71: Hoare triple {96337#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-15 11:53:53,296 INFO L290 TraceCheckUtils]: 72: Hoare triple {96337#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-15 11:53:53,297 INFO L290 TraceCheckUtils]: 73: Hoare triple {96337#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-15 11:53:53,297 INFO L290 TraceCheckUtils]: 74: Hoare triple {96337#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-15 11:53:53,297 INFO L290 TraceCheckUtils]: 75: Hoare triple {96337#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-15 11:53:53,297 INFO L290 TraceCheckUtils]: 76: Hoare triple {96337#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-15 11:53:53,297 INFO L290 TraceCheckUtils]: 77: Hoare triple {96337#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-15 11:53:53,297 INFO L290 TraceCheckUtils]: 78: Hoare triple {96337#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-15 11:53:53,297 INFO L290 TraceCheckUtils]: 79: Hoare triple {96337#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-15 11:53:53,297 INFO L290 TraceCheckUtils]: 80: Hoare triple {96337#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-15 11:53:53,297 INFO L290 TraceCheckUtils]: 81: Hoare triple {96337#false} assume 8448 == #t~mem68;havoc #t~mem68; {96337#false} is VALID [2022-04-15 11:53:53,297 INFO L290 TraceCheckUtils]: 82: Hoare triple {96337#false} assume !(~num1~0 > 0); {96337#false} is VALID [2022-04-15 11:53:53,297 INFO L290 TraceCheckUtils]: 83: Hoare triple {96337#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; {96337#false} is VALID [2022-04-15 11:53:53,298 INFO L290 TraceCheckUtils]: 84: Hoare triple {96337#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); {96337#false} is VALID [2022-04-15 11:53:53,298 INFO L290 TraceCheckUtils]: 85: Hoare triple {96337#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {96337#false} is VALID [2022-04-15 11:53:53,298 INFO L290 TraceCheckUtils]: 86: Hoare triple {96337#false} ~skip~0 := 0; {96337#false} is VALID [2022-04-15 11:53:53,298 INFO L290 TraceCheckUtils]: 87: Hoare triple {96337#false} assume !false; {96337#false} is VALID [2022-04-15 11:53:53,298 INFO L290 TraceCheckUtils]: 88: Hoare triple {96337#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); {96337#false} is VALID [2022-04-15 11:53:53,298 INFO L290 TraceCheckUtils]: 89: Hoare triple {96337#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-15 11:53:53,298 INFO L290 TraceCheckUtils]: 90: Hoare triple {96337#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-15 11:53:53,298 INFO L290 TraceCheckUtils]: 91: Hoare triple {96337#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-15 11:53:53,298 INFO L290 TraceCheckUtils]: 92: Hoare triple {96337#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-15 11:53:53,298 INFO L290 TraceCheckUtils]: 93: Hoare triple {96337#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-15 11:53:53,299 INFO L290 TraceCheckUtils]: 94: Hoare triple {96337#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-15 11:53:53,299 INFO L290 TraceCheckUtils]: 95: Hoare triple {96337#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-15 11:53:53,299 INFO L290 TraceCheckUtils]: 96: Hoare triple {96337#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-15 11:53:53,299 INFO L290 TraceCheckUtils]: 97: Hoare triple {96337#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-15 11:53:53,299 INFO L290 TraceCheckUtils]: 98: Hoare triple {96337#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-15 11:53:53,299 INFO L290 TraceCheckUtils]: 99: Hoare triple {96337#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-15 11:53:53,299 INFO L290 TraceCheckUtils]: 100: Hoare triple {96337#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-15 11:53:53,299 INFO L290 TraceCheckUtils]: 101: Hoare triple {96337#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-15 11:53:53,299 INFO L290 TraceCheckUtils]: 102: Hoare triple {96337#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-15 11:53:53,300 INFO L290 TraceCheckUtils]: 103: Hoare triple {96337#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-15 11:53:53,300 INFO L290 TraceCheckUtils]: 104: Hoare triple {96337#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-15 11:53:53,300 INFO L290 TraceCheckUtils]: 105: Hoare triple {96337#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-15 11:53:53,300 INFO L290 TraceCheckUtils]: 106: Hoare triple {96337#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-15 11:53:53,300 INFO L290 TraceCheckUtils]: 107: Hoare triple {96337#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-15 11:53:53,300 INFO L290 TraceCheckUtils]: 108: Hoare triple {96337#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-15 11:53:53,300 INFO L290 TraceCheckUtils]: 109: Hoare triple {96337#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-15 11:53:53,300 INFO L290 TraceCheckUtils]: 110: Hoare triple {96337#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-15 11:53:53,300 INFO L290 TraceCheckUtils]: 111: Hoare triple {96337#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-15 11:53:53,300 INFO L290 TraceCheckUtils]: 112: Hoare triple {96337#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-15 11:53:53,300 INFO L290 TraceCheckUtils]: 113: Hoare triple {96337#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-15 11:53:53,301 INFO L290 TraceCheckUtils]: 114: Hoare triple {96337#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-15 11:53:53,301 INFO L290 TraceCheckUtils]: 115: Hoare triple {96337#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-15 11:53:53,301 INFO L290 TraceCheckUtils]: 116: Hoare triple {96337#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-15 11:53:53,301 INFO L290 TraceCheckUtils]: 117: Hoare triple {96337#false} assume 8640 == #t~mem75;havoc #t~mem75; {96337#false} is VALID [2022-04-15 11:53:53,301 INFO L290 TraceCheckUtils]: 118: Hoare triple {96337#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {96337#false} is VALID [2022-04-15 11:53:53,301 INFO L290 TraceCheckUtils]: 119: Hoare triple {96337#false} assume !(4 == ~blastFlag~0); {96337#false} is VALID [2022-04-15 11:53:53,301 INFO L290 TraceCheckUtils]: 120: Hoare triple {96337#false} assume !(7 == ~blastFlag~0); {96337#false} is VALID [2022-04-15 11:53:53,301 INFO L290 TraceCheckUtils]: 121: Hoare triple {96337#false} assume !(10 == ~blastFlag~0); {96337#false} is VALID [2022-04-15 11:53:53,301 INFO L290 TraceCheckUtils]: 122: Hoare triple {96337#false} assume 13 == ~blastFlag~0; {96337#false} is VALID [2022-04-15 11:53:53,301 INFO L290 TraceCheckUtils]: 123: Hoare triple {96337#false} assume !false; {96337#false} is VALID [2022-04-15 11:53:53,302 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-15 11:53:53,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:53:53,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367548661] [2022-04-15 11:53:53,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367548661] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:53:53,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:53:53,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:53:53,302 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:53:53,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1241041391] [2022-04-15 11:53:53,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1241041391] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:53:53,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:53:53,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:53:53,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916041763] [2022-04-15 11:53:53,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:53:53,303 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 124 [2022-04-15 11:53:53,304 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:53:53,304 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:53:53,380 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:53:53,380 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:53:53,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:53:53,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:53:53,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:53:53,381 INFO L87 Difference]: Start difference. First operand 913 states and 1434 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:54:07,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:54:07,908 INFO L93 Difference]: Finished difference Result 1738 states and 2689 transitions. [2022-04-15 11:54:07,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:54:07,908 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 124 [2022-04-15 11:54:07,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:54:07,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:54:07,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 596 transitions. [2022-04-15 11:54:07,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:54:07,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 596 transitions. [2022-04-15 11:54:07,912 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 596 transitions. [2022-04-15 11:54:08,325 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 596 edges. 596 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:54:08,370 INFO L225 Difference]: With dead ends: 1738 [2022-04-15 11:54:08,370 INFO L226 Difference]: Without dead ends: 1112 [2022-04-15 11:54:08,371 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:54:08,371 INFO L913 BasicCegarLoop]: 143 mSDtfsCounter, 143 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:54:08,372 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 402 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-04-15 11:54:08,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1112 states. [2022-04-15 11:54:08,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1112 to 913. [2022-04-15 11:54:08,422 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:54:08,423 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1112 states. Second operand has 913 states, 908 states have (on average 1.5583700440528634) internal successors, (1415), 908 states have internal predecessors, (1415), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:54:08,424 INFO L74 IsIncluded]: Start isIncluded. First operand 1112 states. Second operand has 913 states, 908 states have (on average 1.5583700440528634) internal successors, (1415), 908 states have internal predecessors, (1415), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:54:08,424 INFO L87 Difference]: Start difference. First operand 1112 states. Second operand has 913 states, 908 states have (on average 1.5583700440528634) internal successors, (1415), 908 states have internal predecessors, (1415), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:54:08,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:54:08,475 INFO L93 Difference]: Finished difference Result 1112 states and 1690 transitions. [2022-04-15 11:54:08,475 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 1690 transitions. [2022-04-15 11:54:08,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:54:08,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:54:08,477 INFO L74 IsIncluded]: Start isIncluded. First operand has 913 states, 908 states have (on average 1.5583700440528634) internal successors, (1415), 908 states have internal predecessors, (1415), 3 states have call successors, (3), 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 1112 states. [2022-04-15 11:54:08,478 INFO L87 Difference]: Start difference. First operand has 913 states, 908 states have (on average 1.5583700440528634) internal successors, (1415), 908 states have internal predecessors, (1415), 3 states have call successors, (3), 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 1112 states. [2022-04-15 11:54:08,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:54:08,511 INFO L93 Difference]: Finished difference Result 1112 states and 1690 transitions. [2022-04-15 11:54:08,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 1690 transitions. [2022-04-15 11:54:08,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:54:08,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:54:08,512 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:54:08,512 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:54:08,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 913 states, 908 states have (on average 1.5583700440528634) internal successors, (1415), 908 states have internal predecessors, (1415), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:54:08,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1419 transitions. [2022-04-15 11:54:08,560 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1419 transitions. Word has length 124 [2022-04-15 11:54:08,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:54:08,560 INFO L478 AbstractCegarLoop]: Abstraction has 913 states and 1419 transitions. [2022-04-15 11:54:08,560 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:54:08,560 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 913 states and 1419 transitions. [2022-04-15 11:54:12,312 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1419 edges. 1418 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:54:12,313 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1419 transitions. [2022-04-15 11:54:12,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-04-15 11:54:12,314 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:54:12,314 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, 1, 1] [2022-04-15 11:54:12,314 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-15 11:54:12,314 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:54:12,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:54:12,314 INFO L85 PathProgramCache]: Analyzing trace with hash -933759754, now seen corresponding path program 1 times [2022-04-15 11:54:12,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:54:12,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1867843063] [2022-04-15 11:54:12,374 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:54:12,374 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:54:12,374 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:54:12,374 INFO L85 PathProgramCache]: Analyzing trace with hash -933759754, now seen corresponding path program 2 times [2022-04-15 11:54:12,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:54:12,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490626187] [2022-04-15 11:54:12,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:54:12,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:54:12,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:54:12,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:54:12,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:54:12,632 INFO L290 TraceCheckUtils]: 0: Hoare triple {103881#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {103874#true} is VALID [2022-04-15 11:54:12,632 INFO L290 TraceCheckUtils]: 1: Hoare triple {103874#true} assume true; {103874#true} is VALID [2022-04-15 11:54:12,633 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {103874#true} {103874#true} #708#return; {103874#true} is VALID [2022-04-15 11:54:12,633 INFO L272 TraceCheckUtils]: 0: Hoare triple {103874#true} call ULTIMATE.init(); {103881#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:54:12,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {103881#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {103874#true} is VALID [2022-04-15 11:54:12,634 INFO L290 TraceCheckUtils]: 2: Hoare triple {103874#true} assume true; {103874#true} is VALID [2022-04-15 11:54:12,634 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {103874#true} {103874#true} #708#return; {103874#true} is VALID [2022-04-15 11:54:12,634 INFO L272 TraceCheckUtils]: 4: Hoare triple {103874#true} call #t~ret161 := main(); {103874#true} is VALID [2022-04-15 11:54:12,634 INFO L290 TraceCheckUtils]: 5: Hoare triple {103874#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; {103874#true} is VALID [2022-04-15 11:54:12,634 INFO L290 TraceCheckUtils]: 6: Hoare triple {103874#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {103874#true} is VALID [2022-04-15 11:54:12,634 INFO L272 TraceCheckUtils]: 7: Hoare triple {103874#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {103874#true} is VALID [2022-04-15 11:54:12,634 INFO L290 TraceCheckUtils]: 8: Hoare triple {103874#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); {103874#true} is VALID [2022-04-15 11:54:12,634 INFO L290 TraceCheckUtils]: 9: Hoare triple {103874#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; {103874#true} is VALID [2022-04-15 11:54:12,634 INFO L290 TraceCheckUtils]: 10: Hoare triple {103874#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; {103874#true} is VALID [2022-04-15 11:54:12,634 INFO L290 TraceCheckUtils]: 11: Hoare triple {103874#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {103874#true} is VALID [2022-04-15 11:54:12,635 INFO L290 TraceCheckUtils]: 12: Hoare triple {103874#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {103874#true} is VALID [2022-04-15 11:54:12,635 INFO L290 TraceCheckUtils]: 13: Hoare triple {103874#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {103874#true} is VALID [2022-04-15 11:54:12,635 INFO L290 TraceCheckUtils]: 14: Hoare triple {103874#true} assume !false; {103874#true} is VALID [2022-04-15 11:54:12,635 INFO L290 TraceCheckUtils]: 15: Hoare triple {103874#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); {103874#true} is VALID [2022-04-15 11:54:12,635 INFO L290 TraceCheckUtils]: 16: Hoare triple {103874#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {103874#true} is VALID [2022-04-15 11:54:12,635 INFO L290 TraceCheckUtils]: 17: Hoare triple {103874#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {103874#true} is VALID [2022-04-15 11:54:12,635 INFO L290 TraceCheckUtils]: 18: Hoare triple {103874#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {103874#true} is VALID [2022-04-15 11:54:12,635 INFO L290 TraceCheckUtils]: 19: Hoare triple {103874#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {103874#true} is VALID [2022-04-15 11:54:12,635 INFO L290 TraceCheckUtils]: 20: Hoare triple {103874#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {103874#true} is VALID [2022-04-15 11:54:12,635 INFO L290 TraceCheckUtils]: 21: Hoare triple {103874#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {103874#true} is VALID [2022-04-15 11:54:12,635 INFO L290 TraceCheckUtils]: 22: Hoare triple {103874#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {103874#true} is VALID [2022-04-15 11:54:12,635 INFO L290 TraceCheckUtils]: 23: Hoare triple {103874#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {103874#true} is VALID [2022-04-15 11:54:12,636 INFO L290 TraceCheckUtils]: 24: Hoare triple {103874#true} assume 8464 == #t~mem55;havoc #t~mem55; {103874#true} is VALID [2022-04-15 11:54:12,636 INFO L290 TraceCheckUtils]: 25: Hoare triple {103874#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; {103874#true} is VALID [2022-04-15 11:54:12,636 INFO L290 TraceCheckUtils]: 26: Hoare triple {103874#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {103874#true} is VALID [2022-04-15 11:54:12,636 INFO L290 TraceCheckUtils]: 27: Hoare triple {103874#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); {103874#true} is VALID [2022-04-15 11:54:12,636 INFO L290 TraceCheckUtils]: 28: Hoare triple {103874#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); {103874#true} is VALID [2022-04-15 11:54:12,636 INFO L290 TraceCheckUtils]: 29: Hoare triple {103874#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {103874#true} is VALID [2022-04-15 11:54:12,636 INFO L290 TraceCheckUtils]: 30: Hoare triple {103874#true} ~skip~0 := 0; {103874#true} is VALID [2022-04-15 11:54:12,636 INFO L290 TraceCheckUtils]: 31: Hoare triple {103874#true} assume !false; {103874#true} is VALID [2022-04-15 11:54:12,636 INFO L290 TraceCheckUtils]: 32: Hoare triple {103874#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); {103874#true} is VALID [2022-04-15 11:54:12,636 INFO L290 TraceCheckUtils]: 33: Hoare triple {103874#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {103874#true} is VALID [2022-04-15 11:54:12,636 INFO L290 TraceCheckUtils]: 34: Hoare triple {103874#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {103874#true} is VALID [2022-04-15 11:54:12,637 INFO L290 TraceCheckUtils]: 35: Hoare triple {103874#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {103874#true} is VALID [2022-04-15 11:54:12,637 INFO L290 TraceCheckUtils]: 36: Hoare triple {103874#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {103874#true} is VALID [2022-04-15 11:54:12,637 INFO L290 TraceCheckUtils]: 37: Hoare triple {103874#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {103874#true} is VALID [2022-04-15 11:54:12,637 INFO L290 TraceCheckUtils]: 38: Hoare triple {103874#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {103874#true} is VALID [2022-04-15 11:54:12,637 INFO L290 TraceCheckUtils]: 39: Hoare triple {103874#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {103874#true} is VALID [2022-04-15 11:54:12,637 INFO L290 TraceCheckUtils]: 40: Hoare triple {103874#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {103874#true} is VALID [2022-04-15 11:54:12,637 INFO L290 TraceCheckUtils]: 41: Hoare triple {103874#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {103874#true} is VALID [2022-04-15 11:54:12,637 INFO L290 TraceCheckUtils]: 42: Hoare triple {103874#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {103874#true} is VALID [2022-04-15 11:54:12,637 INFO L290 TraceCheckUtils]: 43: Hoare triple {103874#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {103874#true} is VALID [2022-04-15 11:54:12,637 INFO L290 TraceCheckUtils]: 44: Hoare triple {103874#true} assume 8496 == #t~mem58;havoc #t~mem58; {103874#true} is VALID [2022-04-15 11:54:12,637 INFO L290 TraceCheckUtils]: 45: Hoare triple {103874#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {103874#true} is VALID [2022-04-15 11:54:12,638 INFO L290 TraceCheckUtils]: 46: Hoare triple {103874#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {103874#true} is VALID [2022-04-15 11:54:12,638 INFO L290 TraceCheckUtils]: 47: Hoare triple {103874#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {103874#true} is VALID [2022-04-15 11:54:12,638 INFO L290 TraceCheckUtils]: 48: Hoare triple {103874#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {103879#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:54:12,640 INFO L290 TraceCheckUtils]: 49: Hoare triple {103879#(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); {103879#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:54:12,640 INFO L290 TraceCheckUtils]: 50: Hoare triple {103879#(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); {103879#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:54:12,640 INFO L290 TraceCheckUtils]: 51: Hoare triple {103879#(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; {103879#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:54:12,641 INFO L290 TraceCheckUtils]: 52: Hoare triple {103879#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {103879#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:54:12,641 INFO L290 TraceCheckUtils]: 53: Hoare triple {103879#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {103879#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:54:12,642 INFO L290 TraceCheckUtils]: 54: Hoare triple {103879#(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); {103879#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:54:12,642 INFO L290 TraceCheckUtils]: 55: Hoare triple {103879#(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); {103879#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:54:12,643 INFO L290 TraceCheckUtils]: 56: Hoare triple {103879#(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); {103879#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:54:12,643 INFO L290 TraceCheckUtils]: 57: Hoare triple {103879#(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); {103879#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:54:12,644 INFO L290 TraceCheckUtils]: 58: Hoare triple {103879#(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); {103879#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:54:12,644 INFO L290 TraceCheckUtils]: 59: Hoare triple {103879#(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); {103879#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:54:12,645 INFO L290 TraceCheckUtils]: 60: Hoare triple {103879#(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); {103879#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:54:12,645 INFO L290 TraceCheckUtils]: 61: Hoare triple {103879#(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); {103879#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:54:12,646 INFO L290 TraceCheckUtils]: 62: Hoare triple {103879#(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); {103879#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:54:12,646 INFO L290 TraceCheckUtils]: 63: Hoare triple {103879#(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); {103879#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:54:12,647 INFO L290 TraceCheckUtils]: 64: Hoare triple {103879#(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); {103879#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:54:12,647 INFO L290 TraceCheckUtils]: 65: Hoare triple {103879#(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); {103879#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:54:12,648 INFO L290 TraceCheckUtils]: 66: Hoare triple {103879#(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); {103879#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:54:12,648 INFO L290 TraceCheckUtils]: 67: Hoare triple {103879#(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); {103879#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:54:12,648 INFO L290 TraceCheckUtils]: 68: Hoare triple {103879#(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); {103879#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:54:12,649 INFO L290 TraceCheckUtils]: 69: Hoare triple {103879#(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); {103879#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:54:12,649 INFO L290 TraceCheckUtils]: 70: Hoare triple {103879#(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); {103879#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:54:12,650 INFO L290 TraceCheckUtils]: 71: Hoare triple {103879#(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); {103879#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:54:12,650 INFO L290 TraceCheckUtils]: 72: Hoare triple {103879#(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); {103879#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:54:12,651 INFO L290 TraceCheckUtils]: 73: Hoare triple {103879#(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); {103879#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:54:12,651 INFO L290 TraceCheckUtils]: 74: Hoare triple {103879#(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); {103879#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:54:12,652 INFO L290 TraceCheckUtils]: 75: Hoare triple {103879#(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); {103879#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:54:12,652 INFO L290 TraceCheckUtils]: 76: Hoare triple {103879#(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); {103879#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:54:12,653 INFO L290 TraceCheckUtils]: 77: Hoare triple {103879#(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); {103879#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:54:12,653 INFO L290 TraceCheckUtils]: 78: Hoare triple {103879#(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); {103879#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:54:12,653 INFO L290 TraceCheckUtils]: 79: Hoare triple {103879#(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); {103879#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:54:12,654 INFO L290 TraceCheckUtils]: 80: Hoare triple {103879#(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); {103880#(not (= |ssl3_accept_#t~mem73| 8608))} is VALID [2022-04-15 11:54:12,654 INFO L290 TraceCheckUtils]: 81: Hoare triple {103880#(not (= |ssl3_accept_#t~mem73| 8608))} assume 8608 == #t~mem73;havoc #t~mem73; {103875#false} is VALID [2022-04-15 11:54:12,654 INFO L290 TraceCheckUtils]: 82: Hoare triple {103875#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {103875#false} is VALID [2022-04-15 11:54:12,654 INFO L290 TraceCheckUtils]: 83: Hoare triple {103875#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); {103875#false} is VALID [2022-04-15 11:54:12,655 INFO L290 TraceCheckUtils]: 84: Hoare triple {103875#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); {103875#false} is VALID [2022-04-15 11:54:12,655 INFO L290 TraceCheckUtils]: 85: Hoare triple {103875#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {103875#false} is VALID [2022-04-15 11:54:12,655 INFO L290 TraceCheckUtils]: 86: Hoare triple {103875#false} ~skip~0 := 0; {103875#false} is VALID [2022-04-15 11:54:12,655 INFO L290 TraceCheckUtils]: 87: Hoare triple {103875#false} assume !false; {103875#false} is VALID [2022-04-15 11:54:12,655 INFO L290 TraceCheckUtils]: 88: Hoare triple {103875#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); {103875#false} is VALID [2022-04-15 11:54:12,655 INFO L290 TraceCheckUtils]: 89: Hoare triple {103875#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {103875#false} is VALID [2022-04-15 11:54:12,655 INFO L290 TraceCheckUtils]: 90: Hoare triple {103875#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {103875#false} is VALID [2022-04-15 11:54:12,655 INFO L290 TraceCheckUtils]: 91: Hoare triple {103875#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {103875#false} is VALID [2022-04-15 11:54:12,655 INFO L290 TraceCheckUtils]: 92: Hoare triple {103875#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {103875#false} is VALID [2022-04-15 11:54:12,655 INFO L290 TraceCheckUtils]: 93: Hoare triple {103875#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {103875#false} is VALID [2022-04-15 11:54:12,656 INFO L290 TraceCheckUtils]: 94: Hoare triple {103875#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {103875#false} is VALID [2022-04-15 11:54:12,656 INFO L290 TraceCheckUtils]: 95: Hoare triple {103875#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {103875#false} is VALID [2022-04-15 11:54:12,656 INFO L290 TraceCheckUtils]: 96: Hoare triple {103875#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {103875#false} is VALID [2022-04-15 11:54:12,656 INFO L290 TraceCheckUtils]: 97: Hoare triple {103875#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {103875#false} is VALID [2022-04-15 11:54:12,656 INFO L290 TraceCheckUtils]: 98: Hoare triple {103875#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {103875#false} is VALID [2022-04-15 11:54:12,656 INFO L290 TraceCheckUtils]: 99: Hoare triple {103875#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {103875#false} is VALID [2022-04-15 11:54:12,656 INFO L290 TraceCheckUtils]: 100: Hoare triple {103875#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {103875#false} is VALID [2022-04-15 11:54:12,656 INFO L290 TraceCheckUtils]: 101: Hoare triple {103875#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {103875#false} is VALID [2022-04-15 11:54:12,656 INFO L290 TraceCheckUtils]: 102: Hoare triple {103875#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {103875#false} is VALID [2022-04-15 11:54:12,656 INFO L290 TraceCheckUtils]: 103: Hoare triple {103875#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {103875#false} is VALID [2022-04-15 11:54:12,656 INFO L290 TraceCheckUtils]: 104: Hoare triple {103875#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {103875#false} is VALID [2022-04-15 11:54:12,657 INFO L290 TraceCheckUtils]: 105: Hoare triple {103875#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {103875#false} is VALID [2022-04-15 11:54:12,657 INFO L290 TraceCheckUtils]: 106: Hoare triple {103875#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {103875#false} is VALID [2022-04-15 11:54:12,657 INFO L290 TraceCheckUtils]: 107: Hoare triple {103875#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {103875#false} is VALID [2022-04-15 11:54:12,657 INFO L290 TraceCheckUtils]: 108: Hoare triple {103875#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {103875#false} is VALID [2022-04-15 11:54:12,657 INFO L290 TraceCheckUtils]: 109: Hoare triple {103875#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {103875#false} is VALID [2022-04-15 11:54:12,657 INFO L290 TraceCheckUtils]: 110: Hoare triple {103875#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {103875#false} is VALID [2022-04-15 11:54:12,657 INFO L290 TraceCheckUtils]: 111: Hoare triple {103875#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {103875#false} is VALID [2022-04-15 11:54:12,657 INFO L290 TraceCheckUtils]: 112: Hoare triple {103875#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {103875#false} is VALID [2022-04-15 11:54:12,657 INFO L290 TraceCheckUtils]: 113: Hoare triple {103875#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {103875#false} is VALID [2022-04-15 11:54:12,657 INFO L290 TraceCheckUtils]: 114: Hoare triple {103875#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {103875#false} is VALID [2022-04-15 11:54:12,658 INFO L290 TraceCheckUtils]: 115: Hoare triple {103875#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {103875#false} is VALID [2022-04-15 11:54:12,658 INFO L290 TraceCheckUtils]: 116: Hoare triple {103875#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {103875#false} is VALID [2022-04-15 11:54:12,658 INFO L290 TraceCheckUtils]: 117: Hoare triple {103875#false} assume 8640 == #t~mem75;havoc #t~mem75; {103875#false} is VALID [2022-04-15 11:54:12,658 INFO L290 TraceCheckUtils]: 118: Hoare triple {103875#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {103875#false} is VALID [2022-04-15 11:54:12,658 INFO L290 TraceCheckUtils]: 119: Hoare triple {103875#false} assume !(4 == ~blastFlag~0); {103875#false} is VALID [2022-04-15 11:54:12,658 INFO L290 TraceCheckUtils]: 120: Hoare triple {103875#false} assume !(7 == ~blastFlag~0); {103875#false} is VALID [2022-04-15 11:54:12,658 INFO L290 TraceCheckUtils]: 121: Hoare triple {103875#false} assume !(10 == ~blastFlag~0); {103875#false} is VALID [2022-04-15 11:54:12,658 INFO L290 TraceCheckUtils]: 122: Hoare triple {103875#false} assume 13 == ~blastFlag~0; {103875#false} is VALID [2022-04-15 11:54:12,658 INFO L290 TraceCheckUtils]: 123: Hoare triple {103875#false} assume !false; {103875#false} is VALID [2022-04-15 11:54:12,659 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-15 11:54:12,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:54:12,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490626187] [2022-04-15 11:54:12,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490626187] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:54:12,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:54:12,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:54:12,659 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:54:12,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1867843063] [2022-04-15 11:54:12,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1867843063] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:54:12,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:54:12,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:54:12,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477945965] [2022-04-15 11:54:12,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:54:12,660 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 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 124 [2022-04-15 11:54:12,661 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:54:12,661 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:54:12,762 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:54:12,763 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:54:12,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:54:12,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:54:12,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:54:12,763 INFO L87 Difference]: Start difference. First operand 913 states and 1419 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:54:15,178 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-15 11:54:17,186 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-15 11:54:28,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:54:28,081 INFO L93 Difference]: Finished difference Result 2119 states and 3275 transitions. [2022-04-15 11:54:28,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:54:28,082 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 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 124 [2022-04-15 11:54:28,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:54:28,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:54:28,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 595 transitions. [2022-04-15 11:54:28,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:54:28,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 595 transitions. [2022-04-15 11:54:28,087 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 595 transitions. [2022-04-15 11:54:28,492 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-15 11:54:28,563 INFO L225 Difference]: With dead ends: 2119 [2022-04-15 11:54:28,563 INFO L226 Difference]: Without dead ends: 1232 [2022-04-15 11:54:28,564 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:54:28,564 INFO L913 BasicCegarLoop]: 143 mSDtfsCounter, 116 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 52 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:54:28,564 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 402 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 479 Invalid, 1 Unknown, 0 Unchecked, 6.3s Time] [2022-04-15 11:54:28,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2022-04-15 11:54:28,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1024. [2022-04-15 11:54:28,625 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:54:28,626 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1232 states. Second operand has 1024 states, 1019 states have (on average 1.5652600588812562) internal successors, (1595), 1019 states have internal predecessors, (1595), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:54:28,627 INFO L74 IsIncluded]: Start isIncluded. First operand 1232 states. Second operand has 1024 states, 1019 states have (on average 1.5652600588812562) internal successors, (1595), 1019 states have internal predecessors, (1595), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:54:28,627 INFO L87 Difference]: Start difference. First operand 1232 states. Second operand has 1024 states, 1019 states have (on average 1.5652600588812562) internal successors, (1595), 1019 states have internal predecessors, (1595), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:54:28,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:54:28,667 INFO L93 Difference]: Finished difference Result 1232 states and 1882 transitions. [2022-04-15 11:54:28,667 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 1882 transitions. [2022-04-15 11:54:28,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:54:28,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:54:28,669 INFO L74 IsIncluded]: Start isIncluded. First operand has 1024 states, 1019 states have (on average 1.5652600588812562) internal successors, (1595), 1019 states have internal predecessors, (1595), 3 states have call successors, (3), 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 1232 states. [2022-04-15 11:54:28,669 INFO L87 Difference]: Start difference. First operand has 1024 states, 1019 states have (on average 1.5652600588812562) internal successors, (1595), 1019 states have internal predecessors, (1595), 3 states have call successors, (3), 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 1232 states. [2022-04-15 11:54:28,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:54:28,708 INFO L93 Difference]: Finished difference Result 1232 states and 1882 transitions. [2022-04-15 11:54:28,708 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 1882 transitions. [2022-04-15 11:54:28,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:54:28,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:54:28,709 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:54:28,709 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:54:28,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 1019 states have (on average 1.5652600588812562) internal successors, (1595), 1019 states have internal predecessors, (1595), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:54:28,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1599 transitions. [2022-04-15 11:54:28,756 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1599 transitions. Word has length 124 [2022-04-15 11:54:28,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:54:28,756 INFO L478 AbstractCegarLoop]: Abstraction has 1024 states and 1599 transitions. [2022-04-15 11:54:28,756 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:54:28,756 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1024 states and 1599 transitions. [2022-04-15 11:54:32,806 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1599 edges. 1598 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:54:32,806 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1599 transitions. [2022-04-15 11:54:32,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-04-15 11:54:32,808 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:54:32,808 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, 1, 1] [2022-04-15 11:54:32,808 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-04-15 11:54:32,808 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:54:32,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:54:32,808 INFO L85 PathProgramCache]: Analyzing trace with hash -315199378, now seen corresponding path program 1 times [2022-04-15 11:54:32,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:54:32,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [856813592] [2022-04-15 11:54:32,876 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:54:32,876 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:54:32,876 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:54:32,876 INFO L85 PathProgramCache]: Analyzing trace with hash -315199378, now seen corresponding path program 2 times [2022-04-15 11:54:32,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:54:32,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452214580] [2022-04-15 11:54:32,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:54:32,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:54:32,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:54:33,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:54:33,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:54:33,144 INFO L290 TraceCheckUtils]: 0: Hoare triple {112643#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {112636#true} is VALID [2022-04-15 11:54:33,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {112636#true} assume true; {112636#true} is VALID [2022-04-15 11:54:33,145 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {112636#true} {112636#true} #708#return; {112636#true} is VALID [2022-04-15 11:54:33,146 INFO L272 TraceCheckUtils]: 0: Hoare triple {112636#true} call ULTIMATE.init(); {112643#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:54:33,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {112643#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {112636#true} is VALID [2022-04-15 11:54:33,146 INFO L290 TraceCheckUtils]: 2: Hoare triple {112636#true} assume true; {112636#true} is VALID [2022-04-15 11:54:33,146 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {112636#true} {112636#true} #708#return; {112636#true} is VALID [2022-04-15 11:54:33,146 INFO L272 TraceCheckUtils]: 4: Hoare triple {112636#true} call #t~ret161 := main(); {112636#true} is VALID [2022-04-15 11:54:33,146 INFO L290 TraceCheckUtils]: 5: Hoare triple {112636#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; {112636#true} is VALID [2022-04-15 11:54:33,146 INFO L290 TraceCheckUtils]: 6: Hoare triple {112636#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {112636#true} is VALID [2022-04-15 11:54:33,146 INFO L272 TraceCheckUtils]: 7: Hoare triple {112636#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {112636#true} is VALID [2022-04-15 11:54:33,146 INFO L290 TraceCheckUtils]: 8: Hoare triple {112636#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); {112636#true} is VALID [2022-04-15 11:54:33,146 INFO L290 TraceCheckUtils]: 9: Hoare triple {112636#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; {112636#true} is VALID [2022-04-15 11:54:33,147 INFO L290 TraceCheckUtils]: 10: Hoare triple {112636#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; {112636#true} is VALID [2022-04-15 11:54:33,147 INFO L290 TraceCheckUtils]: 11: Hoare triple {112636#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {112636#true} is VALID [2022-04-15 11:54:33,147 INFO L290 TraceCheckUtils]: 12: Hoare triple {112636#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {112636#true} is VALID [2022-04-15 11:54:33,147 INFO L290 TraceCheckUtils]: 13: Hoare triple {112636#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {112636#true} is VALID [2022-04-15 11:54:33,147 INFO L290 TraceCheckUtils]: 14: Hoare triple {112636#true} assume !false; {112636#true} is VALID [2022-04-15 11:54:33,147 INFO L290 TraceCheckUtils]: 15: Hoare triple {112636#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); {112636#true} is VALID [2022-04-15 11:54:33,147 INFO L290 TraceCheckUtils]: 16: Hoare triple {112636#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {112636#true} is VALID [2022-04-15 11:54:33,147 INFO L290 TraceCheckUtils]: 17: Hoare triple {112636#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {112636#true} is VALID [2022-04-15 11:54:33,147 INFO L290 TraceCheckUtils]: 18: Hoare triple {112636#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {112636#true} is VALID [2022-04-15 11:54:33,147 INFO L290 TraceCheckUtils]: 19: Hoare triple {112636#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {112636#true} is VALID [2022-04-15 11:54:33,147 INFO L290 TraceCheckUtils]: 20: Hoare triple {112636#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {112636#true} is VALID [2022-04-15 11:54:33,148 INFO L290 TraceCheckUtils]: 21: Hoare triple {112636#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {112636#true} is VALID [2022-04-15 11:54:33,148 INFO L290 TraceCheckUtils]: 22: Hoare triple {112636#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {112636#true} is VALID [2022-04-15 11:54:33,148 INFO L290 TraceCheckUtils]: 23: Hoare triple {112636#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {112636#true} is VALID [2022-04-15 11:54:33,148 INFO L290 TraceCheckUtils]: 24: Hoare triple {112636#true} assume 8464 == #t~mem55;havoc #t~mem55; {112636#true} is VALID [2022-04-15 11:54:33,148 INFO L290 TraceCheckUtils]: 25: Hoare triple {112636#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; {112636#true} is VALID [2022-04-15 11:54:33,148 INFO L290 TraceCheckUtils]: 26: Hoare triple {112636#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {112636#true} is VALID [2022-04-15 11:54:33,148 INFO L290 TraceCheckUtils]: 27: Hoare triple {112636#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); {112636#true} is VALID [2022-04-15 11:54:33,148 INFO L290 TraceCheckUtils]: 28: Hoare triple {112636#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); {112636#true} is VALID [2022-04-15 11:54:33,148 INFO L290 TraceCheckUtils]: 29: Hoare triple {112636#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {112636#true} is VALID [2022-04-15 11:54:33,148 INFO L290 TraceCheckUtils]: 30: Hoare triple {112636#true} ~skip~0 := 0; {112636#true} is VALID [2022-04-15 11:54:33,148 INFO L290 TraceCheckUtils]: 31: Hoare triple {112636#true} assume !false; {112636#true} is VALID [2022-04-15 11:54:33,148 INFO L290 TraceCheckUtils]: 32: Hoare triple {112636#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); {112636#true} is VALID [2022-04-15 11:54:33,149 INFO L290 TraceCheckUtils]: 33: Hoare triple {112636#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {112636#true} is VALID [2022-04-15 11:54:33,149 INFO L290 TraceCheckUtils]: 34: Hoare triple {112636#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {112636#true} is VALID [2022-04-15 11:54:33,149 INFO L290 TraceCheckUtils]: 35: Hoare triple {112636#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {112636#true} is VALID [2022-04-15 11:54:33,149 INFO L290 TraceCheckUtils]: 36: Hoare triple {112636#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {112636#true} is VALID [2022-04-15 11:54:33,149 INFO L290 TraceCheckUtils]: 37: Hoare triple {112636#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {112636#true} is VALID [2022-04-15 11:54:33,149 INFO L290 TraceCheckUtils]: 38: Hoare triple {112636#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {112636#true} is VALID [2022-04-15 11:54:33,149 INFO L290 TraceCheckUtils]: 39: Hoare triple {112636#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {112636#true} is VALID [2022-04-15 11:54:33,149 INFO L290 TraceCheckUtils]: 40: Hoare triple {112636#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {112636#true} is VALID [2022-04-15 11:54:33,149 INFO L290 TraceCheckUtils]: 41: Hoare triple {112636#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {112636#true} is VALID [2022-04-15 11:54:33,149 INFO L290 TraceCheckUtils]: 42: Hoare triple {112636#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {112636#true} is VALID [2022-04-15 11:54:33,149 INFO L290 TraceCheckUtils]: 43: Hoare triple {112636#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {112636#true} is VALID [2022-04-15 11:54:33,150 INFO L290 TraceCheckUtils]: 44: Hoare triple {112636#true} assume 8496 == #t~mem58;havoc #t~mem58; {112636#true} is VALID [2022-04-15 11:54:33,150 INFO L290 TraceCheckUtils]: 45: Hoare triple {112636#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {112636#true} is VALID [2022-04-15 11:54:33,150 INFO L290 TraceCheckUtils]: 46: Hoare triple {112636#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {112636#true} is VALID [2022-04-15 11:54:33,150 INFO L290 TraceCheckUtils]: 47: Hoare triple {112636#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {112636#true} is VALID [2022-04-15 11:54:33,151 INFO L290 TraceCheckUtils]: 48: Hoare triple {112636#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {112641#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:54:33,152 INFO L290 TraceCheckUtils]: 49: Hoare triple {112641#(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); {112641#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:54:33,152 INFO L290 TraceCheckUtils]: 50: Hoare triple {112641#(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); {112641#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:54:33,153 INFO L290 TraceCheckUtils]: 51: Hoare triple {112641#(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; {112641#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:54:33,153 INFO L290 TraceCheckUtils]: 52: Hoare triple {112641#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} ~skip~0 := 0; {112641#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:54:33,153 INFO L290 TraceCheckUtils]: 53: Hoare triple {112641#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !false; {112641#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:54:33,154 INFO L290 TraceCheckUtils]: 54: Hoare triple {112641#(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); {112641#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:54:33,154 INFO L290 TraceCheckUtils]: 55: Hoare triple {112641#(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); {112641#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:54:33,155 INFO L290 TraceCheckUtils]: 56: Hoare triple {112641#(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); {112641#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:54:33,155 INFO L290 TraceCheckUtils]: 57: Hoare triple {112641#(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); {112641#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:54:33,156 INFO L290 TraceCheckUtils]: 58: Hoare triple {112641#(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); {112641#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:54:33,156 INFO L290 TraceCheckUtils]: 59: Hoare triple {112641#(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); {112641#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:54:33,157 INFO L290 TraceCheckUtils]: 60: Hoare triple {112641#(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); {112641#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:54:33,157 INFO L290 TraceCheckUtils]: 61: Hoare triple {112641#(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); {112641#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:54:33,158 INFO L290 TraceCheckUtils]: 62: Hoare triple {112641#(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); {112641#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:54:33,158 INFO L290 TraceCheckUtils]: 63: Hoare triple {112641#(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); {112641#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:54:33,158 INFO L290 TraceCheckUtils]: 64: Hoare triple {112641#(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); {112641#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:54:33,159 INFO L290 TraceCheckUtils]: 65: Hoare triple {112641#(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); {112641#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:54:33,159 INFO L290 TraceCheckUtils]: 66: Hoare triple {112641#(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); {112641#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:54:33,160 INFO L290 TraceCheckUtils]: 67: Hoare triple {112641#(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); {112641#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:54:33,160 INFO L290 TraceCheckUtils]: 68: Hoare triple {112641#(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); {112641#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:54:33,161 INFO L290 TraceCheckUtils]: 69: Hoare triple {112641#(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); {112641#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:54:33,161 INFO L290 TraceCheckUtils]: 70: Hoare triple {112641#(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); {112641#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:54:33,162 INFO L290 TraceCheckUtils]: 71: Hoare triple {112641#(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); {112641#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:54:33,162 INFO L290 TraceCheckUtils]: 72: Hoare triple {112641#(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); {112641#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:54:33,163 INFO L290 TraceCheckUtils]: 73: Hoare triple {112641#(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); {112641#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:54:33,163 INFO L290 TraceCheckUtils]: 74: Hoare triple {112641#(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); {112641#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:54:33,163 INFO L290 TraceCheckUtils]: 75: Hoare triple {112641#(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); {112641#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:54:33,164 INFO L290 TraceCheckUtils]: 76: Hoare triple {112641#(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); {112641#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:54:33,164 INFO L290 TraceCheckUtils]: 77: Hoare triple {112641#(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); {112641#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:54:33,165 INFO L290 TraceCheckUtils]: 78: Hoare triple {112641#(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); {112641#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:54:33,165 INFO L290 TraceCheckUtils]: 79: Hoare triple {112641#(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); {112641#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:54:33,166 INFO L290 TraceCheckUtils]: 80: Hoare triple {112641#(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); {112641#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:54:33,166 INFO L290 TraceCheckUtils]: 81: Hoare triple {112641#(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); {112642#(not (= |ssl3_accept_#t~mem74| 8609))} is VALID [2022-04-15 11:54:33,167 INFO L290 TraceCheckUtils]: 82: Hoare triple {112642#(not (= |ssl3_accept_#t~mem74| 8609))} assume 8609 == #t~mem74;havoc #t~mem74; {112637#false} is VALID [2022-04-15 11:54:33,167 INFO L290 TraceCheckUtils]: 83: Hoare triple {112637#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {112637#false} is VALID [2022-04-15 11:54:33,167 INFO L290 TraceCheckUtils]: 84: Hoare triple {112637#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); {112637#false} is VALID [2022-04-15 11:54:33,167 INFO L290 TraceCheckUtils]: 85: Hoare triple {112637#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); {112637#false} is VALID [2022-04-15 11:54:33,167 INFO L290 TraceCheckUtils]: 86: Hoare triple {112637#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {112637#false} is VALID [2022-04-15 11:54:33,167 INFO L290 TraceCheckUtils]: 87: Hoare triple {112637#false} ~skip~0 := 0; {112637#false} is VALID [2022-04-15 11:54:33,167 INFO L290 TraceCheckUtils]: 88: Hoare triple {112637#false} assume !false; {112637#false} is VALID [2022-04-15 11:54:33,167 INFO L290 TraceCheckUtils]: 89: Hoare triple {112637#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); {112637#false} is VALID [2022-04-15 11:54:33,167 INFO L290 TraceCheckUtils]: 90: Hoare triple {112637#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {112637#false} is VALID [2022-04-15 11:54:33,168 INFO L290 TraceCheckUtils]: 91: Hoare triple {112637#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {112637#false} is VALID [2022-04-15 11:54:33,168 INFO L290 TraceCheckUtils]: 92: Hoare triple {112637#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {112637#false} is VALID [2022-04-15 11:54:33,168 INFO L290 TraceCheckUtils]: 93: Hoare triple {112637#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {112637#false} is VALID [2022-04-15 11:54:33,168 INFO L290 TraceCheckUtils]: 94: Hoare triple {112637#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {112637#false} is VALID [2022-04-15 11:54:33,168 INFO L290 TraceCheckUtils]: 95: Hoare triple {112637#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {112637#false} is VALID [2022-04-15 11:54:33,168 INFO L290 TraceCheckUtils]: 96: Hoare triple {112637#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {112637#false} is VALID [2022-04-15 11:54:33,168 INFO L290 TraceCheckUtils]: 97: Hoare triple {112637#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {112637#false} is VALID [2022-04-15 11:54:33,168 INFO L290 TraceCheckUtils]: 98: Hoare triple {112637#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {112637#false} is VALID [2022-04-15 11:54:33,168 INFO L290 TraceCheckUtils]: 99: Hoare triple {112637#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {112637#false} is VALID [2022-04-15 11:54:33,169 INFO L290 TraceCheckUtils]: 100: Hoare triple {112637#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {112637#false} is VALID [2022-04-15 11:54:33,169 INFO L290 TraceCheckUtils]: 101: Hoare triple {112637#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {112637#false} is VALID [2022-04-15 11:54:33,169 INFO L290 TraceCheckUtils]: 102: Hoare triple {112637#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {112637#false} is VALID [2022-04-15 11:54:33,169 INFO L290 TraceCheckUtils]: 103: Hoare triple {112637#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {112637#false} is VALID [2022-04-15 11:54:33,169 INFO L290 TraceCheckUtils]: 104: Hoare triple {112637#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {112637#false} is VALID [2022-04-15 11:54:33,169 INFO L290 TraceCheckUtils]: 105: Hoare triple {112637#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {112637#false} is VALID [2022-04-15 11:54:33,169 INFO L290 TraceCheckUtils]: 106: Hoare triple {112637#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {112637#false} is VALID [2022-04-15 11:54:33,169 INFO L290 TraceCheckUtils]: 107: Hoare triple {112637#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {112637#false} is VALID [2022-04-15 11:54:33,169 INFO L290 TraceCheckUtils]: 108: Hoare triple {112637#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {112637#false} is VALID [2022-04-15 11:54:33,170 INFO L290 TraceCheckUtils]: 109: Hoare triple {112637#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {112637#false} is VALID [2022-04-15 11:54:33,170 INFO L290 TraceCheckUtils]: 110: Hoare triple {112637#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {112637#false} is VALID [2022-04-15 11:54:33,170 INFO L290 TraceCheckUtils]: 111: Hoare triple {112637#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {112637#false} is VALID [2022-04-15 11:54:33,170 INFO L290 TraceCheckUtils]: 112: Hoare triple {112637#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {112637#false} is VALID [2022-04-15 11:54:33,170 INFO L290 TraceCheckUtils]: 113: Hoare triple {112637#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {112637#false} is VALID [2022-04-15 11:54:33,170 INFO L290 TraceCheckUtils]: 114: Hoare triple {112637#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {112637#false} is VALID [2022-04-15 11:54:33,170 INFO L290 TraceCheckUtils]: 115: Hoare triple {112637#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {112637#false} is VALID [2022-04-15 11:54:33,170 INFO L290 TraceCheckUtils]: 116: Hoare triple {112637#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {112637#false} is VALID [2022-04-15 11:54:33,170 INFO L290 TraceCheckUtils]: 117: Hoare triple {112637#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {112637#false} is VALID [2022-04-15 11:54:33,171 INFO L290 TraceCheckUtils]: 118: Hoare triple {112637#false} assume 8640 == #t~mem75;havoc #t~mem75; {112637#false} is VALID [2022-04-15 11:54:33,171 INFO L290 TraceCheckUtils]: 119: Hoare triple {112637#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {112637#false} is VALID [2022-04-15 11:54:33,171 INFO L290 TraceCheckUtils]: 120: Hoare triple {112637#false} assume !(4 == ~blastFlag~0); {112637#false} is VALID [2022-04-15 11:54:33,171 INFO L290 TraceCheckUtils]: 121: Hoare triple {112637#false} assume !(7 == ~blastFlag~0); {112637#false} is VALID [2022-04-15 11:54:33,171 INFO L290 TraceCheckUtils]: 122: Hoare triple {112637#false} assume !(10 == ~blastFlag~0); {112637#false} is VALID [2022-04-15 11:54:33,171 INFO L290 TraceCheckUtils]: 123: Hoare triple {112637#false} assume 13 == ~blastFlag~0; {112637#false} is VALID [2022-04-15 11:54:33,171 INFO L290 TraceCheckUtils]: 124: Hoare triple {112637#false} assume !false; {112637#false} is VALID [2022-04-15 11:54:33,172 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-15 11:54:33,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:54:33,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452214580] [2022-04-15 11:54:33,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452214580] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:54:33,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:54:33,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:54:33,172 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:54:33,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [856813592] [2022-04-15 11:54:33,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [856813592] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:54:33,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:54:33,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:54:33,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209847777] [2022-04-15 11:54:33,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:54:33,173 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 125 [2022-04-15 11:54:33,174 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:54:33,174 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:54:33,264 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:54:33,264 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:54:33,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:54:33,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:54:33,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:54:33,265 INFO L87 Difference]: Start difference. First operand 1024 states and 1599 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:54:36,206 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:54:43,144 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-15 11:54:48,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:54:48,670 INFO L93 Difference]: Finished difference Result 2221 states and 3437 transitions. [2022-04-15 11:54:48,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:54:48,671 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 125 [2022-04-15 11:54:48,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:54:48,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:54:48,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 595 transitions. [2022-04-15 11:54:48,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:54:48,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 595 transitions. [2022-04-15 11:54:48,675 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 595 transitions. [2022-04-15 11:54:49,076 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-15 11:54:49,141 INFO L225 Difference]: With dead ends: 2221 [2022-04-15 11:54:49,141 INFO L226 Difference]: Without dead ends: 1223 [2022-04-15 11:54:49,142 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:54:49,143 INFO L913 BasicCegarLoop]: 151 mSDtfsCounter, 115 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 53 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:54:49,143 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 418 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 486 Invalid, 1 Unknown, 0 Unchecked, 6.1s Time] [2022-04-15 11:54:49,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2022-04-15 11:54:49,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 1024. [2022-04-15 11:54:49,208 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:54:49,209 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1223 states. Second operand has 1024 states, 1019 states have (on average 1.5593719332679097) internal successors, (1589), 1019 states have internal predecessors, (1589), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:54:49,210 INFO L74 IsIncluded]: Start isIncluded. First operand 1223 states. Second operand has 1024 states, 1019 states have (on average 1.5593719332679097) internal successors, (1589), 1019 states have internal predecessors, (1589), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:54:49,210 INFO L87 Difference]: Start difference. First operand 1223 states. Second operand has 1024 states, 1019 states have (on average 1.5593719332679097) internal successors, (1589), 1019 states have internal predecessors, (1589), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:54:49,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:54:49,249 INFO L93 Difference]: Finished difference Result 1223 states and 1864 transitions. [2022-04-15 11:54:49,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 1864 transitions. [2022-04-15 11:54:49,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:54:49,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:54:49,250 INFO L74 IsIncluded]: Start isIncluded. First operand has 1024 states, 1019 states have (on average 1.5593719332679097) internal successors, (1589), 1019 states have internal predecessors, (1589), 3 states have call successors, (3), 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 1223 states. [2022-04-15 11:54:49,251 INFO L87 Difference]: Start difference. First operand has 1024 states, 1019 states have (on average 1.5593719332679097) internal successors, (1589), 1019 states have internal predecessors, (1589), 3 states have call successors, (3), 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 1223 states. [2022-04-15 11:54:49,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:54:49,290 INFO L93 Difference]: Finished difference Result 1223 states and 1864 transitions. [2022-04-15 11:54:49,290 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 1864 transitions. [2022-04-15 11:54:49,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:54:49,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:54:49,291 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:54:49,291 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:54:49,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 1019 states have (on average 1.5593719332679097) internal successors, (1589), 1019 states have internal predecessors, (1589), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:54:49,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1593 transitions. [2022-04-15 11:54:49,344 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1593 transitions. Word has length 125 [2022-04-15 11:54:49,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:54:49,344 INFO L478 AbstractCegarLoop]: Abstraction has 1024 states and 1593 transitions. [2022-04-15 11:54:49,344 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:54:49,344 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1024 states and 1593 transitions. [2022-04-15 11:54:53,372 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1593 edges. 1592 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:54:53,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1593 transitions. [2022-04-15 11:54:53,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-04-15 11:54:53,374 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:54:53,374 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2022-04-15 11:54:53,374 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-04-15 11:54:53,374 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:54:53,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:54:53,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1505319124, now seen corresponding path program 1 times [2022-04-15 11:54:53,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:54:53,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1269735139] [2022-04-15 11:54:53,468 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:54:53,468 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:54:53,468 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:54:53,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1505319124, now seen corresponding path program 2 times [2022-04-15 11:54:53,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:54:53,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919748780] [2022-04-15 11:54:53,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:54:53,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:54:53,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:54:53,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:54:53,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:54:53,714 INFO L290 TraceCheckUtils]: 0: Hoare triple {121591#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {121584#true} is VALID [2022-04-15 11:54:53,715 INFO L290 TraceCheckUtils]: 1: Hoare triple {121584#true} assume true; {121584#true} is VALID [2022-04-15 11:54:53,715 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {121584#true} {121584#true} #708#return; {121584#true} is VALID [2022-04-15 11:54:53,716 INFO L272 TraceCheckUtils]: 0: Hoare triple {121584#true} call ULTIMATE.init(); {121591#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:54:53,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {121591#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {121584#true} is VALID [2022-04-15 11:54:53,716 INFO L290 TraceCheckUtils]: 2: Hoare triple {121584#true} assume true; {121584#true} is VALID [2022-04-15 11:54:53,716 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {121584#true} {121584#true} #708#return; {121584#true} is VALID [2022-04-15 11:54:53,716 INFO L272 TraceCheckUtils]: 4: Hoare triple {121584#true} call #t~ret161 := main(); {121584#true} is VALID [2022-04-15 11:54:53,716 INFO L290 TraceCheckUtils]: 5: Hoare triple {121584#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; {121584#true} is VALID [2022-04-15 11:54:53,716 INFO L290 TraceCheckUtils]: 6: Hoare triple {121584#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {121584#true} is VALID [2022-04-15 11:54:53,716 INFO L272 TraceCheckUtils]: 7: Hoare triple {121584#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {121584#true} is VALID [2022-04-15 11:54:53,716 INFO L290 TraceCheckUtils]: 8: Hoare triple {121584#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); {121584#true} is VALID [2022-04-15 11:54:53,716 INFO L290 TraceCheckUtils]: 9: Hoare triple {121584#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; {121584#true} is VALID [2022-04-15 11:54:53,717 INFO L290 TraceCheckUtils]: 10: Hoare triple {121584#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; {121584#true} is VALID [2022-04-15 11:54:53,717 INFO L290 TraceCheckUtils]: 11: Hoare triple {121584#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {121584#true} is VALID [2022-04-15 11:54:53,717 INFO L290 TraceCheckUtils]: 12: Hoare triple {121584#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {121584#true} is VALID [2022-04-15 11:54:53,717 INFO L290 TraceCheckUtils]: 13: Hoare triple {121584#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {121584#true} is VALID [2022-04-15 11:54:53,717 INFO L290 TraceCheckUtils]: 14: Hoare triple {121584#true} assume !false; {121584#true} is VALID [2022-04-15 11:54:53,717 INFO L290 TraceCheckUtils]: 15: Hoare triple {121584#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); {121584#true} is VALID [2022-04-15 11:54:53,717 INFO L290 TraceCheckUtils]: 16: Hoare triple {121584#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {121584#true} is VALID [2022-04-15 11:54:53,717 INFO L290 TraceCheckUtils]: 17: Hoare triple {121584#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {121584#true} is VALID [2022-04-15 11:54:53,717 INFO L290 TraceCheckUtils]: 18: Hoare triple {121584#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {121584#true} is VALID [2022-04-15 11:54:53,717 INFO L290 TraceCheckUtils]: 19: Hoare triple {121584#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {121584#true} is VALID [2022-04-15 11:54:53,718 INFO L290 TraceCheckUtils]: 20: Hoare triple {121584#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {121584#true} is VALID [2022-04-15 11:54:53,718 INFO L290 TraceCheckUtils]: 21: Hoare triple {121584#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {121584#true} is VALID [2022-04-15 11:54:53,718 INFO L290 TraceCheckUtils]: 22: Hoare triple {121584#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {121584#true} is VALID [2022-04-15 11:54:53,718 INFO L290 TraceCheckUtils]: 23: Hoare triple {121584#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {121584#true} is VALID [2022-04-15 11:54:53,718 INFO L290 TraceCheckUtils]: 24: Hoare triple {121584#true} assume 8464 == #t~mem55;havoc #t~mem55; {121584#true} is VALID [2022-04-15 11:54:53,718 INFO L290 TraceCheckUtils]: 25: Hoare triple {121584#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; {121584#true} is VALID [2022-04-15 11:54:53,718 INFO L290 TraceCheckUtils]: 26: Hoare triple {121584#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {121584#true} is VALID [2022-04-15 11:54:53,718 INFO L290 TraceCheckUtils]: 27: Hoare triple {121584#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); {121584#true} is VALID [2022-04-15 11:54:53,718 INFO L290 TraceCheckUtils]: 28: Hoare triple {121584#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); {121584#true} is VALID [2022-04-15 11:54:53,718 INFO L290 TraceCheckUtils]: 29: Hoare triple {121584#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {121584#true} is VALID [2022-04-15 11:54:53,718 INFO L290 TraceCheckUtils]: 30: Hoare triple {121584#true} ~skip~0 := 0; {121584#true} is VALID [2022-04-15 11:54:53,719 INFO L290 TraceCheckUtils]: 31: Hoare triple {121584#true} assume !false; {121584#true} is VALID [2022-04-15 11:54:53,719 INFO L290 TraceCheckUtils]: 32: Hoare triple {121584#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); {121584#true} is VALID [2022-04-15 11:54:53,719 INFO L290 TraceCheckUtils]: 33: Hoare triple {121584#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {121584#true} is VALID [2022-04-15 11:54:53,719 INFO L290 TraceCheckUtils]: 34: Hoare triple {121584#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {121584#true} is VALID [2022-04-15 11:54:53,719 INFO L290 TraceCheckUtils]: 35: Hoare triple {121584#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {121584#true} is VALID [2022-04-15 11:54:53,719 INFO L290 TraceCheckUtils]: 36: Hoare triple {121584#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {121584#true} is VALID [2022-04-15 11:54:53,719 INFO L290 TraceCheckUtils]: 37: Hoare triple {121584#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {121584#true} is VALID [2022-04-15 11:54:53,719 INFO L290 TraceCheckUtils]: 38: Hoare triple {121584#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {121584#true} is VALID [2022-04-15 11:54:53,719 INFO L290 TraceCheckUtils]: 39: Hoare triple {121584#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {121584#true} is VALID [2022-04-15 11:54:53,719 INFO L290 TraceCheckUtils]: 40: Hoare triple {121584#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {121584#true} is VALID [2022-04-15 11:54:53,720 INFO L290 TraceCheckUtils]: 41: Hoare triple {121584#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {121584#true} is VALID [2022-04-15 11:54:53,720 INFO L290 TraceCheckUtils]: 42: Hoare triple {121584#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {121584#true} is VALID [2022-04-15 11:54:53,720 INFO L290 TraceCheckUtils]: 43: Hoare triple {121584#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {121584#true} is VALID [2022-04-15 11:54:53,720 INFO L290 TraceCheckUtils]: 44: Hoare triple {121584#true} assume 8496 == #t~mem58;havoc #t~mem58; {121584#true} is VALID [2022-04-15 11:54:53,720 INFO L290 TraceCheckUtils]: 45: Hoare triple {121584#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {121584#true} is VALID [2022-04-15 11:54:53,720 INFO L290 TraceCheckUtils]: 46: Hoare triple {121584#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {121584#true} is VALID [2022-04-15 11:54:53,720 INFO L290 TraceCheckUtils]: 47: Hoare triple {121584#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {121584#true} is VALID [2022-04-15 11:54:53,721 INFO L290 TraceCheckUtils]: 48: Hoare triple {121584#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {121589#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:54:53,722 INFO L290 TraceCheckUtils]: 49: Hoare triple {121589#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {121589#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:54:53,723 INFO L290 TraceCheckUtils]: 50: Hoare triple {121589#(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); {121589#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:54:53,723 INFO L290 TraceCheckUtils]: 51: Hoare triple {121589#(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; {121589#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:54:53,723 INFO L290 TraceCheckUtils]: 52: Hoare triple {121589#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} ~skip~0 := 0; {121589#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:54:53,724 INFO L290 TraceCheckUtils]: 53: Hoare triple {121589#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !false; {121589#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:54:53,724 INFO L290 TraceCheckUtils]: 54: Hoare triple {121589#(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); {121589#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:54:53,725 INFO L290 TraceCheckUtils]: 55: Hoare triple {121589#(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); {121589#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:54:53,725 INFO L290 TraceCheckUtils]: 56: Hoare triple {121589#(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); {121589#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:54:53,726 INFO L290 TraceCheckUtils]: 57: Hoare triple {121589#(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); {121589#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:54:53,726 INFO L290 TraceCheckUtils]: 58: Hoare triple {121589#(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); {121589#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:54:53,726 INFO L290 TraceCheckUtils]: 59: Hoare triple {121589#(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); {121589#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:54:53,727 INFO L290 TraceCheckUtils]: 60: Hoare triple {121589#(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); {121590#(not (= |ssl3_accept_#t~mem53| 8481))} is VALID [2022-04-15 11:54:53,727 INFO L290 TraceCheckUtils]: 61: Hoare triple {121590#(not (= |ssl3_accept_#t~mem53| 8481))} assume 8481 == #t~mem53;havoc #t~mem53; {121585#false} is VALID [2022-04-15 11:54:53,727 INFO L290 TraceCheckUtils]: 62: Hoare triple {121585#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; {121585#false} is VALID [2022-04-15 11:54:53,728 INFO L290 TraceCheckUtils]: 63: Hoare triple {121585#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); {121585#false} is VALID [2022-04-15 11:54:53,728 INFO L290 TraceCheckUtils]: 64: Hoare triple {121585#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); {121585#false} is VALID [2022-04-15 11:54:53,728 INFO L290 TraceCheckUtils]: 65: Hoare triple {121585#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {121585#false} is VALID [2022-04-15 11:54:53,728 INFO L290 TraceCheckUtils]: 66: Hoare triple {121585#false} ~skip~0 := 0; {121585#false} is VALID [2022-04-15 11:54:53,728 INFO L290 TraceCheckUtils]: 67: Hoare triple {121585#false} assume !false; {121585#false} is VALID [2022-04-15 11:54:53,728 INFO L290 TraceCheckUtils]: 68: Hoare triple {121585#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); {121585#false} is VALID [2022-04-15 11:54:53,728 INFO L290 TraceCheckUtils]: 69: Hoare triple {121585#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-15 11:54:53,728 INFO L290 TraceCheckUtils]: 70: Hoare triple {121585#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-15 11:54:53,728 INFO L290 TraceCheckUtils]: 71: Hoare triple {121585#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-15 11:54:53,728 INFO L290 TraceCheckUtils]: 72: Hoare triple {121585#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-15 11:54:53,729 INFO L290 TraceCheckUtils]: 73: Hoare triple {121585#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-15 11:54:53,729 INFO L290 TraceCheckUtils]: 74: Hoare triple {121585#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-15 11:54:53,729 INFO L290 TraceCheckUtils]: 75: Hoare triple {121585#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-15 11:54:53,729 INFO L290 TraceCheckUtils]: 76: Hoare triple {121585#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-15 11:54:53,729 INFO L290 TraceCheckUtils]: 77: Hoare triple {121585#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-15 11:54:53,729 INFO L290 TraceCheckUtils]: 78: Hoare triple {121585#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-15 11:54:53,729 INFO L290 TraceCheckUtils]: 79: Hoare triple {121585#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-15 11:54:53,729 INFO L290 TraceCheckUtils]: 80: Hoare triple {121585#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-15 11:54:53,729 INFO L290 TraceCheckUtils]: 81: Hoare triple {121585#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-15 11:54:53,729 INFO L290 TraceCheckUtils]: 82: Hoare triple {121585#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-15 11:54:53,729 INFO L290 TraceCheckUtils]: 83: Hoare triple {121585#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-15 11:54:53,730 INFO L290 TraceCheckUtils]: 84: Hoare triple {121585#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-15 11:54:53,730 INFO L290 TraceCheckUtils]: 85: Hoare triple {121585#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-15 11:54:53,730 INFO L290 TraceCheckUtils]: 86: Hoare triple {121585#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-15 11:54:53,730 INFO L290 TraceCheckUtils]: 87: Hoare triple {121585#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-15 11:54:53,730 INFO L290 TraceCheckUtils]: 88: Hoare triple {121585#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-15 11:54:53,730 INFO L290 TraceCheckUtils]: 89: Hoare triple {121585#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-15 11:54:53,730 INFO L290 TraceCheckUtils]: 90: Hoare triple {121585#false} assume 8448 == #t~mem68;havoc #t~mem68; {121585#false} is VALID [2022-04-15 11:54:53,730 INFO L290 TraceCheckUtils]: 91: Hoare triple {121585#false} assume !(~num1~0 > 0); {121585#false} is VALID [2022-04-15 11:54:53,730 INFO L290 TraceCheckUtils]: 92: Hoare triple {121585#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; {121585#false} is VALID [2022-04-15 11:54:53,730 INFO L290 TraceCheckUtils]: 93: Hoare triple {121585#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); {121585#false} is VALID [2022-04-15 11:54:53,730 INFO L290 TraceCheckUtils]: 94: Hoare triple {121585#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {121585#false} is VALID [2022-04-15 11:54:53,731 INFO L290 TraceCheckUtils]: 95: Hoare triple {121585#false} ~skip~0 := 0; {121585#false} is VALID [2022-04-15 11:54:53,731 INFO L290 TraceCheckUtils]: 96: Hoare triple {121585#false} assume !false; {121585#false} is VALID [2022-04-15 11:54:53,731 INFO L290 TraceCheckUtils]: 97: Hoare triple {121585#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); {121585#false} is VALID [2022-04-15 11:54:53,731 INFO L290 TraceCheckUtils]: 98: Hoare triple {121585#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-15 11:54:53,731 INFO L290 TraceCheckUtils]: 99: Hoare triple {121585#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-15 11:54:53,731 INFO L290 TraceCheckUtils]: 100: Hoare triple {121585#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-15 11:54:53,731 INFO L290 TraceCheckUtils]: 101: Hoare triple {121585#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-15 11:54:53,731 INFO L290 TraceCheckUtils]: 102: Hoare triple {121585#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-15 11:54:53,731 INFO L290 TraceCheckUtils]: 103: Hoare triple {121585#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-15 11:54:53,731 INFO L290 TraceCheckUtils]: 104: Hoare triple {121585#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-15 11:54:53,731 INFO L290 TraceCheckUtils]: 105: Hoare triple {121585#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-15 11:54:53,732 INFO L290 TraceCheckUtils]: 106: Hoare triple {121585#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-15 11:54:53,732 INFO L290 TraceCheckUtils]: 107: Hoare triple {121585#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-15 11:54:53,732 INFO L290 TraceCheckUtils]: 108: Hoare triple {121585#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-15 11:54:53,732 INFO L290 TraceCheckUtils]: 109: Hoare triple {121585#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-15 11:54:53,732 INFO L290 TraceCheckUtils]: 110: Hoare triple {121585#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-15 11:54:53,732 INFO L290 TraceCheckUtils]: 111: Hoare triple {121585#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-15 11:54:53,732 INFO L290 TraceCheckUtils]: 112: Hoare triple {121585#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-15 11:54:53,732 INFO L290 TraceCheckUtils]: 113: Hoare triple {121585#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-15 11:54:53,732 INFO L290 TraceCheckUtils]: 114: Hoare triple {121585#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-15 11:54:53,732 INFO L290 TraceCheckUtils]: 115: Hoare triple {121585#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-15 11:54:53,733 INFO L290 TraceCheckUtils]: 116: Hoare triple {121585#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-15 11:54:53,733 INFO L290 TraceCheckUtils]: 117: Hoare triple {121585#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-15 11:54:53,733 INFO L290 TraceCheckUtils]: 118: Hoare triple {121585#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-15 11:54:53,733 INFO L290 TraceCheckUtils]: 119: Hoare triple {121585#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-15 11:54:53,733 INFO L290 TraceCheckUtils]: 120: Hoare triple {121585#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-15 11:54:53,733 INFO L290 TraceCheckUtils]: 121: Hoare triple {121585#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-15 11:54:53,733 INFO L290 TraceCheckUtils]: 122: Hoare triple {121585#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-15 11:54:53,733 INFO L290 TraceCheckUtils]: 123: Hoare triple {121585#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-15 11:54:53,733 INFO L290 TraceCheckUtils]: 124: Hoare triple {121585#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-15 11:54:53,733 INFO L290 TraceCheckUtils]: 125: Hoare triple {121585#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-15 11:54:53,733 INFO L290 TraceCheckUtils]: 126: Hoare triple {121585#false} assume 8640 == #t~mem75;havoc #t~mem75; {121585#false} is VALID [2022-04-15 11:54:53,734 INFO L290 TraceCheckUtils]: 127: Hoare triple {121585#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {121585#false} is VALID [2022-04-15 11:54:53,734 INFO L290 TraceCheckUtils]: 128: Hoare triple {121585#false} assume !(4 == ~blastFlag~0); {121585#false} is VALID [2022-04-15 11:54:53,734 INFO L290 TraceCheckUtils]: 129: Hoare triple {121585#false} assume !(7 == ~blastFlag~0); {121585#false} is VALID [2022-04-15 11:54:53,734 INFO L290 TraceCheckUtils]: 130: Hoare triple {121585#false} assume !(10 == ~blastFlag~0); {121585#false} is VALID [2022-04-15 11:54:53,734 INFO L290 TraceCheckUtils]: 131: Hoare triple {121585#false} assume 13 == ~blastFlag~0; {121585#false} is VALID [2022-04-15 11:54:53,734 INFO L290 TraceCheckUtils]: 132: Hoare triple {121585#false} assume !false; {121585#false} is VALID [2022-04-15 11:54:53,734 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-15 11:54:53,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:54:53,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919748780] [2022-04-15 11:54:53,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919748780] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:54:53,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:54:53,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:54:53,735 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:54:53,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1269735139] [2022-04-15 11:54:53,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1269735139] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:54:53,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:54:53,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:54:53,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243205407] [2022-04-15 11:54:53,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:54:53,736 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (3), 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 133 [2022-04-15 11:54:53,736 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:54:53,736 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:54:53,822 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:54:53,822 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:54:53,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:54:53,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:54:53,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:54:53,823 INFO L87 Difference]: Start difference. First operand 1024 states and 1593 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:54:55,922 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-15 11:55:01,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:55:01,290 INFO L93 Difference]: Finished difference Result 2219 states and 3423 transitions. [2022-04-15 11:55:01,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:55:01,291 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (3), 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 133 [2022-04-15 11:55:01,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:55:01,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:55:01,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 594 transitions. [2022-04-15 11:55:01,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:55:01,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 594 transitions. [2022-04-15 11:55:01,295 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 594 transitions. [2022-04-15 11:55:01,704 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 594 edges. 594 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:55:01,761 INFO L225 Difference]: With dead ends: 2219 [2022-04-15 11:55:01,761 INFO L226 Difference]: Without dead ends: 1221 [2022-04-15 11:55:01,762 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:55:01,763 INFO L913 BasicCegarLoop]: 136 mSDtfsCounter, 135 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 55 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-04-15 11:55:01,763 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 388 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 468 Invalid, 1 Unknown, 0 Unchecked, 3.8s Time] [2022-04-15 11:55:01,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2022-04-15 11:55:01,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 1024. [2022-04-15 11:55:01,835 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:55:01,836 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1221 states. Second operand has 1024 states, 1019 states have (on average 1.5436702649656526) internal successors, (1573), 1019 states have internal predecessors, (1573), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:55:01,836 INFO L74 IsIncluded]: Start isIncluded. First operand 1221 states. Second operand has 1024 states, 1019 states have (on average 1.5436702649656526) internal successors, (1573), 1019 states have internal predecessors, (1573), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:55:01,837 INFO L87 Difference]: Start difference. First operand 1221 states. Second operand has 1024 states, 1019 states have (on average 1.5436702649656526) internal successors, (1573), 1019 states have internal predecessors, (1573), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:55:01,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:55:01,876 INFO L93 Difference]: Finished difference Result 1221 states and 1846 transitions. [2022-04-15 11:55:01,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1221 states and 1846 transitions. [2022-04-15 11:55:01,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:55:01,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:55:01,877 INFO L74 IsIncluded]: Start isIncluded. First operand has 1024 states, 1019 states have (on average 1.5436702649656526) internal successors, (1573), 1019 states have internal predecessors, (1573), 3 states have call successors, (3), 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 1221 states. [2022-04-15 11:55:01,878 INFO L87 Difference]: Start difference. First operand has 1024 states, 1019 states have (on average 1.5436702649656526) internal successors, (1573), 1019 states have internal predecessors, (1573), 3 states have call successors, (3), 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 1221 states. [2022-04-15 11:55:01,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:55:01,927 INFO L93 Difference]: Finished difference Result 1221 states and 1846 transitions. [2022-04-15 11:55:01,927 INFO L276 IsEmpty]: Start isEmpty. Operand 1221 states and 1846 transitions. [2022-04-15 11:55:01,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:55:01,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:55:01,928 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:55:01,929 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:55:01,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 1019 states have (on average 1.5436702649656526) internal successors, (1573), 1019 states have internal predecessors, (1573), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:55:01,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1577 transitions. [2022-04-15 11:55:01,976 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1577 transitions. Word has length 133 [2022-04-15 11:55:01,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:55:01,977 INFO L478 AbstractCegarLoop]: Abstraction has 1024 states and 1577 transitions. [2022-04-15 11:55:01,977 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:55:01,977 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1024 states and 1577 transitions. [2022-04-15 11:55:06,034 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1577 edges. 1576 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:55:06,035 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1577 transitions. [2022-04-15 11:55:06,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-04-15 11:55:06,036 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:55:06,036 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, 1] [2022-04-15 11:55:06,036 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-04-15 11:55:06,036 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:55:06,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:55:06,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1537626722, now seen corresponding path program 1 times [2022-04-15 11:55:06,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:55:06,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1600056824] [2022-04-15 11:55:06,112 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:55:06,113 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:55:06,113 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:55:06,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1537626722, now seen corresponding path program 2 times [2022-04-15 11:55:06,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:55:06,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896832999] [2022-04-15 11:55:06,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:55:06,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:55:06,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:55:06,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:55:06,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:55:06,352 INFO L290 TraceCheckUtils]: 0: Hoare triple {130531#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {130524#true} is VALID [2022-04-15 11:55:06,352 INFO L290 TraceCheckUtils]: 1: Hoare triple {130524#true} assume true; {130524#true} is VALID [2022-04-15 11:55:06,353 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {130524#true} {130524#true} #708#return; {130524#true} is VALID [2022-04-15 11:55:06,353 INFO L272 TraceCheckUtils]: 0: Hoare triple {130524#true} call ULTIMATE.init(); {130531#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:55:06,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {130531#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {130524#true} is VALID [2022-04-15 11:55:06,353 INFO L290 TraceCheckUtils]: 2: Hoare triple {130524#true} assume true; {130524#true} is VALID [2022-04-15 11:55:06,353 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {130524#true} {130524#true} #708#return; {130524#true} is VALID [2022-04-15 11:55:06,354 INFO L272 TraceCheckUtils]: 4: Hoare triple {130524#true} call #t~ret161 := main(); {130524#true} is VALID [2022-04-15 11:55:06,354 INFO L290 TraceCheckUtils]: 5: Hoare triple {130524#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; {130524#true} is VALID [2022-04-15 11:55:06,354 INFO L290 TraceCheckUtils]: 6: Hoare triple {130524#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {130524#true} is VALID [2022-04-15 11:55:06,354 INFO L272 TraceCheckUtils]: 7: Hoare triple {130524#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {130524#true} is VALID [2022-04-15 11:55:06,354 INFO L290 TraceCheckUtils]: 8: Hoare triple {130524#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); {130524#true} is VALID [2022-04-15 11:55:06,354 INFO L290 TraceCheckUtils]: 9: Hoare triple {130524#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; {130524#true} is VALID [2022-04-15 11:55:06,354 INFO L290 TraceCheckUtils]: 10: Hoare triple {130524#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; {130524#true} is VALID [2022-04-15 11:55:06,354 INFO L290 TraceCheckUtils]: 11: Hoare triple {130524#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {130524#true} is VALID [2022-04-15 11:55:06,354 INFO L290 TraceCheckUtils]: 12: Hoare triple {130524#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {130524#true} is VALID [2022-04-15 11:55:06,354 INFO L290 TraceCheckUtils]: 13: Hoare triple {130524#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {130524#true} is VALID [2022-04-15 11:55:06,354 INFO L290 TraceCheckUtils]: 14: Hoare triple {130524#true} assume !false; {130524#true} is VALID [2022-04-15 11:55:06,354 INFO L290 TraceCheckUtils]: 15: Hoare triple {130524#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); {130524#true} is VALID [2022-04-15 11:55:06,354 INFO L290 TraceCheckUtils]: 16: Hoare triple {130524#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {130524#true} is VALID [2022-04-15 11:55:06,354 INFO L290 TraceCheckUtils]: 17: Hoare triple {130524#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {130524#true} is VALID [2022-04-15 11:55:06,354 INFO L290 TraceCheckUtils]: 18: Hoare triple {130524#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {130524#true} is VALID [2022-04-15 11:55:06,355 INFO L290 TraceCheckUtils]: 19: Hoare triple {130524#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {130524#true} is VALID [2022-04-15 11:55:06,355 INFO L290 TraceCheckUtils]: 20: Hoare triple {130524#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {130524#true} is VALID [2022-04-15 11:55:06,355 INFO L290 TraceCheckUtils]: 21: Hoare triple {130524#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {130524#true} is VALID [2022-04-15 11:55:06,355 INFO L290 TraceCheckUtils]: 22: Hoare triple {130524#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {130524#true} is VALID [2022-04-15 11:55:06,355 INFO L290 TraceCheckUtils]: 23: Hoare triple {130524#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {130524#true} is VALID [2022-04-15 11:55:06,355 INFO L290 TraceCheckUtils]: 24: Hoare triple {130524#true} assume 8464 == #t~mem55;havoc #t~mem55; {130524#true} is VALID [2022-04-15 11:55:06,355 INFO L290 TraceCheckUtils]: 25: Hoare triple {130524#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; {130524#true} is VALID [2022-04-15 11:55:06,355 INFO L290 TraceCheckUtils]: 26: Hoare triple {130524#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {130524#true} is VALID [2022-04-15 11:55:06,355 INFO L290 TraceCheckUtils]: 27: Hoare triple {130524#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); {130524#true} is VALID [2022-04-15 11:55:06,355 INFO L290 TraceCheckUtils]: 28: Hoare triple {130524#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); {130524#true} is VALID [2022-04-15 11:55:06,355 INFO L290 TraceCheckUtils]: 29: Hoare triple {130524#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {130524#true} is VALID [2022-04-15 11:55:06,355 INFO L290 TraceCheckUtils]: 30: Hoare triple {130524#true} ~skip~0 := 0; {130524#true} is VALID [2022-04-15 11:55:06,355 INFO L290 TraceCheckUtils]: 31: Hoare triple {130524#true} assume !false; {130524#true} is VALID [2022-04-15 11:55:06,355 INFO L290 TraceCheckUtils]: 32: Hoare triple {130524#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); {130524#true} is VALID [2022-04-15 11:55:06,356 INFO L290 TraceCheckUtils]: 33: Hoare triple {130524#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {130524#true} is VALID [2022-04-15 11:55:06,356 INFO L290 TraceCheckUtils]: 34: Hoare triple {130524#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {130524#true} is VALID [2022-04-15 11:55:06,356 INFO L290 TraceCheckUtils]: 35: Hoare triple {130524#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {130524#true} is VALID [2022-04-15 11:55:06,356 INFO L290 TraceCheckUtils]: 36: Hoare triple {130524#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {130524#true} is VALID [2022-04-15 11:55:06,356 INFO L290 TraceCheckUtils]: 37: Hoare triple {130524#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {130524#true} is VALID [2022-04-15 11:55:06,356 INFO L290 TraceCheckUtils]: 38: Hoare triple {130524#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {130524#true} is VALID [2022-04-15 11:55:06,356 INFO L290 TraceCheckUtils]: 39: Hoare triple {130524#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {130524#true} is VALID [2022-04-15 11:55:06,356 INFO L290 TraceCheckUtils]: 40: Hoare triple {130524#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {130524#true} is VALID [2022-04-15 11:55:06,356 INFO L290 TraceCheckUtils]: 41: Hoare triple {130524#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {130524#true} is VALID [2022-04-15 11:55:06,356 INFO L290 TraceCheckUtils]: 42: Hoare triple {130524#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {130524#true} is VALID [2022-04-15 11:55:06,356 INFO L290 TraceCheckUtils]: 43: Hoare triple {130524#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {130524#true} is VALID [2022-04-15 11:55:06,356 INFO L290 TraceCheckUtils]: 44: Hoare triple {130524#true} assume 8496 == #t~mem58;havoc #t~mem58; {130524#true} is VALID [2022-04-15 11:55:06,356 INFO L290 TraceCheckUtils]: 45: Hoare triple {130524#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {130524#true} is VALID [2022-04-15 11:55:06,356 INFO L290 TraceCheckUtils]: 46: Hoare triple {130524#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {130524#true} is VALID [2022-04-15 11:55:06,356 INFO L290 TraceCheckUtils]: 47: Hoare triple {130524#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {130524#true} is VALID [2022-04-15 11:55:06,357 INFO L290 TraceCheckUtils]: 48: Hoare triple {130524#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:06,360 INFO L290 TraceCheckUtils]: 49: Hoare triple {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:06,360 INFO L290 TraceCheckUtils]: 50: Hoare triple {130529#(= 8656 (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); {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:06,360 INFO L290 TraceCheckUtils]: 51: Hoare triple {130529#(= 8656 (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; {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:06,361 INFO L290 TraceCheckUtils]: 52: Hoare triple {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:06,361 INFO L290 TraceCheckUtils]: 53: Hoare triple {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:06,361 INFO L290 TraceCheckUtils]: 54: Hoare triple {130529#(= 8656 (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); {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:06,363 INFO L290 TraceCheckUtils]: 55: Hoare triple {130529#(= 8656 (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); {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:06,364 INFO L290 TraceCheckUtils]: 56: Hoare triple {130529#(= 8656 (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); {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:06,364 INFO L290 TraceCheckUtils]: 57: Hoare triple {130529#(= 8656 (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); {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:06,364 INFO L290 TraceCheckUtils]: 58: Hoare triple {130529#(= 8656 (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); {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:06,365 INFO L290 TraceCheckUtils]: 59: Hoare triple {130529#(= 8656 (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); {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:06,365 INFO L290 TraceCheckUtils]: 60: Hoare triple {130529#(= 8656 (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); {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:06,366 INFO L290 TraceCheckUtils]: 61: Hoare triple {130529#(= 8656 (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); {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:06,366 INFO L290 TraceCheckUtils]: 62: Hoare triple {130529#(= 8656 (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); {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:06,366 INFO L290 TraceCheckUtils]: 63: Hoare triple {130529#(= 8656 (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); {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:06,367 INFO L290 TraceCheckUtils]: 64: Hoare triple {130529#(= 8656 (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); {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:06,367 INFO L290 TraceCheckUtils]: 65: Hoare triple {130529#(= 8656 (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); {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:06,367 INFO L290 TraceCheckUtils]: 66: Hoare triple {130529#(= 8656 (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); {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:06,368 INFO L290 TraceCheckUtils]: 67: Hoare triple {130529#(= 8656 (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); {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:06,368 INFO L290 TraceCheckUtils]: 68: Hoare triple {130529#(= 8656 (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); {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:06,368 INFO L290 TraceCheckUtils]: 69: Hoare triple {130529#(= 8656 (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); {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:06,369 INFO L290 TraceCheckUtils]: 70: Hoare triple {130529#(= 8656 (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); {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:06,369 INFO L290 TraceCheckUtils]: 71: Hoare triple {130529#(= 8656 (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); {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:06,369 INFO L290 TraceCheckUtils]: 72: Hoare triple {130529#(= 8656 (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); {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:06,370 INFO L290 TraceCheckUtils]: 73: Hoare triple {130529#(= 8656 (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); {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:06,370 INFO L290 TraceCheckUtils]: 74: Hoare triple {130529#(= 8656 (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); {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:06,370 INFO L290 TraceCheckUtils]: 75: Hoare triple {130529#(= 8656 (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); {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:06,371 INFO L290 TraceCheckUtils]: 76: Hoare triple {130529#(= 8656 (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); {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:06,371 INFO L290 TraceCheckUtils]: 77: Hoare triple {130529#(= 8656 (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); {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:06,371 INFO L290 TraceCheckUtils]: 78: Hoare triple {130529#(= 8656 (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); {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:06,372 INFO L290 TraceCheckUtils]: 79: Hoare triple {130529#(= 8656 (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); {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:06,372 INFO L290 TraceCheckUtils]: 80: Hoare triple {130529#(= 8656 (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); {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:06,372 INFO L290 TraceCheckUtils]: 81: Hoare triple {130529#(= 8656 (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); {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:06,373 INFO L290 TraceCheckUtils]: 82: Hoare triple {130529#(= 8656 (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); {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:06,373 INFO L290 TraceCheckUtils]: 83: Hoare triple {130529#(= 8656 (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); {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:06,373 INFO L290 TraceCheckUtils]: 84: Hoare triple {130529#(= 8656 (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); {130530#(= |ssl3_accept_#t~mem77| 8656)} is VALID [2022-04-15 11:55:06,374 INFO L290 TraceCheckUtils]: 85: Hoare triple {130530#(= |ssl3_accept_#t~mem77| 8656)} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {130525#false} is VALID [2022-04-15 11:55:06,374 INFO L290 TraceCheckUtils]: 86: Hoare triple {130525#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {130525#false} is VALID [2022-04-15 11:55:06,374 INFO L290 TraceCheckUtils]: 87: Hoare triple {130525#false} assume 8672 == #t~mem79;havoc #t~mem79; {130525#false} is VALID [2022-04-15 11:55:06,374 INFO L290 TraceCheckUtils]: 88: Hoare triple {130525#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {130525#false} is VALID [2022-04-15 11:55:06,374 INFO L290 TraceCheckUtils]: 89: Hoare triple {130525#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {130525#false} is VALID [2022-04-15 11:55:06,374 INFO L290 TraceCheckUtils]: 90: Hoare triple {130525#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); {130525#false} is VALID [2022-04-15 11:55:06,374 INFO L290 TraceCheckUtils]: 91: Hoare triple {130525#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; {130525#false} is VALID [2022-04-15 11:55:06,374 INFO L290 TraceCheckUtils]: 92: Hoare triple {130525#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {130525#false} is VALID [2022-04-15 11:55:06,374 INFO L290 TraceCheckUtils]: 93: Hoare triple {130525#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); {130525#false} is VALID [2022-04-15 11:55:06,374 INFO L290 TraceCheckUtils]: 94: Hoare triple {130525#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {130525#false} is VALID [2022-04-15 11:55:06,375 INFO L290 TraceCheckUtils]: 95: Hoare triple {130525#false} ~skip~0 := 0; {130525#false} is VALID [2022-04-15 11:55:06,375 INFO L290 TraceCheckUtils]: 96: Hoare triple {130525#false} assume !false; {130525#false} is VALID [2022-04-15 11:55:06,375 INFO L290 TraceCheckUtils]: 97: Hoare triple {130525#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); {130525#false} is VALID [2022-04-15 11:55:06,375 INFO L290 TraceCheckUtils]: 98: Hoare triple {130525#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {130525#false} is VALID [2022-04-15 11:55:06,375 INFO L290 TraceCheckUtils]: 99: Hoare triple {130525#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {130525#false} is VALID [2022-04-15 11:55:06,375 INFO L290 TraceCheckUtils]: 100: Hoare triple {130525#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {130525#false} is VALID [2022-04-15 11:55:06,375 INFO L290 TraceCheckUtils]: 101: Hoare triple {130525#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {130525#false} is VALID [2022-04-15 11:55:06,375 INFO L290 TraceCheckUtils]: 102: Hoare triple {130525#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {130525#false} is VALID [2022-04-15 11:55:06,375 INFO L290 TraceCheckUtils]: 103: Hoare triple {130525#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {130525#false} is VALID [2022-04-15 11:55:06,375 INFO L290 TraceCheckUtils]: 104: Hoare triple {130525#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {130525#false} is VALID [2022-04-15 11:55:06,375 INFO L290 TraceCheckUtils]: 105: Hoare triple {130525#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {130525#false} is VALID [2022-04-15 11:55:06,375 INFO L290 TraceCheckUtils]: 106: Hoare triple {130525#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {130525#false} is VALID [2022-04-15 11:55:06,375 INFO L290 TraceCheckUtils]: 107: Hoare triple {130525#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {130525#false} is VALID [2022-04-15 11:55:06,375 INFO L290 TraceCheckUtils]: 108: Hoare triple {130525#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {130525#false} is VALID [2022-04-15 11:55:06,376 INFO L290 TraceCheckUtils]: 109: Hoare triple {130525#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {130525#false} is VALID [2022-04-15 11:55:06,376 INFO L290 TraceCheckUtils]: 110: Hoare triple {130525#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {130525#false} is VALID [2022-04-15 11:55:06,376 INFO L290 TraceCheckUtils]: 111: Hoare triple {130525#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {130525#false} is VALID [2022-04-15 11:55:06,376 INFO L290 TraceCheckUtils]: 112: Hoare triple {130525#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {130525#false} is VALID [2022-04-15 11:55:06,376 INFO L290 TraceCheckUtils]: 113: Hoare triple {130525#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {130525#false} is VALID [2022-04-15 11:55:06,376 INFO L290 TraceCheckUtils]: 114: Hoare triple {130525#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {130525#false} is VALID [2022-04-15 11:55:06,376 INFO L290 TraceCheckUtils]: 115: Hoare triple {130525#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {130525#false} is VALID [2022-04-15 11:55:06,376 INFO L290 TraceCheckUtils]: 116: Hoare triple {130525#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {130525#false} is VALID [2022-04-15 11:55:06,376 INFO L290 TraceCheckUtils]: 117: Hoare triple {130525#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {130525#false} is VALID [2022-04-15 11:55:06,376 INFO L290 TraceCheckUtils]: 118: Hoare triple {130525#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {130525#false} is VALID [2022-04-15 11:55:06,376 INFO L290 TraceCheckUtils]: 119: Hoare triple {130525#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {130525#false} is VALID [2022-04-15 11:55:06,376 INFO L290 TraceCheckUtils]: 120: Hoare triple {130525#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {130525#false} is VALID [2022-04-15 11:55:06,376 INFO L290 TraceCheckUtils]: 121: Hoare triple {130525#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {130525#false} is VALID [2022-04-15 11:55:06,376 INFO L290 TraceCheckUtils]: 122: Hoare triple {130525#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {130525#false} is VALID [2022-04-15 11:55:06,376 INFO L290 TraceCheckUtils]: 123: Hoare triple {130525#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {130525#false} is VALID [2022-04-15 11:55:06,377 INFO L290 TraceCheckUtils]: 124: Hoare triple {130525#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {130525#false} is VALID [2022-04-15 11:55:06,377 INFO L290 TraceCheckUtils]: 125: Hoare triple {130525#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {130525#false} is VALID [2022-04-15 11:55:06,377 INFO L290 TraceCheckUtils]: 126: Hoare triple {130525#false} assume 8640 == #t~mem75;havoc #t~mem75; {130525#false} is VALID [2022-04-15 11:55:06,377 INFO L290 TraceCheckUtils]: 127: Hoare triple {130525#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {130525#false} is VALID [2022-04-15 11:55:06,377 INFO L290 TraceCheckUtils]: 128: Hoare triple {130525#false} assume !(4 == ~blastFlag~0); {130525#false} is VALID [2022-04-15 11:55:06,377 INFO L290 TraceCheckUtils]: 129: Hoare triple {130525#false} assume !(7 == ~blastFlag~0); {130525#false} is VALID [2022-04-15 11:55:06,377 INFO L290 TraceCheckUtils]: 130: Hoare triple {130525#false} assume !(10 == ~blastFlag~0); {130525#false} is VALID [2022-04-15 11:55:06,377 INFO L290 TraceCheckUtils]: 131: Hoare triple {130525#false} assume 13 == ~blastFlag~0; {130525#false} is VALID [2022-04-15 11:55:06,377 INFO L290 TraceCheckUtils]: 132: Hoare triple {130525#false} assume !false; {130525#false} is VALID [2022-04-15 11:55:06,377 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-15 11:55:06,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:55:06,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896832999] [2022-04-15 11:55:06,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896832999] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:55:06,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:55:06,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:55:06,378 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:55:06,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1600056824] [2022-04-15 11:55:06,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1600056824] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:55:06,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:55:06,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:55:06,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806196254] [2022-04-15 11:55:06,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:55:06,379 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 1 states have call successors, (3), 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 133 [2022-04-15 11:55:06,379 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:55:06,379 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:55:06,458 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:55:06,459 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:55:06,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:55:06,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:55:06,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:55:06,459 INFO L87 Difference]: Start difference. First operand 1024 states and 1577 transitions. Second operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:55:09,789 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:55:22,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:55:22,684 INFO L93 Difference]: Finished difference Result 2240 states and 3442 transitions. [2022-04-15 11:55:22,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:55:22,685 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 1 states have call successors, (3), 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 133 [2022-04-15 11:55:22,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:55:22,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:55:22,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 536 transitions. [2022-04-15 11:55:22,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:55:22,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 536 transitions. [2022-04-15 11:55:22,689 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 536 transitions. [2022-04-15 11:55:23,038 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 536 edges. 536 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:55:23,093 INFO L225 Difference]: With dead ends: 2240 [2022-04-15 11:55:23,093 INFO L226 Difference]: Without dead ends: 1242 [2022-04-15 11:55:23,094 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-15 11:55:23,094 INFO L913 BasicCegarLoop]: 264 mSDtfsCounter, 53 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:55:23,094 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 649 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2022-04-15 11:55:23,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2022-04-15 11:55:23,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 1153. [2022-04-15 11:55:23,181 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:55:23,182 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1242 states. Second operand has 1153 states, 1148 states have (on average 1.5426829268292683) internal successors, (1771), 1148 states have internal predecessors, (1771), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:55:23,183 INFO L74 IsIncluded]: Start isIncluded. First operand 1242 states. Second operand has 1153 states, 1148 states have (on average 1.5426829268292683) internal successors, (1771), 1148 states have internal predecessors, (1771), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:55:23,184 INFO L87 Difference]: Start difference. First operand 1242 states. Second operand has 1153 states, 1148 states have (on average 1.5426829268292683) internal successors, (1771), 1148 states have internal predecessors, (1771), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:55:23,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:55:23,223 INFO L93 Difference]: Finished difference Result 1242 states and 1893 transitions. [2022-04-15 11:55:23,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1242 states and 1893 transitions. [2022-04-15 11:55:23,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:55:23,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:55:23,225 INFO L74 IsIncluded]: Start isIncluded. First operand has 1153 states, 1148 states have (on average 1.5426829268292683) internal successors, (1771), 1148 states have internal predecessors, (1771), 3 states have call successors, (3), 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 1242 states. [2022-04-15 11:55:23,225 INFO L87 Difference]: Start difference. First operand has 1153 states, 1148 states have (on average 1.5426829268292683) internal successors, (1771), 1148 states have internal predecessors, (1771), 3 states have call successors, (3), 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 1242 states. [2022-04-15 11:55:23,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:55:23,265 INFO L93 Difference]: Finished difference Result 1242 states and 1893 transitions. [2022-04-15 11:55:23,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1242 states and 1893 transitions. [2022-04-15 11:55:23,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:55:23,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:55:23,266 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:55:23,266 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:55:23,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1153 states, 1148 states have (on average 1.5426829268292683) internal successors, (1771), 1148 states have internal predecessors, (1771), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:55:23,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 1775 transitions. [2022-04-15 11:55:23,319 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 1775 transitions. Word has length 133 [2022-04-15 11:55:23,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:55:23,319 INFO L478 AbstractCegarLoop]: Abstraction has 1153 states and 1775 transitions. [2022-04-15 11:55:23,320 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:55:23,320 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1153 states and 1775 transitions. [2022-04-15 11:55:27,611 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1775 edges. 1774 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:55:27,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1775 transitions. [2022-04-15 11:55:27,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-04-15 11:55:27,613 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:55:27,613 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, 1] [2022-04-15 11:55:27,613 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-04-15 11:55:27,613 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:55:27,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:55:27,613 INFO L85 PathProgramCache]: Analyzing trace with hash -880857756, now seen corresponding path program 1 times [2022-04-15 11:55:27,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:55:27,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [554056960] [2022-04-15 11:55:27,697 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:55:27,697 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:55:27,697 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:55:27,697 INFO L85 PathProgramCache]: Analyzing trace with hash -880857756, now seen corresponding path program 2 times [2022-04-15 11:55:27,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:55:27,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797794752] [2022-04-15 11:55:27,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:55:27,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:55:27,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:55:27,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:55:27,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:55:27,929 INFO L290 TraceCheckUtils]: 0: Hoare triple {139813#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {139806#true} is VALID [2022-04-15 11:55:27,929 INFO L290 TraceCheckUtils]: 1: Hoare triple {139806#true} assume true; {139806#true} is VALID [2022-04-15 11:55:27,929 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {139806#true} {139806#true} #708#return; {139806#true} is VALID [2022-04-15 11:55:27,930 INFO L272 TraceCheckUtils]: 0: Hoare triple {139806#true} call ULTIMATE.init(); {139813#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:55:27,930 INFO L290 TraceCheckUtils]: 1: Hoare triple {139813#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {139806#true} is VALID [2022-04-15 11:55:27,930 INFO L290 TraceCheckUtils]: 2: Hoare triple {139806#true} assume true; {139806#true} is VALID [2022-04-15 11:55:27,930 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {139806#true} {139806#true} #708#return; {139806#true} is VALID [2022-04-15 11:55:27,930 INFO L272 TraceCheckUtils]: 4: Hoare triple {139806#true} call #t~ret161 := main(); {139806#true} is VALID [2022-04-15 11:55:27,930 INFO L290 TraceCheckUtils]: 5: Hoare triple {139806#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; {139806#true} is VALID [2022-04-15 11:55:27,931 INFO L290 TraceCheckUtils]: 6: Hoare triple {139806#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {139806#true} is VALID [2022-04-15 11:55:27,931 INFO L272 TraceCheckUtils]: 7: Hoare triple {139806#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {139806#true} is VALID [2022-04-15 11:55:27,931 INFO L290 TraceCheckUtils]: 8: Hoare triple {139806#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); {139806#true} is VALID [2022-04-15 11:55:27,931 INFO L290 TraceCheckUtils]: 9: Hoare triple {139806#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; {139806#true} is VALID [2022-04-15 11:55:27,931 INFO L290 TraceCheckUtils]: 10: Hoare triple {139806#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; {139806#true} is VALID [2022-04-15 11:55:27,931 INFO L290 TraceCheckUtils]: 11: Hoare triple {139806#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {139806#true} is VALID [2022-04-15 11:55:27,931 INFO L290 TraceCheckUtils]: 12: Hoare triple {139806#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {139806#true} is VALID [2022-04-15 11:55:27,931 INFO L290 TraceCheckUtils]: 13: Hoare triple {139806#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {139806#true} is VALID [2022-04-15 11:55:27,931 INFO L290 TraceCheckUtils]: 14: Hoare triple {139806#true} assume !false; {139806#true} is VALID [2022-04-15 11:55:27,931 INFO L290 TraceCheckUtils]: 15: Hoare triple {139806#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); {139806#true} is VALID [2022-04-15 11:55:27,931 INFO L290 TraceCheckUtils]: 16: Hoare triple {139806#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {139806#true} is VALID [2022-04-15 11:55:27,931 INFO L290 TraceCheckUtils]: 17: Hoare triple {139806#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {139806#true} is VALID [2022-04-15 11:55:27,931 INFO L290 TraceCheckUtils]: 18: Hoare triple {139806#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {139806#true} is VALID [2022-04-15 11:55:27,931 INFO L290 TraceCheckUtils]: 19: Hoare triple {139806#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {139806#true} is VALID [2022-04-15 11:55:27,931 INFO L290 TraceCheckUtils]: 20: Hoare triple {139806#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {139806#true} is VALID [2022-04-15 11:55:27,932 INFO L290 TraceCheckUtils]: 21: Hoare triple {139806#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {139806#true} is VALID [2022-04-15 11:55:27,932 INFO L290 TraceCheckUtils]: 22: Hoare triple {139806#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {139806#true} is VALID [2022-04-15 11:55:27,932 INFO L290 TraceCheckUtils]: 23: Hoare triple {139806#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {139806#true} is VALID [2022-04-15 11:55:27,932 INFO L290 TraceCheckUtils]: 24: Hoare triple {139806#true} assume 8464 == #t~mem55;havoc #t~mem55; {139806#true} is VALID [2022-04-15 11:55:27,932 INFO L290 TraceCheckUtils]: 25: Hoare triple {139806#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; {139806#true} is VALID [2022-04-15 11:55:27,932 INFO L290 TraceCheckUtils]: 26: Hoare triple {139806#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {139806#true} is VALID [2022-04-15 11:55:27,932 INFO L290 TraceCheckUtils]: 27: Hoare triple {139806#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); {139806#true} is VALID [2022-04-15 11:55:27,932 INFO L290 TraceCheckUtils]: 28: Hoare triple {139806#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); {139806#true} is VALID [2022-04-15 11:55:27,932 INFO L290 TraceCheckUtils]: 29: Hoare triple {139806#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {139806#true} is VALID [2022-04-15 11:55:27,932 INFO L290 TraceCheckUtils]: 30: Hoare triple {139806#true} ~skip~0 := 0; {139806#true} is VALID [2022-04-15 11:55:27,932 INFO L290 TraceCheckUtils]: 31: Hoare triple {139806#true} assume !false; {139806#true} is VALID [2022-04-15 11:55:27,932 INFO L290 TraceCheckUtils]: 32: Hoare triple {139806#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); {139806#true} is VALID [2022-04-15 11:55:27,932 INFO L290 TraceCheckUtils]: 33: Hoare triple {139806#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {139806#true} is VALID [2022-04-15 11:55:27,932 INFO L290 TraceCheckUtils]: 34: Hoare triple {139806#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {139806#true} is VALID [2022-04-15 11:55:27,932 INFO L290 TraceCheckUtils]: 35: Hoare triple {139806#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {139806#true} is VALID [2022-04-15 11:55:27,933 INFO L290 TraceCheckUtils]: 36: Hoare triple {139806#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {139806#true} is VALID [2022-04-15 11:55:27,933 INFO L290 TraceCheckUtils]: 37: Hoare triple {139806#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {139806#true} is VALID [2022-04-15 11:55:27,933 INFO L290 TraceCheckUtils]: 38: Hoare triple {139806#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {139806#true} is VALID [2022-04-15 11:55:27,933 INFO L290 TraceCheckUtils]: 39: Hoare triple {139806#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {139806#true} is VALID [2022-04-15 11:55:27,933 INFO L290 TraceCheckUtils]: 40: Hoare triple {139806#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {139806#true} is VALID [2022-04-15 11:55:27,933 INFO L290 TraceCheckUtils]: 41: Hoare triple {139806#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {139806#true} is VALID [2022-04-15 11:55:27,933 INFO L290 TraceCheckUtils]: 42: Hoare triple {139806#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {139806#true} is VALID [2022-04-15 11:55:27,933 INFO L290 TraceCheckUtils]: 43: Hoare triple {139806#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {139806#true} is VALID [2022-04-15 11:55:27,933 INFO L290 TraceCheckUtils]: 44: Hoare triple {139806#true} assume 8496 == #t~mem58;havoc #t~mem58; {139806#true} is VALID [2022-04-15 11:55:27,933 INFO L290 TraceCheckUtils]: 45: Hoare triple {139806#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {139806#true} is VALID [2022-04-15 11:55:27,933 INFO L290 TraceCheckUtils]: 46: Hoare triple {139806#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {139806#true} is VALID [2022-04-15 11:55:27,933 INFO L290 TraceCheckUtils]: 47: Hoare triple {139806#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {139806#true} is VALID [2022-04-15 11:55:27,934 INFO L290 TraceCheckUtils]: 48: Hoare triple {139806#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {139811#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:55:27,935 INFO L290 TraceCheckUtils]: 49: Hoare triple {139811#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {139811#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:55:27,935 INFO L290 TraceCheckUtils]: 50: Hoare triple {139811#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} 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); {139811#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:55:27,936 INFO L290 TraceCheckUtils]: 51: Hoare triple {139811#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {139811#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:55:27,936 INFO L290 TraceCheckUtils]: 52: Hoare triple {139811#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} ~skip~0 := 0; {139811#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:55:27,936 INFO L290 TraceCheckUtils]: 53: Hoare triple {139811#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !false; {139811#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:55:27,937 INFO L290 TraceCheckUtils]: 54: Hoare triple {139811#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} 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); {139811#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:55:27,937 INFO L290 TraceCheckUtils]: 55: Hoare triple {139811#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {139811#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:55:27,937 INFO L290 TraceCheckUtils]: 56: Hoare triple {139811#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {139811#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:55:27,938 INFO L290 TraceCheckUtils]: 57: Hoare triple {139811#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {139811#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:55:27,938 INFO L290 TraceCheckUtils]: 58: Hoare triple {139811#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {139811#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:55:27,938 INFO L290 TraceCheckUtils]: 59: Hoare triple {139811#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {139811#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:55:27,939 INFO L290 TraceCheckUtils]: 60: Hoare triple {139811#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {139811#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:55:27,939 INFO L290 TraceCheckUtils]: 61: Hoare triple {139811#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {139811#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:55:27,939 INFO L290 TraceCheckUtils]: 62: Hoare triple {139811#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {139811#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:55:27,940 INFO L290 TraceCheckUtils]: 63: Hoare triple {139811#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {139811#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:55:27,940 INFO L290 TraceCheckUtils]: 64: Hoare triple {139811#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {139811#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:55:27,940 INFO L290 TraceCheckUtils]: 65: Hoare triple {139811#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {139811#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:55:27,941 INFO L290 TraceCheckUtils]: 66: Hoare triple {139811#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {139811#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:55:27,941 INFO L290 TraceCheckUtils]: 67: Hoare triple {139811#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {139812#(= |ssl3_accept_#t~mem60| 8512)} is VALID [2022-04-15 11:55:27,941 INFO L290 TraceCheckUtils]: 68: Hoare triple {139812#(= |ssl3_accept_#t~mem60| 8512)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-15 11:55:27,942 INFO L290 TraceCheckUtils]: 69: Hoare triple {139807#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-15 11:55:27,942 INFO L290 TraceCheckUtils]: 70: Hoare triple {139807#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-15 11:55:27,942 INFO L290 TraceCheckUtils]: 71: Hoare triple {139807#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-15 11:55:27,942 INFO L290 TraceCheckUtils]: 72: Hoare triple {139807#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-15 11:55:27,942 INFO L290 TraceCheckUtils]: 73: Hoare triple {139807#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-15 11:55:27,942 INFO L290 TraceCheckUtils]: 74: Hoare triple {139807#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-15 11:55:27,942 INFO L290 TraceCheckUtils]: 75: Hoare triple {139807#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-15 11:55:27,942 INFO L290 TraceCheckUtils]: 76: Hoare triple {139807#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-15 11:55:27,942 INFO L290 TraceCheckUtils]: 77: Hoare triple {139807#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-15 11:55:27,942 INFO L290 TraceCheckUtils]: 78: Hoare triple {139807#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-15 11:55:27,942 INFO L290 TraceCheckUtils]: 79: Hoare triple {139807#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-15 11:55:27,942 INFO L290 TraceCheckUtils]: 80: Hoare triple {139807#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-15 11:55:27,942 INFO L290 TraceCheckUtils]: 81: Hoare triple {139807#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-15 11:55:27,942 INFO L290 TraceCheckUtils]: 82: Hoare triple {139807#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-15 11:55:27,943 INFO L290 TraceCheckUtils]: 83: Hoare triple {139807#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-15 11:55:27,943 INFO L290 TraceCheckUtils]: 84: Hoare triple {139807#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-15 11:55:27,943 INFO L290 TraceCheckUtils]: 85: Hoare triple {139807#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-15 11:55:27,943 INFO L290 TraceCheckUtils]: 86: Hoare triple {139807#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-15 11:55:27,943 INFO L290 TraceCheckUtils]: 87: Hoare triple {139807#false} assume 8672 == #t~mem79;havoc #t~mem79; {139807#false} is VALID [2022-04-15 11:55:27,943 INFO L290 TraceCheckUtils]: 88: Hoare triple {139807#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {139807#false} is VALID [2022-04-15 11:55:27,943 INFO L290 TraceCheckUtils]: 89: Hoare triple {139807#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {139807#false} is VALID [2022-04-15 11:55:27,943 INFO L290 TraceCheckUtils]: 90: Hoare triple {139807#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); {139807#false} is VALID [2022-04-15 11:55:27,943 INFO L290 TraceCheckUtils]: 91: Hoare triple {139807#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; {139807#false} is VALID [2022-04-15 11:55:27,943 INFO L290 TraceCheckUtils]: 92: Hoare triple {139807#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {139807#false} is VALID [2022-04-15 11:55:27,944 INFO L290 TraceCheckUtils]: 93: Hoare triple {139807#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); {139807#false} is VALID [2022-04-15 11:55:27,944 INFO L290 TraceCheckUtils]: 94: Hoare triple {139807#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {139807#false} is VALID [2022-04-15 11:55:27,944 INFO L290 TraceCheckUtils]: 95: Hoare triple {139807#false} ~skip~0 := 0; {139807#false} is VALID [2022-04-15 11:55:27,944 INFO L290 TraceCheckUtils]: 96: Hoare triple {139807#false} assume !false; {139807#false} is VALID [2022-04-15 11:55:27,944 INFO L290 TraceCheckUtils]: 97: Hoare triple {139807#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); {139807#false} is VALID [2022-04-15 11:55:27,944 INFO L290 TraceCheckUtils]: 98: Hoare triple {139807#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-15 11:55:27,944 INFO L290 TraceCheckUtils]: 99: Hoare triple {139807#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-15 11:55:27,944 INFO L290 TraceCheckUtils]: 100: Hoare triple {139807#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-15 11:55:27,944 INFO L290 TraceCheckUtils]: 101: Hoare triple {139807#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-15 11:55:27,944 INFO L290 TraceCheckUtils]: 102: Hoare triple {139807#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-15 11:55:27,944 INFO L290 TraceCheckUtils]: 103: Hoare triple {139807#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-15 11:55:27,945 INFO L290 TraceCheckUtils]: 104: Hoare triple {139807#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-15 11:55:27,945 INFO L290 TraceCheckUtils]: 105: Hoare triple {139807#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-15 11:55:27,945 INFO L290 TraceCheckUtils]: 106: Hoare triple {139807#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-15 11:55:27,945 INFO L290 TraceCheckUtils]: 107: Hoare triple {139807#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-15 11:55:27,945 INFO L290 TraceCheckUtils]: 108: Hoare triple {139807#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-15 11:55:27,945 INFO L290 TraceCheckUtils]: 109: Hoare triple {139807#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-15 11:55:27,945 INFO L290 TraceCheckUtils]: 110: Hoare triple {139807#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-15 11:55:27,945 INFO L290 TraceCheckUtils]: 111: Hoare triple {139807#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-15 11:55:27,945 INFO L290 TraceCheckUtils]: 112: Hoare triple {139807#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-15 11:55:27,945 INFO L290 TraceCheckUtils]: 113: Hoare triple {139807#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-15 11:55:27,946 INFO L290 TraceCheckUtils]: 114: Hoare triple {139807#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-15 11:55:27,946 INFO L290 TraceCheckUtils]: 115: Hoare triple {139807#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-15 11:55:27,946 INFO L290 TraceCheckUtils]: 116: Hoare triple {139807#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-15 11:55:27,946 INFO L290 TraceCheckUtils]: 117: Hoare triple {139807#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-15 11:55:27,946 INFO L290 TraceCheckUtils]: 118: Hoare triple {139807#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-15 11:55:27,946 INFO L290 TraceCheckUtils]: 119: Hoare triple {139807#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-15 11:55:27,946 INFO L290 TraceCheckUtils]: 120: Hoare triple {139807#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-15 11:55:27,946 INFO L290 TraceCheckUtils]: 121: Hoare triple {139807#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-15 11:55:27,946 INFO L290 TraceCheckUtils]: 122: Hoare triple {139807#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-15 11:55:27,946 INFO L290 TraceCheckUtils]: 123: Hoare triple {139807#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-15 11:55:27,947 INFO L290 TraceCheckUtils]: 124: Hoare triple {139807#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-15 11:55:27,947 INFO L290 TraceCheckUtils]: 125: Hoare triple {139807#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-15 11:55:27,947 INFO L290 TraceCheckUtils]: 126: Hoare triple {139807#false} assume 8640 == #t~mem75;havoc #t~mem75; {139807#false} is VALID [2022-04-15 11:55:27,947 INFO L290 TraceCheckUtils]: 127: Hoare triple {139807#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {139807#false} is VALID [2022-04-15 11:55:27,947 INFO L290 TraceCheckUtils]: 128: Hoare triple {139807#false} assume !(4 == ~blastFlag~0); {139807#false} is VALID [2022-04-15 11:55:27,947 INFO L290 TraceCheckUtils]: 129: Hoare triple {139807#false} assume !(7 == ~blastFlag~0); {139807#false} is VALID [2022-04-15 11:55:27,947 INFO L290 TraceCheckUtils]: 130: Hoare triple {139807#false} assume !(10 == ~blastFlag~0); {139807#false} is VALID [2022-04-15 11:55:27,947 INFO L290 TraceCheckUtils]: 131: Hoare triple {139807#false} assume 13 == ~blastFlag~0; {139807#false} is VALID [2022-04-15 11:55:27,947 INFO L290 TraceCheckUtils]: 132: Hoare triple {139807#false} assume !false; {139807#false} is VALID [2022-04-15 11:55:27,948 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-15 11:55:27,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:55:27,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797794752] [2022-04-15 11:55:27,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797794752] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:55:27,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:55:27,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:55:27,949 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:55:27,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [554056960] [2022-04-15 11:55:27,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [554056960] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:55:27,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:55:27,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:55:27,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334714841] [2022-04-15 11:55:27,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:55:27,949 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 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 133 [2022-04-15 11:55:27,950 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:55:27,950 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:55:28,026 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:55:28,026 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:55:28,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:55:28,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:55:28,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:55:28,027 INFO L87 Difference]: Start difference. First operand 1153 states and 1775 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:55:31,328 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-15 11:55:33,334 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-15 11:55:44,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:55:44,884 INFO L93 Difference]: Finished difference Result 2384 states and 3667 transitions. [2022-04-15 11:55:44,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:55:44,885 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 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 133 [2022-04-15 11:55:44,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:55:44,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:55:44,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 480 transitions. [2022-04-15 11:55:44,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:55:44,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 480 transitions. [2022-04-15 11:55:44,889 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 480 transitions. [2022-04-15 11:55:45,202 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 480 edges. 480 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:55:45,258 INFO L225 Difference]: With dead ends: 2384 [2022-04-15 11:55:45,258 INFO L226 Difference]: Without dead ends: 1257 [2022-04-15 11:55:45,259 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-15 11:55:45,260 INFO L913 BasicCegarLoop]: 244 mSDtfsCounter, 26 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:55:45,260 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 609 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 437 Invalid, 1 Unknown, 0 Unchecked, 6.4s Time] [2022-04-15 11:55:45,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2022-04-15 11:55:45,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 1225. [2022-04-15 11:55:45,352 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:55:45,353 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1257 states. Second operand has 1225 states, 1220 states have (on average 1.5377049180327869) internal successors, (1876), 1220 states have internal predecessors, (1876), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:55:45,354 INFO L74 IsIncluded]: Start isIncluded. First operand 1257 states. Second operand has 1225 states, 1220 states have (on average 1.5377049180327869) internal successors, (1876), 1220 states have internal predecessors, (1876), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:55:45,354 INFO L87 Difference]: Start difference. First operand 1257 states. Second operand has 1225 states, 1220 states have (on average 1.5377049180327869) internal successors, (1876), 1220 states have internal predecessors, (1876), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:55:45,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:55:45,395 INFO L93 Difference]: Finished difference Result 1257 states and 1920 transitions. [2022-04-15 11:55:45,395 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 1920 transitions. [2022-04-15 11:55:45,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:55:45,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:55:45,397 INFO L74 IsIncluded]: Start isIncluded. First operand has 1225 states, 1220 states have (on average 1.5377049180327869) internal successors, (1876), 1220 states have internal predecessors, (1876), 3 states have call successors, (3), 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 1257 states. [2022-04-15 11:55:45,398 INFO L87 Difference]: Start difference. First operand has 1225 states, 1220 states have (on average 1.5377049180327869) internal successors, (1876), 1220 states have internal predecessors, (1876), 3 states have call successors, (3), 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 1257 states. [2022-04-15 11:55:45,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:55:45,438 INFO L93 Difference]: Finished difference Result 1257 states and 1920 transitions. [2022-04-15 11:55:45,438 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 1920 transitions. [2022-04-15 11:55:45,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:55:45,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:55:45,439 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:55:45,440 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:55:45,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 1220 states have (on average 1.5377049180327869) internal successors, (1876), 1220 states have internal predecessors, (1876), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:55:45,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1880 transitions. [2022-04-15 11:55:45,499 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1880 transitions. Word has length 133 [2022-04-15 11:55:45,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:55:45,499 INFO L478 AbstractCegarLoop]: Abstraction has 1225 states and 1880 transitions. [2022-04-15 11:55:45,499 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:55:45,499 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1225 states and 1880 transitions. [2022-04-15 11:55:49,897 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1880 edges. 1879 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:55:49,897 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1880 transitions. [2022-04-15 11:55:49,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-04-15 11:55:49,899 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:55:49,899 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-04-15 11:55:49,899 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-04-15 11:55:49,900 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:55:49,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:55:49,900 INFO L85 PathProgramCache]: Analyzing trace with hash 403795998, now seen corresponding path program 1 times [2022-04-15 11:55:49,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:55:49,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1602442453] [2022-04-15 11:55:49,989 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:55:49,989 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:55:49,989 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:55:49,989 INFO L85 PathProgramCache]: Analyzing trace with hash 403795998, now seen corresponding path program 2 times [2022-04-15 11:55:49,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:55:49,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782266470] [2022-04-15 11:55:49,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:55:49,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:55:50,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:55:50,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:55:50,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:55:50,228 INFO L290 TraceCheckUtils]: 0: Hoare triple {149557#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {149550#true} is VALID [2022-04-15 11:55:50,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {149550#true} assume true; {149550#true} is VALID [2022-04-15 11:55:50,228 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {149550#true} {149550#true} #708#return; {149550#true} is VALID [2022-04-15 11:55:50,229 INFO L272 TraceCheckUtils]: 0: Hoare triple {149550#true} call ULTIMATE.init(); {149557#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:55:50,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {149557#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {149550#true} is VALID [2022-04-15 11:55:50,229 INFO L290 TraceCheckUtils]: 2: Hoare triple {149550#true} assume true; {149550#true} is VALID [2022-04-15 11:55:50,229 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {149550#true} {149550#true} #708#return; {149550#true} is VALID [2022-04-15 11:55:50,229 INFO L272 TraceCheckUtils]: 4: Hoare triple {149550#true} call #t~ret161 := main(); {149550#true} is VALID [2022-04-15 11:55:50,229 INFO L290 TraceCheckUtils]: 5: Hoare triple {149550#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; {149550#true} is VALID [2022-04-15 11:55:50,230 INFO L290 TraceCheckUtils]: 6: Hoare triple {149550#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {149550#true} is VALID [2022-04-15 11:55:50,230 INFO L272 TraceCheckUtils]: 7: Hoare triple {149550#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {149550#true} is VALID [2022-04-15 11:55:50,230 INFO L290 TraceCheckUtils]: 8: Hoare triple {149550#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); {149550#true} is VALID [2022-04-15 11:55:50,230 INFO L290 TraceCheckUtils]: 9: Hoare triple {149550#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; {149550#true} is VALID [2022-04-15 11:55:50,230 INFO L290 TraceCheckUtils]: 10: Hoare triple {149550#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; {149550#true} is VALID [2022-04-15 11:55:50,230 INFO L290 TraceCheckUtils]: 11: Hoare triple {149550#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {149550#true} is VALID [2022-04-15 11:55:50,230 INFO L290 TraceCheckUtils]: 12: Hoare triple {149550#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {149550#true} is VALID [2022-04-15 11:55:50,230 INFO L290 TraceCheckUtils]: 13: Hoare triple {149550#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {149550#true} is VALID [2022-04-15 11:55:50,230 INFO L290 TraceCheckUtils]: 14: Hoare triple {149550#true} assume !false; {149550#true} is VALID [2022-04-15 11:55:50,230 INFO L290 TraceCheckUtils]: 15: Hoare triple {149550#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); {149550#true} is VALID [2022-04-15 11:55:50,230 INFO L290 TraceCheckUtils]: 16: Hoare triple {149550#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {149550#true} is VALID [2022-04-15 11:55:50,230 INFO L290 TraceCheckUtils]: 17: Hoare triple {149550#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {149550#true} is VALID [2022-04-15 11:55:50,230 INFO L290 TraceCheckUtils]: 18: Hoare triple {149550#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {149550#true} is VALID [2022-04-15 11:55:50,230 INFO L290 TraceCheckUtils]: 19: Hoare triple {149550#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {149550#true} is VALID [2022-04-15 11:55:50,231 INFO L290 TraceCheckUtils]: 20: Hoare triple {149550#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {149550#true} is VALID [2022-04-15 11:55:50,231 INFO L290 TraceCheckUtils]: 21: Hoare triple {149550#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {149550#true} is VALID [2022-04-15 11:55:50,231 INFO L290 TraceCheckUtils]: 22: Hoare triple {149550#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {149550#true} is VALID [2022-04-15 11:55:50,231 INFO L290 TraceCheckUtils]: 23: Hoare triple {149550#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {149550#true} is VALID [2022-04-15 11:55:50,231 INFO L290 TraceCheckUtils]: 24: Hoare triple {149550#true} assume 8464 == #t~mem55;havoc #t~mem55; {149550#true} is VALID [2022-04-15 11:55:50,231 INFO L290 TraceCheckUtils]: 25: Hoare triple {149550#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; {149550#true} is VALID [2022-04-15 11:55:50,231 INFO L290 TraceCheckUtils]: 26: Hoare triple {149550#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {149550#true} is VALID [2022-04-15 11:55:50,231 INFO L290 TraceCheckUtils]: 27: Hoare triple {149550#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); {149550#true} is VALID [2022-04-15 11:55:50,231 INFO L290 TraceCheckUtils]: 28: Hoare triple {149550#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); {149550#true} is VALID [2022-04-15 11:55:50,231 INFO L290 TraceCheckUtils]: 29: Hoare triple {149550#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {149550#true} is VALID [2022-04-15 11:55:50,231 INFO L290 TraceCheckUtils]: 30: Hoare triple {149550#true} ~skip~0 := 0; {149550#true} is VALID [2022-04-15 11:55:50,231 INFO L290 TraceCheckUtils]: 31: Hoare triple {149550#true} assume !false; {149550#true} is VALID [2022-04-15 11:55:50,231 INFO L290 TraceCheckUtils]: 32: Hoare triple {149550#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); {149550#true} is VALID [2022-04-15 11:55:50,231 INFO L290 TraceCheckUtils]: 33: Hoare triple {149550#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {149550#true} is VALID [2022-04-15 11:55:50,232 INFO L290 TraceCheckUtils]: 34: Hoare triple {149550#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {149550#true} is VALID [2022-04-15 11:55:50,232 INFO L290 TraceCheckUtils]: 35: Hoare triple {149550#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {149550#true} is VALID [2022-04-15 11:55:50,232 INFO L290 TraceCheckUtils]: 36: Hoare triple {149550#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {149550#true} is VALID [2022-04-15 11:55:50,232 INFO L290 TraceCheckUtils]: 37: Hoare triple {149550#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {149550#true} is VALID [2022-04-15 11:55:50,232 INFO L290 TraceCheckUtils]: 38: Hoare triple {149550#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {149550#true} is VALID [2022-04-15 11:55:50,232 INFO L290 TraceCheckUtils]: 39: Hoare triple {149550#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {149550#true} is VALID [2022-04-15 11:55:50,232 INFO L290 TraceCheckUtils]: 40: Hoare triple {149550#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {149550#true} is VALID [2022-04-15 11:55:50,232 INFO L290 TraceCheckUtils]: 41: Hoare triple {149550#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {149550#true} is VALID [2022-04-15 11:55:50,232 INFO L290 TraceCheckUtils]: 42: Hoare triple {149550#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {149550#true} is VALID [2022-04-15 11:55:50,232 INFO L290 TraceCheckUtils]: 43: Hoare triple {149550#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {149550#true} is VALID [2022-04-15 11:55:50,232 INFO L290 TraceCheckUtils]: 44: Hoare triple {149550#true} assume 8496 == #t~mem58;havoc #t~mem58; {149550#true} is VALID [2022-04-15 11:55:50,232 INFO L290 TraceCheckUtils]: 45: Hoare triple {149550#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {149550#true} is VALID [2022-04-15 11:55:50,232 INFO L290 TraceCheckUtils]: 46: Hoare triple {149550#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {149550#true} is VALID [2022-04-15 11:55:50,232 INFO L290 TraceCheckUtils]: 47: Hoare triple {149550#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {149550#true} is VALID [2022-04-15 11:55:50,240 INFO L290 TraceCheckUtils]: 48: Hoare triple {149550#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {149555#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:50,241 INFO L290 TraceCheckUtils]: 49: Hoare triple {149555#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {149555#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:50,241 INFO L290 TraceCheckUtils]: 50: Hoare triple {149555#(= 8656 (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); {149555#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:50,242 INFO L290 TraceCheckUtils]: 51: Hoare triple {149555#(= 8656 (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; {149555#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:50,242 INFO L290 TraceCheckUtils]: 52: Hoare triple {149555#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {149555#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:50,242 INFO L290 TraceCheckUtils]: 53: Hoare triple {149555#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {149555#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:50,243 INFO L290 TraceCheckUtils]: 54: Hoare triple {149555#(= 8656 (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); {149555#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:50,243 INFO L290 TraceCheckUtils]: 55: Hoare triple {149555#(= 8656 (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); {149555#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:50,244 INFO L290 TraceCheckUtils]: 56: Hoare triple {149555#(= 8656 (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); {149555#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:50,244 INFO L290 TraceCheckUtils]: 57: Hoare triple {149555#(= 8656 (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); {149555#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:50,245 INFO L290 TraceCheckUtils]: 58: Hoare triple {149555#(= 8656 (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); {149555#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:50,245 INFO L290 TraceCheckUtils]: 59: Hoare triple {149555#(= 8656 (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); {149555#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:50,246 INFO L290 TraceCheckUtils]: 60: Hoare triple {149555#(= 8656 (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); {149555#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:50,246 INFO L290 TraceCheckUtils]: 61: Hoare triple {149555#(= 8656 (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); {149555#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:50,247 INFO L290 TraceCheckUtils]: 62: Hoare triple {149555#(= 8656 (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); {149555#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:50,247 INFO L290 TraceCheckUtils]: 63: Hoare triple {149555#(= 8656 (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); {149555#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:50,248 INFO L290 TraceCheckUtils]: 64: Hoare triple {149555#(= 8656 (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); {149555#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:50,248 INFO L290 TraceCheckUtils]: 65: Hoare triple {149555#(= 8656 (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); {149555#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:50,249 INFO L290 TraceCheckUtils]: 66: Hoare triple {149555#(= 8656 (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); {149555#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:50,249 INFO L290 TraceCheckUtils]: 67: Hoare triple {149555#(= 8656 (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); {149555#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:50,250 INFO L290 TraceCheckUtils]: 68: Hoare triple {149555#(= 8656 (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); {149555#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:50,250 INFO L290 TraceCheckUtils]: 69: Hoare triple {149555#(= 8656 (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); {149555#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:50,251 INFO L290 TraceCheckUtils]: 70: Hoare triple {149555#(= 8656 (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); {149555#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:50,251 INFO L290 TraceCheckUtils]: 71: Hoare triple {149555#(= 8656 (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); {149555#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:50,252 INFO L290 TraceCheckUtils]: 72: Hoare triple {149555#(= 8656 (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); {149555#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:50,252 INFO L290 TraceCheckUtils]: 73: Hoare triple {149555#(= 8656 (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); {149556#(= |ssl3_accept_#t~mem66| 8656)} is VALID [2022-04-15 11:55:50,253 INFO L290 TraceCheckUtils]: 74: Hoare triple {149556#(= |ssl3_accept_#t~mem66| 8656)} assume 8560 == #t~mem66;havoc #t~mem66; {149551#false} is VALID [2022-04-15 11:55:50,253 INFO L290 TraceCheckUtils]: 75: Hoare triple {149551#false} assume -2147483648 <= #t~nondet130 && #t~nondet130 <= 2147483647;~ret~0 := #t~nondet130;havoc #t~nondet130; {149551#false} is VALID [2022-04-15 11:55:50,253 INFO L290 TraceCheckUtils]: 76: Hoare triple {149551#false} assume !(~ret~0 <= 0);call #t~mem131.base, #t~mem131.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8576, #t~mem131.base, 844 + #t~mem131.offset, 4);havoc #t~mem131.base, #t~mem131.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {149551#false} is VALID [2022-04-15 11:55:50,253 INFO L290 TraceCheckUtils]: 77: Hoare triple {149551#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); {149551#false} is VALID [2022-04-15 11:55:50,253 INFO L290 TraceCheckUtils]: 78: Hoare triple {149551#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {149551#false} is VALID [2022-04-15 11:55:50,253 INFO L290 TraceCheckUtils]: 79: Hoare triple {149551#false} ~skip~0 := 0; {149551#false} is VALID [2022-04-15 11:55:50,253 INFO L290 TraceCheckUtils]: 80: Hoare triple {149551#false} assume !false; {149551#false} is VALID [2022-04-15 11:55:50,254 INFO L290 TraceCheckUtils]: 81: Hoare triple {149551#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); {149551#false} is VALID [2022-04-15 11:55:50,254 INFO L290 TraceCheckUtils]: 82: Hoare triple {149551#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-15 11:55:50,254 INFO L290 TraceCheckUtils]: 83: Hoare triple {149551#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-15 11:55:50,254 INFO L290 TraceCheckUtils]: 84: Hoare triple {149551#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-15 11:55:50,254 INFO L290 TraceCheckUtils]: 85: Hoare triple {149551#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-15 11:55:50,254 INFO L290 TraceCheckUtils]: 86: Hoare triple {149551#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-15 11:55:50,254 INFO L290 TraceCheckUtils]: 87: Hoare triple {149551#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-15 11:55:50,254 INFO L290 TraceCheckUtils]: 88: Hoare triple {149551#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-15 11:55:50,254 INFO L290 TraceCheckUtils]: 89: Hoare triple {149551#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-15 11:55:50,255 INFO L290 TraceCheckUtils]: 90: Hoare triple {149551#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-15 11:55:50,255 INFO L290 TraceCheckUtils]: 91: Hoare triple {149551#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-15 11:55:50,255 INFO L290 TraceCheckUtils]: 92: Hoare triple {149551#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-15 11:55:50,255 INFO L290 TraceCheckUtils]: 93: Hoare triple {149551#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-15 11:55:50,255 INFO L290 TraceCheckUtils]: 94: Hoare triple {149551#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-15 11:55:50,255 INFO L290 TraceCheckUtils]: 95: Hoare triple {149551#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-15 11:55:50,255 INFO L290 TraceCheckUtils]: 96: Hoare triple {149551#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-15 11:55:50,255 INFO L290 TraceCheckUtils]: 97: Hoare triple {149551#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-15 11:55:50,255 INFO L290 TraceCheckUtils]: 98: Hoare triple {149551#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-15 11:55:50,255 INFO L290 TraceCheckUtils]: 99: Hoare triple {149551#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-15 11:55:50,255 INFO L290 TraceCheckUtils]: 100: Hoare triple {149551#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-15 11:55:50,256 INFO L290 TraceCheckUtils]: 101: Hoare triple {149551#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-15 11:55:50,256 INFO L290 TraceCheckUtils]: 102: Hoare triple {149551#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-15 11:55:50,256 INFO L290 TraceCheckUtils]: 103: Hoare triple {149551#false} assume 8448 == #t~mem68;havoc #t~mem68; {149551#false} is VALID [2022-04-15 11:55:50,256 INFO L290 TraceCheckUtils]: 104: Hoare triple {149551#false} assume !(~num1~0 > 0); {149551#false} is VALID [2022-04-15 11:55:50,256 INFO L290 TraceCheckUtils]: 105: Hoare triple {149551#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; {149551#false} is VALID [2022-04-15 11:55:50,256 INFO L290 TraceCheckUtils]: 106: Hoare triple {149551#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); {149551#false} is VALID [2022-04-15 11:55:50,256 INFO L290 TraceCheckUtils]: 107: Hoare triple {149551#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {149551#false} is VALID [2022-04-15 11:55:50,256 INFO L290 TraceCheckUtils]: 108: Hoare triple {149551#false} ~skip~0 := 0; {149551#false} is VALID [2022-04-15 11:55:50,256 INFO L290 TraceCheckUtils]: 109: Hoare triple {149551#false} assume !false; {149551#false} is VALID [2022-04-15 11:55:50,256 INFO L290 TraceCheckUtils]: 110: Hoare triple {149551#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); {149551#false} is VALID [2022-04-15 11:55:50,257 INFO L290 TraceCheckUtils]: 111: Hoare triple {149551#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-15 11:55:50,257 INFO L290 TraceCheckUtils]: 112: Hoare triple {149551#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-15 11:55:50,257 INFO L290 TraceCheckUtils]: 113: Hoare triple {149551#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-15 11:55:50,257 INFO L290 TraceCheckUtils]: 114: Hoare triple {149551#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-15 11:55:50,257 INFO L290 TraceCheckUtils]: 115: Hoare triple {149551#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-15 11:55:50,257 INFO L290 TraceCheckUtils]: 116: Hoare triple {149551#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-15 11:55:50,257 INFO L290 TraceCheckUtils]: 117: Hoare triple {149551#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-15 11:55:50,257 INFO L290 TraceCheckUtils]: 118: Hoare triple {149551#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-15 11:55:50,257 INFO L290 TraceCheckUtils]: 119: Hoare triple {149551#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-15 11:55:50,257 INFO L290 TraceCheckUtils]: 120: Hoare triple {149551#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-15 11:55:50,257 INFO L290 TraceCheckUtils]: 121: Hoare triple {149551#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-15 11:55:50,258 INFO L290 TraceCheckUtils]: 122: Hoare triple {149551#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-15 11:55:50,258 INFO L290 TraceCheckUtils]: 123: Hoare triple {149551#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-15 11:55:50,258 INFO L290 TraceCheckUtils]: 124: Hoare triple {149551#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-15 11:55:50,258 INFO L290 TraceCheckUtils]: 125: Hoare triple {149551#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-15 11:55:50,258 INFO L290 TraceCheckUtils]: 126: Hoare triple {149551#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-15 11:55:50,258 INFO L290 TraceCheckUtils]: 127: Hoare triple {149551#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-15 11:55:50,258 INFO L290 TraceCheckUtils]: 128: Hoare triple {149551#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-15 11:55:50,258 INFO L290 TraceCheckUtils]: 129: Hoare triple {149551#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-15 11:55:50,258 INFO L290 TraceCheckUtils]: 130: Hoare triple {149551#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-15 11:55:50,258 INFO L290 TraceCheckUtils]: 131: Hoare triple {149551#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-15 11:55:50,259 INFO L290 TraceCheckUtils]: 132: Hoare triple {149551#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-15 11:55:50,259 INFO L290 TraceCheckUtils]: 133: Hoare triple {149551#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-15 11:55:50,259 INFO L290 TraceCheckUtils]: 134: Hoare triple {149551#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-15 11:55:50,259 INFO L290 TraceCheckUtils]: 135: Hoare triple {149551#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-15 11:55:50,259 INFO L290 TraceCheckUtils]: 136: Hoare triple {149551#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-15 11:55:50,259 INFO L290 TraceCheckUtils]: 137: Hoare triple {149551#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-15 11:55:50,259 INFO L290 TraceCheckUtils]: 138: Hoare triple {149551#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-15 11:55:50,259 INFO L290 TraceCheckUtils]: 139: Hoare triple {149551#false} assume 8640 == #t~mem75;havoc #t~mem75; {149551#false} is VALID [2022-04-15 11:55:50,259 INFO L290 TraceCheckUtils]: 140: Hoare triple {149551#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {149551#false} is VALID [2022-04-15 11:55:50,259 INFO L290 TraceCheckUtils]: 141: Hoare triple {149551#false} assume !(4 == ~blastFlag~0); {149551#false} is VALID [2022-04-15 11:55:50,260 INFO L290 TraceCheckUtils]: 142: Hoare triple {149551#false} assume !(7 == ~blastFlag~0); {149551#false} is VALID [2022-04-15 11:55:50,260 INFO L290 TraceCheckUtils]: 143: Hoare triple {149551#false} assume !(10 == ~blastFlag~0); {149551#false} is VALID [2022-04-15 11:55:50,260 INFO L290 TraceCheckUtils]: 144: Hoare triple {149551#false} assume 13 == ~blastFlag~0; {149551#false} is VALID [2022-04-15 11:55:50,260 INFO L290 TraceCheckUtils]: 145: Hoare triple {149551#false} assume !false; {149551#false} is VALID [2022-04-15 11:55:50,260 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-15 11:55:50,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:55:50,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782266470] [2022-04-15 11:55:50,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782266470] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:55:50,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:55:50,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:55:50,261 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:55:50,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1602442453] [2022-04-15 11:55:50,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1602442453] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:55:50,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:55:50,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:55:50,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604962096] [2022-04-15 11:55:50,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:55:50,262 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 146 [2022-04-15 11:55:50,262 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:55:50,262 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:55:50,346 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:55:50,346 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:55:50,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:55:50,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:55:50,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:55:50,347 INFO L87 Difference]: Start difference. First operand 1225 states and 1880 transitions. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:55:59,711 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:56:06,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:56:06,675 INFO L93 Difference]: Finished difference Result 2513 states and 3847 transitions. [2022-04-15 11:56:06,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:56:06,676 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 146 [2022-04-15 11:56:06,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:56:06,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:56:06,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 535 transitions. [2022-04-15 11:56:06,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:56:06,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 535 transitions. [2022-04-15 11:56:06,681 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 535 transitions. [2022-04-15 11:56:07,047 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 535 edges. 535 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:56:07,119 INFO L225 Difference]: With dead ends: 2513 [2022-04-15 11:56:07,119 INFO L226 Difference]: Without dead ends: 1314 [2022-04-15 11:56:07,120 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-15 11:56:07,121 INFO L913 BasicCegarLoop]: 264 mSDtfsCounter, 63 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:56:07,121 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 649 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2022-04-15 11:56:07,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2022-04-15 11:56:07,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1225. [2022-04-15 11:56:07,210 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:56:07,211 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1314 states. Second operand has 1225 states, 1220 states have (on average 1.5352459016393443) internal successors, (1873), 1220 states have internal predecessors, (1873), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:56:07,212 INFO L74 IsIncluded]: Start isIncluded. First operand 1314 states. Second operand has 1225 states, 1220 states have (on average 1.5352459016393443) internal successors, (1873), 1220 states have internal predecessors, (1873), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:56:07,213 INFO L87 Difference]: Start difference. First operand 1314 states. Second operand has 1225 states, 1220 states have (on average 1.5352459016393443) internal successors, (1873), 1220 states have internal predecessors, (1873), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:56:07,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:56:07,258 INFO L93 Difference]: Finished difference Result 1314 states and 1995 transitions. [2022-04-15 11:56:07,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1995 transitions. [2022-04-15 11:56:07,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:56:07,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:56:07,273 INFO L74 IsIncluded]: Start isIncluded. First operand has 1225 states, 1220 states have (on average 1.5352459016393443) internal successors, (1873), 1220 states have internal predecessors, (1873), 3 states have call successors, (3), 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 1314 states. [2022-04-15 11:56:07,274 INFO L87 Difference]: Start difference. First operand has 1225 states, 1220 states have (on average 1.5352459016393443) internal successors, (1873), 1220 states have internal predecessors, (1873), 3 states have call successors, (3), 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 1314 states. [2022-04-15 11:56:07,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:56:07,318 INFO L93 Difference]: Finished difference Result 1314 states and 1995 transitions. [2022-04-15 11:56:07,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1995 transitions. [2022-04-15 11:56:07,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:56:07,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:56:07,318 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:56:07,319 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:56:07,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 1220 states have (on average 1.5352459016393443) internal successors, (1873), 1220 states have internal predecessors, (1873), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:56:07,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1877 transitions. [2022-04-15 11:56:07,381 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1877 transitions. Word has length 146 [2022-04-15 11:56:07,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:56:07,382 INFO L478 AbstractCegarLoop]: Abstraction has 1225 states and 1877 transitions. [2022-04-15 11:56:07,382 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:56:07,382 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1225 states and 1877 transitions. [2022-04-15 11:56:11,789 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1877 edges. 1876 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:56:11,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1877 transitions. [2022-04-15 11:56:11,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-04-15 11:56:11,790 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:56:11,791 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1] [2022-04-15 11:56:11,791 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-04-15 11:56:11,791 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:56:11,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:56:11,791 INFO L85 PathProgramCache]: Analyzing trace with hash -147368869, now seen corresponding path program 1 times [2022-04-15 11:56:11,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:56:11,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1101187267] [2022-04-15 11:56:11,899 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:56:11,900 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:56:11,900 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:56:11,900 INFO L85 PathProgramCache]: Analyzing trace with hash -147368869, now seen corresponding path program 2 times [2022-04-15 11:56:11,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:56:11,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88961632] [2022-04-15 11:56:11,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:56:11,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:56:11,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:56:12,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:56:12,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:56:12,143 INFO L290 TraceCheckUtils]: 0: Hoare triple {159673#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {159666#true} is VALID [2022-04-15 11:56:12,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {159666#true} assume true; {159666#true} is VALID [2022-04-15 11:56:12,143 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {159666#true} {159666#true} #708#return; {159666#true} is VALID [2022-04-15 11:56:12,144 INFO L272 TraceCheckUtils]: 0: Hoare triple {159666#true} call ULTIMATE.init(); {159673#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:56:12,144 INFO L290 TraceCheckUtils]: 1: Hoare triple {159673#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {159666#true} is VALID [2022-04-15 11:56:12,144 INFO L290 TraceCheckUtils]: 2: Hoare triple {159666#true} assume true; {159666#true} is VALID [2022-04-15 11:56:12,144 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {159666#true} {159666#true} #708#return; {159666#true} is VALID [2022-04-15 11:56:12,144 INFO L272 TraceCheckUtils]: 4: Hoare triple {159666#true} call #t~ret161 := main(); {159666#true} is VALID [2022-04-15 11:56:12,144 INFO L290 TraceCheckUtils]: 5: Hoare triple {159666#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; {159666#true} is VALID [2022-04-15 11:56:12,144 INFO L290 TraceCheckUtils]: 6: Hoare triple {159666#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {159666#true} is VALID [2022-04-15 11:56:12,145 INFO L272 TraceCheckUtils]: 7: Hoare triple {159666#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {159666#true} is VALID [2022-04-15 11:56:12,145 INFO L290 TraceCheckUtils]: 8: Hoare triple {159666#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); {159666#true} is VALID [2022-04-15 11:56:12,145 INFO L290 TraceCheckUtils]: 9: Hoare triple {159666#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; {159666#true} is VALID [2022-04-15 11:56:12,145 INFO L290 TraceCheckUtils]: 10: Hoare triple {159666#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; {159666#true} is VALID [2022-04-15 11:56:12,145 INFO L290 TraceCheckUtils]: 11: Hoare triple {159666#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {159666#true} is VALID [2022-04-15 11:56:12,145 INFO L290 TraceCheckUtils]: 12: Hoare triple {159666#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {159666#true} is VALID [2022-04-15 11:56:12,145 INFO L290 TraceCheckUtils]: 13: Hoare triple {159666#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {159666#true} is VALID [2022-04-15 11:56:12,145 INFO L290 TraceCheckUtils]: 14: Hoare triple {159666#true} assume !false; {159666#true} is VALID [2022-04-15 11:56:12,145 INFO L290 TraceCheckUtils]: 15: Hoare triple {159666#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); {159666#true} is VALID [2022-04-15 11:56:12,145 INFO L290 TraceCheckUtils]: 16: Hoare triple {159666#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {159666#true} is VALID [2022-04-15 11:56:12,145 INFO L290 TraceCheckUtils]: 17: Hoare triple {159666#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {159666#true} is VALID [2022-04-15 11:56:12,145 INFO L290 TraceCheckUtils]: 18: Hoare triple {159666#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {159666#true} is VALID [2022-04-15 11:56:12,145 INFO L290 TraceCheckUtils]: 19: Hoare triple {159666#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {159666#true} is VALID [2022-04-15 11:56:12,145 INFO L290 TraceCheckUtils]: 20: Hoare triple {159666#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {159666#true} is VALID [2022-04-15 11:56:12,145 INFO L290 TraceCheckUtils]: 21: Hoare triple {159666#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {159666#true} is VALID [2022-04-15 11:56:12,146 INFO L290 TraceCheckUtils]: 22: Hoare triple {159666#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {159666#true} is VALID [2022-04-15 11:56:12,146 INFO L290 TraceCheckUtils]: 23: Hoare triple {159666#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {159666#true} is VALID [2022-04-15 11:56:12,146 INFO L290 TraceCheckUtils]: 24: Hoare triple {159666#true} assume 8464 == #t~mem55;havoc #t~mem55; {159666#true} is VALID [2022-04-15 11:56:12,146 INFO L290 TraceCheckUtils]: 25: Hoare triple {159666#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; {159666#true} is VALID [2022-04-15 11:56:12,146 INFO L290 TraceCheckUtils]: 26: Hoare triple {159666#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {159666#true} is VALID [2022-04-15 11:56:12,146 INFO L290 TraceCheckUtils]: 27: Hoare triple {159666#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); {159666#true} is VALID [2022-04-15 11:56:12,146 INFO L290 TraceCheckUtils]: 28: Hoare triple {159666#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); {159666#true} is VALID [2022-04-15 11:56:12,146 INFO L290 TraceCheckUtils]: 29: Hoare triple {159666#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {159666#true} is VALID [2022-04-15 11:56:12,146 INFO L290 TraceCheckUtils]: 30: Hoare triple {159666#true} ~skip~0 := 0; {159666#true} is VALID [2022-04-15 11:56:12,146 INFO L290 TraceCheckUtils]: 31: Hoare triple {159666#true} assume !false; {159666#true} is VALID [2022-04-15 11:56:12,146 INFO L290 TraceCheckUtils]: 32: Hoare triple {159666#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); {159666#true} is VALID [2022-04-15 11:56:12,146 INFO L290 TraceCheckUtils]: 33: Hoare triple {159666#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {159666#true} is VALID [2022-04-15 11:56:12,146 INFO L290 TraceCheckUtils]: 34: Hoare triple {159666#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {159666#true} is VALID [2022-04-15 11:56:12,146 INFO L290 TraceCheckUtils]: 35: Hoare triple {159666#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {159666#true} is VALID [2022-04-15 11:56:12,146 INFO L290 TraceCheckUtils]: 36: Hoare triple {159666#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {159666#true} is VALID [2022-04-15 11:56:12,147 INFO L290 TraceCheckUtils]: 37: Hoare triple {159666#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {159666#true} is VALID [2022-04-15 11:56:12,147 INFO L290 TraceCheckUtils]: 38: Hoare triple {159666#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {159666#true} is VALID [2022-04-15 11:56:12,147 INFO L290 TraceCheckUtils]: 39: Hoare triple {159666#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {159666#true} is VALID [2022-04-15 11:56:12,147 INFO L290 TraceCheckUtils]: 40: Hoare triple {159666#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {159666#true} is VALID [2022-04-15 11:56:12,147 INFO L290 TraceCheckUtils]: 41: Hoare triple {159666#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {159666#true} is VALID [2022-04-15 11:56:12,147 INFO L290 TraceCheckUtils]: 42: Hoare triple {159666#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {159666#true} is VALID [2022-04-15 11:56:12,147 INFO L290 TraceCheckUtils]: 43: Hoare triple {159666#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {159666#true} is VALID [2022-04-15 11:56:12,147 INFO L290 TraceCheckUtils]: 44: Hoare triple {159666#true} assume 8496 == #t~mem58;havoc #t~mem58; {159666#true} is VALID [2022-04-15 11:56:12,147 INFO L290 TraceCheckUtils]: 45: Hoare triple {159666#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {159666#true} is VALID [2022-04-15 11:56:12,147 INFO L290 TraceCheckUtils]: 46: Hoare triple {159666#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {159666#true} is VALID [2022-04-15 11:56:12,147 INFO L290 TraceCheckUtils]: 47: Hoare triple {159666#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {159666#true} is VALID [2022-04-15 11:56:12,148 INFO L290 TraceCheckUtils]: 48: Hoare triple {159666#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {159671#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:56:12,149 INFO L290 TraceCheckUtils]: 49: Hoare triple {159671#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {159671#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:56:12,149 INFO L290 TraceCheckUtils]: 50: Hoare triple {159671#(= 8656 (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); {159671#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:56:12,150 INFO L290 TraceCheckUtils]: 51: Hoare triple {159671#(= 8656 (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; {159671#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:56:12,150 INFO L290 TraceCheckUtils]: 52: Hoare triple {159671#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {159671#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:56:12,150 INFO L290 TraceCheckUtils]: 53: Hoare triple {159671#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {159671#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:56:12,151 INFO L290 TraceCheckUtils]: 54: Hoare triple {159671#(= 8656 (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); {159671#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:56:12,151 INFO L290 TraceCheckUtils]: 55: Hoare triple {159671#(= 8656 (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); {159671#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:56:12,151 INFO L290 TraceCheckUtils]: 56: Hoare triple {159671#(= 8656 (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); {159671#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:56:12,152 INFO L290 TraceCheckUtils]: 57: Hoare triple {159671#(= 8656 (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); {159671#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:56:12,152 INFO L290 TraceCheckUtils]: 58: Hoare triple {159671#(= 8656 (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); {159671#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:56:12,152 INFO L290 TraceCheckUtils]: 59: Hoare triple {159671#(= 8656 (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); {159671#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:56:12,153 INFO L290 TraceCheckUtils]: 60: Hoare triple {159671#(= 8656 (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); {159671#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:56:12,153 INFO L290 TraceCheckUtils]: 61: Hoare triple {159671#(= 8656 (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); {159672#(= |ssl3_accept_#t~mem54| 8656)} is VALID [2022-04-15 11:56:12,153 INFO L290 TraceCheckUtils]: 62: Hoare triple {159672#(= |ssl3_accept_#t~mem54| 8656)} assume 8482 == #t~mem54;havoc #t~mem54; {159667#false} is VALID [2022-04-15 11:56:12,154 INFO L290 TraceCheckUtils]: 63: Hoare triple {159667#false} call write~int(3, ~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-15 11:56:12,154 INFO L290 TraceCheckUtils]: 64: Hoare triple {159667#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); {159667#false} is VALID [2022-04-15 11:56:12,154 INFO L290 TraceCheckUtils]: 65: Hoare triple {159667#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {159667#false} is VALID [2022-04-15 11:56:12,154 INFO L290 TraceCheckUtils]: 66: Hoare triple {159667#false} ~skip~0 := 0; {159667#false} is VALID [2022-04-15 11:56:12,154 INFO L290 TraceCheckUtils]: 67: Hoare triple {159667#false} assume !false; {159667#false} is VALID [2022-04-15 11:56:12,154 INFO L290 TraceCheckUtils]: 68: Hoare triple {159667#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); {159667#false} is VALID [2022-04-15 11:56:12,154 INFO L290 TraceCheckUtils]: 69: Hoare triple {159667#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-15 11:56:12,154 INFO L290 TraceCheckUtils]: 70: Hoare triple {159667#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-15 11:56:12,154 INFO L290 TraceCheckUtils]: 71: Hoare triple {159667#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-15 11:56:12,154 INFO L290 TraceCheckUtils]: 72: Hoare triple {159667#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-15 11:56:12,154 INFO L290 TraceCheckUtils]: 73: Hoare triple {159667#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-15 11:56:12,154 INFO L290 TraceCheckUtils]: 74: Hoare triple {159667#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-15 11:56:12,154 INFO L290 TraceCheckUtils]: 75: Hoare triple {159667#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-15 11:56:12,154 INFO L290 TraceCheckUtils]: 76: Hoare triple {159667#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-15 11:56:12,154 INFO L290 TraceCheckUtils]: 77: Hoare triple {159667#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-15 11:56:12,155 INFO L290 TraceCheckUtils]: 78: Hoare triple {159667#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-15 11:56:12,155 INFO L290 TraceCheckUtils]: 79: Hoare triple {159667#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-15 11:56:12,155 INFO L290 TraceCheckUtils]: 80: Hoare triple {159667#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-15 11:56:12,155 INFO L290 TraceCheckUtils]: 81: Hoare triple {159667#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-15 11:56:12,155 INFO L290 TraceCheckUtils]: 82: Hoare triple {159667#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-15 11:56:12,155 INFO L290 TraceCheckUtils]: 83: Hoare triple {159667#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-15 11:56:12,155 INFO L290 TraceCheckUtils]: 84: Hoare triple {159667#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-15 11:56:12,155 INFO L290 TraceCheckUtils]: 85: Hoare triple {159667#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-15 11:56:12,155 INFO L290 TraceCheckUtils]: 86: Hoare triple {159667#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-15 11:56:12,155 INFO L290 TraceCheckUtils]: 87: Hoare triple {159667#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-15 11:56:12,155 INFO L290 TraceCheckUtils]: 88: Hoare triple {159667#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-15 11:56:12,155 INFO L290 TraceCheckUtils]: 89: Hoare triple {159667#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-15 11:56:12,155 INFO L290 TraceCheckUtils]: 90: Hoare triple {159667#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-15 11:56:12,156 INFO L290 TraceCheckUtils]: 91: Hoare triple {159667#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-15 11:56:12,156 INFO L290 TraceCheckUtils]: 92: Hoare triple {159667#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-15 11:56:12,156 INFO L290 TraceCheckUtils]: 93: Hoare triple {159667#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-15 11:56:12,156 INFO L290 TraceCheckUtils]: 94: Hoare triple {159667#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-15 11:56:12,156 INFO L290 TraceCheckUtils]: 95: Hoare triple {159667#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-15 11:56:12,156 INFO L290 TraceCheckUtils]: 96: Hoare triple {159667#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-15 11:56:12,156 INFO L290 TraceCheckUtils]: 97: Hoare triple {159667#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-15 11:56:12,156 INFO L290 TraceCheckUtils]: 98: Hoare triple {159667#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-15 11:56:12,156 INFO L290 TraceCheckUtils]: 99: Hoare triple {159667#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-15 11:56:12,156 INFO L290 TraceCheckUtils]: 100: Hoare triple {159667#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-15 11:56:12,157 INFO L290 TraceCheckUtils]: 101: Hoare triple {159667#false} assume 8672 == #t~mem79;havoc #t~mem79; {159667#false} is VALID [2022-04-15 11:56:12,157 INFO L290 TraceCheckUtils]: 102: Hoare triple {159667#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {159667#false} is VALID [2022-04-15 11:56:12,157 INFO L290 TraceCheckUtils]: 103: Hoare triple {159667#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {159667#false} is VALID [2022-04-15 11:56:12,157 INFO L290 TraceCheckUtils]: 104: Hoare triple {159667#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); {159667#false} is VALID [2022-04-15 11:56:12,157 INFO L290 TraceCheckUtils]: 105: Hoare triple {159667#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; {159667#false} is VALID [2022-04-15 11:56:12,157 INFO L290 TraceCheckUtils]: 106: Hoare triple {159667#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {159667#false} is VALID [2022-04-15 11:56:12,157 INFO L290 TraceCheckUtils]: 107: Hoare triple {159667#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); {159667#false} is VALID [2022-04-15 11:56:12,157 INFO L290 TraceCheckUtils]: 108: Hoare triple {159667#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {159667#false} is VALID [2022-04-15 11:56:12,157 INFO L290 TraceCheckUtils]: 109: Hoare triple {159667#false} ~skip~0 := 0; {159667#false} is VALID [2022-04-15 11:56:12,157 INFO L290 TraceCheckUtils]: 110: Hoare triple {159667#false} assume !false; {159667#false} is VALID [2022-04-15 11:56:12,157 INFO L290 TraceCheckUtils]: 111: Hoare triple {159667#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); {159667#false} is VALID [2022-04-15 11:56:12,158 INFO L290 TraceCheckUtils]: 112: Hoare triple {159667#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-15 11:56:12,158 INFO L290 TraceCheckUtils]: 113: Hoare triple {159667#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-15 11:56:12,158 INFO L290 TraceCheckUtils]: 114: Hoare triple {159667#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-15 11:56:12,158 INFO L290 TraceCheckUtils]: 115: Hoare triple {159667#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-15 11:56:12,158 INFO L290 TraceCheckUtils]: 116: Hoare triple {159667#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-15 11:56:12,158 INFO L290 TraceCheckUtils]: 117: Hoare triple {159667#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-15 11:56:12,158 INFO L290 TraceCheckUtils]: 118: Hoare triple {159667#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-15 11:56:12,158 INFO L290 TraceCheckUtils]: 119: Hoare triple {159667#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-15 11:56:12,158 INFO L290 TraceCheckUtils]: 120: Hoare triple {159667#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-15 11:56:12,158 INFO L290 TraceCheckUtils]: 121: Hoare triple {159667#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-15 11:56:12,158 INFO L290 TraceCheckUtils]: 122: Hoare triple {159667#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-15 11:56:12,158 INFO L290 TraceCheckUtils]: 123: Hoare triple {159667#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-15 11:56:12,158 INFO L290 TraceCheckUtils]: 124: Hoare triple {159667#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-15 11:56:12,158 INFO L290 TraceCheckUtils]: 125: Hoare triple {159667#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-15 11:56:12,158 INFO L290 TraceCheckUtils]: 126: Hoare triple {159667#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-15 11:56:12,159 INFO L290 TraceCheckUtils]: 127: Hoare triple {159667#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-15 11:56:12,159 INFO L290 TraceCheckUtils]: 128: Hoare triple {159667#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-15 11:56:12,159 INFO L290 TraceCheckUtils]: 129: Hoare triple {159667#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-15 11:56:12,159 INFO L290 TraceCheckUtils]: 130: Hoare triple {159667#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-15 11:56:12,159 INFO L290 TraceCheckUtils]: 131: Hoare triple {159667#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-15 11:56:12,159 INFO L290 TraceCheckUtils]: 132: Hoare triple {159667#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-15 11:56:12,159 INFO L290 TraceCheckUtils]: 133: Hoare triple {159667#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-15 11:56:12,159 INFO L290 TraceCheckUtils]: 134: Hoare triple {159667#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-15 11:56:12,159 INFO L290 TraceCheckUtils]: 135: Hoare triple {159667#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-15 11:56:12,159 INFO L290 TraceCheckUtils]: 136: Hoare triple {159667#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-15 11:56:12,159 INFO L290 TraceCheckUtils]: 137: Hoare triple {159667#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-15 11:56:12,159 INFO L290 TraceCheckUtils]: 138: Hoare triple {159667#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-15 11:56:12,159 INFO L290 TraceCheckUtils]: 139: Hoare triple {159667#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-15 11:56:12,159 INFO L290 TraceCheckUtils]: 140: Hoare triple {159667#false} assume 8640 == #t~mem75;havoc #t~mem75; {159667#false} is VALID [2022-04-15 11:56:12,159 INFO L290 TraceCheckUtils]: 141: Hoare triple {159667#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {159667#false} is VALID [2022-04-15 11:56:12,160 INFO L290 TraceCheckUtils]: 142: Hoare triple {159667#false} assume !(4 == ~blastFlag~0); {159667#false} is VALID [2022-04-15 11:56:12,160 INFO L290 TraceCheckUtils]: 143: Hoare triple {159667#false} assume !(7 == ~blastFlag~0); {159667#false} is VALID [2022-04-15 11:56:12,160 INFO L290 TraceCheckUtils]: 144: Hoare triple {159667#false} assume !(10 == ~blastFlag~0); {159667#false} is VALID [2022-04-15 11:56:12,160 INFO L290 TraceCheckUtils]: 145: Hoare triple {159667#false} assume 13 == ~blastFlag~0; {159667#false} is VALID [2022-04-15 11:56:12,160 INFO L290 TraceCheckUtils]: 146: Hoare triple {159667#false} assume !false; {159667#false} is VALID [2022-04-15 11:56:12,160 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-15 11:56:12,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:56:12,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88961632] [2022-04-15 11:56:12,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88961632] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:56:12,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:56:12,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:56:12,161 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:56:12,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1101187267] [2022-04-15 11:56:12,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1101187267] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:56:12,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:56:12,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:56:12,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021335580] [2022-04-15 11:56:12,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:56:12,162 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (3), 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 147 [2022-04-15 11:56:12,162 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:56:12,162 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:56:12,232 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:56:12,232 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:56:12,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:56:12,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:56:12,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:56:12,233 INFO L87 Difference]: Start difference. First operand 1225 states and 1877 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:56:15,755 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-15 11:56:19,013 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:56:28,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:56:28,859 INFO L93 Difference]: Finished difference Result 2510 states and 3838 transitions. [2022-04-15 11:56:28,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:56:28,859 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (3), 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 147 [2022-04-15 11:56:28,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:56:28,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:56:28,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 533 transitions. [2022-04-15 11:56:28,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:56:28,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 533 transitions. [2022-04-15 11:56:28,863 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 533 transitions. [2022-04-15 11:56:29,219 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-15 11:56:29,287 INFO L225 Difference]: With dead ends: 2510 [2022-04-15 11:56:29,287 INFO L226 Difference]: Without dead ends: 1311 [2022-04-15 11:56:29,288 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-15 11:56:29,288 INFO L913 BasicCegarLoop]: 263 mSDtfsCounter, 74 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-04-15 11:56:29,289 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 647 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 564 Invalid, 1 Unknown, 0 Unchecked, 6.7s Time] [2022-04-15 11:56:29,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1311 states. [2022-04-15 11:56:29,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1311 to 1225. [2022-04-15 11:56:29,382 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:56:29,383 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1311 states. Second operand has 1225 states, 1220 states have (on average 1.5327868852459017) internal successors, (1870), 1220 states have internal predecessors, (1870), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:56:29,383 INFO L74 IsIncluded]: Start isIncluded. First operand 1311 states. Second operand has 1225 states, 1220 states have (on average 1.5327868852459017) internal successors, (1870), 1220 states have internal predecessors, (1870), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:56:29,384 INFO L87 Difference]: Start difference. First operand 1311 states. Second operand has 1225 states, 1220 states have (on average 1.5327868852459017) internal successors, (1870), 1220 states have internal predecessors, (1870), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:56:29,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:56:29,428 INFO L93 Difference]: Finished difference Result 1311 states and 1989 transitions. [2022-04-15 11:56:29,428 INFO L276 IsEmpty]: Start isEmpty. Operand 1311 states and 1989 transitions. [2022-04-15 11:56:29,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:56:29,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:56:29,429 INFO L74 IsIncluded]: Start isIncluded. First operand has 1225 states, 1220 states have (on average 1.5327868852459017) internal successors, (1870), 1220 states have internal predecessors, (1870), 3 states have call successors, (3), 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 1311 states. [2022-04-15 11:56:29,430 INFO L87 Difference]: Start difference. First operand has 1225 states, 1220 states have (on average 1.5327868852459017) internal successors, (1870), 1220 states have internal predecessors, (1870), 3 states have call successors, (3), 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 1311 states. [2022-04-15 11:56:29,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:56:29,473 INFO L93 Difference]: Finished difference Result 1311 states and 1989 transitions. [2022-04-15 11:56:29,473 INFO L276 IsEmpty]: Start isEmpty. Operand 1311 states and 1989 transitions. [2022-04-15 11:56:29,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:56:29,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:56:29,473 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:56:29,473 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:56:29,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 1220 states have (on average 1.5327868852459017) internal successors, (1870), 1220 states have internal predecessors, (1870), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:56:29,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1874 transitions. [2022-04-15 11:56:29,535 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1874 transitions. Word has length 147 [2022-04-15 11:56:29,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:56:29,535 INFO L478 AbstractCegarLoop]: Abstraction has 1225 states and 1874 transitions. [2022-04-15 11:56:29,535 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:56:29,535 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1225 states and 1874 transitions. [2022-04-15 11:56:33,937 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1874 edges. 1873 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:56:33,937 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1874 transitions. [2022-04-15 11:56:33,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-04-15 11:56:33,938 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:56:33,939 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-04-15 11:56:33,939 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-04-15 11:56:33,939 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:56:33,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:56:33,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1964705935, now seen corresponding path program 1 times [2022-04-15 11:56:33,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:56:33,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1718862153] [2022-04-15 11:56:34,023 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:56:34,023 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:56:34,023 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:56:34,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1964705935, now seen corresponding path program 2 times [2022-04-15 11:56:34,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:56:34,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343714849] [2022-04-15 11:56:34,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:56:34,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:56:34,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:56:34,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:56:34,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:56:34,273 INFO L290 TraceCheckUtils]: 0: Hoare triple {169777#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {169770#true} is VALID [2022-04-15 11:56:34,273 INFO L290 TraceCheckUtils]: 1: Hoare triple {169770#true} assume true; {169770#true} is VALID [2022-04-15 11:56:34,273 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {169770#true} {169770#true} #708#return; {169770#true} is VALID [2022-04-15 11:56:34,274 INFO L272 TraceCheckUtils]: 0: Hoare triple {169770#true} call ULTIMATE.init(); {169777#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:56:34,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {169777#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {169770#true} is VALID [2022-04-15 11:56:34,274 INFO L290 TraceCheckUtils]: 2: Hoare triple {169770#true} assume true; {169770#true} is VALID [2022-04-15 11:56:34,275 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {169770#true} {169770#true} #708#return; {169770#true} is VALID [2022-04-15 11:56:34,275 INFO L272 TraceCheckUtils]: 4: Hoare triple {169770#true} call #t~ret161 := main(); {169770#true} is VALID [2022-04-15 11:56:34,275 INFO L290 TraceCheckUtils]: 5: Hoare triple {169770#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; {169770#true} is VALID [2022-04-15 11:56:34,275 INFO L290 TraceCheckUtils]: 6: Hoare triple {169770#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {169770#true} is VALID [2022-04-15 11:56:34,275 INFO L272 TraceCheckUtils]: 7: Hoare triple {169770#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {169770#true} is VALID [2022-04-15 11:56:34,275 INFO L290 TraceCheckUtils]: 8: Hoare triple {169770#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); {169770#true} is VALID [2022-04-15 11:56:34,275 INFO L290 TraceCheckUtils]: 9: Hoare triple {169770#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; {169770#true} is VALID [2022-04-15 11:56:34,275 INFO L290 TraceCheckUtils]: 10: Hoare triple {169770#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; {169770#true} is VALID [2022-04-15 11:56:34,275 INFO L290 TraceCheckUtils]: 11: Hoare triple {169770#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {169770#true} is VALID [2022-04-15 11:56:34,275 INFO L290 TraceCheckUtils]: 12: Hoare triple {169770#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {169770#true} is VALID [2022-04-15 11:56:34,276 INFO L290 TraceCheckUtils]: 13: Hoare triple {169770#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {169770#true} is VALID [2022-04-15 11:56:34,276 INFO L290 TraceCheckUtils]: 14: Hoare triple {169770#true} assume !false; {169770#true} is VALID [2022-04-15 11:56:34,276 INFO L290 TraceCheckUtils]: 15: Hoare triple {169770#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); {169770#true} is VALID [2022-04-15 11:56:34,276 INFO L290 TraceCheckUtils]: 16: Hoare triple {169770#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {169770#true} is VALID [2022-04-15 11:56:34,276 INFO L290 TraceCheckUtils]: 17: Hoare triple {169770#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {169770#true} is VALID [2022-04-15 11:56:34,276 INFO L290 TraceCheckUtils]: 18: Hoare triple {169770#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {169770#true} is VALID [2022-04-15 11:56:34,276 INFO L290 TraceCheckUtils]: 19: Hoare triple {169770#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {169770#true} is VALID [2022-04-15 11:56:34,276 INFO L290 TraceCheckUtils]: 20: Hoare triple {169770#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {169770#true} is VALID [2022-04-15 11:56:34,276 INFO L290 TraceCheckUtils]: 21: Hoare triple {169770#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {169770#true} is VALID [2022-04-15 11:56:34,276 INFO L290 TraceCheckUtils]: 22: Hoare triple {169770#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {169770#true} is VALID [2022-04-15 11:56:34,277 INFO L290 TraceCheckUtils]: 23: Hoare triple {169770#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {169770#true} is VALID [2022-04-15 11:56:34,277 INFO L290 TraceCheckUtils]: 24: Hoare triple {169770#true} assume 8464 == #t~mem55;havoc #t~mem55; {169770#true} is VALID [2022-04-15 11:56:34,277 INFO L290 TraceCheckUtils]: 25: Hoare triple {169770#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; {169770#true} is VALID [2022-04-15 11:56:34,277 INFO L290 TraceCheckUtils]: 26: Hoare triple {169770#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {169770#true} is VALID [2022-04-15 11:56:34,277 INFO L290 TraceCheckUtils]: 27: Hoare triple {169770#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); {169770#true} is VALID [2022-04-15 11:56:34,277 INFO L290 TraceCheckUtils]: 28: Hoare triple {169770#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); {169770#true} is VALID [2022-04-15 11:56:34,277 INFO L290 TraceCheckUtils]: 29: Hoare triple {169770#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {169770#true} is VALID [2022-04-15 11:56:34,277 INFO L290 TraceCheckUtils]: 30: Hoare triple {169770#true} ~skip~0 := 0; {169770#true} is VALID [2022-04-15 11:56:34,277 INFO L290 TraceCheckUtils]: 31: Hoare triple {169770#true} assume !false; {169770#true} is VALID [2022-04-15 11:56:34,277 INFO L290 TraceCheckUtils]: 32: Hoare triple {169770#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); {169770#true} is VALID [2022-04-15 11:56:34,278 INFO L290 TraceCheckUtils]: 33: Hoare triple {169770#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {169770#true} is VALID [2022-04-15 11:56:34,278 INFO L290 TraceCheckUtils]: 34: Hoare triple {169770#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {169770#true} is VALID [2022-04-15 11:56:34,278 INFO L290 TraceCheckUtils]: 35: Hoare triple {169770#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {169770#true} is VALID [2022-04-15 11:56:34,278 INFO L290 TraceCheckUtils]: 36: Hoare triple {169770#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {169770#true} is VALID [2022-04-15 11:56:34,278 INFO L290 TraceCheckUtils]: 37: Hoare triple {169770#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {169770#true} is VALID [2022-04-15 11:56:34,278 INFO L290 TraceCheckUtils]: 38: Hoare triple {169770#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {169770#true} is VALID [2022-04-15 11:56:34,278 INFO L290 TraceCheckUtils]: 39: Hoare triple {169770#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {169770#true} is VALID [2022-04-15 11:56:34,278 INFO L290 TraceCheckUtils]: 40: Hoare triple {169770#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {169770#true} is VALID [2022-04-15 11:56:34,278 INFO L290 TraceCheckUtils]: 41: Hoare triple {169770#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {169770#true} is VALID [2022-04-15 11:56:34,278 INFO L290 TraceCheckUtils]: 42: Hoare triple {169770#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {169770#true} is VALID [2022-04-15 11:56:34,279 INFO L290 TraceCheckUtils]: 43: Hoare triple {169770#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {169770#true} is VALID [2022-04-15 11:56:34,279 INFO L290 TraceCheckUtils]: 44: Hoare triple {169770#true} assume 8496 == #t~mem58;havoc #t~mem58; {169770#true} is VALID [2022-04-15 11:56:34,279 INFO L290 TraceCheckUtils]: 45: Hoare triple {169770#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {169770#true} is VALID [2022-04-15 11:56:34,279 INFO L290 TraceCheckUtils]: 46: Hoare triple {169770#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {169770#true} is VALID [2022-04-15 11:56:34,279 INFO L290 TraceCheckUtils]: 47: Hoare triple {169770#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {169770#true} is VALID [2022-04-15 11:56:34,280 INFO L290 TraceCheckUtils]: 48: Hoare triple {169770#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {169775#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:34,281 INFO L290 TraceCheckUtils]: 49: Hoare triple {169775#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {169775#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:34,281 INFO L290 TraceCheckUtils]: 50: Hoare triple {169775#(not (= 8561 (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); {169775#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:34,282 INFO L290 TraceCheckUtils]: 51: Hoare triple {169775#(not (= 8561 (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; {169775#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:34,282 INFO L290 TraceCheckUtils]: 52: Hoare triple {169775#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {169775#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:34,283 INFO L290 TraceCheckUtils]: 53: Hoare triple {169775#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {169775#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:34,283 INFO L290 TraceCheckUtils]: 54: Hoare triple {169775#(not (= 8561 (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); {169775#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:34,284 INFO L290 TraceCheckUtils]: 55: Hoare triple {169775#(not (= 8561 (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); {169775#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:34,284 INFO L290 TraceCheckUtils]: 56: Hoare triple {169775#(not (= 8561 (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); {169775#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:34,284 INFO L290 TraceCheckUtils]: 57: Hoare triple {169775#(not (= 8561 (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); {169775#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:34,285 INFO L290 TraceCheckUtils]: 58: Hoare triple {169775#(not (= 8561 (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); {169775#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:34,285 INFO L290 TraceCheckUtils]: 59: Hoare triple {169775#(not (= 8561 (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); {169775#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:34,286 INFO L290 TraceCheckUtils]: 60: Hoare triple {169775#(not (= 8561 (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); {169775#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:34,286 INFO L290 TraceCheckUtils]: 61: Hoare triple {169775#(not (= 8561 (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); {169775#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:34,286 INFO L290 TraceCheckUtils]: 62: Hoare triple {169775#(not (= 8561 (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); {169775#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:34,287 INFO L290 TraceCheckUtils]: 63: Hoare triple {169775#(not (= 8561 (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); {169775#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:34,287 INFO L290 TraceCheckUtils]: 64: Hoare triple {169775#(not (= 8561 (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); {169775#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:34,287 INFO L290 TraceCheckUtils]: 65: Hoare triple {169775#(not (= 8561 (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); {169775#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:34,288 INFO L290 TraceCheckUtils]: 66: Hoare triple {169775#(not (= 8561 (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); {169775#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:34,300 INFO L290 TraceCheckUtils]: 67: Hoare triple {169775#(not (= 8561 (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); {169775#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:34,301 INFO L290 TraceCheckUtils]: 68: Hoare triple {169775#(not (= 8561 (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); {169775#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:34,301 INFO L290 TraceCheckUtils]: 69: Hoare triple {169775#(not (= 8561 (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); {169775#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:34,302 INFO L290 TraceCheckUtils]: 70: Hoare triple {169775#(not (= 8561 (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); {169775#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:34,302 INFO L290 TraceCheckUtils]: 71: Hoare triple {169775#(not (= 8561 (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); {169775#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:34,302 INFO L290 TraceCheckUtils]: 72: Hoare triple {169775#(not (= 8561 (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); {169775#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:34,303 INFO L290 TraceCheckUtils]: 73: Hoare triple {169775#(not (= 8561 (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); {169775#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:34,303 INFO L290 TraceCheckUtils]: 74: Hoare triple {169775#(not (= 8561 (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); {169776#(not (= |ssl3_accept_#t~mem67| 8561))} is VALID [2022-04-15 11:56:34,304 INFO L290 TraceCheckUtils]: 75: Hoare triple {169776#(not (= |ssl3_accept_#t~mem67| 8561))} assume 8561 == #t~mem67;havoc #t~mem67; {169771#false} is VALID [2022-04-15 11:56:34,304 INFO L290 TraceCheckUtils]: 76: Hoare triple {169771#false} assume -2147483648 <= #t~nondet130 && #t~nondet130 <= 2147483647;~ret~0 := #t~nondet130;havoc #t~nondet130; {169771#false} is VALID [2022-04-15 11:56:34,304 INFO L290 TraceCheckUtils]: 77: Hoare triple {169771#false} assume !(~ret~0 <= 0);call #t~mem131.base, #t~mem131.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8576, #t~mem131.base, 844 + #t~mem131.offset, 4);havoc #t~mem131.base, #t~mem131.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {169771#false} is VALID [2022-04-15 11:56:34,304 INFO L290 TraceCheckUtils]: 78: Hoare triple {169771#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); {169771#false} is VALID [2022-04-15 11:56:34,304 INFO L290 TraceCheckUtils]: 79: Hoare triple {169771#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {169771#false} is VALID [2022-04-15 11:56:34,304 INFO L290 TraceCheckUtils]: 80: Hoare triple {169771#false} ~skip~0 := 0; {169771#false} is VALID [2022-04-15 11:56:34,304 INFO L290 TraceCheckUtils]: 81: Hoare triple {169771#false} assume !false; {169771#false} is VALID [2022-04-15 11:56:34,304 INFO L290 TraceCheckUtils]: 82: Hoare triple {169771#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); {169771#false} is VALID [2022-04-15 11:56:34,304 INFO L290 TraceCheckUtils]: 83: Hoare triple {169771#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-15 11:56:34,304 INFO L290 TraceCheckUtils]: 84: Hoare triple {169771#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-15 11:56:34,304 INFO L290 TraceCheckUtils]: 85: Hoare triple {169771#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-15 11:56:34,304 INFO L290 TraceCheckUtils]: 86: Hoare triple {169771#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-15 11:56:34,304 INFO L290 TraceCheckUtils]: 87: Hoare triple {169771#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-15 11:56:34,304 INFO L290 TraceCheckUtils]: 88: Hoare triple {169771#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-15 11:56:34,304 INFO L290 TraceCheckUtils]: 89: Hoare triple {169771#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-15 11:56:34,305 INFO L290 TraceCheckUtils]: 90: Hoare triple {169771#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-15 11:56:34,305 INFO L290 TraceCheckUtils]: 91: Hoare triple {169771#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-15 11:56:34,305 INFO L290 TraceCheckUtils]: 92: Hoare triple {169771#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-15 11:56:34,305 INFO L290 TraceCheckUtils]: 93: Hoare triple {169771#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-15 11:56:34,305 INFO L290 TraceCheckUtils]: 94: Hoare triple {169771#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-15 11:56:34,305 INFO L290 TraceCheckUtils]: 95: Hoare triple {169771#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-15 11:56:34,305 INFO L290 TraceCheckUtils]: 96: Hoare triple {169771#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-15 11:56:34,305 INFO L290 TraceCheckUtils]: 97: Hoare triple {169771#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-15 11:56:34,305 INFO L290 TraceCheckUtils]: 98: Hoare triple {169771#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-15 11:56:34,305 INFO L290 TraceCheckUtils]: 99: Hoare triple {169771#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-15 11:56:34,305 INFO L290 TraceCheckUtils]: 100: Hoare triple {169771#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-15 11:56:34,305 INFO L290 TraceCheckUtils]: 101: Hoare triple {169771#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-15 11:56:34,305 INFO L290 TraceCheckUtils]: 102: Hoare triple {169771#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-15 11:56:34,305 INFO L290 TraceCheckUtils]: 103: Hoare triple {169771#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-15 11:56:34,306 INFO L290 TraceCheckUtils]: 104: Hoare triple {169771#false} assume 8448 == #t~mem68;havoc #t~mem68; {169771#false} is VALID [2022-04-15 11:56:34,306 INFO L290 TraceCheckUtils]: 105: Hoare triple {169771#false} assume !(~num1~0 > 0); {169771#false} is VALID [2022-04-15 11:56:34,306 INFO L290 TraceCheckUtils]: 106: Hoare triple {169771#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; {169771#false} is VALID [2022-04-15 11:56:34,306 INFO L290 TraceCheckUtils]: 107: Hoare triple {169771#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); {169771#false} is VALID [2022-04-15 11:56:34,306 INFO L290 TraceCheckUtils]: 108: Hoare triple {169771#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {169771#false} is VALID [2022-04-15 11:56:34,306 INFO L290 TraceCheckUtils]: 109: Hoare triple {169771#false} ~skip~0 := 0; {169771#false} is VALID [2022-04-15 11:56:34,306 INFO L290 TraceCheckUtils]: 110: Hoare triple {169771#false} assume !false; {169771#false} is VALID [2022-04-15 11:56:34,306 INFO L290 TraceCheckUtils]: 111: Hoare triple {169771#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); {169771#false} is VALID [2022-04-15 11:56:34,306 INFO L290 TraceCheckUtils]: 112: Hoare triple {169771#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-15 11:56:34,306 INFO L290 TraceCheckUtils]: 113: Hoare triple {169771#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-15 11:56:34,306 INFO L290 TraceCheckUtils]: 114: Hoare triple {169771#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-15 11:56:34,306 INFO L290 TraceCheckUtils]: 115: Hoare triple {169771#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-15 11:56:34,306 INFO L290 TraceCheckUtils]: 116: Hoare triple {169771#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-15 11:56:34,306 INFO L290 TraceCheckUtils]: 117: Hoare triple {169771#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-15 11:56:34,306 INFO L290 TraceCheckUtils]: 118: Hoare triple {169771#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-15 11:56:34,307 INFO L290 TraceCheckUtils]: 119: Hoare triple {169771#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-15 11:56:34,307 INFO L290 TraceCheckUtils]: 120: Hoare triple {169771#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-15 11:56:34,307 INFO L290 TraceCheckUtils]: 121: Hoare triple {169771#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-15 11:56:34,307 INFO L290 TraceCheckUtils]: 122: Hoare triple {169771#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-15 11:56:34,307 INFO L290 TraceCheckUtils]: 123: Hoare triple {169771#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-15 11:56:34,307 INFO L290 TraceCheckUtils]: 124: Hoare triple {169771#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-15 11:56:34,307 INFO L290 TraceCheckUtils]: 125: Hoare triple {169771#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-15 11:56:34,307 INFO L290 TraceCheckUtils]: 126: Hoare triple {169771#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-15 11:56:34,307 INFO L290 TraceCheckUtils]: 127: Hoare triple {169771#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-15 11:56:34,307 INFO L290 TraceCheckUtils]: 128: Hoare triple {169771#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-15 11:56:34,307 INFO L290 TraceCheckUtils]: 129: Hoare triple {169771#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-15 11:56:34,307 INFO L290 TraceCheckUtils]: 130: Hoare triple {169771#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-15 11:56:34,307 INFO L290 TraceCheckUtils]: 131: Hoare triple {169771#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-15 11:56:34,307 INFO L290 TraceCheckUtils]: 132: Hoare triple {169771#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-15 11:56:34,307 INFO L290 TraceCheckUtils]: 133: Hoare triple {169771#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-15 11:56:34,308 INFO L290 TraceCheckUtils]: 134: Hoare triple {169771#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-15 11:56:34,308 INFO L290 TraceCheckUtils]: 135: Hoare triple {169771#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-15 11:56:34,308 INFO L290 TraceCheckUtils]: 136: Hoare triple {169771#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-15 11:56:34,308 INFO L290 TraceCheckUtils]: 137: Hoare triple {169771#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-15 11:56:34,308 INFO L290 TraceCheckUtils]: 138: Hoare triple {169771#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-15 11:56:34,308 INFO L290 TraceCheckUtils]: 139: Hoare triple {169771#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-15 11:56:34,308 INFO L290 TraceCheckUtils]: 140: Hoare triple {169771#false} assume 8640 == #t~mem75;havoc #t~mem75; {169771#false} is VALID [2022-04-15 11:56:34,308 INFO L290 TraceCheckUtils]: 141: Hoare triple {169771#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {169771#false} is VALID [2022-04-15 11:56:34,308 INFO L290 TraceCheckUtils]: 142: Hoare triple {169771#false} assume !(4 == ~blastFlag~0); {169771#false} is VALID [2022-04-15 11:56:34,308 INFO L290 TraceCheckUtils]: 143: Hoare triple {169771#false} assume !(7 == ~blastFlag~0); {169771#false} is VALID [2022-04-15 11:56:34,308 INFO L290 TraceCheckUtils]: 144: Hoare triple {169771#false} assume !(10 == ~blastFlag~0); {169771#false} is VALID [2022-04-15 11:56:34,308 INFO L290 TraceCheckUtils]: 145: Hoare triple {169771#false} assume 13 == ~blastFlag~0; {169771#false} is VALID [2022-04-15 11:56:34,308 INFO L290 TraceCheckUtils]: 146: Hoare triple {169771#false} assume !false; {169771#false} is VALID [2022-04-15 11:56:34,309 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-15 11:56:34,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:56:34,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343714849] [2022-04-15 11:56:34,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343714849] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:56:34,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:56:34,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:56:34,309 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:56:34,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1718862153] [2022-04-15 11:56:34,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1718862153] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:56:34,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:56:34,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:56:34,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045077571] [2022-04-15 11:56:34,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:56:34,310 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 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 147 [2022-04-15 11:56:34,310 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:56:34,310 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:56:34,383 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:56:34,383 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:56:34,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:56:34,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:56:34,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:56:34,384 INFO L87 Difference]: Start difference. First operand 1225 states and 1874 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:56:38,027 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:56:40,035 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-15 11:56:47,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:56:47,050 INFO L93 Difference]: Finished difference Result 2621 states and 3986 transitions. [2022-04-15 11:56:47,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:56:47,050 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 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 147 [2022-04-15 11:56:47,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:56:47,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:56:47,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 593 transitions. [2022-04-15 11:56:47,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:56:47,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 593 transitions. [2022-04-15 11:56:47,054 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 593 transitions. [2022-04-15 11:56:47,457 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-15 11:56:47,540 INFO L225 Difference]: With dead ends: 2621 [2022-04-15 11:56:47,540 INFO L226 Difference]: Without dead ends: 1422 [2022-04-15 11:56:47,541 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-15 11:56:47,541 INFO L913 BasicCegarLoop]: 136 mSDtfsCounter, 120 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 55 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:56:47,541 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 388 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 471 Invalid, 1 Unknown, 0 Unchecked, 7.1s Time] [2022-04-15 11:56:47,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2022-04-15 11:56:47,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 1225. [2022-04-15 11:56:47,641 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:56:47,642 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1422 states. Second operand has 1225 states, 1220 states have (on average 1.518032786885246) internal successors, (1852), 1220 states have internal predecessors, (1852), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:56:47,643 INFO L74 IsIncluded]: Start isIncluded. First operand 1422 states. Second operand has 1225 states, 1220 states have (on average 1.518032786885246) internal successors, (1852), 1220 states have internal predecessors, (1852), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:56:47,644 INFO L87 Difference]: Start difference. First operand 1422 states. Second operand has 1225 states, 1220 states have (on average 1.518032786885246) internal successors, (1852), 1220 states have internal predecessors, (1852), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:56:47,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:56:47,693 INFO L93 Difference]: Finished difference Result 1422 states and 2125 transitions. [2022-04-15 11:56:47,693 INFO L276 IsEmpty]: Start isEmpty. Operand 1422 states and 2125 transitions. [2022-04-15 11:56:47,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:56:47,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:56:47,695 INFO L74 IsIncluded]: Start isIncluded. First operand has 1225 states, 1220 states have (on average 1.518032786885246) internal successors, (1852), 1220 states have internal predecessors, (1852), 3 states have call successors, (3), 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 1422 states. [2022-04-15 11:56:47,696 INFO L87 Difference]: Start difference. First operand has 1225 states, 1220 states have (on average 1.518032786885246) internal successors, (1852), 1220 states have internal predecessors, (1852), 3 states have call successors, (3), 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 1422 states. [2022-04-15 11:56:47,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:56:47,745 INFO L93 Difference]: Finished difference Result 1422 states and 2125 transitions. [2022-04-15 11:56:47,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1422 states and 2125 transitions. [2022-04-15 11:56:47,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:56:47,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:56:47,746 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:56:47,746 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:56:47,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 1220 states have (on average 1.518032786885246) internal successors, (1852), 1220 states have internal predecessors, (1852), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:56:47,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1856 transitions. [2022-04-15 11:56:47,805 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1856 transitions. Word has length 147 [2022-04-15 11:56:47,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:56:47,805 INFO L478 AbstractCegarLoop]: Abstraction has 1225 states and 1856 transitions. [2022-04-15 11:56:47,805 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:56:47,805 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1225 states and 1856 transitions. [2022-04-15 11:56:52,375 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1856 edges. 1855 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:56:52,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1856 transitions. [2022-04-15 11:56:52,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-04-15 11:56:52,377 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:56:52,377 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1] [2022-04-15 11:56:52,377 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-04-15 11:56:52,377 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:56:52,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:56:52,378 INFO L85 PathProgramCache]: Analyzing trace with hash 883672029, now seen corresponding path program 1 times [2022-04-15 11:56:52,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:56:52,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1922879055] [2022-04-15 11:56:52,454 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:56:52,454 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:56:52,455 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:56:52,455 INFO L85 PathProgramCache]: Analyzing trace with hash 883672029, now seen corresponding path program 2 times [2022-04-15 11:56:52,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:56:52,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955965618] [2022-04-15 11:56:52,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:56:52,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:56:52,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:56:52,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:56:52,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:56:52,703 INFO L290 TraceCheckUtils]: 0: Hoare triple {180325#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {180318#true} is VALID [2022-04-15 11:56:52,703 INFO L290 TraceCheckUtils]: 1: Hoare triple {180318#true} assume true; {180318#true} is VALID [2022-04-15 11:56:52,703 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {180318#true} {180318#true} #708#return; {180318#true} is VALID [2022-04-15 11:56:52,704 INFO L272 TraceCheckUtils]: 0: Hoare triple {180318#true} call ULTIMATE.init(); {180325#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:56:52,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {180325#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {180318#true} is VALID [2022-04-15 11:56:52,704 INFO L290 TraceCheckUtils]: 2: Hoare triple {180318#true} assume true; {180318#true} is VALID [2022-04-15 11:56:52,704 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {180318#true} {180318#true} #708#return; {180318#true} is VALID [2022-04-15 11:56:52,704 INFO L272 TraceCheckUtils]: 4: Hoare triple {180318#true} call #t~ret161 := main(); {180318#true} is VALID [2022-04-15 11:56:52,705 INFO L290 TraceCheckUtils]: 5: Hoare triple {180318#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; {180318#true} is VALID [2022-04-15 11:56:52,705 INFO L290 TraceCheckUtils]: 6: Hoare triple {180318#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {180318#true} is VALID [2022-04-15 11:56:52,705 INFO L272 TraceCheckUtils]: 7: Hoare triple {180318#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {180318#true} is VALID [2022-04-15 11:56:52,705 INFO L290 TraceCheckUtils]: 8: Hoare triple {180318#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); {180318#true} is VALID [2022-04-15 11:56:52,705 INFO L290 TraceCheckUtils]: 9: Hoare triple {180318#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; {180318#true} is VALID [2022-04-15 11:56:52,705 INFO L290 TraceCheckUtils]: 10: Hoare triple {180318#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; {180318#true} is VALID [2022-04-15 11:56:52,705 INFO L290 TraceCheckUtils]: 11: Hoare triple {180318#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {180318#true} is VALID [2022-04-15 11:56:52,705 INFO L290 TraceCheckUtils]: 12: Hoare triple {180318#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {180318#true} is VALID [2022-04-15 11:56:52,705 INFO L290 TraceCheckUtils]: 13: Hoare triple {180318#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {180318#true} is VALID [2022-04-15 11:56:52,706 INFO L290 TraceCheckUtils]: 14: Hoare triple {180318#true} assume !false; {180318#true} is VALID [2022-04-15 11:56:52,706 INFO L290 TraceCheckUtils]: 15: Hoare triple {180318#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); {180318#true} is VALID [2022-04-15 11:56:52,706 INFO L290 TraceCheckUtils]: 16: Hoare triple {180318#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {180318#true} is VALID [2022-04-15 11:56:52,706 INFO L290 TraceCheckUtils]: 17: Hoare triple {180318#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {180318#true} is VALID [2022-04-15 11:56:52,706 INFO L290 TraceCheckUtils]: 18: Hoare triple {180318#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {180318#true} is VALID [2022-04-15 11:56:52,706 INFO L290 TraceCheckUtils]: 19: Hoare triple {180318#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {180318#true} is VALID [2022-04-15 11:56:52,706 INFO L290 TraceCheckUtils]: 20: Hoare triple {180318#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {180318#true} is VALID [2022-04-15 11:56:52,706 INFO L290 TraceCheckUtils]: 21: Hoare triple {180318#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {180318#true} is VALID [2022-04-15 11:56:52,706 INFO L290 TraceCheckUtils]: 22: Hoare triple {180318#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {180318#true} is VALID [2022-04-15 11:56:52,706 INFO L290 TraceCheckUtils]: 23: Hoare triple {180318#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {180318#true} is VALID [2022-04-15 11:56:52,707 INFO L290 TraceCheckUtils]: 24: Hoare triple {180318#true} assume 8464 == #t~mem55;havoc #t~mem55; {180318#true} is VALID [2022-04-15 11:56:52,707 INFO L290 TraceCheckUtils]: 25: Hoare triple {180318#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; {180318#true} is VALID [2022-04-15 11:56:52,707 INFO L290 TraceCheckUtils]: 26: Hoare triple {180318#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {180318#true} is VALID [2022-04-15 11:56:52,707 INFO L290 TraceCheckUtils]: 27: Hoare triple {180318#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); {180318#true} is VALID [2022-04-15 11:56:52,707 INFO L290 TraceCheckUtils]: 28: Hoare triple {180318#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); {180318#true} is VALID [2022-04-15 11:56:52,707 INFO L290 TraceCheckUtils]: 29: Hoare triple {180318#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {180318#true} is VALID [2022-04-15 11:56:52,707 INFO L290 TraceCheckUtils]: 30: Hoare triple {180318#true} ~skip~0 := 0; {180318#true} is VALID [2022-04-15 11:56:52,707 INFO L290 TraceCheckUtils]: 31: Hoare triple {180318#true} assume !false; {180318#true} is VALID [2022-04-15 11:56:52,707 INFO L290 TraceCheckUtils]: 32: Hoare triple {180318#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); {180318#true} is VALID [2022-04-15 11:56:52,708 INFO L290 TraceCheckUtils]: 33: Hoare triple {180318#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {180318#true} is VALID [2022-04-15 11:56:52,708 INFO L290 TraceCheckUtils]: 34: Hoare triple {180318#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {180318#true} is VALID [2022-04-15 11:56:52,708 INFO L290 TraceCheckUtils]: 35: Hoare triple {180318#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {180318#true} is VALID [2022-04-15 11:56:52,708 INFO L290 TraceCheckUtils]: 36: Hoare triple {180318#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {180318#true} is VALID [2022-04-15 11:56:52,708 INFO L290 TraceCheckUtils]: 37: Hoare triple {180318#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {180318#true} is VALID [2022-04-15 11:56:52,708 INFO L290 TraceCheckUtils]: 38: Hoare triple {180318#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {180318#true} is VALID [2022-04-15 11:56:52,708 INFO L290 TraceCheckUtils]: 39: Hoare triple {180318#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {180318#true} is VALID [2022-04-15 11:56:52,708 INFO L290 TraceCheckUtils]: 40: Hoare triple {180318#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {180318#true} is VALID [2022-04-15 11:56:52,708 INFO L290 TraceCheckUtils]: 41: Hoare triple {180318#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {180318#true} is VALID [2022-04-15 11:56:52,709 INFO L290 TraceCheckUtils]: 42: Hoare triple {180318#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {180318#true} is VALID [2022-04-15 11:56:52,709 INFO L290 TraceCheckUtils]: 43: Hoare triple {180318#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {180318#true} is VALID [2022-04-15 11:56:52,709 INFO L290 TraceCheckUtils]: 44: Hoare triple {180318#true} assume 8496 == #t~mem58;havoc #t~mem58; {180318#true} is VALID [2022-04-15 11:56:52,709 INFO L290 TraceCheckUtils]: 45: Hoare triple {180318#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {180318#true} is VALID [2022-04-15 11:56:52,709 INFO L290 TraceCheckUtils]: 46: Hoare triple {180318#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {180318#true} is VALID [2022-04-15 11:56:52,709 INFO L290 TraceCheckUtils]: 47: Hoare triple {180318#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {180318#true} is VALID [2022-04-15 11:56:52,710 INFO L290 TraceCheckUtils]: 48: Hoare triple {180318#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {180323#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:56:52,711 INFO L290 TraceCheckUtils]: 49: Hoare triple {180323#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {180323#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:56:52,711 INFO L290 TraceCheckUtils]: 50: Hoare triple {180323#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} 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); {180323#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:56:52,712 INFO L290 TraceCheckUtils]: 51: Hoare triple {180323#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {180323#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:56:52,724 INFO L290 TraceCheckUtils]: 52: Hoare triple {180323#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} ~skip~0 := 0; {180323#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:56:52,727 INFO L290 TraceCheckUtils]: 53: Hoare triple {180323#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !false; {180323#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:56:52,728 INFO L290 TraceCheckUtils]: 54: Hoare triple {180323#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} 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); {180323#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:56:52,728 INFO L290 TraceCheckUtils]: 55: Hoare triple {180323#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {180323#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:56:52,728 INFO L290 TraceCheckUtils]: 56: Hoare triple {180323#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {180323#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:56:52,729 INFO L290 TraceCheckUtils]: 57: Hoare triple {180323#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {180323#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:56:52,729 INFO L290 TraceCheckUtils]: 58: Hoare triple {180323#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {180323#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:56:52,730 INFO L290 TraceCheckUtils]: 59: Hoare triple {180323#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {180323#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:56:52,730 INFO L290 TraceCheckUtils]: 60: Hoare triple {180323#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {180323#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:56:52,731 INFO L290 TraceCheckUtils]: 61: Hoare triple {180323#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {180324#(= |ssl3_accept_#t~mem54| 8512)} is VALID [2022-04-15 11:56:52,731 INFO L290 TraceCheckUtils]: 62: Hoare triple {180324#(= |ssl3_accept_#t~mem54| 8512)} assume 8482 == #t~mem54;havoc #t~mem54; {180319#false} is VALID [2022-04-15 11:56:52,731 INFO L290 TraceCheckUtils]: 63: Hoare triple {180319#false} call write~int(3, ~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-15 11:56:52,731 INFO L290 TraceCheckUtils]: 64: Hoare triple {180319#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); {180319#false} is VALID [2022-04-15 11:56:52,731 INFO L290 TraceCheckUtils]: 65: Hoare triple {180319#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {180319#false} is VALID [2022-04-15 11:56:52,731 INFO L290 TraceCheckUtils]: 66: Hoare triple {180319#false} ~skip~0 := 0; {180319#false} is VALID [2022-04-15 11:56:52,732 INFO L290 TraceCheckUtils]: 67: Hoare triple {180319#false} assume !false; {180319#false} is VALID [2022-04-15 11:56:52,732 INFO L290 TraceCheckUtils]: 68: Hoare triple {180319#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); {180319#false} is VALID [2022-04-15 11:56:52,732 INFO L290 TraceCheckUtils]: 69: Hoare triple {180319#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-15 11:56:52,732 INFO L290 TraceCheckUtils]: 70: Hoare triple {180319#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-15 11:56:52,732 INFO L290 TraceCheckUtils]: 71: Hoare triple {180319#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-15 11:56:52,732 INFO L290 TraceCheckUtils]: 72: Hoare triple {180319#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-15 11:56:52,732 INFO L290 TraceCheckUtils]: 73: Hoare triple {180319#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-15 11:56:52,732 INFO L290 TraceCheckUtils]: 74: Hoare triple {180319#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-15 11:56:52,732 INFO L290 TraceCheckUtils]: 75: Hoare triple {180319#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-15 11:56:52,732 INFO L290 TraceCheckUtils]: 76: Hoare triple {180319#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-15 11:56:52,732 INFO L290 TraceCheckUtils]: 77: Hoare triple {180319#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-15 11:56:52,733 INFO L290 TraceCheckUtils]: 78: Hoare triple {180319#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-15 11:56:52,733 INFO L290 TraceCheckUtils]: 79: Hoare triple {180319#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-15 11:56:52,733 INFO L290 TraceCheckUtils]: 80: Hoare triple {180319#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-15 11:56:52,733 INFO L290 TraceCheckUtils]: 81: Hoare triple {180319#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-15 11:56:52,733 INFO L290 TraceCheckUtils]: 82: Hoare triple {180319#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-15 11:56:52,733 INFO L290 TraceCheckUtils]: 83: Hoare triple {180319#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-15 11:56:52,733 INFO L290 TraceCheckUtils]: 84: Hoare triple {180319#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-15 11:56:52,733 INFO L290 TraceCheckUtils]: 85: Hoare triple {180319#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-15 11:56:52,733 INFO L290 TraceCheckUtils]: 86: Hoare triple {180319#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-15 11:56:52,733 INFO L290 TraceCheckUtils]: 87: Hoare triple {180319#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-15 11:56:52,734 INFO L290 TraceCheckUtils]: 88: Hoare triple {180319#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-15 11:56:52,734 INFO L290 TraceCheckUtils]: 89: Hoare triple {180319#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-15 11:56:52,734 INFO L290 TraceCheckUtils]: 90: Hoare triple {180319#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-15 11:56:52,734 INFO L290 TraceCheckUtils]: 91: Hoare triple {180319#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-15 11:56:52,734 INFO L290 TraceCheckUtils]: 92: Hoare triple {180319#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-15 11:56:52,734 INFO L290 TraceCheckUtils]: 93: Hoare triple {180319#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-15 11:56:52,734 INFO L290 TraceCheckUtils]: 94: Hoare triple {180319#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-15 11:56:52,734 INFO L290 TraceCheckUtils]: 95: Hoare triple {180319#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-15 11:56:52,734 INFO L290 TraceCheckUtils]: 96: Hoare triple {180319#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-15 11:56:52,734 INFO L290 TraceCheckUtils]: 97: Hoare triple {180319#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-15 11:56:52,734 INFO L290 TraceCheckUtils]: 98: Hoare triple {180319#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-15 11:56:52,735 INFO L290 TraceCheckUtils]: 99: Hoare triple {180319#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-15 11:56:52,735 INFO L290 TraceCheckUtils]: 100: Hoare triple {180319#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-15 11:56:52,735 INFO L290 TraceCheckUtils]: 101: Hoare triple {180319#false} assume 8672 == #t~mem79;havoc #t~mem79; {180319#false} is VALID [2022-04-15 11:56:52,735 INFO L290 TraceCheckUtils]: 102: Hoare triple {180319#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {180319#false} is VALID [2022-04-15 11:56:52,735 INFO L290 TraceCheckUtils]: 103: Hoare triple {180319#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {180319#false} is VALID [2022-04-15 11:56:52,735 INFO L290 TraceCheckUtils]: 104: Hoare triple {180319#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); {180319#false} is VALID [2022-04-15 11:56:52,735 INFO L290 TraceCheckUtils]: 105: Hoare triple {180319#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; {180319#false} is VALID [2022-04-15 11:56:52,735 INFO L290 TraceCheckUtils]: 106: Hoare triple {180319#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {180319#false} is VALID [2022-04-15 11:56:52,735 INFO L290 TraceCheckUtils]: 107: Hoare triple {180319#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); {180319#false} is VALID [2022-04-15 11:56:52,735 INFO L290 TraceCheckUtils]: 108: Hoare triple {180319#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {180319#false} is VALID [2022-04-15 11:56:52,735 INFO L290 TraceCheckUtils]: 109: Hoare triple {180319#false} ~skip~0 := 0; {180319#false} is VALID [2022-04-15 11:56:52,736 INFO L290 TraceCheckUtils]: 110: Hoare triple {180319#false} assume !false; {180319#false} is VALID [2022-04-15 11:56:52,736 INFO L290 TraceCheckUtils]: 111: Hoare triple {180319#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); {180319#false} is VALID [2022-04-15 11:56:52,736 INFO L290 TraceCheckUtils]: 112: Hoare triple {180319#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-15 11:56:52,736 INFO L290 TraceCheckUtils]: 113: Hoare triple {180319#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-15 11:56:52,736 INFO L290 TraceCheckUtils]: 114: Hoare triple {180319#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-15 11:56:52,736 INFO L290 TraceCheckUtils]: 115: Hoare triple {180319#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-15 11:56:52,736 INFO L290 TraceCheckUtils]: 116: Hoare triple {180319#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-15 11:56:52,736 INFO L290 TraceCheckUtils]: 117: Hoare triple {180319#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-15 11:56:52,736 INFO L290 TraceCheckUtils]: 118: Hoare triple {180319#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-15 11:56:52,736 INFO L290 TraceCheckUtils]: 119: Hoare triple {180319#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-15 11:56:52,737 INFO L290 TraceCheckUtils]: 120: Hoare triple {180319#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-15 11:56:52,737 INFO L290 TraceCheckUtils]: 121: Hoare triple {180319#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-15 11:56:52,737 INFO L290 TraceCheckUtils]: 122: Hoare triple {180319#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-15 11:56:52,737 INFO L290 TraceCheckUtils]: 123: Hoare triple {180319#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-15 11:56:52,737 INFO L290 TraceCheckUtils]: 124: Hoare triple {180319#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-15 11:56:52,737 INFO L290 TraceCheckUtils]: 125: Hoare triple {180319#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-15 11:56:52,737 INFO L290 TraceCheckUtils]: 126: Hoare triple {180319#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-15 11:56:52,737 INFO L290 TraceCheckUtils]: 127: Hoare triple {180319#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-15 11:56:52,737 INFO L290 TraceCheckUtils]: 128: Hoare triple {180319#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-15 11:56:52,737 INFO L290 TraceCheckUtils]: 129: Hoare triple {180319#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-15 11:56:52,737 INFO L290 TraceCheckUtils]: 130: Hoare triple {180319#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-15 11:56:52,738 INFO L290 TraceCheckUtils]: 131: Hoare triple {180319#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-15 11:56:52,738 INFO L290 TraceCheckUtils]: 132: Hoare triple {180319#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-15 11:56:52,738 INFO L290 TraceCheckUtils]: 133: Hoare triple {180319#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-15 11:56:52,738 INFO L290 TraceCheckUtils]: 134: Hoare triple {180319#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-15 11:56:52,738 INFO L290 TraceCheckUtils]: 135: Hoare triple {180319#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-15 11:56:52,738 INFO L290 TraceCheckUtils]: 136: Hoare triple {180319#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-15 11:56:52,738 INFO L290 TraceCheckUtils]: 137: Hoare triple {180319#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-15 11:56:52,738 INFO L290 TraceCheckUtils]: 138: Hoare triple {180319#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-15 11:56:52,738 INFO L290 TraceCheckUtils]: 139: Hoare triple {180319#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-15 11:56:52,738 INFO L290 TraceCheckUtils]: 140: Hoare triple {180319#false} assume 8640 == #t~mem75;havoc #t~mem75; {180319#false} is VALID [2022-04-15 11:56:52,738 INFO L290 TraceCheckUtils]: 141: Hoare triple {180319#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {180319#false} is VALID [2022-04-15 11:56:52,739 INFO L290 TraceCheckUtils]: 142: Hoare triple {180319#false} assume !(4 == ~blastFlag~0); {180319#false} is VALID [2022-04-15 11:56:52,739 INFO L290 TraceCheckUtils]: 143: Hoare triple {180319#false} assume !(7 == ~blastFlag~0); {180319#false} is VALID [2022-04-15 11:56:52,739 INFO L290 TraceCheckUtils]: 144: Hoare triple {180319#false} assume !(10 == ~blastFlag~0); {180319#false} is VALID [2022-04-15 11:56:52,739 INFO L290 TraceCheckUtils]: 145: Hoare triple {180319#false} assume 13 == ~blastFlag~0; {180319#false} is VALID [2022-04-15 11:56:52,739 INFO L290 TraceCheckUtils]: 146: Hoare triple {180319#false} assume !false; {180319#false} is VALID [2022-04-15 11:56:52,739 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-15 11:56:52,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:56:52,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955965618] [2022-04-15 11:56:52,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955965618] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:56:52,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:56:52,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:56:52,740 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:56:52,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1922879055] [2022-04-15 11:56:52,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1922879055] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:56:52,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:56:52,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:56:52,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926114704] [2022-04-15 11:56:52,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:56:52,742 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (3), 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 147 [2022-04-15 11:56:52,743 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:56:52,743 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:56:52,823 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:56:52,823 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:56:52,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:56:52,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:56:52,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:56:52,824 INFO L87 Difference]: Start difference. First operand 1225 states and 1856 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:56:57,370 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-15 11:57:01,527 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-15 11:57:07,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:57:07,255 INFO L93 Difference]: Finished difference Result 2453 states and 3718 transitions. [2022-04-15 11:57:07,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:57:07,256 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (3), 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 147 [2022-04-15 11:57:07,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:57:07,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:57:07,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 478 transitions. [2022-04-15 11:57:07,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:57:07,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 478 transitions. [2022-04-15 11:57:07,259 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 478 transitions. [2022-04-15 11:57:07,569 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 478 edges. 478 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:57:07,635 INFO L225 Difference]: With dead ends: 2453 [2022-04-15 11:57:07,635 INFO L226 Difference]: Without dead ends: 1254 [2022-04-15 11:57:07,636 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-15 11:57:07,637 INFO L913 BasicCegarLoop]: 244 mSDtfsCounter, 31 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-04-15 11:57:07,637 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 609 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 429 Invalid, 2 Unknown, 0 Unchecked, 6.9s Time] [2022-04-15 11:57:07,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2022-04-15 11:57:07,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 1225. [2022-04-15 11:57:07,758 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:57:07,759 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1254 states. Second operand has 1225 states, 1220 states have (on average 1.5155737704918033) internal successors, (1849), 1220 states have internal predecessors, (1849), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:57:07,760 INFO L74 IsIncluded]: Start isIncluded. First operand 1254 states. Second operand has 1225 states, 1220 states have (on average 1.5155737704918033) internal successors, (1849), 1220 states have internal predecessors, (1849), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:57:07,761 INFO L87 Difference]: Start difference. First operand 1254 states. Second operand has 1225 states, 1220 states have (on average 1.5155737704918033) internal successors, (1849), 1220 states have internal predecessors, (1849), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:57:07,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:57:07,801 INFO L93 Difference]: Finished difference Result 1254 states and 1890 transitions. [2022-04-15 11:57:07,801 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 1890 transitions. [2022-04-15 11:57:07,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:57:07,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:57:07,802 INFO L74 IsIncluded]: Start isIncluded. First operand has 1225 states, 1220 states have (on average 1.5155737704918033) internal successors, (1849), 1220 states have internal predecessors, (1849), 3 states have call successors, (3), 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 1254 states. [2022-04-15 11:57:07,803 INFO L87 Difference]: Start difference. First operand has 1225 states, 1220 states have (on average 1.5155737704918033) internal successors, (1849), 1220 states have internal predecessors, (1849), 3 states have call successors, (3), 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 1254 states. [2022-04-15 11:57:07,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:57:07,843 INFO L93 Difference]: Finished difference Result 1254 states and 1890 transitions. [2022-04-15 11:57:07,843 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 1890 transitions. [2022-04-15 11:57:07,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:57:07,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:57:07,855 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:57:07,855 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:57:07,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 1220 states have (on average 1.5155737704918033) internal successors, (1849), 1220 states have internal predecessors, (1849), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:57:07,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1853 transitions. [2022-04-15 11:57:07,916 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1853 transitions. Word has length 147 [2022-04-15 11:57:07,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:57:07,916 INFO L478 AbstractCegarLoop]: Abstraction has 1225 states and 1853 transitions. [2022-04-15 11:57:07,916 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:57:07,916 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1225 states and 1853 transitions. [2022-04-15 11:57:12,414 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1853 edges. 1852 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:57:12,414 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1853 transitions. [2022-04-15 11:57:12,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-04-15 11:57:12,416 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:57:12,416 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:57:12,416 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-04-15 11:57:12,416 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:57:12,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:57:12,416 INFO L85 PathProgramCache]: Analyzing trace with hash -979936917, now seen corresponding path program 1 times [2022-04-15 11:57:12,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:57:12,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [876410649] [2022-04-15 11:57:12,564 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:57:12,565 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:57:12,565 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:57:12,565 INFO L85 PathProgramCache]: Analyzing trace with hash -979936917, now seen corresponding path program 2 times [2022-04-15 11:57:12,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:57:12,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492362455] [2022-04-15 11:57:12,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:57:12,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:57:12,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:57:12,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:57:12,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:57:12,801 INFO L290 TraceCheckUtils]: 0: Hoare triple {190201#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {190194#true} is VALID [2022-04-15 11:57:12,801 INFO L290 TraceCheckUtils]: 1: Hoare triple {190194#true} assume true; {190194#true} is VALID [2022-04-15 11:57:12,801 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {190194#true} {190194#true} #708#return; {190194#true} is VALID [2022-04-15 11:57:12,801 INFO L272 TraceCheckUtils]: 0: Hoare triple {190194#true} call ULTIMATE.init(); {190201#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:57:12,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {190201#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {190194#true} is VALID [2022-04-15 11:57:12,802 INFO L290 TraceCheckUtils]: 2: Hoare triple {190194#true} assume true; {190194#true} is VALID [2022-04-15 11:57:12,802 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {190194#true} {190194#true} #708#return; {190194#true} is VALID [2022-04-15 11:57:12,802 INFO L272 TraceCheckUtils]: 4: Hoare triple {190194#true} call #t~ret161 := main(); {190194#true} is VALID [2022-04-15 11:57:12,802 INFO L290 TraceCheckUtils]: 5: Hoare triple {190194#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; {190194#true} is VALID [2022-04-15 11:57:12,802 INFO L290 TraceCheckUtils]: 6: Hoare triple {190194#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {190194#true} is VALID [2022-04-15 11:57:12,802 INFO L272 TraceCheckUtils]: 7: Hoare triple {190194#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {190194#true} is VALID [2022-04-15 11:57:12,802 INFO L290 TraceCheckUtils]: 8: Hoare triple {190194#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); {190194#true} is VALID [2022-04-15 11:57:12,802 INFO L290 TraceCheckUtils]: 9: Hoare triple {190194#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; {190194#true} is VALID [2022-04-15 11:57:12,802 INFO L290 TraceCheckUtils]: 10: Hoare triple {190194#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; {190194#true} is VALID [2022-04-15 11:57:12,802 INFO L290 TraceCheckUtils]: 11: Hoare triple {190194#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {190194#true} is VALID [2022-04-15 11:57:12,802 INFO L290 TraceCheckUtils]: 12: Hoare triple {190194#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {190194#true} is VALID [2022-04-15 11:57:12,802 INFO L290 TraceCheckUtils]: 13: Hoare triple {190194#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {190194#true} is VALID [2022-04-15 11:57:12,802 INFO L290 TraceCheckUtils]: 14: Hoare triple {190194#true} assume !false; {190194#true} is VALID [2022-04-15 11:57:12,803 INFO L290 TraceCheckUtils]: 15: Hoare triple {190194#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); {190194#true} is VALID [2022-04-15 11:57:12,803 INFO L290 TraceCheckUtils]: 16: Hoare triple {190194#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {190194#true} is VALID [2022-04-15 11:57:12,803 INFO L290 TraceCheckUtils]: 17: Hoare triple {190194#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {190194#true} is VALID [2022-04-15 11:57:12,803 INFO L290 TraceCheckUtils]: 18: Hoare triple {190194#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {190194#true} is VALID [2022-04-15 11:57:12,803 INFO L290 TraceCheckUtils]: 19: Hoare triple {190194#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {190194#true} is VALID [2022-04-15 11:57:12,803 INFO L290 TraceCheckUtils]: 20: Hoare triple {190194#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {190194#true} is VALID [2022-04-15 11:57:12,803 INFO L290 TraceCheckUtils]: 21: Hoare triple {190194#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {190194#true} is VALID [2022-04-15 11:57:12,803 INFO L290 TraceCheckUtils]: 22: Hoare triple {190194#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {190194#true} is VALID [2022-04-15 11:57:12,803 INFO L290 TraceCheckUtils]: 23: Hoare triple {190194#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {190194#true} is VALID [2022-04-15 11:57:12,803 INFO L290 TraceCheckUtils]: 24: Hoare triple {190194#true} assume 8464 == #t~mem55;havoc #t~mem55; {190194#true} is VALID [2022-04-15 11:57:12,803 INFO L290 TraceCheckUtils]: 25: Hoare triple {190194#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; {190194#true} is VALID [2022-04-15 11:57:12,803 INFO L290 TraceCheckUtils]: 26: Hoare triple {190194#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {190194#true} is VALID [2022-04-15 11:57:12,803 INFO L290 TraceCheckUtils]: 27: Hoare triple {190194#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); {190194#true} is VALID [2022-04-15 11:57:12,803 INFO L290 TraceCheckUtils]: 28: Hoare triple {190194#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); {190194#true} is VALID [2022-04-15 11:57:12,804 INFO L290 TraceCheckUtils]: 29: Hoare triple {190194#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {190194#true} is VALID [2022-04-15 11:57:12,804 INFO L290 TraceCheckUtils]: 30: Hoare triple {190194#true} ~skip~0 := 0; {190194#true} is VALID [2022-04-15 11:57:12,804 INFO L290 TraceCheckUtils]: 31: Hoare triple {190194#true} assume !false; {190194#true} is VALID [2022-04-15 11:57:12,804 INFO L290 TraceCheckUtils]: 32: Hoare triple {190194#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); {190194#true} is VALID [2022-04-15 11:57:12,804 INFO L290 TraceCheckUtils]: 33: Hoare triple {190194#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {190194#true} is VALID [2022-04-15 11:57:12,804 INFO L290 TraceCheckUtils]: 34: Hoare triple {190194#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {190194#true} is VALID [2022-04-15 11:57:12,804 INFO L290 TraceCheckUtils]: 35: Hoare triple {190194#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {190194#true} is VALID [2022-04-15 11:57:12,804 INFO L290 TraceCheckUtils]: 36: Hoare triple {190194#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {190194#true} is VALID [2022-04-15 11:57:12,804 INFO L290 TraceCheckUtils]: 37: Hoare triple {190194#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {190194#true} is VALID [2022-04-15 11:57:12,804 INFO L290 TraceCheckUtils]: 38: Hoare triple {190194#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {190194#true} is VALID [2022-04-15 11:57:12,804 INFO L290 TraceCheckUtils]: 39: Hoare triple {190194#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {190194#true} is VALID [2022-04-15 11:57:12,804 INFO L290 TraceCheckUtils]: 40: Hoare triple {190194#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {190194#true} is VALID [2022-04-15 11:57:12,804 INFO L290 TraceCheckUtils]: 41: Hoare triple {190194#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {190194#true} is VALID [2022-04-15 11:57:12,804 INFO L290 TraceCheckUtils]: 42: Hoare triple {190194#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {190194#true} is VALID [2022-04-15 11:57:12,804 INFO L290 TraceCheckUtils]: 43: Hoare triple {190194#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {190194#true} is VALID [2022-04-15 11:57:12,805 INFO L290 TraceCheckUtils]: 44: Hoare triple {190194#true} assume 8496 == #t~mem58;havoc #t~mem58; {190194#true} is VALID [2022-04-15 11:57:12,805 INFO L290 TraceCheckUtils]: 45: Hoare triple {190194#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {190194#true} is VALID [2022-04-15 11:57:12,805 INFO L290 TraceCheckUtils]: 46: Hoare triple {190194#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {190194#true} is VALID [2022-04-15 11:57:12,805 INFO L290 TraceCheckUtils]: 47: Hoare triple {190194#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {190194#true} is VALID [2022-04-15 11:57:12,805 INFO L290 TraceCheckUtils]: 48: Hoare triple {190194#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {190199#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:57:12,806 INFO L290 TraceCheckUtils]: 49: Hoare triple {190199#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {190199#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:57:12,807 INFO L290 TraceCheckUtils]: 50: Hoare triple {190199#(= 8656 (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); {190199#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:57:12,807 INFO L290 TraceCheckUtils]: 51: Hoare triple {190199#(= 8656 (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; {190199#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:57:12,815 INFO L290 TraceCheckUtils]: 52: Hoare triple {190199#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {190199#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:57:12,816 INFO L290 TraceCheckUtils]: 53: Hoare triple {190199#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {190199#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:57:12,816 INFO L290 TraceCheckUtils]: 54: Hoare triple {190199#(= 8656 (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); {190199#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:57:12,817 INFO L290 TraceCheckUtils]: 55: Hoare triple {190199#(= 8656 (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); {190199#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:57:12,817 INFO L290 TraceCheckUtils]: 56: Hoare triple {190199#(= 8656 (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); {190199#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:57:12,818 INFO L290 TraceCheckUtils]: 57: Hoare triple {190199#(= 8656 (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); {190199#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:57:12,818 INFO L290 TraceCheckUtils]: 58: Hoare triple {190199#(= 8656 (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); {190199#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:57:12,818 INFO L290 TraceCheckUtils]: 59: Hoare triple {190199#(= 8656 (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); {190199#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:57:12,819 INFO L290 TraceCheckUtils]: 60: Hoare triple {190199#(= 8656 (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); {190199#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:57:12,819 INFO L290 TraceCheckUtils]: 61: Hoare triple {190199#(= 8656 (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); {190199#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:57:12,819 INFO L290 TraceCheckUtils]: 62: Hoare triple {190199#(= 8656 (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); {190199#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:57:12,820 INFO L290 TraceCheckUtils]: 63: Hoare triple {190199#(= 8656 (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); {190199#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:57:12,820 INFO L290 TraceCheckUtils]: 64: Hoare triple {190199#(= 8656 (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); {190199#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:57:12,820 INFO L290 TraceCheckUtils]: 65: Hoare triple {190199#(= 8656 (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); {190199#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:57:12,821 INFO L290 TraceCheckUtils]: 66: Hoare triple {190199#(= 8656 (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); {190199#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:57:12,821 INFO L290 TraceCheckUtils]: 67: Hoare triple {190199#(= 8656 (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); {190199#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:57:12,822 INFO L290 TraceCheckUtils]: 68: Hoare triple {190199#(= 8656 (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); {190199#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:57:12,822 INFO L290 TraceCheckUtils]: 69: Hoare triple {190199#(= 8656 (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); {190199#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:57:12,822 INFO L290 TraceCheckUtils]: 70: Hoare triple {190199#(= 8656 (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); {190199#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:57:12,823 INFO L290 TraceCheckUtils]: 71: Hoare triple {190199#(= 8656 (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); {190200#(= |ssl3_accept_#t~mem64| 8656)} is VALID [2022-04-15 11:57:12,826 INFO L290 TraceCheckUtils]: 72: Hoare triple {190200#(= |ssl3_accept_#t~mem64| 8656)} assume 8544 == #t~mem64;havoc #t~mem64; {190195#false} is VALID [2022-04-15 11:57:12,826 INFO L290 TraceCheckUtils]: 73: Hoare triple {190195#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {190195#false} is VALID [2022-04-15 11:57:12,826 INFO L290 TraceCheckUtils]: 74: Hoare triple {190195#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {190195#false} is VALID [2022-04-15 11:57:12,826 INFO L290 TraceCheckUtils]: 75: Hoare triple {190195#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {190195#false} is VALID [2022-04-15 11:57:12,826 INFO L290 TraceCheckUtils]: 76: Hoare triple {190195#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {190195#false} is VALID [2022-04-15 11:57:12,826 INFO L290 TraceCheckUtils]: 77: Hoare triple {190195#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {190195#false} is VALID [2022-04-15 11:57:12,826 INFO L290 TraceCheckUtils]: 78: Hoare triple {190195#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {190195#false} is VALID [2022-04-15 11:57:12,826 INFO L290 TraceCheckUtils]: 79: Hoare triple {190195#false} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 52 + ~s.offset, 4);call #t~mem128.base, #t~mem128.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8576, #t~mem128.base, 844 + #t~mem128.offset, 4);havoc #t~mem128.base, #t~mem128.offset;call write~int(0, ~s.base, 64 + ~s.offset, 4); {190195#false} is VALID [2022-04-15 11:57:12,827 INFO L290 TraceCheckUtils]: 80: Hoare triple {190195#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); {190195#false} is VALID [2022-04-15 11:57:12,827 INFO L290 TraceCheckUtils]: 81: Hoare triple {190195#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {190195#false} is VALID [2022-04-15 11:57:12,827 INFO L290 TraceCheckUtils]: 82: Hoare triple {190195#false} ~skip~0 := 0; {190195#false} is VALID [2022-04-15 11:57:12,827 INFO L290 TraceCheckUtils]: 83: Hoare triple {190195#false} assume !false; {190195#false} is VALID [2022-04-15 11:57:12,827 INFO L290 TraceCheckUtils]: 84: Hoare triple {190195#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); {190195#false} is VALID [2022-04-15 11:57:12,827 INFO L290 TraceCheckUtils]: 85: Hoare triple {190195#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-15 11:57:12,827 INFO L290 TraceCheckUtils]: 86: Hoare triple {190195#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-15 11:57:12,827 INFO L290 TraceCheckUtils]: 87: Hoare triple {190195#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-15 11:57:12,827 INFO L290 TraceCheckUtils]: 88: Hoare triple {190195#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-15 11:57:12,827 INFO L290 TraceCheckUtils]: 89: Hoare triple {190195#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-15 11:57:12,828 INFO L290 TraceCheckUtils]: 90: Hoare triple {190195#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-15 11:57:12,828 INFO L290 TraceCheckUtils]: 91: Hoare triple {190195#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-15 11:57:12,828 INFO L290 TraceCheckUtils]: 92: Hoare triple {190195#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-15 11:57:12,828 INFO L290 TraceCheckUtils]: 93: Hoare triple {190195#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-15 11:57:12,828 INFO L290 TraceCheckUtils]: 94: Hoare triple {190195#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-15 11:57:12,828 INFO L290 TraceCheckUtils]: 95: Hoare triple {190195#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-15 11:57:12,828 INFO L290 TraceCheckUtils]: 96: Hoare triple {190195#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-15 11:57:12,828 INFO L290 TraceCheckUtils]: 97: Hoare triple {190195#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-15 11:57:12,828 INFO L290 TraceCheckUtils]: 98: Hoare triple {190195#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-15 11:57:12,829 INFO L290 TraceCheckUtils]: 99: Hoare triple {190195#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-15 11:57:12,829 INFO L290 TraceCheckUtils]: 100: Hoare triple {190195#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-15 11:57:12,829 INFO L290 TraceCheckUtils]: 101: Hoare triple {190195#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-15 11:57:12,829 INFO L290 TraceCheckUtils]: 102: Hoare triple {190195#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-15 11:57:12,829 INFO L290 TraceCheckUtils]: 103: Hoare triple {190195#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-15 11:57:12,829 INFO L290 TraceCheckUtils]: 104: Hoare triple {190195#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-15 11:57:12,829 INFO L290 TraceCheckUtils]: 105: Hoare triple {190195#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-15 11:57:12,829 INFO L290 TraceCheckUtils]: 106: Hoare triple {190195#false} assume 8448 == #t~mem68;havoc #t~mem68; {190195#false} is VALID [2022-04-15 11:57:12,829 INFO L290 TraceCheckUtils]: 107: Hoare triple {190195#false} assume !(~num1~0 > 0); {190195#false} is VALID [2022-04-15 11:57:12,829 INFO L290 TraceCheckUtils]: 108: Hoare triple {190195#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; {190195#false} is VALID [2022-04-15 11:57:12,829 INFO L290 TraceCheckUtils]: 109: Hoare triple {190195#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); {190195#false} is VALID [2022-04-15 11:57:12,830 INFO L290 TraceCheckUtils]: 110: Hoare triple {190195#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {190195#false} is VALID [2022-04-15 11:57:12,830 INFO L290 TraceCheckUtils]: 111: Hoare triple {190195#false} ~skip~0 := 0; {190195#false} is VALID [2022-04-15 11:57:12,830 INFO L290 TraceCheckUtils]: 112: Hoare triple {190195#false} assume !false; {190195#false} is VALID [2022-04-15 11:57:12,830 INFO L290 TraceCheckUtils]: 113: Hoare triple {190195#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); {190195#false} is VALID [2022-04-15 11:57:12,830 INFO L290 TraceCheckUtils]: 114: Hoare triple {190195#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-15 11:57:12,830 INFO L290 TraceCheckUtils]: 115: Hoare triple {190195#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-15 11:57:12,830 INFO L290 TraceCheckUtils]: 116: Hoare triple {190195#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-15 11:57:12,830 INFO L290 TraceCheckUtils]: 117: Hoare triple {190195#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-15 11:57:12,830 INFO L290 TraceCheckUtils]: 118: Hoare triple {190195#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-15 11:57:12,830 INFO L290 TraceCheckUtils]: 119: Hoare triple {190195#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-15 11:57:12,830 INFO L290 TraceCheckUtils]: 120: Hoare triple {190195#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-15 11:57:12,831 INFO L290 TraceCheckUtils]: 121: Hoare triple {190195#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-15 11:57:12,831 INFO L290 TraceCheckUtils]: 122: Hoare triple {190195#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-15 11:57:12,831 INFO L290 TraceCheckUtils]: 123: Hoare triple {190195#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-15 11:57:12,831 INFO L290 TraceCheckUtils]: 124: Hoare triple {190195#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-15 11:57:12,831 INFO L290 TraceCheckUtils]: 125: Hoare triple {190195#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-15 11:57:12,831 INFO L290 TraceCheckUtils]: 126: Hoare triple {190195#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-15 11:57:12,831 INFO L290 TraceCheckUtils]: 127: Hoare triple {190195#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-15 11:57:12,831 INFO L290 TraceCheckUtils]: 128: Hoare triple {190195#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-15 11:57:12,831 INFO L290 TraceCheckUtils]: 129: Hoare triple {190195#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-15 11:57:12,831 INFO L290 TraceCheckUtils]: 130: Hoare triple {190195#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-15 11:57:12,832 INFO L290 TraceCheckUtils]: 131: Hoare triple {190195#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-15 11:57:12,832 INFO L290 TraceCheckUtils]: 132: Hoare triple {190195#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-15 11:57:12,832 INFO L290 TraceCheckUtils]: 133: Hoare triple {190195#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-15 11:57:12,832 INFO L290 TraceCheckUtils]: 134: Hoare triple {190195#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-15 11:57:12,832 INFO L290 TraceCheckUtils]: 135: Hoare triple {190195#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-15 11:57:12,832 INFO L290 TraceCheckUtils]: 136: Hoare triple {190195#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-15 11:57:12,832 INFO L290 TraceCheckUtils]: 137: Hoare triple {190195#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-15 11:57:12,832 INFO L290 TraceCheckUtils]: 138: Hoare triple {190195#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-15 11:57:12,832 INFO L290 TraceCheckUtils]: 139: Hoare triple {190195#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-15 11:57:12,832 INFO L290 TraceCheckUtils]: 140: Hoare triple {190195#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-15 11:57:12,833 INFO L290 TraceCheckUtils]: 141: Hoare triple {190195#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-15 11:57:12,833 INFO L290 TraceCheckUtils]: 142: Hoare triple {190195#false} assume 8640 == #t~mem75;havoc #t~mem75; {190195#false} is VALID [2022-04-15 11:57:12,833 INFO L290 TraceCheckUtils]: 143: Hoare triple {190195#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {190195#false} is VALID [2022-04-15 11:57:12,833 INFO L290 TraceCheckUtils]: 144: Hoare triple {190195#false} assume !(4 == ~blastFlag~0); {190195#false} is VALID [2022-04-15 11:57:12,833 INFO L290 TraceCheckUtils]: 145: Hoare triple {190195#false} assume !(7 == ~blastFlag~0); {190195#false} is VALID [2022-04-15 11:57:12,833 INFO L290 TraceCheckUtils]: 146: Hoare triple {190195#false} assume !(10 == ~blastFlag~0); {190195#false} is VALID [2022-04-15 11:57:12,833 INFO L290 TraceCheckUtils]: 147: Hoare triple {190195#false} assume 13 == ~blastFlag~0; {190195#false} is VALID [2022-04-15 11:57:12,833 INFO L290 TraceCheckUtils]: 148: Hoare triple {190195#false} assume !false; {190195#false} is VALID [2022-04-15 11:57:12,834 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-15 11:57:12,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:57:12,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492362455] [2022-04-15 11:57:12,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492362455] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:57:12,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:57:12,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:57:12,834 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:57:12,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [876410649] [2022-04-15 11:57:12,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [876410649] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:57:12,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:57:12,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:57:12,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8239994] [2022-04-15 11:57:12,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:57:12,835 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 149 [2022-04-15 11:57:12,835 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:57:12,835 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-15 11:57:12,910 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-15 11:57:12,910 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:57:12,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:57:12,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:57:12,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:57:12,910 INFO L87 Difference]: Start difference. First operand 1225 states and 1853 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-15 11:57:14,992 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-15 11:57:21,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:57:21,856 INFO L93 Difference]: Finished difference Result 2504 states and 3784 transitions. [2022-04-15 11:57:21,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:57:21,856 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 149 [2022-04-15 11:57:21,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:57:21,856 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-15 11:57:21,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 529 transitions. [2022-04-15 11:57:21,858 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-15 11:57:21,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 529 transitions. [2022-04-15 11:57:21,860 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 529 transitions. [2022-04-15 11:57:22,203 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 529 edges. 529 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:57:22,282 INFO L225 Difference]: With dead ends: 2504 [2022-04-15 11:57:22,282 INFO L226 Difference]: Without dead ends: 1305 [2022-04-15 11:57:22,283 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-15 11:57:22,284 INFO L913 BasicCegarLoop]: 260 mSDtfsCounter, 61 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:57:22,284 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 641 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 554 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2022-04-15 11:57:22,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1305 states. [2022-04-15 11:57:22,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1305 to 1225. [2022-04-15 11:57:22,375 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:57:22,376 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1305 states. Second operand has 1225 states, 1220 states have (on average 1.5131147540983607) internal successors, (1846), 1220 states have internal predecessors, (1846), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:57:22,376 INFO L74 IsIncluded]: Start isIncluded. First operand 1305 states. Second operand has 1225 states, 1220 states have (on average 1.5131147540983607) internal successors, (1846), 1220 states have internal predecessors, (1846), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:57:22,377 INFO L87 Difference]: Start difference. First operand 1305 states. Second operand has 1225 states, 1220 states have (on average 1.5131147540983607) internal successors, (1846), 1220 states have internal predecessors, (1846), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:57:22,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:57:22,420 INFO L93 Difference]: Finished difference Result 1305 states and 1959 transitions. [2022-04-15 11:57:22,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1305 states and 1959 transitions. [2022-04-15 11:57:22,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:57:22,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:57:22,422 INFO L74 IsIncluded]: Start isIncluded. First operand has 1225 states, 1220 states have (on average 1.5131147540983607) internal successors, (1846), 1220 states have internal predecessors, (1846), 3 states have call successors, (3), 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 1305 states. [2022-04-15 11:57:22,422 INFO L87 Difference]: Start difference. First operand has 1225 states, 1220 states have (on average 1.5131147540983607) internal successors, (1846), 1220 states have internal predecessors, (1846), 3 states have call successors, (3), 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 1305 states. [2022-04-15 11:57:22,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:57:22,465 INFO L93 Difference]: Finished difference Result 1305 states and 1959 transitions. [2022-04-15 11:57:22,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1305 states and 1959 transitions. [2022-04-15 11:57:22,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:57:22,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:57:22,466 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:57:22,466 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:57:22,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 1220 states have (on average 1.5131147540983607) internal successors, (1846), 1220 states have internal predecessors, (1846), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:57:22,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1850 transitions. [2022-04-15 11:57:22,538 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1850 transitions. Word has length 149 [2022-04-15 11:57:22,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:57:22,538 INFO L478 AbstractCegarLoop]: Abstraction has 1225 states and 1850 transitions. [2022-04-15 11:57:22,538 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-15 11:57:22,538 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1225 states and 1850 transitions. [2022-04-15 11:57:27,067 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1850 edges. 1849 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:57:27,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1850 transitions. [2022-04-15 11:57:27,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-04-15 11:57:27,069 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:57:27,069 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:57:27,069 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-04-15 11:57:27,069 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:57:27,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:57:27,069 INFO L85 PathProgramCache]: Analyzing trace with hash -292719464, now seen corresponding path program 1 times [2022-04-15 11:57:27,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:57:27,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2017010865] [2022-04-15 11:57:27,184 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:57:27,185 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:57:27,185 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:57:27,185 INFO L85 PathProgramCache]: Analyzing trace with hash -292719464, now seen corresponding path program 2 times [2022-04-15 11:57:27,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:57:27,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968977903] [2022-04-15 11:57:27,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:57:27,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:57:27,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:57:27,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:57:27,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:57:27,406 INFO L290 TraceCheckUtils]: 0: Hoare triple {200281#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {200274#true} is VALID [2022-04-15 11:57:27,406 INFO L290 TraceCheckUtils]: 1: Hoare triple {200274#true} assume true; {200274#true} is VALID [2022-04-15 11:57:27,406 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {200274#true} {200274#true} #708#return; {200274#true} is VALID [2022-04-15 11:57:27,407 INFO L272 TraceCheckUtils]: 0: Hoare triple {200274#true} call ULTIMATE.init(); {200281#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:57:27,407 INFO L290 TraceCheckUtils]: 1: Hoare triple {200281#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {200274#true} is VALID [2022-04-15 11:57:27,407 INFO L290 TraceCheckUtils]: 2: Hoare triple {200274#true} assume true; {200274#true} is VALID [2022-04-15 11:57:27,407 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {200274#true} {200274#true} #708#return; {200274#true} is VALID [2022-04-15 11:57:27,407 INFO L272 TraceCheckUtils]: 4: Hoare triple {200274#true} call #t~ret161 := main(); {200274#true} is VALID [2022-04-15 11:57:27,407 INFO L290 TraceCheckUtils]: 5: Hoare triple {200274#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; {200274#true} is VALID [2022-04-15 11:57:27,407 INFO L290 TraceCheckUtils]: 6: Hoare triple {200274#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {200274#true} is VALID [2022-04-15 11:57:27,407 INFO L272 TraceCheckUtils]: 7: Hoare triple {200274#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {200274#true} is VALID [2022-04-15 11:57:27,407 INFO L290 TraceCheckUtils]: 8: Hoare triple {200274#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); {200274#true} is VALID [2022-04-15 11:57:27,408 INFO L290 TraceCheckUtils]: 9: Hoare triple {200274#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; {200274#true} is VALID [2022-04-15 11:57:27,408 INFO L290 TraceCheckUtils]: 10: Hoare triple {200274#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; {200274#true} is VALID [2022-04-15 11:57:27,408 INFO L290 TraceCheckUtils]: 11: Hoare triple {200274#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {200274#true} is VALID [2022-04-15 11:57:27,408 INFO L290 TraceCheckUtils]: 12: Hoare triple {200274#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {200274#true} is VALID [2022-04-15 11:57:27,408 INFO L290 TraceCheckUtils]: 13: Hoare triple {200274#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {200274#true} is VALID [2022-04-15 11:57:27,408 INFO L290 TraceCheckUtils]: 14: Hoare triple {200274#true} assume !false; {200274#true} is VALID [2022-04-15 11:57:27,408 INFO L290 TraceCheckUtils]: 15: Hoare triple {200274#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); {200274#true} is VALID [2022-04-15 11:57:27,408 INFO L290 TraceCheckUtils]: 16: Hoare triple {200274#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {200274#true} is VALID [2022-04-15 11:57:27,408 INFO L290 TraceCheckUtils]: 17: Hoare triple {200274#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {200274#true} is VALID [2022-04-15 11:57:27,408 INFO L290 TraceCheckUtils]: 18: Hoare triple {200274#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {200274#true} is VALID [2022-04-15 11:57:27,408 INFO L290 TraceCheckUtils]: 19: Hoare triple {200274#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {200274#true} is VALID [2022-04-15 11:57:27,408 INFO L290 TraceCheckUtils]: 20: Hoare triple {200274#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {200274#true} is VALID [2022-04-15 11:57:27,408 INFO L290 TraceCheckUtils]: 21: Hoare triple {200274#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {200274#true} is VALID [2022-04-15 11:57:27,408 INFO L290 TraceCheckUtils]: 22: Hoare triple {200274#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {200274#true} is VALID [2022-04-15 11:57:27,408 INFO L290 TraceCheckUtils]: 23: Hoare triple {200274#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {200274#true} is VALID [2022-04-15 11:57:27,409 INFO L290 TraceCheckUtils]: 24: Hoare triple {200274#true} assume 8464 == #t~mem55;havoc #t~mem55; {200274#true} is VALID [2022-04-15 11:57:27,409 INFO L290 TraceCheckUtils]: 25: Hoare triple {200274#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; {200274#true} is VALID [2022-04-15 11:57:27,409 INFO L290 TraceCheckUtils]: 26: Hoare triple {200274#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {200274#true} is VALID [2022-04-15 11:57:27,409 INFO L290 TraceCheckUtils]: 27: Hoare triple {200274#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); {200274#true} is VALID [2022-04-15 11:57:27,409 INFO L290 TraceCheckUtils]: 28: Hoare triple {200274#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); {200274#true} is VALID [2022-04-15 11:57:27,409 INFO L290 TraceCheckUtils]: 29: Hoare triple {200274#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {200274#true} is VALID [2022-04-15 11:57:27,409 INFO L290 TraceCheckUtils]: 30: Hoare triple {200274#true} ~skip~0 := 0; {200274#true} is VALID [2022-04-15 11:57:27,409 INFO L290 TraceCheckUtils]: 31: Hoare triple {200274#true} assume !false; {200274#true} is VALID [2022-04-15 11:57:27,409 INFO L290 TraceCheckUtils]: 32: Hoare triple {200274#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); {200274#true} is VALID [2022-04-15 11:57:27,409 INFO L290 TraceCheckUtils]: 33: Hoare triple {200274#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {200274#true} is VALID [2022-04-15 11:57:27,409 INFO L290 TraceCheckUtils]: 34: Hoare triple {200274#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {200274#true} is VALID [2022-04-15 11:57:27,409 INFO L290 TraceCheckUtils]: 35: Hoare triple {200274#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {200274#true} is VALID [2022-04-15 11:57:27,409 INFO L290 TraceCheckUtils]: 36: Hoare triple {200274#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {200274#true} is VALID [2022-04-15 11:57:27,409 INFO L290 TraceCheckUtils]: 37: Hoare triple {200274#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {200274#true} is VALID [2022-04-15 11:57:27,410 INFO L290 TraceCheckUtils]: 38: Hoare triple {200274#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {200274#true} is VALID [2022-04-15 11:57:27,410 INFO L290 TraceCheckUtils]: 39: Hoare triple {200274#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {200274#true} is VALID [2022-04-15 11:57:27,410 INFO L290 TraceCheckUtils]: 40: Hoare triple {200274#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {200274#true} is VALID [2022-04-15 11:57:27,410 INFO L290 TraceCheckUtils]: 41: Hoare triple {200274#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {200274#true} is VALID [2022-04-15 11:57:27,410 INFO L290 TraceCheckUtils]: 42: Hoare triple {200274#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {200274#true} is VALID [2022-04-15 11:57:27,410 INFO L290 TraceCheckUtils]: 43: Hoare triple {200274#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {200274#true} is VALID [2022-04-15 11:57:27,410 INFO L290 TraceCheckUtils]: 44: Hoare triple {200274#true} assume 8496 == #t~mem58;havoc #t~mem58; {200274#true} is VALID [2022-04-15 11:57:27,410 INFO L290 TraceCheckUtils]: 45: Hoare triple {200274#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {200274#true} is VALID [2022-04-15 11:57:27,410 INFO L290 TraceCheckUtils]: 46: Hoare triple {200274#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {200274#true} is VALID [2022-04-15 11:57:27,410 INFO L290 TraceCheckUtils]: 47: Hoare triple {200274#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {200274#true} is VALID [2022-04-15 11:57:27,411 INFO L290 TraceCheckUtils]: 48: Hoare triple {200274#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:57:27,412 INFO L290 TraceCheckUtils]: 49: Hoare triple {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:57:27,412 INFO L290 TraceCheckUtils]: 50: Hoare triple {200279#(= 8656 (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); {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:57:27,412 INFO L290 TraceCheckUtils]: 51: Hoare triple {200279#(= 8656 (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; {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:57:27,413 INFO L290 TraceCheckUtils]: 52: Hoare triple {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:57:27,413 INFO L290 TraceCheckUtils]: 53: Hoare triple {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:57:27,413 INFO L290 TraceCheckUtils]: 54: Hoare triple {200279#(= 8656 (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); {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:57:27,414 INFO L290 TraceCheckUtils]: 55: Hoare triple {200279#(= 8656 (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); {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:57:27,414 INFO L290 TraceCheckUtils]: 56: Hoare triple {200279#(= 8656 (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); {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:57:27,414 INFO L290 TraceCheckUtils]: 57: Hoare triple {200279#(= 8656 (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); {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:57:27,415 INFO L290 TraceCheckUtils]: 58: Hoare triple {200279#(= 8656 (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); {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:57:27,415 INFO L290 TraceCheckUtils]: 59: Hoare triple {200279#(= 8656 (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); {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:57:27,415 INFO L290 TraceCheckUtils]: 60: Hoare triple {200279#(= 8656 (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); {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:57:27,416 INFO L290 TraceCheckUtils]: 61: Hoare triple {200279#(= 8656 (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); {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:57:27,416 INFO L290 TraceCheckUtils]: 62: Hoare triple {200279#(= 8656 (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); {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:57:27,417 INFO L290 TraceCheckUtils]: 63: Hoare triple {200279#(= 8656 (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); {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:57:27,417 INFO L290 TraceCheckUtils]: 64: Hoare triple {200279#(= 8656 (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); {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:57:27,417 INFO L290 TraceCheckUtils]: 65: Hoare triple {200279#(= 8656 (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); {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:57:27,418 INFO L290 TraceCheckUtils]: 66: Hoare triple {200279#(= 8656 (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); {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:57:27,418 INFO L290 TraceCheckUtils]: 67: Hoare triple {200279#(= 8656 (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); {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:57:27,418 INFO L290 TraceCheckUtils]: 68: Hoare triple {200279#(= 8656 (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); {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:57:27,419 INFO L290 TraceCheckUtils]: 69: Hoare triple {200279#(= 8656 (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); {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:57:27,419 INFO L290 TraceCheckUtils]: 70: Hoare triple {200279#(= 8656 (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); {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:57:27,419 INFO L290 TraceCheckUtils]: 71: Hoare triple {200279#(= 8656 (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); {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:57:27,420 INFO L290 TraceCheckUtils]: 72: Hoare triple {200279#(= 8656 (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); {200280#(= |ssl3_accept_#t~mem65| 8656)} is VALID [2022-04-15 11:57:27,420 INFO L290 TraceCheckUtils]: 73: Hoare triple {200280#(= |ssl3_accept_#t~mem65| 8656)} assume 8545 == #t~mem65;havoc #t~mem65; {200275#false} is VALID [2022-04-15 11:57:27,420 INFO L290 TraceCheckUtils]: 74: Hoare triple {200275#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {200275#false} is VALID [2022-04-15 11:57:27,420 INFO L290 TraceCheckUtils]: 75: Hoare triple {200275#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {200275#false} is VALID [2022-04-15 11:57:27,420 INFO L290 TraceCheckUtils]: 76: Hoare triple {200275#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {200275#false} is VALID [2022-04-15 11:57:27,420 INFO L290 TraceCheckUtils]: 77: Hoare triple {200275#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {200275#false} is VALID [2022-04-15 11:57:27,420 INFO L290 TraceCheckUtils]: 78: Hoare triple {200275#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {200275#false} is VALID [2022-04-15 11:57:27,420 INFO L290 TraceCheckUtils]: 79: Hoare triple {200275#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {200275#false} is VALID [2022-04-15 11:57:27,421 INFO L290 TraceCheckUtils]: 80: Hoare triple {200275#false} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 52 + ~s.offset, 4);call #t~mem128.base, #t~mem128.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8576, #t~mem128.base, 844 + #t~mem128.offset, 4);havoc #t~mem128.base, #t~mem128.offset;call write~int(0, ~s.base, 64 + ~s.offset, 4); {200275#false} is VALID [2022-04-15 11:57:27,421 INFO L290 TraceCheckUtils]: 81: Hoare triple {200275#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); {200275#false} is VALID [2022-04-15 11:57:27,421 INFO L290 TraceCheckUtils]: 82: Hoare triple {200275#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {200275#false} is VALID [2022-04-15 11:57:27,421 INFO L290 TraceCheckUtils]: 83: Hoare triple {200275#false} ~skip~0 := 0; {200275#false} is VALID [2022-04-15 11:57:27,421 INFO L290 TraceCheckUtils]: 84: Hoare triple {200275#false} assume !false; {200275#false} is VALID [2022-04-15 11:57:27,421 INFO L290 TraceCheckUtils]: 85: Hoare triple {200275#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); {200275#false} is VALID [2022-04-15 11:57:27,421 INFO L290 TraceCheckUtils]: 86: Hoare triple {200275#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-15 11:57:27,421 INFO L290 TraceCheckUtils]: 87: Hoare triple {200275#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-15 11:57:27,421 INFO L290 TraceCheckUtils]: 88: Hoare triple {200275#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-15 11:57:27,421 INFO L290 TraceCheckUtils]: 89: Hoare triple {200275#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-15 11:57:27,421 INFO L290 TraceCheckUtils]: 90: Hoare triple {200275#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-15 11:57:27,421 INFO L290 TraceCheckUtils]: 91: Hoare triple {200275#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-15 11:57:27,421 INFO L290 TraceCheckUtils]: 92: Hoare triple {200275#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-15 11:57:27,421 INFO L290 TraceCheckUtils]: 93: Hoare triple {200275#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-15 11:57:27,421 INFO L290 TraceCheckUtils]: 94: Hoare triple {200275#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-15 11:57:27,422 INFO L290 TraceCheckUtils]: 95: Hoare triple {200275#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-15 11:57:27,422 INFO L290 TraceCheckUtils]: 96: Hoare triple {200275#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-15 11:57:27,422 INFO L290 TraceCheckUtils]: 97: Hoare triple {200275#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-15 11:57:27,422 INFO L290 TraceCheckUtils]: 98: Hoare triple {200275#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-15 11:57:27,422 INFO L290 TraceCheckUtils]: 99: Hoare triple {200275#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-15 11:57:27,422 INFO L290 TraceCheckUtils]: 100: Hoare triple {200275#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-15 11:57:27,422 INFO L290 TraceCheckUtils]: 101: Hoare triple {200275#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-15 11:57:27,422 INFO L290 TraceCheckUtils]: 102: Hoare triple {200275#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-15 11:57:27,422 INFO L290 TraceCheckUtils]: 103: Hoare triple {200275#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-15 11:57:27,422 INFO L290 TraceCheckUtils]: 104: Hoare triple {200275#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-15 11:57:27,422 INFO L290 TraceCheckUtils]: 105: Hoare triple {200275#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-15 11:57:27,422 INFO L290 TraceCheckUtils]: 106: Hoare triple {200275#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-15 11:57:27,422 INFO L290 TraceCheckUtils]: 107: Hoare triple {200275#false} assume 8448 == #t~mem68;havoc #t~mem68; {200275#false} is VALID [2022-04-15 11:57:27,422 INFO L290 TraceCheckUtils]: 108: Hoare triple {200275#false} assume !(~num1~0 > 0); {200275#false} is VALID [2022-04-15 11:57:27,422 INFO L290 TraceCheckUtils]: 109: Hoare triple {200275#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; {200275#false} is VALID [2022-04-15 11:57:27,423 INFO L290 TraceCheckUtils]: 110: Hoare triple {200275#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); {200275#false} is VALID [2022-04-15 11:57:27,423 INFO L290 TraceCheckUtils]: 111: Hoare triple {200275#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {200275#false} is VALID [2022-04-15 11:57:27,423 INFO L290 TraceCheckUtils]: 112: Hoare triple {200275#false} ~skip~0 := 0; {200275#false} is VALID [2022-04-15 11:57:27,423 INFO L290 TraceCheckUtils]: 113: Hoare triple {200275#false} assume !false; {200275#false} is VALID [2022-04-15 11:57:27,423 INFO L290 TraceCheckUtils]: 114: Hoare triple {200275#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); {200275#false} is VALID [2022-04-15 11:57:27,423 INFO L290 TraceCheckUtils]: 115: Hoare triple {200275#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-15 11:57:27,423 INFO L290 TraceCheckUtils]: 116: Hoare triple {200275#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-15 11:57:27,423 INFO L290 TraceCheckUtils]: 117: Hoare triple {200275#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-15 11:57:27,423 INFO L290 TraceCheckUtils]: 118: Hoare triple {200275#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-15 11:57:27,423 INFO L290 TraceCheckUtils]: 119: Hoare triple {200275#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-15 11:57:27,423 INFO L290 TraceCheckUtils]: 120: Hoare triple {200275#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-15 11:57:27,423 INFO L290 TraceCheckUtils]: 121: Hoare triple {200275#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-15 11:57:27,423 INFO L290 TraceCheckUtils]: 122: Hoare triple {200275#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-15 11:57:27,423 INFO L290 TraceCheckUtils]: 123: Hoare triple {200275#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-15 11:57:27,423 INFO L290 TraceCheckUtils]: 124: Hoare triple {200275#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-15 11:57:27,424 INFO L290 TraceCheckUtils]: 125: Hoare triple {200275#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-15 11:57:27,424 INFO L290 TraceCheckUtils]: 126: Hoare triple {200275#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-15 11:57:27,424 INFO L290 TraceCheckUtils]: 127: Hoare triple {200275#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-15 11:57:27,424 INFO L290 TraceCheckUtils]: 128: Hoare triple {200275#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-15 11:57:27,424 INFO L290 TraceCheckUtils]: 129: Hoare triple {200275#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-15 11:57:27,424 INFO L290 TraceCheckUtils]: 130: Hoare triple {200275#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-15 11:57:27,424 INFO L290 TraceCheckUtils]: 131: Hoare triple {200275#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-15 11:57:27,424 INFO L290 TraceCheckUtils]: 132: Hoare triple {200275#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-15 11:57:27,424 INFO L290 TraceCheckUtils]: 133: Hoare triple {200275#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-15 11:57:27,424 INFO L290 TraceCheckUtils]: 134: Hoare triple {200275#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-15 11:57:27,424 INFO L290 TraceCheckUtils]: 135: Hoare triple {200275#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-15 11:57:27,424 INFO L290 TraceCheckUtils]: 136: Hoare triple {200275#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-15 11:57:27,424 INFO L290 TraceCheckUtils]: 137: Hoare triple {200275#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-15 11:57:27,424 INFO L290 TraceCheckUtils]: 138: Hoare triple {200275#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-15 11:57:27,424 INFO L290 TraceCheckUtils]: 139: Hoare triple {200275#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-15 11:57:27,425 INFO L290 TraceCheckUtils]: 140: Hoare triple {200275#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-15 11:57:27,425 INFO L290 TraceCheckUtils]: 141: Hoare triple {200275#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-15 11:57:27,425 INFO L290 TraceCheckUtils]: 142: Hoare triple {200275#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-15 11:57:27,425 INFO L290 TraceCheckUtils]: 143: Hoare triple {200275#false} assume 8640 == #t~mem75;havoc #t~mem75; {200275#false} is VALID [2022-04-15 11:57:27,425 INFO L290 TraceCheckUtils]: 144: Hoare triple {200275#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {200275#false} is VALID [2022-04-15 11:57:27,425 INFO L290 TraceCheckUtils]: 145: Hoare triple {200275#false} assume !(4 == ~blastFlag~0); {200275#false} is VALID [2022-04-15 11:57:27,425 INFO L290 TraceCheckUtils]: 146: Hoare triple {200275#false} assume !(7 == ~blastFlag~0); {200275#false} is VALID [2022-04-15 11:57:27,425 INFO L290 TraceCheckUtils]: 147: Hoare triple {200275#false} assume !(10 == ~blastFlag~0); {200275#false} is VALID [2022-04-15 11:57:27,425 INFO L290 TraceCheckUtils]: 148: Hoare triple {200275#false} assume 13 == ~blastFlag~0; {200275#false} is VALID [2022-04-15 11:57:27,425 INFO L290 TraceCheckUtils]: 149: Hoare triple {200275#false} assume !false; {200275#false} is VALID [2022-04-15 11:57:27,425 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-15 11:57:27,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:57:27,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968977903] [2022-04-15 11:57:27,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968977903] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:57:27,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:57:27,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:57:27,426 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:57:27,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2017010865] [2022-04-15 11:57:27,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2017010865] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:57:27,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:57:27,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:57:27,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037309784] [2022-04-15 11:57:27,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:57:27,427 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 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 150 [2022-04-15 11:57:27,427 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:57:27,427 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:57:27,509 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:57:27,509 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:57:27,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:57:27,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:57:27,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:57:27,509 INFO L87 Difference]: Start difference. First operand 1225 states and 1850 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:57:34,238 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-15 11:57:37,845 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-15 11:57:44,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:57:44,228 INFO L93 Difference]: Finished difference Result 2480 states and 3739 transitions. [2022-04-15 11:57:44,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:57:44,228 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 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 150 [2022-04-15 11:57:44,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:57:44,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:57:44,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 515 transitions. [2022-04-15 11:57:44,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:57:44,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 515 transitions. [2022-04-15 11:57:44,232 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 515 transitions. [2022-04-15 11:57:44,568 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 515 edges. 515 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:57:44,626 INFO L225 Difference]: With dead ends: 2480 [2022-04-15 11:57:44,626 INFO L226 Difference]: Without dead ends: 1281 [2022-04-15 11:57:44,627 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-15 11:57:44,627 INFO L913 BasicCegarLoop]: 255 mSDtfsCounter, 50 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-04-15 11:57:44,627 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 631 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 521 Invalid, 1 Unknown, 0 Unchecked, 6.8s Time] [2022-04-15 11:57:44,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1281 states. [2022-04-15 11:57:44,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1281 to 1225. [2022-04-15 11:57:44,729 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:57:44,730 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1281 states. Second operand has 1225 states, 1220 states have (on average 1.5106557377049181) internal successors, (1843), 1220 states have internal predecessors, (1843), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:57:44,730 INFO L74 IsIncluded]: Start isIncluded. First operand 1281 states. Second operand has 1225 states, 1220 states have (on average 1.5106557377049181) internal successors, (1843), 1220 states have internal predecessors, (1843), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:57:44,731 INFO L87 Difference]: Start difference. First operand 1281 states. Second operand has 1225 states, 1220 states have (on average 1.5106557377049181) internal successors, (1843), 1220 states have internal predecessors, (1843), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:57:44,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:57:44,778 INFO L93 Difference]: Finished difference Result 1281 states and 1917 transitions. [2022-04-15 11:57:44,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1281 states and 1917 transitions. [2022-04-15 11:57:44,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:57:44,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:57:44,780 INFO L74 IsIncluded]: Start isIncluded. First operand has 1225 states, 1220 states have (on average 1.5106557377049181) internal successors, (1843), 1220 states have internal predecessors, (1843), 3 states have call successors, (3), 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 1281 states. [2022-04-15 11:57:44,781 INFO L87 Difference]: Start difference. First operand has 1225 states, 1220 states have (on average 1.5106557377049181) internal successors, (1843), 1220 states have internal predecessors, (1843), 3 states have call successors, (3), 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 1281 states. [2022-04-15 11:57:44,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:57:44,850 INFO L93 Difference]: Finished difference Result 1281 states and 1917 transitions. [2022-04-15 11:57:44,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1281 states and 1917 transitions. [2022-04-15 11:57:44,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:57:44,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:57:44,851 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:57:44,851 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:57:44,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 1220 states have (on average 1.5106557377049181) internal successors, (1843), 1220 states have internal predecessors, (1843), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:57:44,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1847 transitions. [2022-04-15 11:57:44,916 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1847 transitions. Word has length 150 [2022-04-15 11:57:44,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:57:44,916 INFO L478 AbstractCegarLoop]: Abstraction has 1225 states and 1847 transitions. [2022-04-15 11:57:44,917 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:57:44,917 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1225 states and 1847 transitions. [2022-04-15 11:57:49,403 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1847 edges. 1846 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:57:49,403 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1847 transitions. [2022-04-15 11:57:49,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-04-15 11:57:49,404 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:57:49,405 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:57:49,405 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-04-15 11:57:49,405 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:57:49,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:57:49,405 INFO L85 PathProgramCache]: Analyzing trace with hash 83155422, now seen corresponding path program 1 times [2022-04-15 11:57:49,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:57:49,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [256729210] [2022-04-15 11:57:49,506 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:57:49,506 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:57:49,506 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:57:49,506 INFO L85 PathProgramCache]: Analyzing trace with hash 83155422, now seen corresponding path program 2 times [2022-04-15 11:57:49,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:57:49,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833513946] [2022-04-15 11:57:49,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:57:49,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:57:49,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:57:49,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:57:49,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:57:49,749 INFO L290 TraceCheckUtils]: 0: Hoare triple {210265#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {210258#true} is VALID [2022-04-15 11:57:49,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {210258#true} assume true; {210258#true} is VALID [2022-04-15 11:57:49,749 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {210258#true} {210258#true} #708#return; {210258#true} is VALID [2022-04-15 11:57:49,750 INFO L272 TraceCheckUtils]: 0: Hoare triple {210258#true} call ULTIMATE.init(); {210265#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:57:49,750 INFO L290 TraceCheckUtils]: 1: Hoare triple {210265#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {210258#true} is VALID [2022-04-15 11:57:49,750 INFO L290 TraceCheckUtils]: 2: Hoare triple {210258#true} assume true; {210258#true} is VALID [2022-04-15 11:57:49,750 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {210258#true} {210258#true} #708#return; {210258#true} is VALID [2022-04-15 11:57:49,750 INFO L272 TraceCheckUtils]: 4: Hoare triple {210258#true} call #t~ret161 := main(); {210258#true} is VALID [2022-04-15 11:57:49,750 INFO L290 TraceCheckUtils]: 5: Hoare triple {210258#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; {210258#true} is VALID [2022-04-15 11:57:49,750 INFO L290 TraceCheckUtils]: 6: Hoare triple {210258#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {210258#true} is VALID [2022-04-15 11:57:49,750 INFO L272 TraceCheckUtils]: 7: Hoare triple {210258#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {210258#true} is VALID [2022-04-15 11:57:49,751 INFO L290 TraceCheckUtils]: 8: Hoare triple {210258#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); {210258#true} is VALID [2022-04-15 11:57:49,751 INFO L290 TraceCheckUtils]: 9: Hoare triple {210258#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; {210258#true} is VALID [2022-04-15 11:57:49,751 INFO L290 TraceCheckUtils]: 10: Hoare triple {210258#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; {210258#true} is VALID [2022-04-15 11:57:49,751 INFO L290 TraceCheckUtils]: 11: Hoare triple {210258#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {210258#true} is VALID [2022-04-15 11:57:49,751 INFO L290 TraceCheckUtils]: 12: Hoare triple {210258#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {210258#true} is VALID [2022-04-15 11:57:49,751 INFO L290 TraceCheckUtils]: 13: Hoare triple {210258#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {210258#true} is VALID [2022-04-15 11:57:49,751 INFO L290 TraceCheckUtils]: 14: Hoare triple {210258#true} assume !false; {210258#true} is VALID [2022-04-15 11:57:49,751 INFO L290 TraceCheckUtils]: 15: Hoare triple {210258#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); {210258#true} is VALID [2022-04-15 11:57:49,751 INFO L290 TraceCheckUtils]: 16: Hoare triple {210258#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {210258#true} is VALID [2022-04-15 11:57:49,751 INFO L290 TraceCheckUtils]: 17: Hoare triple {210258#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {210258#true} is VALID [2022-04-15 11:57:49,751 INFO L290 TraceCheckUtils]: 18: Hoare triple {210258#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {210258#true} is VALID [2022-04-15 11:57:49,751 INFO L290 TraceCheckUtils]: 19: Hoare triple {210258#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {210258#true} is VALID [2022-04-15 11:57:49,751 INFO L290 TraceCheckUtils]: 20: Hoare triple {210258#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {210258#true} is VALID [2022-04-15 11:57:49,751 INFO L290 TraceCheckUtils]: 21: Hoare triple {210258#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {210258#true} is VALID [2022-04-15 11:57:49,751 INFO L290 TraceCheckUtils]: 22: Hoare triple {210258#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {210258#true} is VALID [2022-04-15 11:57:49,752 INFO L290 TraceCheckUtils]: 23: Hoare triple {210258#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {210258#true} is VALID [2022-04-15 11:57:49,752 INFO L290 TraceCheckUtils]: 24: Hoare triple {210258#true} assume 8464 == #t~mem55;havoc #t~mem55; {210258#true} is VALID [2022-04-15 11:57:49,752 INFO L290 TraceCheckUtils]: 25: Hoare triple {210258#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; {210258#true} is VALID [2022-04-15 11:57:49,752 INFO L290 TraceCheckUtils]: 26: Hoare triple {210258#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {210258#true} is VALID [2022-04-15 11:57:49,752 INFO L290 TraceCheckUtils]: 27: Hoare triple {210258#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); {210258#true} is VALID [2022-04-15 11:57:49,752 INFO L290 TraceCheckUtils]: 28: Hoare triple {210258#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); {210258#true} is VALID [2022-04-15 11:57:49,752 INFO L290 TraceCheckUtils]: 29: Hoare triple {210258#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {210258#true} is VALID [2022-04-15 11:57:49,752 INFO L290 TraceCheckUtils]: 30: Hoare triple {210258#true} ~skip~0 := 0; {210258#true} is VALID [2022-04-15 11:57:49,752 INFO L290 TraceCheckUtils]: 31: Hoare triple {210258#true} assume !false; {210258#true} is VALID [2022-04-15 11:57:49,752 INFO L290 TraceCheckUtils]: 32: Hoare triple {210258#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); {210258#true} is VALID [2022-04-15 11:57:49,752 INFO L290 TraceCheckUtils]: 33: Hoare triple {210258#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {210258#true} is VALID [2022-04-15 11:57:49,752 INFO L290 TraceCheckUtils]: 34: Hoare triple {210258#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {210258#true} is VALID [2022-04-15 11:57:49,752 INFO L290 TraceCheckUtils]: 35: Hoare triple {210258#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {210258#true} is VALID [2022-04-15 11:57:49,752 INFO L290 TraceCheckUtils]: 36: Hoare triple {210258#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {210258#true} is VALID [2022-04-15 11:57:49,752 INFO L290 TraceCheckUtils]: 37: Hoare triple {210258#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {210258#true} is VALID [2022-04-15 11:57:49,753 INFO L290 TraceCheckUtils]: 38: Hoare triple {210258#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {210258#true} is VALID [2022-04-15 11:57:49,753 INFO L290 TraceCheckUtils]: 39: Hoare triple {210258#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {210258#true} is VALID [2022-04-15 11:57:49,753 INFO L290 TraceCheckUtils]: 40: Hoare triple {210258#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {210258#true} is VALID [2022-04-15 11:57:49,753 INFO L290 TraceCheckUtils]: 41: Hoare triple {210258#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {210258#true} is VALID [2022-04-15 11:57:49,753 INFO L290 TraceCheckUtils]: 42: Hoare triple {210258#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {210258#true} is VALID [2022-04-15 11:57:49,753 INFO L290 TraceCheckUtils]: 43: Hoare triple {210258#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {210258#true} is VALID [2022-04-15 11:57:49,753 INFO L290 TraceCheckUtils]: 44: Hoare triple {210258#true} assume 8496 == #t~mem58;havoc #t~mem58; {210258#true} is VALID [2022-04-15 11:57:49,753 INFO L290 TraceCheckUtils]: 45: Hoare triple {210258#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {210258#true} is VALID [2022-04-15 11:57:49,753 INFO L290 TraceCheckUtils]: 46: Hoare triple {210258#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {210258#true} is VALID [2022-04-15 11:57:49,753 INFO L290 TraceCheckUtils]: 47: Hoare triple {210258#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {210258#true} is VALID [2022-04-15 11:57:49,754 INFO L290 TraceCheckUtils]: 48: Hoare triple {210258#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {210263#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-15 11:57:49,755 INFO L290 TraceCheckUtils]: 49: Hoare triple {210263#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {210263#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-15 11:57:49,755 INFO L290 TraceCheckUtils]: 50: Hoare triple {210263#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} 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); {210263#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-15 11:57:49,755 INFO L290 TraceCheckUtils]: 51: Hoare triple {210263#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {210263#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-15 11:57:49,756 INFO L290 TraceCheckUtils]: 52: Hoare triple {210263#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} ~skip~0 := 0; {210263#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-15 11:57:49,756 INFO L290 TraceCheckUtils]: 53: Hoare triple {210263#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !false; {210263#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-15 11:57:49,756 INFO L290 TraceCheckUtils]: 54: Hoare triple {210263#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} 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); {210263#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-15 11:57:49,757 INFO L290 TraceCheckUtils]: 55: Hoare triple {210263#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {210263#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-15 11:57:49,757 INFO L290 TraceCheckUtils]: 56: Hoare triple {210263#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {210263#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-15 11:57:49,757 INFO L290 TraceCheckUtils]: 57: Hoare triple {210263#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {210263#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-15 11:57:49,758 INFO L290 TraceCheckUtils]: 58: Hoare triple {210263#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {210263#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-15 11:57:49,758 INFO L290 TraceCheckUtils]: 59: Hoare triple {210263#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {210263#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-15 11:57:49,758 INFO L290 TraceCheckUtils]: 60: Hoare triple {210263#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {210263#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-15 11:57:49,759 INFO L290 TraceCheckUtils]: 61: Hoare triple {210263#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {210263#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-15 11:57:49,759 INFO L290 TraceCheckUtils]: 62: Hoare triple {210263#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {210263#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-15 11:57:49,760 INFO L290 TraceCheckUtils]: 63: Hoare triple {210263#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {210263#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-15 11:57:49,760 INFO L290 TraceCheckUtils]: 64: Hoare triple {210263#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {210263#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-15 11:57:49,760 INFO L290 TraceCheckUtils]: 65: Hoare triple {210263#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {210263#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-15 11:57:49,761 INFO L290 TraceCheckUtils]: 66: Hoare triple {210263#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {210263#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-15 11:57:49,761 INFO L290 TraceCheckUtils]: 67: Hoare triple {210263#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {210264#(not (= |ssl3_accept_#t~mem60| 8512))} is VALID [2022-04-15 11:57:49,761 INFO L290 TraceCheckUtils]: 68: Hoare triple {210264#(not (= |ssl3_accept_#t~mem60| 8512))} assume 8512 == #t~mem60;havoc #t~mem60; {210259#false} is VALID [2022-04-15 11:57:49,761 INFO L290 TraceCheckUtils]: 69: Hoare triple {210259#false} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 836 + #t~mem95.offset, 4);call #t~mem97 := read~int(#t~mem96.base, 12 + #t~mem96.offset, 4); {210259#false} is VALID [2022-04-15 11:57:49,762 INFO L290 TraceCheckUtils]: 70: Hoare triple {210259#false} assume 0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 4294967296;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;~skip~0 := 1; {210259#false} is VALID [2022-04-15 11:57:49,762 INFO L290 TraceCheckUtils]: 71: Hoare triple {210259#false} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {210259#false} is VALID [2022-04-15 11:57:49,762 INFO L290 TraceCheckUtils]: 72: Hoare triple {210259#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); {210259#false} is VALID [2022-04-15 11:57:49,762 INFO L290 TraceCheckUtils]: 73: Hoare triple {210259#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {210259#false} is VALID [2022-04-15 11:57:49,762 INFO L290 TraceCheckUtils]: 74: Hoare triple {210259#false} ~skip~0 := 0; {210259#false} is VALID [2022-04-15 11:57:49,762 INFO L290 TraceCheckUtils]: 75: Hoare triple {210259#false} assume !false; {210259#false} is VALID [2022-04-15 11:57:49,762 INFO L290 TraceCheckUtils]: 76: Hoare triple {210259#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); {210259#false} is VALID [2022-04-15 11:57:49,762 INFO L290 TraceCheckUtils]: 77: Hoare triple {210259#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-15 11:57:49,762 INFO L290 TraceCheckUtils]: 78: Hoare triple {210259#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-15 11:57:49,762 INFO L290 TraceCheckUtils]: 79: Hoare triple {210259#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-15 11:57:49,762 INFO L290 TraceCheckUtils]: 80: Hoare triple {210259#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-15 11:57:49,762 INFO L290 TraceCheckUtils]: 81: Hoare triple {210259#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-15 11:57:49,762 INFO L290 TraceCheckUtils]: 82: Hoare triple {210259#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-15 11:57:49,762 INFO L290 TraceCheckUtils]: 83: Hoare triple {210259#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-15 11:57:49,762 INFO L290 TraceCheckUtils]: 84: Hoare triple {210259#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-15 11:57:49,763 INFO L290 TraceCheckUtils]: 85: Hoare triple {210259#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-15 11:57:49,763 INFO L290 TraceCheckUtils]: 86: Hoare triple {210259#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-15 11:57:49,763 INFO L290 TraceCheckUtils]: 87: Hoare triple {210259#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-15 11:57:49,763 INFO L290 TraceCheckUtils]: 88: Hoare triple {210259#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-15 11:57:49,763 INFO L290 TraceCheckUtils]: 89: Hoare triple {210259#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-15 11:57:49,763 INFO L290 TraceCheckUtils]: 90: Hoare triple {210259#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-15 11:57:49,763 INFO L290 TraceCheckUtils]: 91: Hoare triple {210259#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-15 11:57:49,763 INFO L290 TraceCheckUtils]: 92: Hoare triple {210259#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-15 11:57:49,763 INFO L290 TraceCheckUtils]: 93: Hoare triple {210259#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-15 11:57:49,763 INFO L290 TraceCheckUtils]: 94: Hoare triple {210259#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-15 11:57:49,763 INFO L290 TraceCheckUtils]: 95: Hoare triple {210259#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-15 11:57:49,763 INFO L290 TraceCheckUtils]: 96: Hoare triple {210259#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-15 11:57:49,763 INFO L290 TraceCheckUtils]: 97: Hoare triple {210259#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-15 11:57:49,763 INFO L290 TraceCheckUtils]: 98: Hoare triple {210259#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-15 11:57:49,763 INFO L290 TraceCheckUtils]: 99: Hoare triple {210259#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-15 11:57:49,763 INFO L290 TraceCheckUtils]: 100: Hoare triple {210259#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-15 11:57:49,764 INFO L290 TraceCheckUtils]: 101: Hoare triple {210259#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-15 11:57:49,764 INFO L290 TraceCheckUtils]: 102: Hoare triple {210259#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-15 11:57:49,764 INFO L290 TraceCheckUtils]: 103: Hoare triple {210259#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-15 11:57:49,764 INFO L290 TraceCheckUtils]: 104: Hoare triple {210259#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-15 11:57:49,764 INFO L290 TraceCheckUtils]: 105: Hoare triple {210259#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-15 11:57:49,764 INFO L290 TraceCheckUtils]: 106: Hoare triple {210259#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-15 11:57:49,764 INFO L290 TraceCheckUtils]: 107: Hoare triple {210259#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-15 11:57:49,764 INFO L290 TraceCheckUtils]: 108: Hoare triple {210259#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-15 11:57:49,764 INFO L290 TraceCheckUtils]: 109: Hoare triple {210259#false} assume 8672 == #t~mem79;havoc #t~mem79; {210259#false} is VALID [2022-04-15 11:57:49,764 INFO L290 TraceCheckUtils]: 110: Hoare triple {210259#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {210259#false} is VALID [2022-04-15 11:57:49,764 INFO L290 TraceCheckUtils]: 111: Hoare triple {210259#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {210259#false} is VALID [2022-04-15 11:57:49,764 INFO L290 TraceCheckUtils]: 112: Hoare triple {210259#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); {210259#false} is VALID [2022-04-15 11:57:49,764 INFO L290 TraceCheckUtils]: 113: Hoare triple {210259#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; {210259#false} is VALID [2022-04-15 11:57:49,764 INFO L290 TraceCheckUtils]: 114: Hoare triple {210259#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {210259#false} is VALID [2022-04-15 11:57:49,764 INFO L290 TraceCheckUtils]: 115: Hoare triple {210259#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); {210259#false} is VALID [2022-04-15 11:57:49,765 INFO L290 TraceCheckUtils]: 116: Hoare triple {210259#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {210259#false} is VALID [2022-04-15 11:57:49,765 INFO L290 TraceCheckUtils]: 117: Hoare triple {210259#false} ~skip~0 := 0; {210259#false} is VALID [2022-04-15 11:57:49,765 INFO L290 TraceCheckUtils]: 118: Hoare triple {210259#false} assume !false; {210259#false} is VALID [2022-04-15 11:57:49,765 INFO L290 TraceCheckUtils]: 119: Hoare triple {210259#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); {210259#false} is VALID [2022-04-15 11:57:49,765 INFO L290 TraceCheckUtils]: 120: Hoare triple {210259#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-15 11:57:49,765 INFO L290 TraceCheckUtils]: 121: Hoare triple {210259#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-15 11:57:49,765 INFO L290 TraceCheckUtils]: 122: Hoare triple {210259#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-15 11:57:49,765 INFO L290 TraceCheckUtils]: 123: Hoare triple {210259#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-15 11:57:49,765 INFO L290 TraceCheckUtils]: 124: Hoare triple {210259#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-15 11:57:49,765 INFO L290 TraceCheckUtils]: 125: Hoare triple {210259#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-15 11:57:49,765 INFO L290 TraceCheckUtils]: 126: Hoare triple {210259#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-15 11:57:49,765 INFO L290 TraceCheckUtils]: 127: Hoare triple {210259#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-15 11:57:49,765 INFO L290 TraceCheckUtils]: 128: Hoare triple {210259#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-15 11:57:49,765 INFO L290 TraceCheckUtils]: 129: Hoare triple {210259#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-15 11:57:49,765 INFO L290 TraceCheckUtils]: 130: Hoare triple {210259#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-15 11:57:49,766 INFO L290 TraceCheckUtils]: 131: Hoare triple {210259#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-15 11:57:49,766 INFO L290 TraceCheckUtils]: 132: Hoare triple {210259#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-15 11:57:49,766 INFO L290 TraceCheckUtils]: 133: Hoare triple {210259#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-15 11:57:49,766 INFO L290 TraceCheckUtils]: 134: Hoare triple {210259#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-15 11:57:49,766 INFO L290 TraceCheckUtils]: 135: Hoare triple {210259#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-15 11:57:49,766 INFO L290 TraceCheckUtils]: 136: Hoare triple {210259#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-15 11:57:49,766 INFO L290 TraceCheckUtils]: 137: Hoare triple {210259#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-15 11:57:49,766 INFO L290 TraceCheckUtils]: 138: Hoare triple {210259#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-15 11:57:49,766 INFO L290 TraceCheckUtils]: 139: Hoare triple {210259#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-15 11:57:49,766 INFO L290 TraceCheckUtils]: 140: Hoare triple {210259#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-15 11:57:49,766 INFO L290 TraceCheckUtils]: 141: Hoare triple {210259#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-15 11:57:49,766 INFO L290 TraceCheckUtils]: 142: Hoare triple {210259#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-15 11:57:49,766 INFO L290 TraceCheckUtils]: 143: Hoare triple {210259#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-15 11:57:49,766 INFO L290 TraceCheckUtils]: 144: Hoare triple {210259#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-15 11:57:49,766 INFO L290 TraceCheckUtils]: 145: Hoare triple {210259#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-15 11:57:49,766 INFO L290 TraceCheckUtils]: 146: Hoare triple {210259#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-15 11:57:49,767 INFO L290 TraceCheckUtils]: 147: Hoare triple {210259#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-15 11:57:49,767 INFO L290 TraceCheckUtils]: 148: Hoare triple {210259#false} assume 8640 == #t~mem75;havoc #t~mem75; {210259#false} is VALID [2022-04-15 11:57:49,767 INFO L290 TraceCheckUtils]: 149: Hoare triple {210259#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {210259#false} is VALID [2022-04-15 11:57:49,767 INFO L290 TraceCheckUtils]: 150: Hoare triple {210259#false} assume !(4 == ~blastFlag~0); {210259#false} is VALID [2022-04-15 11:57:49,767 INFO L290 TraceCheckUtils]: 151: Hoare triple {210259#false} assume !(7 == ~blastFlag~0); {210259#false} is VALID [2022-04-15 11:57:49,767 INFO L290 TraceCheckUtils]: 152: Hoare triple {210259#false} assume !(10 == ~blastFlag~0); {210259#false} is VALID [2022-04-15 11:57:49,767 INFO L290 TraceCheckUtils]: 153: Hoare triple {210259#false} assume 13 == ~blastFlag~0; {210259#false} is VALID [2022-04-15 11:57:49,767 INFO L290 TraceCheckUtils]: 154: Hoare triple {210259#false} assume !false; {210259#false} is VALID [2022-04-15 11:57:49,767 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-15 11:57:49,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:57:49,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833513946] [2022-04-15 11:57:49,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833513946] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:57:49,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:57:49,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:57:49,768 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:57:49,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [256729210] [2022-04-15 11:57:49,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [256729210] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:57:49,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:57:49,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:57:49,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562068502] [2022-04-15 11:57:49,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:57:49,768 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 155 [2022-04-15 11:57:49,769 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:57:49,769 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-15 11:57:49,843 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-15 11:57:49,843 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:57:49,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:57:49,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:57:49,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:57:49,844 INFO L87 Difference]: Start difference. First operand 1225 states and 1847 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-15 11:57:52,334 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:57:54,340 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-15 11:58:04,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:58:04,870 INFO L93 Difference]: Finished difference Result 2621 states and 3932 transitions. [2022-04-15 11:58:04,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:58:04,870 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 155 [2022-04-15 11:58:04,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:58:04,871 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-15 11:58:04,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 593 transitions. [2022-04-15 11:58:04,873 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-15 11:58:04,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 593 transitions. [2022-04-15 11:58:04,874 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 593 transitions. [2022-04-15 11:58:05,274 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-15 11:58:05,344 INFO L225 Difference]: With dead ends: 2621 [2022-04-15 11:58:05,344 INFO L226 Difference]: Without dead ends: 1422 [2022-04-15 11:58:05,346 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-15 11:58:05,346 INFO L913 BasicCegarLoop]: 136 mSDtfsCounter, 126 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 53 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-04-15 11:58:05,346 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 388 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 473 Invalid, 1 Unknown, 0 Unchecked, 6.9s Time] [2022-04-15 11:58:05,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2022-04-15 11:58:05,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 1225. [2022-04-15 11:58:05,465 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:58:05,466 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1422 states. Second operand has 1225 states, 1220 states have (on average 1.4959016393442623) internal successors, (1825), 1220 states have internal predecessors, (1825), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:58:05,467 INFO L74 IsIncluded]: Start isIncluded. First operand 1422 states. Second operand has 1225 states, 1220 states have (on average 1.4959016393442623) internal successors, (1825), 1220 states have internal predecessors, (1825), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:58:05,468 INFO L87 Difference]: Start difference. First operand 1422 states. Second operand has 1225 states, 1220 states have (on average 1.4959016393442623) internal successors, (1825), 1220 states have internal predecessors, (1825), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:58:05,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:58:05,518 INFO L93 Difference]: Finished difference Result 1422 states and 2098 transitions. [2022-04-15 11:58:05,518 INFO L276 IsEmpty]: Start isEmpty. Operand 1422 states and 2098 transitions. [2022-04-15 11:58:05,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:58:05,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:58:05,519 INFO L74 IsIncluded]: Start isIncluded. First operand has 1225 states, 1220 states have (on average 1.4959016393442623) internal successors, (1825), 1220 states have internal predecessors, (1825), 3 states have call successors, (3), 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 1422 states. [2022-04-15 11:58:05,520 INFO L87 Difference]: Start difference. First operand has 1225 states, 1220 states have (on average 1.4959016393442623) internal successors, (1825), 1220 states have internal predecessors, (1825), 3 states have call successors, (3), 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 1422 states. [2022-04-15 11:58:05,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:58:05,569 INFO L93 Difference]: Finished difference Result 1422 states and 2098 transitions. [2022-04-15 11:58:05,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1422 states and 2098 transitions. [2022-04-15 11:58:05,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:58:05,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:58:05,570 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:58:05,570 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:58:05,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 1220 states have (on average 1.4959016393442623) internal successors, (1825), 1220 states have internal predecessors, (1825), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:58:05,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1829 transitions. [2022-04-15 11:58:05,638 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1829 transitions. Word has length 155 [2022-04-15 11:58:05,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:58:05,638 INFO L478 AbstractCegarLoop]: Abstraction has 1225 states and 1829 transitions. [2022-04-15 11:58:05,638 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-15 11:58:05,638 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1225 states and 1829 transitions. [2022-04-15 11:58:10,245 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1829 edges. 1828 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:58:10,245 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1829 transitions. [2022-04-15 11:58:10,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-04-15 11:58:10,246 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:58:10,246 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:58:10,246 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-04-15 11:58:10,247 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:58:10,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:58:10,247 INFO L85 PathProgramCache]: Analyzing trace with hash -2058705056, now seen corresponding path program 1 times [2022-04-15 11:58:10,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:58:10,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [167603565] [2022-04-15 11:58:10,345 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:58:10,345 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:58:10,345 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:58:10,345 INFO L85 PathProgramCache]: Analyzing trace with hash -2058705056, now seen corresponding path program 2 times [2022-04-15 11:58:10,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:58:10,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953426784] [2022-04-15 11:58:10,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:58:10,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:58:10,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:58:10,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:58:10,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:58:10,578 INFO L290 TraceCheckUtils]: 0: Hoare triple {220812#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {220806#true} is VALID [2022-04-15 11:58:10,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {220806#true} assume true; {220806#true} is VALID [2022-04-15 11:58:10,578 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {220806#true} {220806#true} #708#return; {220806#true} is VALID [2022-04-15 11:58:10,579 INFO L272 TraceCheckUtils]: 0: Hoare triple {220806#true} call ULTIMATE.init(); {220812#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:58:10,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {220812#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {220806#true} is VALID [2022-04-15 11:58:10,579 INFO L290 TraceCheckUtils]: 2: Hoare triple {220806#true} assume true; {220806#true} is VALID [2022-04-15 11:58:10,579 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {220806#true} {220806#true} #708#return; {220806#true} is VALID [2022-04-15 11:58:10,579 INFO L272 TraceCheckUtils]: 4: Hoare triple {220806#true} call #t~ret161 := main(); {220806#true} is VALID [2022-04-15 11:58:10,579 INFO L290 TraceCheckUtils]: 5: Hoare triple {220806#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; {220806#true} is VALID [2022-04-15 11:58:10,579 INFO L290 TraceCheckUtils]: 6: Hoare triple {220806#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {220806#true} is VALID [2022-04-15 11:58:10,579 INFO L272 TraceCheckUtils]: 7: Hoare triple {220806#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {220806#true} is VALID [2022-04-15 11:58:10,580 INFO L290 TraceCheckUtils]: 8: Hoare triple {220806#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); {220806#true} is VALID [2022-04-15 11:58:10,580 INFO L290 TraceCheckUtils]: 9: Hoare triple {220806#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; {220806#true} is VALID [2022-04-15 11:58:10,580 INFO L290 TraceCheckUtils]: 10: Hoare triple {220806#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; {220806#true} is VALID [2022-04-15 11:58:10,580 INFO L290 TraceCheckUtils]: 11: Hoare triple {220806#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {220806#true} is VALID [2022-04-15 11:58:10,580 INFO L290 TraceCheckUtils]: 12: Hoare triple {220806#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {220806#true} is VALID [2022-04-15 11:58:10,580 INFO L290 TraceCheckUtils]: 13: Hoare triple {220806#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {220806#true} is VALID [2022-04-15 11:58:10,580 INFO L290 TraceCheckUtils]: 14: Hoare triple {220806#true} assume !false; {220806#true} is VALID [2022-04-15 11:58:10,580 INFO L290 TraceCheckUtils]: 15: Hoare triple {220806#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); {220806#true} is VALID [2022-04-15 11:58:10,580 INFO L290 TraceCheckUtils]: 16: Hoare triple {220806#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {220806#true} is VALID [2022-04-15 11:58:10,580 INFO L290 TraceCheckUtils]: 17: Hoare triple {220806#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {220806#true} is VALID [2022-04-15 11:58:10,580 INFO L290 TraceCheckUtils]: 18: Hoare triple {220806#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {220806#true} is VALID [2022-04-15 11:58:10,580 INFO L290 TraceCheckUtils]: 19: Hoare triple {220806#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {220806#true} is VALID [2022-04-15 11:58:10,580 INFO L290 TraceCheckUtils]: 20: Hoare triple {220806#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {220806#true} is VALID [2022-04-15 11:58:10,580 INFO L290 TraceCheckUtils]: 21: Hoare triple {220806#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {220806#true} is VALID [2022-04-15 11:58:10,580 INFO L290 TraceCheckUtils]: 22: Hoare triple {220806#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {220806#true} is VALID [2022-04-15 11:58:10,581 INFO L290 TraceCheckUtils]: 23: Hoare triple {220806#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {220806#true} is VALID [2022-04-15 11:58:10,581 INFO L290 TraceCheckUtils]: 24: Hoare triple {220806#true} assume 8464 == #t~mem55;havoc #t~mem55; {220806#true} is VALID [2022-04-15 11:58:10,581 INFO L290 TraceCheckUtils]: 25: Hoare triple {220806#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; {220806#true} is VALID [2022-04-15 11:58:10,581 INFO L290 TraceCheckUtils]: 26: Hoare triple {220806#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {220806#true} is VALID [2022-04-15 11:58:10,581 INFO L290 TraceCheckUtils]: 27: Hoare triple {220806#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); {220806#true} is VALID [2022-04-15 11:58:10,581 INFO L290 TraceCheckUtils]: 28: Hoare triple {220806#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); {220806#true} is VALID [2022-04-15 11:58:10,581 INFO L290 TraceCheckUtils]: 29: Hoare triple {220806#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {220806#true} is VALID [2022-04-15 11:58:10,581 INFO L290 TraceCheckUtils]: 30: Hoare triple {220806#true} ~skip~0 := 0; {220806#true} is VALID [2022-04-15 11:58:10,581 INFO L290 TraceCheckUtils]: 31: Hoare triple {220806#true} assume !false; {220806#true} is VALID [2022-04-15 11:58:10,581 INFO L290 TraceCheckUtils]: 32: Hoare triple {220806#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); {220806#true} is VALID [2022-04-15 11:58:10,581 INFO L290 TraceCheckUtils]: 33: Hoare triple {220806#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {220806#true} is VALID [2022-04-15 11:58:10,581 INFO L290 TraceCheckUtils]: 34: Hoare triple {220806#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {220806#true} is VALID [2022-04-15 11:58:10,581 INFO L290 TraceCheckUtils]: 35: Hoare triple {220806#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {220806#true} is VALID [2022-04-15 11:58:10,581 INFO L290 TraceCheckUtils]: 36: Hoare triple {220806#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {220806#true} is VALID [2022-04-15 11:58:10,581 INFO L290 TraceCheckUtils]: 37: Hoare triple {220806#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {220806#true} is VALID [2022-04-15 11:58:10,581 INFO L290 TraceCheckUtils]: 38: Hoare triple {220806#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {220806#true} is VALID [2022-04-15 11:58:10,582 INFO L290 TraceCheckUtils]: 39: Hoare triple {220806#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {220806#true} is VALID [2022-04-15 11:58:10,582 INFO L290 TraceCheckUtils]: 40: Hoare triple {220806#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {220806#true} is VALID [2022-04-15 11:58:10,582 INFO L290 TraceCheckUtils]: 41: Hoare triple {220806#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {220806#true} is VALID [2022-04-15 11:58:10,582 INFO L290 TraceCheckUtils]: 42: Hoare triple {220806#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {220806#true} is VALID [2022-04-15 11:58:10,582 INFO L290 TraceCheckUtils]: 43: Hoare triple {220806#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {220806#true} is VALID [2022-04-15 11:58:10,582 INFO L290 TraceCheckUtils]: 44: Hoare triple {220806#true} assume 8496 == #t~mem58;havoc #t~mem58; {220806#true} is VALID [2022-04-15 11:58:10,582 INFO L290 TraceCheckUtils]: 45: Hoare triple {220806#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {220806#true} is VALID [2022-04-15 11:58:10,582 INFO L290 TraceCheckUtils]: 46: Hoare triple {220806#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:58:10,582 INFO L290 TraceCheckUtils]: 47: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:58:10,583 INFO L290 TraceCheckUtils]: 48: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:58:10,583 INFO L290 TraceCheckUtils]: 49: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:58:10,583 INFO L290 TraceCheckUtils]: 50: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} 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); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:58:10,584 INFO L290 TraceCheckUtils]: 51: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:58:10,584 INFO L290 TraceCheckUtils]: 52: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} ~skip~0 := 0; {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:58:10,584 INFO L290 TraceCheckUtils]: 53: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !false; {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:58:10,584 INFO L290 TraceCheckUtils]: 54: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~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); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:58:10,585 INFO L290 TraceCheckUtils]: 55: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:58:10,585 INFO L290 TraceCheckUtils]: 56: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:58:10,585 INFO L290 TraceCheckUtils]: 57: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:58:10,585 INFO L290 TraceCheckUtils]: 58: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:58:10,586 INFO L290 TraceCheckUtils]: 59: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:58:10,586 INFO L290 TraceCheckUtils]: 60: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:58:10,586 INFO L290 TraceCheckUtils]: 61: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:58:10,586 INFO L290 TraceCheckUtils]: 62: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:58:10,587 INFO L290 TraceCheckUtils]: 63: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:58:10,587 INFO L290 TraceCheckUtils]: 64: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:58:10,587 INFO L290 TraceCheckUtils]: 65: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:58:10,588 INFO L290 TraceCheckUtils]: 66: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:58:10,588 INFO L290 TraceCheckUtils]: 67: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:58:10,588 INFO L290 TraceCheckUtils]: 68: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume 8512 == #t~mem60;havoc #t~mem60; {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:58:10,588 INFO L290 TraceCheckUtils]: 69: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 836 + #t~mem95.offset, 4);call #t~mem97 := read~int(#t~mem96.base, 12 + #t~mem96.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:58:10,589 INFO L290 TraceCheckUtils]: 70: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume 0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 4294967296;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;~skip~0 := 1; {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:58:10,589 INFO L290 TraceCheckUtils]: 71: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:58:10,589 INFO L290 TraceCheckUtils]: 72: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} 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); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:58:10,589 INFO L290 TraceCheckUtils]: 73: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:58:10,590 INFO L290 TraceCheckUtils]: 74: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} ~skip~0 := 0; {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:58:10,590 INFO L290 TraceCheckUtils]: 75: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !false; {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:58:10,590 INFO L290 TraceCheckUtils]: 76: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~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); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:58:10,591 INFO L290 TraceCheckUtils]: 77: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:58:10,591 INFO L290 TraceCheckUtils]: 78: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:58:10,591 INFO L290 TraceCheckUtils]: 79: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:58:10,591 INFO L290 TraceCheckUtils]: 80: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:58:10,592 INFO L290 TraceCheckUtils]: 81: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:58:10,592 INFO L290 TraceCheckUtils]: 82: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:58:10,592 INFO L290 TraceCheckUtils]: 83: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:58:10,592 INFO L290 TraceCheckUtils]: 84: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:58:10,593 INFO L290 TraceCheckUtils]: 85: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:58:10,593 INFO L290 TraceCheckUtils]: 86: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:58:10,593 INFO L290 TraceCheckUtils]: 87: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:58:10,593 INFO L290 TraceCheckUtils]: 88: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:58:10,594 INFO L290 TraceCheckUtils]: 89: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:58:10,594 INFO L290 TraceCheckUtils]: 90: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:58:10,594 INFO L290 TraceCheckUtils]: 91: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:58:10,595 INFO L290 TraceCheckUtils]: 92: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:58:10,595 INFO L290 TraceCheckUtils]: 93: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:58:10,595 INFO L290 TraceCheckUtils]: 94: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:58:10,595 INFO L290 TraceCheckUtils]: 95: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:58:10,596 INFO L290 TraceCheckUtils]: 96: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:58:10,596 INFO L290 TraceCheckUtils]: 97: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:58:10,596 INFO L290 TraceCheckUtils]: 98: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:58:10,596 INFO L290 TraceCheckUtils]: 99: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:58:10,597 INFO L290 TraceCheckUtils]: 100: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:58:10,597 INFO L290 TraceCheckUtils]: 101: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:58:10,597 INFO L290 TraceCheckUtils]: 102: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:58:10,597 INFO L290 TraceCheckUtils]: 103: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:58:10,598 INFO L290 TraceCheckUtils]: 104: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:58:10,598 INFO L290 TraceCheckUtils]: 105: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:58:10,598 INFO L290 TraceCheckUtils]: 106: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:58:10,599 INFO L290 TraceCheckUtils]: 107: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:58:10,599 INFO L290 TraceCheckUtils]: 108: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:58:10,599 INFO L290 TraceCheckUtils]: 109: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume 8672 == #t~mem79;havoc #t~mem79; {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:58:10,599 INFO L290 TraceCheckUtils]: 110: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:58:10,600 INFO L290 TraceCheckUtils]: 111: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {220807#false} is VALID [2022-04-15 11:58:10,600 INFO L290 TraceCheckUtils]: 112: Hoare triple {220807#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); {220807#false} is VALID [2022-04-15 11:58:10,600 INFO L290 TraceCheckUtils]: 113: Hoare triple {220807#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; {220807#false} is VALID [2022-04-15 11:58:10,600 INFO L290 TraceCheckUtils]: 114: Hoare triple {220807#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {220807#false} is VALID [2022-04-15 11:58:10,600 INFO L290 TraceCheckUtils]: 115: Hoare triple {220807#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); {220807#false} is VALID [2022-04-15 11:58:10,600 INFO L290 TraceCheckUtils]: 116: Hoare triple {220807#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {220807#false} is VALID [2022-04-15 11:58:10,600 INFO L290 TraceCheckUtils]: 117: Hoare triple {220807#false} ~skip~0 := 0; {220807#false} is VALID [2022-04-15 11:58:10,600 INFO L290 TraceCheckUtils]: 118: Hoare triple {220807#false} assume !false; {220807#false} is VALID [2022-04-15 11:58:10,600 INFO L290 TraceCheckUtils]: 119: Hoare triple {220807#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); {220807#false} is VALID [2022-04-15 11:58:10,601 INFO L290 TraceCheckUtils]: 120: Hoare triple {220807#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {220807#false} is VALID [2022-04-15 11:58:10,601 INFO L290 TraceCheckUtils]: 121: Hoare triple {220807#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {220807#false} is VALID [2022-04-15 11:58:10,601 INFO L290 TraceCheckUtils]: 122: Hoare triple {220807#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {220807#false} is VALID [2022-04-15 11:58:10,601 INFO L290 TraceCheckUtils]: 123: Hoare triple {220807#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {220807#false} is VALID [2022-04-15 11:58:10,601 INFO L290 TraceCheckUtils]: 124: Hoare triple {220807#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {220807#false} is VALID [2022-04-15 11:58:10,601 INFO L290 TraceCheckUtils]: 125: Hoare triple {220807#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {220807#false} is VALID [2022-04-15 11:58:10,601 INFO L290 TraceCheckUtils]: 126: Hoare triple {220807#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {220807#false} is VALID [2022-04-15 11:58:10,601 INFO L290 TraceCheckUtils]: 127: Hoare triple {220807#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {220807#false} is VALID [2022-04-15 11:58:10,601 INFO L290 TraceCheckUtils]: 128: Hoare triple {220807#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {220807#false} is VALID [2022-04-15 11:58:10,601 INFO L290 TraceCheckUtils]: 129: Hoare triple {220807#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {220807#false} is VALID [2022-04-15 11:58:10,602 INFO L290 TraceCheckUtils]: 130: Hoare triple {220807#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {220807#false} is VALID [2022-04-15 11:58:10,602 INFO L290 TraceCheckUtils]: 131: Hoare triple {220807#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {220807#false} is VALID [2022-04-15 11:58:10,602 INFO L290 TraceCheckUtils]: 132: Hoare triple {220807#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {220807#false} is VALID [2022-04-15 11:58:10,602 INFO L290 TraceCheckUtils]: 133: Hoare triple {220807#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {220807#false} is VALID [2022-04-15 11:58:10,602 INFO L290 TraceCheckUtils]: 134: Hoare triple {220807#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {220807#false} is VALID [2022-04-15 11:58:10,602 INFO L290 TraceCheckUtils]: 135: Hoare triple {220807#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {220807#false} is VALID [2022-04-15 11:58:10,602 INFO L290 TraceCheckUtils]: 136: Hoare triple {220807#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {220807#false} is VALID [2022-04-15 11:58:10,602 INFO L290 TraceCheckUtils]: 137: Hoare triple {220807#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {220807#false} is VALID [2022-04-15 11:58:10,602 INFO L290 TraceCheckUtils]: 138: Hoare triple {220807#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {220807#false} is VALID [2022-04-15 11:58:10,602 INFO L290 TraceCheckUtils]: 139: Hoare triple {220807#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {220807#false} is VALID [2022-04-15 11:58:10,602 INFO L290 TraceCheckUtils]: 140: Hoare triple {220807#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {220807#false} is VALID [2022-04-15 11:58:10,603 INFO L290 TraceCheckUtils]: 141: Hoare triple {220807#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {220807#false} is VALID [2022-04-15 11:58:10,603 INFO L290 TraceCheckUtils]: 142: Hoare triple {220807#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {220807#false} is VALID [2022-04-15 11:58:10,603 INFO L290 TraceCheckUtils]: 143: Hoare triple {220807#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {220807#false} is VALID [2022-04-15 11:58:10,603 INFO L290 TraceCheckUtils]: 144: Hoare triple {220807#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {220807#false} is VALID [2022-04-15 11:58:10,603 INFO L290 TraceCheckUtils]: 145: Hoare triple {220807#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {220807#false} is VALID [2022-04-15 11:58:10,603 INFO L290 TraceCheckUtils]: 146: Hoare triple {220807#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {220807#false} is VALID [2022-04-15 11:58:10,603 INFO L290 TraceCheckUtils]: 147: Hoare triple {220807#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {220807#false} is VALID [2022-04-15 11:58:10,603 INFO L290 TraceCheckUtils]: 148: Hoare triple {220807#false} assume 8640 == #t~mem75;havoc #t~mem75; {220807#false} is VALID [2022-04-15 11:58:10,603 INFO L290 TraceCheckUtils]: 149: Hoare triple {220807#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {220807#false} is VALID [2022-04-15 11:58:10,603 INFO L290 TraceCheckUtils]: 150: Hoare triple {220807#false} assume !(4 == ~blastFlag~0); {220807#false} is VALID [2022-04-15 11:58:10,604 INFO L290 TraceCheckUtils]: 151: Hoare triple {220807#false} assume !(7 == ~blastFlag~0); {220807#false} is VALID [2022-04-15 11:58:10,604 INFO L290 TraceCheckUtils]: 152: Hoare triple {220807#false} assume !(10 == ~blastFlag~0); {220807#false} is VALID [2022-04-15 11:58:10,604 INFO L290 TraceCheckUtils]: 153: Hoare triple {220807#false} assume 13 == ~blastFlag~0; {220807#false} is VALID [2022-04-15 11:58:10,604 INFO L290 TraceCheckUtils]: 154: Hoare triple {220807#false} assume !false; {220807#false} is VALID [2022-04-15 11:58:10,604 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-15 11:58:10,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:58:10,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953426784] [2022-04-15 11:58:10,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953426784] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:58:10,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:58:10,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:58:10,605 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:58:10,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [167603565] [2022-04-15 11:58:10,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [167603565] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:58:10,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:58:10,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:58:10,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902018334] [2022-04-15 11:58:10,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:58:10,606 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 3 states have internal predecessors, (123), 1 states have call successors, (3), 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 155 [2022-04-15 11:58:10,606 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:58:10,606 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 30.75) internal successors, (123), 3 states have internal predecessors, (123), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:58:10,688 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:58:10,688 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:58:10,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:58:10,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:58:10,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:58:10,688 INFO L87 Difference]: Start difference. First operand 1225 states and 1829 transitions. Second operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 3 states have internal predecessors, (123), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:58:14,377 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-15 11:58:16,900 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:58:22,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:58:22,596 INFO L93 Difference]: Finished difference Result 2070 states and 3104 transitions. [2022-04-15 11:58:22,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:58:22,596 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 3 states have internal predecessors, (123), 1 states have call successors, (3), 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 155 [2022-04-15 11:58:22,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:58:22,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 3 states have internal predecessors, (123), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:58:22,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 622 transitions. [2022-04-15 11:58:22,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 3 states have internal predecessors, (123), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:58:22,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 622 transitions. [2022-04-15 11:58:22,600 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 622 transitions. [2022-04-15 11:58:23,008 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 622 edges. 622 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:58:23,123 INFO L225 Difference]: With dead ends: 2070 [2022-04-15 11:58:23,124 INFO L226 Difference]: Without dead ends: 1644 [2022-04-15 11:58:23,124 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:58:23,124 INFO L913 BasicCegarLoop]: 392 mSDtfsCounter, 137 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 12 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-04-15 11:58:23,124 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 586 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 444 Invalid, 1 Unknown, 0 Unchecked, 5.7s Time] [2022-04-15 11:58:23,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1644 states. [2022-04-15 11:58:23,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1644 to 1644. [2022-04-15 11:58:23,250 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:58:23,251 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1644 states. Second operand has 1644 states, 1639 states have (on average 1.4929835265405735) internal successors, (2447), 1639 states have internal predecessors, (2447), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:58:23,252 INFO L74 IsIncluded]: Start isIncluded. First operand 1644 states. Second operand has 1644 states, 1639 states have (on average 1.4929835265405735) internal successors, (2447), 1639 states have internal predecessors, (2447), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:58:23,253 INFO L87 Difference]: Start difference. First operand 1644 states. Second operand has 1644 states, 1639 states have (on average 1.4929835265405735) internal successors, (2447), 1639 states have internal predecessors, (2447), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:58:23,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:58:23,330 INFO L93 Difference]: Finished difference Result 1644 states and 2451 transitions. [2022-04-15 11:58:23,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1644 states and 2451 transitions. [2022-04-15 11:58:23,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:58:23,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:58:23,332 INFO L74 IsIncluded]: Start isIncluded. First operand has 1644 states, 1639 states have (on average 1.4929835265405735) internal successors, (2447), 1639 states have internal predecessors, (2447), 3 states have call successors, (3), 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 1644 states. [2022-04-15 11:58:23,333 INFO L87 Difference]: Start difference. First operand has 1644 states, 1639 states have (on average 1.4929835265405735) internal successors, (2447), 1639 states have internal predecessors, (2447), 3 states have call successors, (3), 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 1644 states. [2022-04-15 11:58:23,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:58:23,408 INFO L93 Difference]: Finished difference Result 1644 states and 2451 transitions. [2022-04-15 11:58:23,408 INFO L276 IsEmpty]: Start isEmpty. Operand 1644 states and 2451 transitions. [2022-04-15 11:58:23,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:58:23,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:58:23,409 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:58:23,409 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:58:23,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1644 states, 1639 states have (on average 1.4929835265405735) internal successors, (2447), 1639 states have internal predecessors, (2447), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:58:23,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1644 states to 1644 states and 2451 transitions. [2022-04-15 11:58:23,540 INFO L78 Accepts]: Start accepts. Automaton has 1644 states and 2451 transitions. Word has length 155 [2022-04-15 11:58:23,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:58:23,540 INFO L478 AbstractCegarLoop]: Abstraction has 1644 states and 2451 transitions. [2022-04-15 11:58:23,540 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 3 states have internal predecessors, (123), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:58:23,540 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1644 states and 2451 transitions. [2022-04-15 11:58:28,641 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2451 edges. 2450 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:58:28,642 INFO L276 IsEmpty]: Start isEmpty. Operand 1644 states and 2451 transitions. [2022-04-15 11:58:28,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-04-15 11:58:28,643 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:58:28,644 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:58:28,644 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-04-15 11:58:28,644 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:58:28,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:58:28,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1197677666, now seen corresponding path program 1 times [2022-04-15 11:58:28,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:58:28,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2029566486] [2022-04-15 11:58:28,747 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:58:28,747 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:58:28,747 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:58:28,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1197677666, now seen corresponding path program 2 times [2022-04-15 11:58:28,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:58:28,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338058512] [2022-04-15 11:58:28,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:58:28,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:58:28,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:58:28,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:58:28,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:58:28,930 INFO L290 TraceCheckUtils]: 0: Hoare triple {231537#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {231531#true} is VALID [2022-04-15 11:58:28,930 INFO L290 TraceCheckUtils]: 1: Hoare triple {231531#true} assume true; {231531#true} is VALID [2022-04-15 11:58:28,930 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {231531#true} {231531#true} #708#return; {231531#true} is VALID [2022-04-15 11:58:28,931 INFO L272 TraceCheckUtils]: 0: Hoare triple {231531#true} call ULTIMATE.init(); {231537#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:58:28,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {231537#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {231531#true} is VALID [2022-04-15 11:58:28,931 INFO L290 TraceCheckUtils]: 2: Hoare triple {231531#true} assume true; {231531#true} is VALID [2022-04-15 11:58:28,931 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {231531#true} {231531#true} #708#return; {231531#true} is VALID [2022-04-15 11:58:28,931 INFO L272 TraceCheckUtils]: 4: Hoare triple {231531#true} call #t~ret161 := main(); {231531#true} is VALID [2022-04-15 11:58:28,931 INFO L290 TraceCheckUtils]: 5: Hoare triple {231531#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; {231531#true} is VALID [2022-04-15 11:58:28,931 INFO L290 TraceCheckUtils]: 6: Hoare triple {231531#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {231531#true} is VALID [2022-04-15 11:58:28,931 INFO L272 TraceCheckUtils]: 7: Hoare triple {231531#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {231531#true} is VALID [2022-04-15 11:58:28,931 INFO L290 TraceCheckUtils]: 8: Hoare triple {231531#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); {231531#true} is VALID [2022-04-15 11:58:28,932 INFO L290 TraceCheckUtils]: 9: Hoare triple {231531#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; {231531#true} is VALID [2022-04-15 11:58:28,932 INFO L290 TraceCheckUtils]: 10: Hoare triple {231531#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; {231531#true} is VALID [2022-04-15 11:58:28,932 INFO L290 TraceCheckUtils]: 11: Hoare triple {231531#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {231531#true} is VALID [2022-04-15 11:58:28,932 INFO L290 TraceCheckUtils]: 12: Hoare triple {231531#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {231531#true} is VALID [2022-04-15 11:58:28,932 INFO L290 TraceCheckUtils]: 13: Hoare triple {231531#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {231531#true} is VALID [2022-04-15 11:58:28,932 INFO L290 TraceCheckUtils]: 14: Hoare triple {231531#true} assume !false; {231531#true} is VALID [2022-04-15 11:58:28,932 INFO L290 TraceCheckUtils]: 15: Hoare triple {231531#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); {231531#true} is VALID [2022-04-15 11:58:28,932 INFO L290 TraceCheckUtils]: 16: Hoare triple {231531#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {231531#true} is VALID [2022-04-15 11:58:28,932 INFO L290 TraceCheckUtils]: 17: Hoare triple {231531#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {231531#true} is VALID [2022-04-15 11:58:28,932 INFO L290 TraceCheckUtils]: 18: Hoare triple {231531#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {231531#true} is VALID [2022-04-15 11:58:28,932 INFO L290 TraceCheckUtils]: 19: Hoare triple {231531#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {231531#true} is VALID [2022-04-15 11:58:28,932 INFO L290 TraceCheckUtils]: 20: Hoare triple {231531#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {231531#true} is VALID [2022-04-15 11:58:28,932 INFO L290 TraceCheckUtils]: 21: Hoare triple {231531#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {231531#true} is VALID [2022-04-15 11:58:28,932 INFO L290 TraceCheckUtils]: 22: Hoare triple {231531#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {231531#true} is VALID [2022-04-15 11:58:28,932 INFO L290 TraceCheckUtils]: 23: Hoare triple {231531#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {231531#true} is VALID [2022-04-15 11:58:28,933 INFO L290 TraceCheckUtils]: 24: Hoare triple {231531#true} assume 8464 == #t~mem55;havoc #t~mem55; {231531#true} is VALID [2022-04-15 11:58:28,933 INFO L290 TraceCheckUtils]: 25: Hoare triple {231531#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; {231531#true} is VALID [2022-04-15 11:58:28,933 INFO L290 TraceCheckUtils]: 26: Hoare triple {231531#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {231536#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-15 11:58:28,933 INFO L290 TraceCheckUtils]: 27: Hoare triple {231536#(= ssl3_accept_~blastFlag~0 1)} 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); {231536#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-15 11:58:28,933 INFO L290 TraceCheckUtils]: 28: Hoare triple {231536#(= ssl3_accept_~blastFlag~0 1)} 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); {231536#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-15 11:58:28,934 INFO L290 TraceCheckUtils]: 29: Hoare triple {231536#(= ssl3_accept_~blastFlag~0 1)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {231536#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-15 11:58:28,934 INFO L290 TraceCheckUtils]: 30: Hoare triple {231536#(= ssl3_accept_~blastFlag~0 1)} ~skip~0 := 0; {231536#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-15 11:58:28,934 INFO L290 TraceCheckUtils]: 31: Hoare triple {231536#(= ssl3_accept_~blastFlag~0 1)} assume !false; {231536#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-15 11:58:28,934 INFO L290 TraceCheckUtils]: 32: Hoare triple {231536#(= ssl3_accept_~blastFlag~0 1)} 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); {231536#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-15 11:58:28,935 INFO L290 TraceCheckUtils]: 33: Hoare triple {231536#(= ssl3_accept_~blastFlag~0 1)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {231536#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-15 11:58:28,935 INFO L290 TraceCheckUtils]: 34: Hoare triple {231536#(= ssl3_accept_~blastFlag~0 1)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {231536#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-15 11:58:28,935 INFO L290 TraceCheckUtils]: 35: Hoare triple {231536#(= ssl3_accept_~blastFlag~0 1)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {231536#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-15 11:58:28,936 INFO L290 TraceCheckUtils]: 36: Hoare triple {231536#(= ssl3_accept_~blastFlag~0 1)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {231536#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-15 11:58:28,936 INFO L290 TraceCheckUtils]: 37: Hoare triple {231536#(= ssl3_accept_~blastFlag~0 1)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {231536#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-15 11:58:28,936 INFO L290 TraceCheckUtils]: 38: Hoare triple {231536#(= ssl3_accept_~blastFlag~0 1)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {231536#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-15 11:58:28,936 INFO L290 TraceCheckUtils]: 39: Hoare triple {231536#(= ssl3_accept_~blastFlag~0 1)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {231536#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-15 11:58:28,937 INFO L290 TraceCheckUtils]: 40: Hoare triple {231536#(= ssl3_accept_~blastFlag~0 1)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {231536#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-15 11:58:28,937 INFO L290 TraceCheckUtils]: 41: Hoare triple {231536#(= ssl3_accept_~blastFlag~0 1)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {231536#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-15 11:58:28,937 INFO L290 TraceCheckUtils]: 42: Hoare triple {231536#(= ssl3_accept_~blastFlag~0 1)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {231536#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-15 11:58:28,937 INFO L290 TraceCheckUtils]: 43: Hoare triple {231536#(= ssl3_accept_~blastFlag~0 1)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {231536#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-15 11:58:28,938 INFO L290 TraceCheckUtils]: 44: Hoare triple {231536#(= ssl3_accept_~blastFlag~0 1)} assume 8496 == #t~mem58;havoc #t~mem58; {231536#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-15 11:58:28,938 INFO L290 TraceCheckUtils]: 45: Hoare triple {231536#(= ssl3_accept_~blastFlag~0 1)} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {231536#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-15 11:58:28,938 INFO L290 TraceCheckUtils]: 46: Hoare triple {231536#(= ssl3_accept_~blastFlag~0 1)} assume !(1 == ~blastFlag~0); {231532#false} is VALID [2022-04-15 11:58:28,938 INFO L290 TraceCheckUtils]: 47: Hoare triple {231532#false} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,938 INFO L290 TraceCheckUtils]: 48: Hoare triple {231532#false} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,938 INFO L290 TraceCheckUtils]: 49: Hoare triple {231532#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,939 INFO L290 TraceCheckUtils]: 50: Hoare triple {231532#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); {231532#false} is VALID [2022-04-15 11:58:28,939 INFO L290 TraceCheckUtils]: 51: Hoare triple {231532#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {231532#false} is VALID [2022-04-15 11:58:28,939 INFO L290 TraceCheckUtils]: 52: Hoare triple {231532#false} ~skip~0 := 0; {231532#false} is VALID [2022-04-15 11:58:28,939 INFO L290 TraceCheckUtils]: 53: Hoare triple {231532#false} assume !false; {231532#false} is VALID [2022-04-15 11:58:28,939 INFO L290 TraceCheckUtils]: 54: Hoare triple {231532#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); {231532#false} is VALID [2022-04-15 11:58:28,939 INFO L290 TraceCheckUtils]: 55: Hoare triple {231532#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,939 INFO L290 TraceCheckUtils]: 56: Hoare triple {231532#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,939 INFO L290 TraceCheckUtils]: 57: Hoare triple {231532#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,939 INFO L290 TraceCheckUtils]: 58: Hoare triple {231532#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,939 INFO L290 TraceCheckUtils]: 59: Hoare triple {231532#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,939 INFO L290 TraceCheckUtils]: 60: Hoare triple {231532#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,939 INFO L290 TraceCheckUtils]: 61: Hoare triple {231532#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,939 INFO L290 TraceCheckUtils]: 62: Hoare triple {231532#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,939 INFO L290 TraceCheckUtils]: 63: Hoare triple {231532#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,939 INFO L290 TraceCheckUtils]: 64: Hoare triple {231532#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,940 INFO L290 TraceCheckUtils]: 65: Hoare triple {231532#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,940 INFO L290 TraceCheckUtils]: 66: Hoare triple {231532#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,940 INFO L290 TraceCheckUtils]: 67: Hoare triple {231532#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,940 INFO L290 TraceCheckUtils]: 68: Hoare triple {231532#false} assume 8512 == #t~mem60;havoc #t~mem60; {231532#false} is VALID [2022-04-15 11:58:28,940 INFO L290 TraceCheckUtils]: 69: Hoare triple {231532#false} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 836 + #t~mem95.offset, 4);call #t~mem97 := read~int(#t~mem96.base, 12 + #t~mem96.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,940 INFO L290 TraceCheckUtils]: 70: Hoare triple {231532#false} assume 0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 4294967296;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;~skip~0 := 1; {231532#false} is VALID [2022-04-15 11:58:28,940 INFO L290 TraceCheckUtils]: 71: Hoare triple {231532#false} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,940 INFO L290 TraceCheckUtils]: 72: Hoare triple {231532#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); {231532#false} is VALID [2022-04-15 11:58:28,940 INFO L290 TraceCheckUtils]: 73: Hoare triple {231532#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {231532#false} is VALID [2022-04-15 11:58:28,940 INFO L290 TraceCheckUtils]: 74: Hoare triple {231532#false} ~skip~0 := 0; {231532#false} is VALID [2022-04-15 11:58:28,940 INFO L290 TraceCheckUtils]: 75: Hoare triple {231532#false} assume !false; {231532#false} is VALID [2022-04-15 11:58:28,940 INFO L290 TraceCheckUtils]: 76: Hoare triple {231532#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); {231532#false} is VALID [2022-04-15 11:58:28,940 INFO L290 TraceCheckUtils]: 77: Hoare triple {231532#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,940 INFO L290 TraceCheckUtils]: 78: Hoare triple {231532#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,940 INFO L290 TraceCheckUtils]: 79: Hoare triple {231532#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,940 INFO L290 TraceCheckUtils]: 80: Hoare triple {231532#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,941 INFO L290 TraceCheckUtils]: 81: Hoare triple {231532#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,941 INFO L290 TraceCheckUtils]: 82: Hoare triple {231532#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,941 INFO L290 TraceCheckUtils]: 83: Hoare triple {231532#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,941 INFO L290 TraceCheckUtils]: 84: Hoare triple {231532#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,941 INFO L290 TraceCheckUtils]: 85: Hoare triple {231532#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,941 INFO L290 TraceCheckUtils]: 86: Hoare triple {231532#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,941 INFO L290 TraceCheckUtils]: 87: Hoare triple {231532#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,941 INFO L290 TraceCheckUtils]: 88: Hoare triple {231532#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,941 INFO L290 TraceCheckUtils]: 89: Hoare triple {231532#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,941 INFO L290 TraceCheckUtils]: 90: Hoare triple {231532#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,941 INFO L290 TraceCheckUtils]: 91: Hoare triple {231532#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,941 INFO L290 TraceCheckUtils]: 92: Hoare triple {231532#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,941 INFO L290 TraceCheckUtils]: 93: Hoare triple {231532#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,942 INFO L290 TraceCheckUtils]: 94: Hoare triple {231532#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,942 INFO L290 TraceCheckUtils]: 95: Hoare triple {231532#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,942 INFO L290 TraceCheckUtils]: 96: Hoare triple {231532#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,942 INFO L290 TraceCheckUtils]: 97: Hoare triple {231532#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,942 INFO L290 TraceCheckUtils]: 98: Hoare triple {231532#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,942 INFO L290 TraceCheckUtils]: 99: Hoare triple {231532#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,942 INFO L290 TraceCheckUtils]: 100: Hoare triple {231532#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,942 INFO L290 TraceCheckUtils]: 101: Hoare triple {231532#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,942 INFO L290 TraceCheckUtils]: 102: Hoare triple {231532#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,942 INFO L290 TraceCheckUtils]: 103: Hoare triple {231532#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,942 INFO L290 TraceCheckUtils]: 104: Hoare triple {231532#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,942 INFO L290 TraceCheckUtils]: 105: Hoare triple {231532#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,943 INFO L290 TraceCheckUtils]: 106: Hoare triple {231532#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,943 INFO L290 TraceCheckUtils]: 107: Hoare triple {231532#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,943 INFO L290 TraceCheckUtils]: 108: Hoare triple {231532#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,943 INFO L290 TraceCheckUtils]: 109: Hoare triple {231532#false} assume 8672 == #t~mem79;havoc #t~mem79; {231532#false} is VALID [2022-04-15 11:58:28,943 INFO L290 TraceCheckUtils]: 110: Hoare triple {231532#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {231532#false} is VALID [2022-04-15 11:58:28,943 INFO L290 TraceCheckUtils]: 111: Hoare triple {231532#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {231532#false} is VALID [2022-04-15 11:58:28,943 INFO L290 TraceCheckUtils]: 112: Hoare triple {231532#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); {231532#false} is VALID [2022-04-15 11:58:28,943 INFO L290 TraceCheckUtils]: 113: Hoare triple {231532#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; {231532#false} is VALID [2022-04-15 11:58:28,943 INFO L290 TraceCheckUtils]: 114: Hoare triple {231532#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,943 INFO L290 TraceCheckUtils]: 115: Hoare triple {231532#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); {231532#false} is VALID [2022-04-15 11:58:28,943 INFO L290 TraceCheckUtils]: 116: Hoare triple {231532#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {231532#false} is VALID [2022-04-15 11:58:28,943 INFO L290 TraceCheckUtils]: 117: Hoare triple {231532#false} ~skip~0 := 0; {231532#false} is VALID [2022-04-15 11:58:28,943 INFO L290 TraceCheckUtils]: 118: Hoare triple {231532#false} assume !false; {231532#false} is VALID [2022-04-15 11:58:28,943 INFO L290 TraceCheckUtils]: 119: Hoare triple {231532#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); {231532#false} is VALID [2022-04-15 11:58:28,943 INFO L290 TraceCheckUtils]: 120: Hoare triple {231532#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,944 INFO L290 TraceCheckUtils]: 121: Hoare triple {231532#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,944 INFO L290 TraceCheckUtils]: 122: Hoare triple {231532#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,944 INFO L290 TraceCheckUtils]: 123: Hoare triple {231532#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,944 INFO L290 TraceCheckUtils]: 124: Hoare triple {231532#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,944 INFO L290 TraceCheckUtils]: 125: Hoare triple {231532#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,944 INFO L290 TraceCheckUtils]: 126: Hoare triple {231532#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,944 INFO L290 TraceCheckUtils]: 127: Hoare triple {231532#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,944 INFO L290 TraceCheckUtils]: 128: Hoare triple {231532#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,944 INFO L290 TraceCheckUtils]: 129: Hoare triple {231532#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,945 INFO L290 TraceCheckUtils]: 130: Hoare triple {231532#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,945 INFO L290 TraceCheckUtils]: 131: Hoare triple {231532#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,945 INFO L290 TraceCheckUtils]: 132: Hoare triple {231532#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,945 INFO L290 TraceCheckUtils]: 133: Hoare triple {231532#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,945 INFO L290 TraceCheckUtils]: 134: Hoare triple {231532#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,945 INFO L290 TraceCheckUtils]: 135: Hoare triple {231532#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,945 INFO L290 TraceCheckUtils]: 136: Hoare triple {231532#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,945 INFO L290 TraceCheckUtils]: 137: Hoare triple {231532#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,945 INFO L290 TraceCheckUtils]: 138: Hoare triple {231532#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,945 INFO L290 TraceCheckUtils]: 139: Hoare triple {231532#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,946 INFO L290 TraceCheckUtils]: 140: Hoare triple {231532#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,946 INFO L290 TraceCheckUtils]: 141: Hoare triple {231532#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,946 INFO L290 TraceCheckUtils]: 142: Hoare triple {231532#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,946 INFO L290 TraceCheckUtils]: 143: Hoare triple {231532#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,946 INFO L290 TraceCheckUtils]: 144: Hoare triple {231532#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,946 INFO L290 TraceCheckUtils]: 145: Hoare triple {231532#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,946 INFO L290 TraceCheckUtils]: 146: Hoare triple {231532#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,946 INFO L290 TraceCheckUtils]: 147: Hoare triple {231532#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-15 11:58:28,946 INFO L290 TraceCheckUtils]: 148: Hoare triple {231532#false} assume 8640 == #t~mem75;havoc #t~mem75; {231532#false} is VALID [2022-04-15 11:58:28,946 INFO L290 TraceCheckUtils]: 149: Hoare triple {231532#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {231532#false} is VALID [2022-04-15 11:58:28,946 INFO L290 TraceCheckUtils]: 150: Hoare triple {231532#false} assume !(4 == ~blastFlag~0); {231532#false} is VALID [2022-04-15 11:58:28,947 INFO L290 TraceCheckUtils]: 151: Hoare triple {231532#false} assume !(7 == ~blastFlag~0); {231532#false} is VALID [2022-04-15 11:58:28,947 INFO L290 TraceCheckUtils]: 152: Hoare triple {231532#false} assume !(10 == ~blastFlag~0); {231532#false} is VALID [2022-04-15 11:58:28,964 INFO L290 TraceCheckUtils]: 153: Hoare triple {231532#false} assume 13 == ~blastFlag~0; {231532#false} is VALID [2022-04-15 11:58:28,964 INFO L290 TraceCheckUtils]: 154: Hoare triple {231532#false} assume !false; {231532#false} is VALID [2022-04-15 11:58:28,965 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-04-15 11:58:28,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:58:28,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338058512] [2022-04-15 11:58:28,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338058512] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:58:28,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:58:28,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:58:28,965 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:58:28,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2029566486] [2022-04-15 11:58:28,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2029566486] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:58:28,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:58:28,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:58:28,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342103335] [2022-04-15 11:58:28,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:58:28,969 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (3), 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 155 [2022-04-15 11:58:28,970 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:58:28,970 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 25.0) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:58:29,052 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:58:29,052 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:58:29,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:58:29,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:58:29,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:58:29,052 INFO L87 Difference]: Start difference. First operand 1644 states and 2451 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:58:33,915 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-15 11:58:37,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:58:37,953 INFO L93 Difference]: Finished difference Result 2516 states and 3752 transitions. [2022-04-15 11:58:37,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:58:37,954 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (3), 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 155 [2022-04-15 11:58:37,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:58:37,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:58:37,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 464 transitions. [2022-04-15 11:58:37,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:58:37,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 464 transitions. [2022-04-15 11:58:37,957 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 464 transitions. [2022-04-15 11:58:38,253 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 464 edges. 464 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:58:38,374 INFO L225 Difference]: With dead ends: 2516 [2022-04-15 11:58:38,374 INFO L226 Difference]: Without dead ends: 1671 [2022-04-15 11:58:38,375 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:58:38,375 INFO L913 BasicCegarLoop]: 250 mSDtfsCounter, 15 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:58:38,375 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 444 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 284 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2022-04-15 11:58:38,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2022-04-15 11:58:38,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1671. [2022-04-15 11:58:38,500 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:58:38,501 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1671 states. Second operand has 1671 states, 1666 states have (on average 1.489795918367347) internal successors, (2482), 1666 states have internal predecessors, (2482), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:58:38,502 INFO L74 IsIncluded]: Start isIncluded. First operand 1671 states. Second operand has 1671 states, 1666 states have (on average 1.489795918367347) internal successors, (2482), 1666 states have internal predecessors, (2482), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:58:38,503 INFO L87 Difference]: Start difference. First operand 1671 states. Second operand has 1671 states, 1666 states have (on average 1.489795918367347) internal successors, (2482), 1666 states have internal predecessors, (2482), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:58:38,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:58:38,575 INFO L93 Difference]: Finished difference Result 1671 states and 2486 transitions. [2022-04-15 11:58:38,575 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 2486 transitions. [2022-04-15 11:58:38,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:58:38,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:58:38,577 INFO L74 IsIncluded]: Start isIncluded. First operand has 1671 states, 1666 states have (on average 1.489795918367347) internal successors, (2482), 1666 states have internal predecessors, (2482), 3 states have call successors, (3), 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 1671 states. [2022-04-15 11:58:38,578 INFO L87 Difference]: Start difference. First operand has 1671 states, 1666 states have (on average 1.489795918367347) internal successors, (2482), 1666 states have internal predecessors, (2482), 3 states have call successors, (3), 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 1671 states. [2022-04-15 11:58:38,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:58:38,657 INFO L93 Difference]: Finished difference Result 1671 states and 2486 transitions. [2022-04-15 11:58:38,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 2486 transitions. [2022-04-15 11:58:38,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:58:38,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:58:38,658 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:58:38,658 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:58:38,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1671 states, 1666 states have (on average 1.489795918367347) internal successors, (2482), 1666 states have internal predecessors, (2482), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:58:38,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 2486 transitions. [2022-04-15 11:58:38,797 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 2486 transitions. Word has length 155 [2022-04-15 11:58:38,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:58:38,797 INFO L478 AbstractCegarLoop]: Abstraction has 1671 states and 2486 transitions. [2022-04-15 11:58:38,797 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:58:38,797 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1671 states and 2486 transitions. [2022-04-15 11:58:43,986 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2486 edges. 2485 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:58:43,986 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 2486 transitions. [2022-04-15 11:58:43,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-04-15 11:58:43,988 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:58:43,988 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-15 11:58:43,988 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-04-15 11:58:43,988 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:58:43,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:58:43,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1776405232, now seen corresponding path program 1 times [2022-04-15 11:58:43,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:58:43,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2020988770] [2022-04-15 11:58:44,092 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:58:44,092 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:58:44,092 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:58:44,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1776405232, now seen corresponding path program 2 times [2022-04-15 11:58:44,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:58:44,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747499374] [2022-04-15 11:58:44,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:58:44,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:58:44,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:58:44,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:58:44,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:58:44,299 INFO L290 TraceCheckUtils]: 0: Hoare triple {243262#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {243256#true} is VALID [2022-04-15 11:58:44,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {243256#true} assume true; {243256#true} is VALID [2022-04-15 11:58:44,300 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {243256#true} {243256#true} #708#return; {243256#true} is VALID [2022-04-15 11:58:44,300 INFO L272 TraceCheckUtils]: 0: Hoare triple {243256#true} call ULTIMATE.init(); {243262#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:58:44,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {243262#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {243256#true} is VALID [2022-04-15 11:58:44,301 INFO L290 TraceCheckUtils]: 2: Hoare triple {243256#true} assume true; {243256#true} is VALID [2022-04-15 11:58:44,301 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {243256#true} {243256#true} #708#return; {243256#true} is VALID [2022-04-15 11:58:44,301 INFO L272 TraceCheckUtils]: 4: Hoare triple {243256#true} call #t~ret161 := main(); {243256#true} is VALID [2022-04-15 11:58:44,301 INFO L290 TraceCheckUtils]: 5: Hoare triple {243256#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; {243256#true} is VALID [2022-04-15 11:58:44,301 INFO L290 TraceCheckUtils]: 6: Hoare triple {243256#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,301 INFO L272 TraceCheckUtils]: 7: Hoare triple {243256#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {243256#true} is VALID [2022-04-15 11:58:44,301 INFO L290 TraceCheckUtils]: 8: Hoare triple {243256#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); {243256#true} is VALID [2022-04-15 11:58:44,301 INFO L290 TraceCheckUtils]: 9: Hoare triple {243256#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; {243256#true} is VALID [2022-04-15 11:58:44,301 INFO L290 TraceCheckUtils]: 10: Hoare triple {243256#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; {243256#true} is VALID [2022-04-15 11:58:44,301 INFO L290 TraceCheckUtils]: 11: Hoare triple {243256#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {243256#true} is VALID [2022-04-15 11:58:44,301 INFO L290 TraceCheckUtils]: 12: Hoare triple {243256#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,301 INFO L290 TraceCheckUtils]: 13: Hoare triple {243256#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {243256#true} is VALID [2022-04-15 11:58:44,301 INFO L290 TraceCheckUtils]: 14: Hoare triple {243256#true} assume !false; {243256#true} is VALID [2022-04-15 11:58:44,301 INFO L290 TraceCheckUtils]: 15: Hoare triple {243256#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); {243256#true} is VALID [2022-04-15 11:58:44,302 INFO L290 TraceCheckUtils]: 16: Hoare triple {243256#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,302 INFO L290 TraceCheckUtils]: 17: Hoare triple {243256#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,302 INFO L290 TraceCheckUtils]: 18: Hoare triple {243256#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,302 INFO L290 TraceCheckUtils]: 19: Hoare triple {243256#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,302 INFO L290 TraceCheckUtils]: 20: Hoare triple {243256#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,302 INFO L290 TraceCheckUtils]: 21: Hoare triple {243256#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,302 INFO L290 TraceCheckUtils]: 22: Hoare triple {243256#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,302 INFO L290 TraceCheckUtils]: 23: Hoare triple {243256#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,302 INFO L290 TraceCheckUtils]: 24: Hoare triple {243256#true} assume 8464 == #t~mem55;havoc #t~mem55; {243256#true} is VALID [2022-04-15 11:58:44,302 INFO L290 TraceCheckUtils]: 25: Hoare triple {243256#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; {243256#true} is VALID [2022-04-15 11:58:44,302 INFO L290 TraceCheckUtils]: 26: Hoare triple {243256#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {243256#true} is VALID [2022-04-15 11:58:44,302 INFO L290 TraceCheckUtils]: 27: Hoare triple {243256#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); {243256#true} is VALID [2022-04-15 11:58:44,302 INFO L290 TraceCheckUtils]: 28: Hoare triple {243256#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); {243256#true} is VALID [2022-04-15 11:58:44,302 INFO L290 TraceCheckUtils]: 29: Hoare triple {243256#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {243256#true} is VALID [2022-04-15 11:58:44,302 INFO L290 TraceCheckUtils]: 30: Hoare triple {243256#true} ~skip~0 := 0; {243256#true} is VALID [2022-04-15 11:58:44,302 INFO L290 TraceCheckUtils]: 31: Hoare triple {243256#true} assume !false; {243256#true} is VALID [2022-04-15 11:58:44,303 INFO L290 TraceCheckUtils]: 32: Hoare triple {243256#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); {243256#true} is VALID [2022-04-15 11:58:44,303 INFO L290 TraceCheckUtils]: 33: Hoare triple {243256#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,303 INFO L290 TraceCheckUtils]: 34: Hoare triple {243256#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,303 INFO L290 TraceCheckUtils]: 35: Hoare triple {243256#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,303 INFO L290 TraceCheckUtils]: 36: Hoare triple {243256#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,303 INFO L290 TraceCheckUtils]: 37: Hoare triple {243256#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,303 INFO L290 TraceCheckUtils]: 38: Hoare triple {243256#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,303 INFO L290 TraceCheckUtils]: 39: Hoare triple {243256#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,303 INFO L290 TraceCheckUtils]: 40: Hoare triple {243256#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,303 INFO L290 TraceCheckUtils]: 41: Hoare triple {243256#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,303 INFO L290 TraceCheckUtils]: 42: Hoare triple {243256#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,303 INFO L290 TraceCheckUtils]: 43: Hoare triple {243256#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,303 INFO L290 TraceCheckUtils]: 44: Hoare triple {243256#true} assume 8496 == #t~mem58;havoc #t~mem58; {243256#true} is VALID [2022-04-15 11:58:44,303 INFO L290 TraceCheckUtils]: 45: Hoare triple {243256#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {243256#true} is VALID [2022-04-15 11:58:44,303 INFO L290 TraceCheckUtils]: 46: Hoare triple {243256#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {243256#true} is VALID [2022-04-15 11:58:44,304 INFO L290 TraceCheckUtils]: 47: Hoare triple {243256#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,304 INFO L290 TraceCheckUtils]: 48: Hoare triple {243256#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,304 INFO L290 TraceCheckUtils]: 49: Hoare triple {243256#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,304 INFO L290 TraceCheckUtils]: 50: Hoare triple {243256#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); {243256#true} is VALID [2022-04-15 11:58:44,304 INFO L290 TraceCheckUtils]: 51: Hoare triple {243256#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {243256#true} is VALID [2022-04-15 11:58:44,304 INFO L290 TraceCheckUtils]: 52: Hoare triple {243256#true} ~skip~0 := 0; {243256#true} is VALID [2022-04-15 11:58:44,304 INFO L290 TraceCheckUtils]: 53: Hoare triple {243256#true} assume !false; {243256#true} is VALID [2022-04-15 11:58:44,304 INFO L290 TraceCheckUtils]: 54: Hoare triple {243256#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); {243256#true} is VALID [2022-04-15 11:58:44,304 INFO L290 TraceCheckUtils]: 55: Hoare triple {243256#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,304 INFO L290 TraceCheckUtils]: 56: Hoare triple {243256#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,304 INFO L290 TraceCheckUtils]: 57: Hoare triple {243256#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,304 INFO L290 TraceCheckUtils]: 58: Hoare triple {243256#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,304 INFO L290 TraceCheckUtils]: 59: Hoare triple {243256#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,304 INFO L290 TraceCheckUtils]: 60: Hoare triple {243256#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,304 INFO L290 TraceCheckUtils]: 61: Hoare triple {243256#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,305 INFO L290 TraceCheckUtils]: 62: Hoare triple {243256#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,305 INFO L290 TraceCheckUtils]: 63: Hoare triple {243256#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,305 INFO L290 TraceCheckUtils]: 64: Hoare triple {243256#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,305 INFO L290 TraceCheckUtils]: 65: Hoare triple {243256#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,305 INFO L290 TraceCheckUtils]: 66: Hoare triple {243256#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,305 INFO L290 TraceCheckUtils]: 67: Hoare triple {243256#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,305 INFO L290 TraceCheckUtils]: 68: Hoare triple {243256#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,305 INFO L290 TraceCheckUtils]: 69: Hoare triple {243256#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,305 INFO L290 TraceCheckUtils]: 70: Hoare triple {243256#true} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,305 INFO L290 TraceCheckUtils]: 71: Hoare triple {243256#true} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,305 INFO L290 TraceCheckUtils]: 72: Hoare triple {243256#true} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,305 INFO L290 TraceCheckUtils]: 73: Hoare triple {243256#true} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,306 INFO L290 TraceCheckUtils]: 74: Hoare triple {243256#true} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,306 INFO L290 TraceCheckUtils]: 75: Hoare triple {243256#true} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,306 INFO L290 TraceCheckUtils]: 76: Hoare triple {243256#true} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,306 INFO L290 TraceCheckUtils]: 77: Hoare triple {243256#true} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,306 INFO L290 TraceCheckUtils]: 78: Hoare triple {243256#true} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,306 INFO L290 TraceCheckUtils]: 79: Hoare triple {243256#true} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,306 INFO L290 TraceCheckUtils]: 80: Hoare triple {243256#true} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,306 INFO L290 TraceCheckUtils]: 81: Hoare triple {243256#true} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,306 INFO L290 TraceCheckUtils]: 82: Hoare triple {243256#true} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,306 INFO L290 TraceCheckUtils]: 83: Hoare triple {243256#true} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,306 INFO L290 TraceCheckUtils]: 84: Hoare triple {243256#true} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,306 INFO L290 TraceCheckUtils]: 85: Hoare triple {243256#true} assume 8656 == #t~mem77;havoc #t~mem77; {243256#true} is VALID [2022-04-15 11:58:44,306 INFO L290 TraceCheckUtils]: 86: Hoare triple {243256#true} call #t~mem140.base, #t~mem140.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem141.base, #t~mem141.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem142.base, #t~mem142.offset := read~$Pointer$(#t~mem141.base, 836 + #t~mem141.offset, 4);call write~$Pointer$(#t~mem142.base, #t~mem142.offset, #t~mem140.base, 172 + #t~mem140.offset, 4);havoc #t~mem140.base, #t~mem140.offset;havoc #t~mem141.base, #t~mem141.offset;havoc #t~mem142.base, #t~mem142.offset; {243256#true} is VALID [2022-04-15 11:58:44,307 INFO L290 TraceCheckUtils]: 87: Hoare triple {243256#true} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {243256#true} is VALID [2022-04-15 11:58:44,307 INFO L290 TraceCheckUtils]: 88: Hoare triple {243256#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {243256#true} is VALID [2022-04-15 11:58:44,307 INFO L290 TraceCheckUtils]: 89: Hoare triple {243256#true} assume !(~ret~0 <= 0);call write~int(8672, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,307 INFO L290 TraceCheckUtils]: 90: Hoare triple {243256#true} assume !(0 == ~tmp___10~0); {243256#true} is VALID [2022-04-15 11:58:44,307 INFO L290 TraceCheckUtils]: 91: Hoare triple {243256#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); {243256#true} is VALID [2022-04-15 11:58:44,307 INFO L290 TraceCheckUtils]: 92: Hoare triple {243256#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {243256#true} is VALID [2022-04-15 11:58:44,307 INFO L290 TraceCheckUtils]: 93: Hoare triple {243256#true} ~skip~0 := 0; {243256#true} is VALID [2022-04-15 11:58:44,307 INFO L290 TraceCheckUtils]: 94: Hoare triple {243256#true} assume !false; {243256#true} is VALID [2022-04-15 11:58:44,307 INFO L290 TraceCheckUtils]: 95: Hoare triple {243256#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); {243256#true} is VALID [2022-04-15 11:58:44,307 INFO L290 TraceCheckUtils]: 96: Hoare triple {243256#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,307 INFO L290 TraceCheckUtils]: 97: Hoare triple {243256#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,308 INFO L290 TraceCheckUtils]: 98: Hoare triple {243256#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,308 INFO L290 TraceCheckUtils]: 99: Hoare triple {243256#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,308 INFO L290 TraceCheckUtils]: 100: Hoare triple {243256#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,308 INFO L290 TraceCheckUtils]: 101: Hoare triple {243256#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,308 INFO L290 TraceCheckUtils]: 102: Hoare triple {243256#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,308 INFO L290 TraceCheckUtils]: 103: Hoare triple {243256#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,308 INFO L290 TraceCheckUtils]: 104: Hoare triple {243256#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,308 INFO L290 TraceCheckUtils]: 105: Hoare triple {243256#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,308 INFO L290 TraceCheckUtils]: 106: Hoare triple {243256#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,308 INFO L290 TraceCheckUtils]: 107: Hoare triple {243256#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,308 INFO L290 TraceCheckUtils]: 108: Hoare triple {243256#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,309 INFO L290 TraceCheckUtils]: 109: Hoare triple {243256#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,309 INFO L290 TraceCheckUtils]: 110: Hoare triple {243256#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,309 INFO L290 TraceCheckUtils]: 111: Hoare triple {243256#true} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,309 INFO L290 TraceCheckUtils]: 112: Hoare triple {243256#true} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,309 INFO L290 TraceCheckUtils]: 113: Hoare triple {243256#true} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,309 INFO L290 TraceCheckUtils]: 114: Hoare triple {243256#true} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,309 INFO L290 TraceCheckUtils]: 115: Hoare triple {243256#true} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,309 INFO L290 TraceCheckUtils]: 116: Hoare triple {243256#true} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,309 INFO L290 TraceCheckUtils]: 117: Hoare triple {243256#true} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,309 INFO L290 TraceCheckUtils]: 118: Hoare triple {243256#true} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,310 INFO L290 TraceCheckUtils]: 119: Hoare triple {243256#true} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,310 INFO L290 TraceCheckUtils]: 120: Hoare triple {243256#true} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,310 INFO L290 TraceCheckUtils]: 121: Hoare triple {243256#true} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,310 INFO L290 TraceCheckUtils]: 122: Hoare triple {243256#true} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,310 INFO L290 TraceCheckUtils]: 123: Hoare triple {243256#true} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,310 INFO L290 TraceCheckUtils]: 124: Hoare triple {243256#true} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,310 INFO L290 TraceCheckUtils]: 125: Hoare triple {243256#true} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,310 INFO L290 TraceCheckUtils]: 126: Hoare triple {243256#true} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,310 INFO L290 TraceCheckUtils]: 127: Hoare triple {243256#true} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-15 11:58:44,310 INFO L290 TraceCheckUtils]: 128: Hoare triple {243256#true} assume 8672 == #t~mem79;havoc #t~mem79; {243256#true} is VALID [2022-04-15 11:58:44,311 INFO L290 TraceCheckUtils]: 129: Hoare triple {243256#true} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {243256#true} is VALID [2022-04-15 11:58:44,311 INFO L290 TraceCheckUtils]: 130: Hoare triple {243256#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-15 11:58:44,312 INFO L290 TraceCheckUtils]: 131: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} 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); {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-15 11:58:44,312 INFO L290 TraceCheckUtils]: 132: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} 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; {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-15 11:58:44,313 INFO L290 TraceCheckUtils]: 133: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-15 11:58:44,313 INFO L290 TraceCheckUtils]: 134: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} 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); {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-15 11:58:44,313 INFO L290 TraceCheckUtils]: 135: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-15 11:58:44,314 INFO L290 TraceCheckUtils]: 136: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} ~skip~0 := 0; {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-15 11:58:44,314 INFO L290 TraceCheckUtils]: 137: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} assume !false; {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-15 11:58:44,314 INFO L290 TraceCheckUtils]: 138: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} 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); {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-15 11:58:44,315 INFO L290 TraceCheckUtils]: 139: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-15 11:58:44,315 INFO L290 TraceCheckUtils]: 140: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-15 11:58:44,316 INFO L290 TraceCheckUtils]: 141: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-15 11:58:44,316 INFO L290 TraceCheckUtils]: 142: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-15 11:58:44,316 INFO L290 TraceCheckUtils]: 143: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-15 11:58:44,317 INFO L290 TraceCheckUtils]: 144: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-15 11:58:44,317 INFO L290 TraceCheckUtils]: 145: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-15 11:58:44,317 INFO L290 TraceCheckUtils]: 146: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-15 11:58:44,318 INFO L290 TraceCheckUtils]: 147: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-15 11:58:44,318 INFO L290 TraceCheckUtils]: 148: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-15 11:58:44,318 INFO L290 TraceCheckUtils]: 149: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-15 11:58:44,319 INFO L290 TraceCheckUtils]: 150: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-15 11:58:44,319 INFO L290 TraceCheckUtils]: 151: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-15 11:58:44,319 INFO L290 TraceCheckUtils]: 152: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-15 11:58:44,320 INFO L290 TraceCheckUtils]: 153: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-15 11:58:44,320 INFO L290 TraceCheckUtils]: 154: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-15 11:58:44,320 INFO L290 TraceCheckUtils]: 155: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-15 11:58:44,321 INFO L290 TraceCheckUtils]: 156: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-15 11:58:44,321 INFO L290 TraceCheckUtils]: 157: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-15 11:58:44,321 INFO L290 TraceCheckUtils]: 158: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-15 11:58:44,322 INFO L290 TraceCheckUtils]: 159: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-15 11:58:44,322 INFO L290 TraceCheckUtils]: 160: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-15 11:58:44,322 INFO L290 TraceCheckUtils]: 161: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-15 11:58:44,323 INFO L290 TraceCheckUtils]: 162: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-15 11:58:44,323 INFO L290 TraceCheckUtils]: 163: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-15 11:58:44,323 INFO L290 TraceCheckUtils]: 164: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-15 11:58:44,324 INFO L290 TraceCheckUtils]: 165: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-15 11:58:44,324 INFO L290 TraceCheckUtils]: 166: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-15 11:58:44,324 INFO L290 TraceCheckUtils]: 167: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} assume 8640 == #t~mem75;havoc #t~mem75; {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-15 11:58:44,325 INFO L290 TraceCheckUtils]: 168: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-15 11:58:44,325 INFO L290 TraceCheckUtils]: 169: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} assume !(4 == ~blastFlag~0); {243257#false} is VALID [2022-04-15 11:58:44,325 INFO L290 TraceCheckUtils]: 170: Hoare triple {243257#false} assume !(7 == ~blastFlag~0); {243257#false} is VALID [2022-04-15 11:58:44,325 INFO L290 TraceCheckUtils]: 171: Hoare triple {243257#false} assume !(10 == ~blastFlag~0); {243257#false} is VALID [2022-04-15 11:58:44,325 INFO L290 TraceCheckUtils]: 172: Hoare triple {243257#false} assume 13 == ~blastFlag~0; {243257#false} is VALID [2022-04-15 11:58:44,325 INFO L290 TraceCheckUtils]: 173: Hoare triple {243257#false} assume !false; {243257#false} is VALID [2022-04-15 11:58:44,326 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-04-15 11:58:44,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:58:44,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747499374] [2022-04-15 11:58:44,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747499374] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:58:44,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:58:44,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:58:44,326 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:58:44,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2020988770] [2022-04-15 11:58:44,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2020988770] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:58:44,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:58:44,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:58:44,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213418626] [2022-04-15 11:58:44,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:58:44,327 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 3 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 174 [2022-04-15 11:58:44,327 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:58:44,327 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 27.25) internal successors, (109), 3 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-15 11:58:44,406 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-15 11:58:44,406 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:58:44,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:58:44,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:58:44,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:58:44,406 INFO L87 Difference]: Start difference. First operand 1671 states and 2486 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 3 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-15 11:58:48,018 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-15 11:58:50,042 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-15 11:58:56,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:58:56,008 INFO L93 Difference]: Finished difference Result 2960 states and 4415 transitions. [2022-04-15 11:58:56,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:58:56,008 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 3 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 174 [2022-04-15 11:58:56,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:58:56,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 3 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-15 11:58:56,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 620 transitions. [2022-04-15 11:58:56,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 3 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-15 11:58:56,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 620 transitions. [2022-04-15 11:58:56,012 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 620 transitions. [2022-04-15 11:58:56,415 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 620 edges. 620 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:58:56,585 INFO L225 Difference]: With dead ends: 2960 [2022-04-15 11:58:56,585 INFO L226 Difference]: Without dead ends: 2088 [2022-04-15 11:58:56,586 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:58:56,586 INFO L913 BasicCegarLoop]: 390 mSDtfsCounter, 143 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 12 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-04-15 11:58:56,586 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 584 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 442 Invalid, 1 Unknown, 0 Unchecked, 5.6s Time] [2022-04-15 11:58:56,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2088 states. [2022-04-15 11:58:56,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2088 to 2088. [2022-04-15 11:58:56,724 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:58:56,726 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2088 states. Second operand has 2088 states, 2083 states have (on average 1.4887181949111858) internal successors, (3101), 2083 states have internal predecessors, (3101), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:58:56,727 INFO L74 IsIncluded]: Start isIncluded. First operand 2088 states. Second operand has 2088 states, 2083 states have (on average 1.4887181949111858) internal successors, (3101), 2083 states have internal predecessors, (3101), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:58:56,728 INFO L87 Difference]: Start difference. First operand 2088 states. Second operand has 2088 states, 2083 states have (on average 1.4887181949111858) internal successors, (3101), 2083 states have internal predecessors, (3101), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:58:56,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:58:56,842 INFO L93 Difference]: Finished difference Result 2088 states and 3105 transitions. [2022-04-15 11:58:56,842 INFO L276 IsEmpty]: Start isEmpty. Operand 2088 states and 3105 transitions. [2022-04-15 11:58:56,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:58:56,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:58:56,844 INFO L74 IsIncluded]: Start isIncluded. First operand has 2088 states, 2083 states have (on average 1.4887181949111858) internal successors, (3101), 2083 states have internal predecessors, (3101), 3 states have call successors, (3), 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 2088 states. [2022-04-15 11:58:56,845 INFO L87 Difference]: Start difference. First operand has 2088 states, 2083 states have (on average 1.4887181949111858) internal successors, (3101), 2083 states have internal predecessors, (3101), 3 states have call successors, (3), 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 2088 states. [2022-04-15 11:58:56,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:58:56,958 INFO L93 Difference]: Finished difference Result 2088 states and 3105 transitions. [2022-04-15 11:58:56,958 INFO L276 IsEmpty]: Start isEmpty. Operand 2088 states and 3105 transitions. [2022-04-15 11:58:56,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:58:56,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:58:56,959 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:58:56,960 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:58:56,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2088 states, 2083 states have (on average 1.4887181949111858) internal successors, (3101), 2083 states have internal predecessors, (3101), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:58:57,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2088 states to 2088 states and 3105 transitions. [2022-04-15 11:58:57,151 INFO L78 Accepts]: Start accepts. Automaton has 2088 states and 3105 transitions. Word has length 174 [2022-04-15 11:58:57,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:58:57,152 INFO L478 AbstractCegarLoop]: Abstraction has 2088 states and 3105 transitions. [2022-04-15 11:58:57,152 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 3 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-15 11:58:57,152 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2088 states and 3105 transitions. [2022-04-15 11:59:02,845 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3105 edges. 3104 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:59:02,845 INFO L276 IsEmpty]: Start isEmpty. Operand 2088 states and 3105 transitions. [2022-04-15 11:59:02,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-04-15 11:59:02,848 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:59:02,848 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-04-15 11:59:02,848 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-04-15 11:59:02,848 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:59:02,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:59:02,848 INFO L85 PathProgramCache]: Analyzing trace with hash -309724723, now seen corresponding path program 1 times [2022-04-15 11:59:02,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:59:02,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1509898184] [2022-04-15 11:59:02,969 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:59:02,969 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:59:02,969 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:59:02,969 INFO L85 PathProgramCache]: Analyzing trace with hash -309724723, now seen corresponding path program 2 times [2022-04-15 11:59:02,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:59:02,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663510602] [2022-04-15 11:59:02,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:59:02,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:59:03,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:59:03,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:59:03,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:59:03,174 INFO L290 TraceCheckUtils]: 0: Hoare triple {257543#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {257537#true} is VALID [2022-04-15 11:59:03,174 INFO L290 TraceCheckUtils]: 1: Hoare triple {257537#true} assume true; {257537#true} is VALID [2022-04-15 11:59:03,174 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {257537#true} {257537#true} #708#return; {257537#true} is VALID [2022-04-15 11:59:03,175 INFO L272 TraceCheckUtils]: 0: Hoare triple {257537#true} call ULTIMATE.init(); {257543#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:59:03,175 INFO L290 TraceCheckUtils]: 1: Hoare triple {257543#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {257537#true} is VALID [2022-04-15 11:59:03,175 INFO L290 TraceCheckUtils]: 2: Hoare triple {257537#true} assume true; {257537#true} is VALID [2022-04-15 11:59:03,176 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {257537#true} {257537#true} #708#return; {257537#true} is VALID [2022-04-15 11:59:03,176 INFO L272 TraceCheckUtils]: 4: Hoare triple {257537#true} call #t~ret161 := main(); {257537#true} is VALID [2022-04-15 11:59:03,176 INFO L290 TraceCheckUtils]: 5: Hoare triple {257537#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; {257537#true} is VALID [2022-04-15 11:59:03,176 INFO L290 TraceCheckUtils]: 6: Hoare triple {257537#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {257537#true} is VALID [2022-04-15 11:59:03,176 INFO L272 TraceCheckUtils]: 7: Hoare triple {257537#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {257537#true} is VALID [2022-04-15 11:59:03,176 INFO L290 TraceCheckUtils]: 8: Hoare triple {257537#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); {257537#true} is VALID [2022-04-15 11:59:03,176 INFO L290 TraceCheckUtils]: 9: Hoare triple {257537#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; {257537#true} is VALID [2022-04-15 11:59:03,176 INFO L290 TraceCheckUtils]: 10: Hoare triple {257537#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; {257537#true} is VALID [2022-04-15 11:59:03,176 INFO L290 TraceCheckUtils]: 11: Hoare triple {257537#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {257537#true} is VALID [2022-04-15 11:59:03,176 INFO L290 TraceCheckUtils]: 12: Hoare triple {257537#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {257537#true} is VALID [2022-04-15 11:59:03,176 INFO L290 TraceCheckUtils]: 13: Hoare triple {257537#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {257537#true} is VALID [2022-04-15 11:59:03,177 INFO L290 TraceCheckUtils]: 14: Hoare triple {257537#true} assume !false; {257537#true} is VALID [2022-04-15 11:59:03,177 INFO L290 TraceCheckUtils]: 15: Hoare triple {257537#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); {257537#true} is VALID [2022-04-15 11:59:03,177 INFO L290 TraceCheckUtils]: 16: Hoare triple {257537#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-15 11:59:03,177 INFO L290 TraceCheckUtils]: 17: Hoare triple {257537#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-15 11:59:03,177 INFO L290 TraceCheckUtils]: 18: Hoare triple {257537#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-15 11:59:03,177 INFO L290 TraceCheckUtils]: 19: Hoare triple {257537#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-15 11:59:03,177 INFO L290 TraceCheckUtils]: 20: Hoare triple {257537#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-15 11:59:03,177 INFO L290 TraceCheckUtils]: 21: Hoare triple {257537#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-15 11:59:03,177 INFO L290 TraceCheckUtils]: 22: Hoare triple {257537#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-15 11:59:03,178 INFO L290 TraceCheckUtils]: 23: Hoare triple {257537#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-15 11:59:03,178 INFO L290 TraceCheckUtils]: 24: Hoare triple {257537#true} assume 8464 == #t~mem55;havoc #t~mem55; {257537#true} is VALID [2022-04-15 11:59:03,178 INFO L290 TraceCheckUtils]: 25: Hoare triple {257537#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; {257537#true} is VALID [2022-04-15 11:59:03,178 INFO L290 TraceCheckUtils]: 26: Hoare triple {257537#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {257537#true} is VALID [2022-04-15 11:59:03,178 INFO L290 TraceCheckUtils]: 27: Hoare triple {257537#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); {257537#true} is VALID [2022-04-15 11:59:03,178 INFO L290 TraceCheckUtils]: 28: Hoare triple {257537#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); {257537#true} is VALID [2022-04-15 11:59:03,178 INFO L290 TraceCheckUtils]: 29: Hoare triple {257537#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {257537#true} is VALID [2022-04-15 11:59:03,178 INFO L290 TraceCheckUtils]: 30: Hoare triple {257537#true} ~skip~0 := 0; {257537#true} is VALID [2022-04-15 11:59:03,178 INFO L290 TraceCheckUtils]: 31: Hoare triple {257537#true} assume !false; {257537#true} is VALID [2022-04-15 11:59:03,178 INFO L290 TraceCheckUtils]: 32: Hoare triple {257537#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); {257537#true} is VALID [2022-04-15 11:59:03,179 INFO L290 TraceCheckUtils]: 33: Hoare triple {257537#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-15 11:59:03,179 INFO L290 TraceCheckUtils]: 34: Hoare triple {257537#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-15 11:59:03,179 INFO L290 TraceCheckUtils]: 35: Hoare triple {257537#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-15 11:59:03,179 INFO L290 TraceCheckUtils]: 36: Hoare triple {257537#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-15 11:59:03,179 INFO L290 TraceCheckUtils]: 37: Hoare triple {257537#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-15 11:59:03,179 INFO L290 TraceCheckUtils]: 38: Hoare triple {257537#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-15 11:59:03,179 INFO L290 TraceCheckUtils]: 39: Hoare triple {257537#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-15 11:59:03,179 INFO L290 TraceCheckUtils]: 40: Hoare triple {257537#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-15 11:59:03,179 INFO L290 TraceCheckUtils]: 41: Hoare triple {257537#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-15 11:59:03,179 INFO L290 TraceCheckUtils]: 42: Hoare triple {257537#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-15 11:59:03,180 INFO L290 TraceCheckUtils]: 43: Hoare triple {257537#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-15 11:59:03,180 INFO L290 TraceCheckUtils]: 44: Hoare triple {257537#true} assume 8496 == #t~mem58;havoc #t~mem58; {257537#true} is VALID [2022-04-15 11:59:03,180 INFO L290 TraceCheckUtils]: 45: Hoare triple {257537#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {257537#true} is VALID [2022-04-15 11:59:03,180 INFO L290 TraceCheckUtils]: 46: Hoare triple {257537#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {257537#true} is VALID [2022-04-15 11:59:03,180 INFO L290 TraceCheckUtils]: 47: Hoare triple {257537#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {257537#true} is VALID [2022-04-15 11:59:03,180 INFO L290 TraceCheckUtils]: 48: Hoare triple {257537#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-15 11:59:03,180 INFO L290 TraceCheckUtils]: 49: Hoare triple {257537#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {257537#true} is VALID [2022-04-15 11:59:03,180 INFO L290 TraceCheckUtils]: 50: Hoare triple {257537#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); {257537#true} is VALID [2022-04-15 11:59:03,180 INFO L290 TraceCheckUtils]: 51: Hoare triple {257537#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {257537#true} is VALID [2022-04-15 11:59:03,180 INFO L290 TraceCheckUtils]: 52: Hoare triple {257537#true} ~skip~0 := 0; {257537#true} is VALID [2022-04-15 11:59:03,181 INFO L290 TraceCheckUtils]: 53: Hoare triple {257537#true} assume !false; {257537#true} is VALID [2022-04-15 11:59:03,181 INFO L290 TraceCheckUtils]: 54: Hoare triple {257537#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); {257537#true} is VALID [2022-04-15 11:59:03,181 INFO L290 TraceCheckUtils]: 55: Hoare triple {257537#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-15 11:59:03,181 INFO L290 TraceCheckUtils]: 56: Hoare triple {257537#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-15 11:59:03,181 INFO L290 TraceCheckUtils]: 57: Hoare triple {257537#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-15 11:59:03,181 INFO L290 TraceCheckUtils]: 58: Hoare triple {257537#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-15 11:59:03,181 INFO L290 TraceCheckUtils]: 59: Hoare triple {257537#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-15 11:59:03,181 INFO L290 TraceCheckUtils]: 60: Hoare triple {257537#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-15 11:59:03,181 INFO L290 TraceCheckUtils]: 61: Hoare triple {257537#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-15 11:59:03,181 INFO L290 TraceCheckUtils]: 62: Hoare triple {257537#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-15 11:59:03,181 INFO L290 TraceCheckUtils]: 63: Hoare triple {257537#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-15 11:59:03,182 INFO L290 TraceCheckUtils]: 64: Hoare triple {257537#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-15 11:59:03,182 INFO L290 TraceCheckUtils]: 65: Hoare triple {257537#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-15 11:59:03,182 INFO L290 TraceCheckUtils]: 66: Hoare triple {257537#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-15 11:59:03,182 INFO L290 TraceCheckUtils]: 67: Hoare triple {257537#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-15 11:59:03,182 INFO L290 TraceCheckUtils]: 68: Hoare triple {257537#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-15 11:59:03,182 INFO L290 TraceCheckUtils]: 69: Hoare triple {257537#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-15 11:59:03,182 INFO L290 TraceCheckUtils]: 70: Hoare triple {257537#true} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-15 11:59:03,182 INFO L290 TraceCheckUtils]: 71: Hoare triple {257537#true} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-15 11:59:03,182 INFO L290 TraceCheckUtils]: 72: Hoare triple {257537#true} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-15 11:59:03,182 INFO L290 TraceCheckUtils]: 73: Hoare triple {257537#true} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-15 11:59:03,182 INFO L290 TraceCheckUtils]: 74: Hoare triple {257537#true} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-15 11:59:03,183 INFO L290 TraceCheckUtils]: 75: Hoare triple {257537#true} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-15 11:59:03,183 INFO L290 TraceCheckUtils]: 76: Hoare triple {257537#true} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-15 11:59:03,183 INFO L290 TraceCheckUtils]: 77: Hoare triple {257537#true} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-15 11:59:03,183 INFO L290 TraceCheckUtils]: 78: Hoare triple {257537#true} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-15 11:59:03,183 INFO L290 TraceCheckUtils]: 79: Hoare triple {257537#true} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-15 11:59:03,183 INFO L290 TraceCheckUtils]: 80: Hoare triple {257537#true} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-15 11:59:03,183 INFO L290 TraceCheckUtils]: 81: Hoare triple {257537#true} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-15 11:59:03,183 INFO L290 TraceCheckUtils]: 82: Hoare triple {257537#true} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-15 11:59:03,183 INFO L290 TraceCheckUtils]: 83: Hoare triple {257537#true} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-15 11:59:03,183 INFO L290 TraceCheckUtils]: 84: Hoare triple {257537#true} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-15 11:59:03,183 INFO L290 TraceCheckUtils]: 85: Hoare triple {257537#true} assume 8656 == #t~mem77;havoc #t~mem77; {257537#true} is VALID [2022-04-15 11:59:03,184 INFO L290 TraceCheckUtils]: 86: Hoare triple {257537#true} call #t~mem140.base, #t~mem140.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem141.base, #t~mem141.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem142.base, #t~mem142.offset := read~$Pointer$(#t~mem141.base, 836 + #t~mem141.offset, 4);call write~$Pointer$(#t~mem142.base, #t~mem142.offset, #t~mem140.base, 172 + #t~mem140.offset, 4);havoc #t~mem140.base, #t~mem140.offset;havoc #t~mem141.base, #t~mem141.offset;havoc #t~mem142.base, #t~mem142.offset; {257537#true} is VALID [2022-04-15 11:59:03,184 INFO L290 TraceCheckUtils]: 87: Hoare triple {257537#true} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {257537#true} is VALID [2022-04-15 11:59:03,184 INFO L290 TraceCheckUtils]: 88: Hoare triple {257537#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:59:03,184 INFO L290 TraceCheckUtils]: 89: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume !(~ret~0 <= 0);call write~int(8672, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:59:03,185 INFO L290 TraceCheckUtils]: 90: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume !(0 == ~tmp___10~0); {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:59:03,185 INFO L290 TraceCheckUtils]: 91: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} 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); {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:59:03,185 INFO L290 TraceCheckUtils]: 92: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:59:03,186 INFO L290 TraceCheckUtils]: 93: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} ~skip~0 := 0; {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:59:03,186 INFO L290 TraceCheckUtils]: 94: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume !false; {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:59:03,186 INFO L290 TraceCheckUtils]: 95: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~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); {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:59:03,187 INFO L290 TraceCheckUtils]: 96: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:59:03,187 INFO L290 TraceCheckUtils]: 97: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:59:03,188 INFO L290 TraceCheckUtils]: 98: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:59:03,188 INFO L290 TraceCheckUtils]: 99: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:59:03,188 INFO L290 TraceCheckUtils]: 100: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:59:03,189 INFO L290 TraceCheckUtils]: 101: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:59:03,189 INFO L290 TraceCheckUtils]: 102: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:59:03,189 INFO L290 TraceCheckUtils]: 103: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:59:03,190 INFO L290 TraceCheckUtils]: 104: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:59:03,190 INFO L290 TraceCheckUtils]: 105: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:59:03,190 INFO L290 TraceCheckUtils]: 106: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:59:03,191 INFO L290 TraceCheckUtils]: 107: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:59:03,191 INFO L290 TraceCheckUtils]: 108: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:59:03,191 INFO L290 TraceCheckUtils]: 109: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:59:03,192 INFO L290 TraceCheckUtils]: 110: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:59:03,192 INFO L290 TraceCheckUtils]: 111: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:59:03,192 INFO L290 TraceCheckUtils]: 112: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:59:03,193 INFO L290 TraceCheckUtils]: 113: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:59:03,193 INFO L290 TraceCheckUtils]: 114: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:59:03,193 INFO L290 TraceCheckUtils]: 115: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:59:03,194 INFO L290 TraceCheckUtils]: 116: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:59:03,194 INFO L290 TraceCheckUtils]: 117: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:59:03,194 INFO L290 TraceCheckUtils]: 118: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:59:03,195 INFO L290 TraceCheckUtils]: 119: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:59:03,195 INFO L290 TraceCheckUtils]: 120: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:59:03,195 INFO L290 TraceCheckUtils]: 121: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:59:03,196 INFO L290 TraceCheckUtils]: 122: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:59:03,196 INFO L290 TraceCheckUtils]: 123: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:59:03,196 INFO L290 TraceCheckUtils]: 124: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:59:03,197 INFO L290 TraceCheckUtils]: 125: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:59:03,197 INFO L290 TraceCheckUtils]: 126: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:59:03,197 INFO L290 TraceCheckUtils]: 127: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:59:03,198 INFO L290 TraceCheckUtils]: 128: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume 8672 == #t~mem79;havoc #t~mem79; {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:59:03,198 INFO L290 TraceCheckUtils]: 129: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:59:03,198 INFO L290 TraceCheckUtils]: 130: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume !(3 == ~blastFlag~0); {257538#false} is VALID [2022-04-15 11:59:03,198 INFO L290 TraceCheckUtils]: 131: Hoare triple {257538#false} assume 6 == ~blastFlag~0;~blastFlag~0 := 7; {257538#false} is VALID [2022-04-15 11:59:03,198 INFO L290 TraceCheckUtils]: 132: Hoare triple {257538#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); {257538#false} is VALID [2022-04-15 11:59:03,198 INFO L290 TraceCheckUtils]: 133: Hoare triple {257538#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; {257538#false} is VALID [2022-04-15 11:59:03,199 INFO L290 TraceCheckUtils]: 134: Hoare triple {257538#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {257538#false} is VALID [2022-04-15 11:59:03,199 INFO L290 TraceCheckUtils]: 135: Hoare triple {257538#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); {257538#false} is VALID [2022-04-15 11:59:03,199 INFO L290 TraceCheckUtils]: 136: Hoare triple {257538#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {257538#false} is VALID [2022-04-15 11:59:03,199 INFO L290 TraceCheckUtils]: 137: Hoare triple {257538#false} ~skip~0 := 0; {257538#false} is VALID [2022-04-15 11:59:03,199 INFO L290 TraceCheckUtils]: 138: Hoare triple {257538#false} assume !false; {257538#false} is VALID [2022-04-15 11:59:03,199 INFO L290 TraceCheckUtils]: 139: Hoare triple {257538#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); {257538#false} is VALID [2022-04-15 11:59:03,199 INFO L290 TraceCheckUtils]: 140: Hoare triple {257538#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {257538#false} is VALID [2022-04-15 11:59:03,199 INFO L290 TraceCheckUtils]: 141: Hoare triple {257538#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {257538#false} is VALID [2022-04-15 11:59:03,199 INFO L290 TraceCheckUtils]: 142: Hoare triple {257538#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {257538#false} is VALID [2022-04-15 11:59:03,199 INFO L290 TraceCheckUtils]: 143: Hoare triple {257538#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {257538#false} is VALID [2022-04-15 11:59:03,199 INFO L290 TraceCheckUtils]: 144: Hoare triple {257538#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {257538#false} is VALID [2022-04-15 11:59:03,200 INFO L290 TraceCheckUtils]: 145: Hoare triple {257538#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {257538#false} is VALID [2022-04-15 11:59:03,200 INFO L290 TraceCheckUtils]: 146: Hoare triple {257538#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {257538#false} is VALID [2022-04-15 11:59:03,200 INFO L290 TraceCheckUtils]: 147: Hoare triple {257538#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {257538#false} is VALID [2022-04-15 11:59:03,200 INFO L290 TraceCheckUtils]: 148: Hoare triple {257538#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {257538#false} is VALID [2022-04-15 11:59:03,200 INFO L290 TraceCheckUtils]: 149: Hoare triple {257538#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {257538#false} is VALID [2022-04-15 11:59:03,200 INFO L290 TraceCheckUtils]: 150: Hoare triple {257538#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {257538#false} is VALID [2022-04-15 11:59:03,200 INFO L290 TraceCheckUtils]: 151: Hoare triple {257538#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {257538#false} is VALID [2022-04-15 11:59:03,200 INFO L290 TraceCheckUtils]: 152: Hoare triple {257538#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {257538#false} is VALID [2022-04-15 11:59:03,200 INFO L290 TraceCheckUtils]: 153: Hoare triple {257538#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {257538#false} is VALID [2022-04-15 11:59:03,200 INFO L290 TraceCheckUtils]: 154: Hoare triple {257538#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {257538#false} is VALID [2022-04-15 11:59:03,200 INFO L290 TraceCheckUtils]: 155: Hoare triple {257538#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {257538#false} is VALID [2022-04-15 11:59:03,201 INFO L290 TraceCheckUtils]: 156: Hoare triple {257538#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {257538#false} is VALID [2022-04-15 11:59:03,201 INFO L290 TraceCheckUtils]: 157: Hoare triple {257538#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {257538#false} is VALID [2022-04-15 11:59:03,201 INFO L290 TraceCheckUtils]: 158: Hoare triple {257538#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {257538#false} is VALID [2022-04-15 11:59:03,201 INFO L290 TraceCheckUtils]: 159: Hoare triple {257538#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {257538#false} is VALID [2022-04-15 11:59:03,201 INFO L290 TraceCheckUtils]: 160: Hoare triple {257538#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {257538#false} is VALID [2022-04-15 11:59:03,201 INFO L290 TraceCheckUtils]: 161: Hoare triple {257538#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {257538#false} is VALID [2022-04-15 11:59:03,201 INFO L290 TraceCheckUtils]: 162: Hoare triple {257538#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {257538#false} is VALID [2022-04-15 11:59:03,201 INFO L290 TraceCheckUtils]: 163: Hoare triple {257538#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {257538#false} is VALID [2022-04-15 11:59:03,201 INFO L290 TraceCheckUtils]: 164: Hoare triple {257538#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {257538#false} is VALID [2022-04-15 11:59:03,201 INFO L290 TraceCheckUtils]: 165: Hoare triple {257538#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {257538#false} is VALID [2022-04-15 11:59:03,201 INFO L290 TraceCheckUtils]: 166: Hoare triple {257538#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {257538#false} is VALID [2022-04-15 11:59:03,202 INFO L290 TraceCheckUtils]: 167: Hoare triple {257538#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {257538#false} is VALID [2022-04-15 11:59:03,202 INFO L290 TraceCheckUtils]: 168: Hoare triple {257538#false} assume 8640 == #t~mem75;havoc #t~mem75; {257538#false} is VALID [2022-04-15 11:59:03,202 INFO L290 TraceCheckUtils]: 169: Hoare triple {257538#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {257538#false} is VALID [2022-04-15 11:59:03,202 INFO L290 TraceCheckUtils]: 170: Hoare triple {257538#false} assume !(4 == ~blastFlag~0); {257538#false} is VALID [2022-04-15 11:59:03,202 INFO L290 TraceCheckUtils]: 171: Hoare triple {257538#false} assume !(7 == ~blastFlag~0); {257538#false} is VALID [2022-04-15 11:59:03,202 INFO L290 TraceCheckUtils]: 172: Hoare triple {257538#false} assume !(10 == ~blastFlag~0); {257538#false} is VALID [2022-04-15 11:59:03,203 INFO L290 TraceCheckUtils]: 173: Hoare triple {257538#false} assume 13 == ~blastFlag~0; {257538#false} is VALID [2022-04-15 11:59:03,203 INFO L290 TraceCheckUtils]: 174: Hoare triple {257538#false} assume !false; {257538#false} is VALID [2022-04-15 11:59:03,203 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-15 11:59:03,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:59:03,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663510602] [2022-04-15 11:59:03,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663510602] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:59:03,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:59:03,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:59:03,205 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:59:03,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1509898184] [2022-04-15 11:59:03,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1509898184] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:59:03,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:59:03,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:59:03,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188760316] [2022-04-15 11:59:03,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:59:03,206 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (3), 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 175 [2022-04-15 11:59:03,206 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:59:03,206 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 36.25) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:59:03,331 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:59:03,331 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:59:03,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:59:03,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:59:03,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:59:03,332 INFO L87 Difference]: Start difference. First operand 2088 states and 3105 transitions. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:59:05,406 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-15 11:59:11,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:59:11,592 INFO L93 Difference]: Finished difference Result 3762 states and 5603 transitions. [2022-04-15 11:59:11,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:59:11,593 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (3), 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 175 [2022-04-15 11:59:11,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:59:11,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:59:11,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 620 transitions. [2022-04-15 11:59:11,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:59:11,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 620 transitions. [2022-04-15 11:59:11,598 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 620 transitions. [2022-04-15 11:59:12,000 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 620 edges. 620 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:59:12,234 INFO L225 Difference]: With dead ends: 3762 [2022-04-15 11:59:12,235 INFO L226 Difference]: Without dead ends: 2473 [2022-04-15 11:59:12,236 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:59:12,236 INFO L913 BasicCegarLoop]: 390 mSDtfsCounter, 140 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 12 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-04-15 11:59:12,236 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 584 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 440 Invalid, 1 Unknown, 0 Unchecked, 3.6s Time] [2022-04-15 11:59:12,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2473 states. [2022-04-15 11:59:12,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2473 to 2473. [2022-04-15 11:59:12,396 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:59:12,398 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2473 states. Second operand has 2473 states, 2468 states have (on average 1.487034035656402) internal successors, (3670), 2468 states have internal predecessors, (3670), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:59:12,400 INFO L74 IsIncluded]: Start isIncluded. First operand 2473 states. Second operand has 2473 states, 2468 states have (on average 1.487034035656402) internal successors, (3670), 2468 states have internal predecessors, (3670), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:59:12,402 INFO L87 Difference]: Start difference. First operand 2473 states. Second operand has 2473 states, 2468 states have (on average 1.487034035656402) internal successors, (3670), 2468 states have internal predecessors, (3670), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:59:12,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:59:12,557 INFO L93 Difference]: Finished difference Result 2473 states and 3674 transitions. [2022-04-15 11:59:12,557 INFO L276 IsEmpty]: Start isEmpty. Operand 2473 states and 3674 transitions. [2022-04-15 11:59:12,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:59:12,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:59:12,561 INFO L74 IsIncluded]: Start isIncluded. First operand has 2473 states, 2468 states have (on average 1.487034035656402) internal successors, (3670), 2468 states have internal predecessors, (3670), 3 states have call successors, (3), 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 2473 states. [2022-04-15 11:59:12,574 INFO L87 Difference]: Start difference. First operand has 2473 states, 2468 states have (on average 1.487034035656402) internal successors, (3670), 2468 states have internal predecessors, (3670), 3 states have call successors, (3), 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 2473 states. [2022-04-15 11:59:12,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:59:12,730 INFO L93 Difference]: Finished difference Result 2473 states and 3674 transitions. [2022-04-15 11:59:12,730 INFO L276 IsEmpty]: Start isEmpty. Operand 2473 states and 3674 transitions. [2022-04-15 11:59:12,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:59:12,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:59:12,731 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:59:12,731 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:59:12,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2473 states, 2468 states have (on average 1.487034035656402) internal successors, (3670), 2468 states have internal predecessors, (3670), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:59:12,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2473 states to 2473 states and 3674 transitions. [2022-04-15 11:59:12,995 INFO L78 Accepts]: Start accepts. Automaton has 2473 states and 3674 transitions. Word has length 175 [2022-04-15 11:59:12,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:59:12,995 INFO L478 AbstractCegarLoop]: Abstraction has 2473 states and 3674 transitions. [2022-04-15 11:59:12,996 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:59:12,996 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2473 states and 3674 transitions. [2022-04-15 11:59:19,343 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3674 edges. 3673 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:59:19,343 INFO L276 IsEmpty]: Start isEmpty. Operand 2473 states and 3674 transitions. [2022-04-15 11:59:19,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2022-04-15 11:59:19,347 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:59:19,347 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:59:19,347 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-04-15 11:59:19,347 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:59:19,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:59:19,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1233357362, now seen corresponding path program 1 times [2022-04-15 11:59:19,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:59:19,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [299189869] [2022-04-15 11:59:52,251 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:59:52,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1233357362, now seen corresponding path program 2 times [2022-04-15 11:59:52,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:59:52,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626510669] [2022-04-15 11:59:52,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:59:52,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:59:52,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:59:52,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:59:52,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:59:52,497 INFO L290 TraceCheckUtils]: 0: Hoare triple {274968#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {274962#true} is VALID [2022-04-15 11:59:52,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {274962#true} assume true; {274962#true} is VALID [2022-04-15 11:59:52,497 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {274962#true} {274962#true} #708#return; {274962#true} is VALID [2022-04-15 11:59:52,498 INFO L272 TraceCheckUtils]: 0: Hoare triple {274962#true} call ULTIMATE.init(); {274968#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:59:52,498 INFO L290 TraceCheckUtils]: 1: Hoare triple {274968#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {274962#true} is VALID [2022-04-15 11:59:52,498 INFO L290 TraceCheckUtils]: 2: Hoare triple {274962#true} assume true; {274962#true} is VALID [2022-04-15 11:59:52,498 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {274962#true} {274962#true} #708#return; {274962#true} is VALID [2022-04-15 11:59:52,498 INFO L272 TraceCheckUtils]: 4: Hoare triple {274962#true} call #t~ret161 := main(); {274962#true} is VALID [2022-04-15 11:59:52,498 INFO L290 TraceCheckUtils]: 5: Hoare triple {274962#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; {274962#true} is VALID [2022-04-15 11:59:52,498 INFO L290 TraceCheckUtils]: 6: Hoare triple {274962#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,499 INFO L272 TraceCheckUtils]: 7: Hoare triple {274962#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {274962#true} is VALID [2022-04-15 11:59:52,499 INFO L290 TraceCheckUtils]: 8: Hoare triple {274962#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); {274962#true} is VALID [2022-04-15 11:59:52,499 INFO L290 TraceCheckUtils]: 9: Hoare triple {274962#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; {274962#true} is VALID [2022-04-15 11:59:52,499 INFO L290 TraceCheckUtils]: 10: Hoare triple {274962#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; {274962#true} is VALID [2022-04-15 11:59:52,499 INFO L290 TraceCheckUtils]: 11: Hoare triple {274962#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {274962#true} is VALID [2022-04-15 11:59:52,499 INFO L290 TraceCheckUtils]: 12: Hoare triple {274962#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,499 INFO L290 TraceCheckUtils]: 13: Hoare triple {274962#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {274962#true} is VALID [2022-04-15 11:59:52,499 INFO L290 TraceCheckUtils]: 14: Hoare triple {274962#true} assume !false; {274962#true} is VALID [2022-04-15 11:59:52,499 INFO L290 TraceCheckUtils]: 15: Hoare triple {274962#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); {274962#true} is VALID [2022-04-15 11:59:52,499 INFO L290 TraceCheckUtils]: 16: Hoare triple {274962#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,499 INFO L290 TraceCheckUtils]: 17: Hoare triple {274962#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,499 INFO L290 TraceCheckUtils]: 18: Hoare triple {274962#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,499 INFO L290 TraceCheckUtils]: 19: Hoare triple {274962#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,499 INFO L290 TraceCheckUtils]: 20: Hoare triple {274962#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,499 INFO L290 TraceCheckUtils]: 21: Hoare triple {274962#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,500 INFO L290 TraceCheckUtils]: 22: Hoare triple {274962#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,500 INFO L290 TraceCheckUtils]: 23: Hoare triple {274962#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,500 INFO L290 TraceCheckUtils]: 24: Hoare triple {274962#true} assume 8464 == #t~mem55;havoc #t~mem55; {274962#true} is VALID [2022-04-15 11:59:52,500 INFO L290 TraceCheckUtils]: 25: Hoare triple {274962#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; {274962#true} is VALID [2022-04-15 11:59:52,500 INFO L290 TraceCheckUtils]: 26: Hoare triple {274962#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {274962#true} is VALID [2022-04-15 11:59:52,500 INFO L290 TraceCheckUtils]: 27: Hoare triple {274962#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); {274962#true} is VALID [2022-04-15 11:59:52,500 INFO L290 TraceCheckUtils]: 28: Hoare triple {274962#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); {274962#true} is VALID [2022-04-15 11:59:52,500 INFO L290 TraceCheckUtils]: 29: Hoare triple {274962#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {274962#true} is VALID [2022-04-15 11:59:52,500 INFO L290 TraceCheckUtils]: 30: Hoare triple {274962#true} ~skip~0 := 0; {274962#true} is VALID [2022-04-15 11:59:52,500 INFO L290 TraceCheckUtils]: 31: Hoare triple {274962#true} assume !false; {274962#true} is VALID [2022-04-15 11:59:52,500 INFO L290 TraceCheckUtils]: 32: Hoare triple {274962#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); {274962#true} is VALID [2022-04-15 11:59:52,500 INFO L290 TraceCheckUtils]: 33: Hoare triple {274962#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,500 INFO L290 TraceCheckUtils]: 34: Hoare triple {274962#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,500 INFO L290 TraceCheckUtils]: 35: Hoare triple {274962#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,500 INFO L290 TraceCheckUtils]: 36: Hoare triple {274962#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,501 INFO L290 TraceCheckUtils]: 37: Hoare triple {274962#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,501 INFO L290 TraceCheckUtils]: 38: Hoare triple {274962#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,501 INFO L290 TraceCheckUtils]: 39: Hoare triple {274962#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,501 INFO L290 TraceCheckUtils]: 40: Hoare triple {274962#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,501 INFO L290 TraceCheckUtils]: 41: Hoare triple {274962#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,501 INFO L290 TraceCheckUtils]: 42: Hoare triple {274962#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,501 INFO L290 TraceCheckUtils]: 43: Hoare triple {274962#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,501 INFO L290 TraceCheckUtils]: 44: Hoare triple {274962#true} assume 8496 == #t~mem58;havoc #t~mem58; {274962#true} is VALID [2022-04-15 11:59:52,501 INFO L290 TraceCheckUtils]: 45: Hoare triple {274962#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {274962#true} is VALID [2022-04-15 11:59:52,501 INFO L290 TraceCheckUtils]: 46: Hoare triple {274962#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {274962#true} is VALID [2022-04-15 11:59:52,501 INFO L290 TraceCheckUtils]: 47: Hoare triple {274962#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,501 INFO L290 TraceCheckUtils]: 48: Hoare triple {274962#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,501 INFO L290 TraceCheckUtils]: 49: Hoare triple {274962#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,501 INFO L290 TraceCheckUtils]: 50: Hoare triple {274962#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); {274962#true} is VALID [2022-04-15 11:59:52,502 INFO L290 TraceCheckUtils]: 51: Hoare triple {274962#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {274962#true} is VALID [2022-04-15 11:59:52,502 INFO L290 TraceCheckUtils]: 52: Hoare triple {274962#true} ~skip~0 := 0; {274962#true} is VALID [2022-04-15 11:59:52,502 INFO L290 TraceCheckUtils]: 53: Hoare triple {274962#true} assume !false; {274962#true} is VALID [2022-04-15 11:59:52,502 INFO L290 TraceCheckUtils]: 54: Hoare triple {274962#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); {274962#true} is VALID [2022-04-15 11:59:52,502 INFO L290 TraceCheckUtils]: 55: Hoare triple {274962#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,502 INFO L290 TraceCheckUtils]: 56: Hoare triple {274962#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,502 INFO L290 TraceCheckUtils]: 57: Hoare triple {274962#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,502 INFO L290 TraceCheckUtils]: 58: Hoare triple {274962#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,502 INFO L290 TraceCheckUtils]: 59: Hoare triple {274962#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,502 INFO L290 TraceCheckUtils]: 60: Hoare triple {274962#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,502 INFO L290 TraceCheckUtils]: 61: Hoare triple {274962#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,502 INFO L290 TraceCheckUtils]: 62: Hoare triple {274962#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,502 INFO L290 TraceCheckUtils]: 63: Hoare triple {274962#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,502 INFO L290 TraceCheckUtils]: 64: Hoare triple {274962#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,502 INFO L290 TraceCheckUtils]: 65: Hoare triple {274962#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,503 INFO L290 TraceCheckUtils]: 66: Hoare triple {274962#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,503 INFO L290 TraceCheckUtils]: 67: Hoare triple {274962#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,503 INFO L290 TraceCheckUtils]: 68: Hoare triple {274962#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,503 INFO L290 TraceCheckUtils]: 69: Hoare triple {274962#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,503 INFO L290 TraceCheckUtils]: 70: Hoare triple {274962#true} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,503 INFO L290 TraceCheckUtils]: 71: Hoare triple {274962#true} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,503 INFO L290 TraceCheckUtils]: 72: Hoare triple {274962#true} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,503 INFO L290 TraceCheckUtils]: 73: Hoare triple {274962#true} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,503 INFO L290 TraceCheckUtils]: 74: Hoare triple {274962#true} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,503 INFO L290 TraceCheckUtils]: 75: Hoare triple {274962#true} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,503 INFO L290 TraceCheckUtils]: 76: Hoare triple {274962#true} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,503 INFO L290 TraceCheckUtils]: 77: Hoare triple {274962#true} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,503 INFO L290 TraceCheckUtils]: 78: Hoare triple {274962#true} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,503 INFO L290 TraceCheckUtils]: 79: Hoare triple {274962#true} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,503 INFO L290 TraceCheckUtils]: 80: Hoare triple {274962#true} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,504 INFO L290 TraceCheckUtils]: 81: Hoare triple {274962#true} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,504 INFO L290 TraceCheckUtils]: 82: Hoare triple {274962#true} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,504 INFO L290 TraceCheckUtils]: 83: Hoare triple {274962#true} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,504 INFO L290 TraceCheckUtils]: 84: Hoare triple {274962#true} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,504 INFO L290 TraceCheckUtils]: 85: Hoare triple {274962#true} assume 8656 == #t~mem77;havoc #t~mem77; {274962#true} is VALID [2022-04-15 11:59:52,504 INFO L290 TraceCheckUtils]: 86: Hoare triple {274962#true} call #t~mem140.base, #t~mem140.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem141.base, #t~mem141.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem142.base, #t~mem142.offset := read~$Pointer$(#t~mem141.base, 836 + #t~mem141.offset, 4);call write~$Pointer$(#t~mem142.base, #t~mem142.offset, #t~mem140.base, 172 + #t~mem140.offset, 4);havoc #t~mem140.base, #t~mem140.offset;havoc #t~mem141.base, #t~mem141.offset;havoc #t~mem142.base, #t~mem142.offset; {274962#true} is VALID [2022-04-15 11:59:52,504 INFO L290 TraceCheckUtils]: 87: Hoare triple {274962#true} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {274962#true} is VALID [2022-04-15 11:59:52,504 INFO L290 TraceCheckUtils]: 88: Hoare triple {274962#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {274962#true} is VALID [2022-04-15 11:59:52,504 INFO L290 TraceCheckUtils]: 89: Hoare triple {274962#true} assume !(~ret~0 <= 0);call write~int(8672, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,504 INFO L290 TraceCheckUtils]: 90: Hoare triple {274962#true} assume !(0 == ~tmp___10~0); {274962#true} is VALID [2022-04-15 11:59:52,504 INFO L290 TraceCheckUtils]: 91: Hoare triple {274962#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); {274962#true} is VALID [2022-04-15 11:59:52,504 INFO L290 TraceCheckUtils]: 92: Hoare triple {274962#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {274962#true} is VALID [2022-04-15 11:59:52,504 INFO L290 TraceCheckUtils]: 93: Hoare triple {274962#true} ~skip~0 := 0; {274962#true} is VALID [2022-04-15 11:59:52,504 INFO L290 TraceCheckUtils]: 94: Hoare triple {274962#true} assume !false; {274962#true} is VALID [2022-04-15 11:59:52,504 INFO L290 TraceCheckUtils]: 95: Hoare triple {274962#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); {274962#true} is VALID [2022-04-15 11:59:52,505 INFO L290 TraceCheckUtils]: 96: Hoare triple {274962#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,505 INFO L290 TraceCheckUtils]: 97: Hoare triple {274962#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,505 INFO L290 TraceCheckUtils]: 98: Hoare triple {274962#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,505 INFO L290 TraceCheckUtils]: 99: Hoare triple {274962#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,505 INFO L290 TraceCheckUtils]: 100: Hoare triple {274962#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,505 INFO L290 TraceCheckUtils]: 101: Hoare triple {274962#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,505 INFO L290 TraceCheckUtils]: 102: Hoare triple {274962#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,505 INFO L290 TraceCheckUtils]: 103: Hoare triple {274962#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,505 INFO L290 TraceCheckUtils]: 104: Hoare triple {274962#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,505 INFO L290 TraceCheckUtils]: 105: Hoare triple {274962#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,505 INFO L290 TraceCheckUtils]: 106: Hoare triple {274962#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,505 INFO L290 TraceCheckUtils]: 107: Hoare triple {274962#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,505 INFO L290 TraceCheckUtils]: 108: Hoare triple {274962#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,505 INFO L290 TraceCheckUtils]: 109: Hoare triple {274962#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,505 INFO L290 TraceCheckUtils]: 110: Hoare triple {274962#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,506 INFO L290 TraceCheckUtils]: 111: Hoare triple {274962#true} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,506 INFO L290 TraceCheckUtils]: 112: Hoare triple {274962#true} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,506 INFO L290 TraceCheckUtils]: 113: Hoare triple {274962#true} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,506 INFO L290 TraceCheckUtils]: 114: Hoare triple {274962#true} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,506 INFO L290 TraceCheckUtils]: 115: Hoare triple {274962#true} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,506 INFO L290 TraceCheckUtils]: 116: Hoare triple {274962#true} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,506 INFO L290 TraceCheckUtils]: 117: Hoare triple {274962#true} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,506 INFO L290 TraceCheckUtils]: 118: Hoare triple {274962#true} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,506 INFO L290 TraceCheckUtils]: 119: Hoare triple {274962#true} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,506 INFO L290 TraceCheckUtils]: 120: Hoare triple {274962#true} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,506 INFO L290 TraceCheckUtils]: 121: Hoare triple {274962#true} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,506 INFO L290 TraceCheckUtils]: 122: Hoare triple {274962#true} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,506 INFO L290 TraceCheckUtils]: 123: Hoare triple {274962#true} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,506 INFO L290 TraceCheckUtils]: 124: Hoare triple {274962#true} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,507 INFO L290 TraceCheckUtils]: 125: Hoare triple {274962#true} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,507 INFO L290 TraceCheckUtils]: 126: Hoare triple {274962#true} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,507 INFO L290 TraceCheckUtils]: 127: Hoare triple {274962#true} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,507 INFO L290 TraceCheckUtils]: 128: Hoare triple {274962#true} assume 8672 == #t~mem79;havoc #t~mem79; {274962#true} is VALID [2022-04-15 11:59:52,507 INFO L290 TraceCheckUtils]: 129: Hoare triple {274962#true} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {274962#true} is VALID [2022-04-15 11:59:52,507 INFO L290 TraceCheckUtils]: 130: Hoare triple {274962#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {274962#true} is VALID [2022-04-15 11:59:52,507 INFO L290 TraceCheckUtils]: 131: Hoare triple {274962#true} 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); {274962#true} is VALID [2022-04-15 11:59:52,507 INFO L290 TraceCheckUtils]: 132: Hoare triple {274962#true} 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; {274962#true} is VALID [2022-04-15 11:59:52,507 INFO L290 TraceCheckUtils]: 133: Hoare triple {274962#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,507 INFO L290 TraceCheckUtils]: 134: Hoare triple {274962#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); {274962#true} is VALID [2022-04-15 11:59:52,507 INFO L290 TraceCheckUtils]: 135: Hoare triple {274962#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {274962#true} is VALID [2022-04-15 11:59:52,507 INFO L290 TraceCheckUtils]: 136: Hoare triple {274962#true} ~skip~0 := 0; {274962#true} is VALID [2022-04-15 11:59:52,507 INFO L290 TraceCheckUtils]: 137: Hoare triple {274962#true} assume !false; {274962#true} is VALID [2022-04-15 11:59:52,507 INFO L290 TraceCheckUtils]: 138: Hoare triple {274962#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); {274962#true} is VALID [2022-04-15 11:59:52,507 INFO L290 TraceCheckUtils]: 139: Hoare triple {274962#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,508 INFO L290 TraceCheckUtils]: 140: Hoare triple {274962#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,508 INFO L290 TraceCheckUtils]: 141: Hoare triple {274962#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,508 INFO L290 TraceCheckUtils]: 142: Hoare triple {274962#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,508 INFO L290 TraceCheckUtils]: 143: Hoare triple {274962#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,508 INFO L290 TraceCheckUtils]: 144: Hoare triple {274962#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,508 INFO L290 TraceCheckUtils]: 145: Hoare triple {274962#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,508 INFO L290 TraceCheckUtils]: 146: Hoare triple {274962#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,508 INFO L290 TraceCheckUtils]: 147: Hoare triple {274962#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,508 INFO L290 TraceCheckUtils]: 148: Hoare triple {274962#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,508 INFO L290 TraceCheckUtils]: 149: Hoare triple {274962#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,508 INFO L290 TraceCheckUtils]: 150: Hoare triple {274962#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,508 INFO L290 TraceCheckUtils]: 151: Hoare triple {274962#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,508 INFO L290 TraceCheckUtils]: 152: Hoare triple {274962#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,508 INFO L290 TraceCheckUtils]: 153: Hoare triple {274962#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,508 INFO L290 TraceCheckUtils]: 154: Hoare triple {274962#true} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,508 INFO L290 TraceCheckUtils]: 155: Hoare triple {274962#true} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,509 INFO L290 TraceCheckUtils]: 156: Hoare triple {274962#true} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,509 INFO L290 TraceCheckUtils]: 157: Hoare triple {274962#true} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,509 INFO L290 TraceCheckUtils]: 158: Hoare triple {274962#true} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,509 INFO L290 TraceCheckUtils]: 159: Hoare triple {274962#true} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,509 INFO L290 TraceCheckUtils]: 160: Hoare triple {274962#true} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,509 INFO L290 TraceCheckUtils]: 161: Hoare triple {274962#true} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,509 INFO L290 TraceCheckUtils]: 162: Hoare triple {274962#true} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,509 INFO L290 TraceCheckUtils]: 163: Hoare triple {274962#true} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,509 INFO L290 TraceCheckUtils]: 164: Hoare triple {274962#true} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,509 INFO L290 TraceCheckUtils]: 165: Hoare triple {274962#true} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,509 INFO L290 TraceCheckUtils]: 166: Hoare triple {274962#true} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-15 11:59:52,509 INFO L290 TraceCheckUtils]: 167: Hoare triple {274962#true} assume 8640 == #t~mem75;havoc #t~mem75; {274962#true} is VALID [2022-04-15 11:59:52,509 INFO L290 TraceCheckUtils]: 168: Hoare triple {274962#true} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {274962#true} is VALID [2022-04-15 11:59:52,510 INFO L290 TraceCheckUtils]: 169: Hoare triple {274962#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:59:52,510 INFO L290 TraceCheckUtils]: 170: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume !(~ret~0 <= 0);call #t~mem139 := read~int(~s.base, 92 + ~s.offset, 4); {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:59:52,510 INFO L290 TraceCheckUtils]: 171: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume 0 != #t~mem139;havoc #t~mem139;call write~int(3, ~s.base, 52 + ~s.offset, 4); {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:59:52,511 INFO L290 TraceCheckUtils]: 172: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:59:52,511 INFO L290 TraceCheckUtils]: 173: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} 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); {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:59:52,511 INFO L290 TraceCheckUtils]: 174: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:59:52,511 INFO L290 TraceCheckUtils]: 175: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} ~skip~0 := 0; {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:59:52,512 INFO L290 TraceCheckUtils]: 176: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume !false; {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:59:52,512 INFO L290 TraceCheckUtils]: 177: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} 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); {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:59:52,512 INFO L290 TraceCheckUtils]: 178: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:59:52,512 INFO L290 TraceCheckUtils]: 179: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:59:52,513 INFO L290 TraceCheckUtils]: 180: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:59:52,513 INFO L290 TraceCheckUtils]: 181: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:59:52,513 INFO L290 TraceCheckUtils]: 182: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:59:52,514 INFO L290 TraceCheckUtils]: 183: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:59:52,514 INFO L290 TraceCheckUtils]: 184: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:59:52,514 INFO L290 TraceCheckUtils]: 185: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:59:52,514 INFO L290 TraceCheckUtils]: 186: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:59:52,515 INFO L290 TraceCheckUtils]: 187: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:59:52,515 INFO L290 TraceCheckUtils]: 188: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:59:52,515 INFO L290 TraceCheckUtils]: 189: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:59:52,515 INFO L290 TraceCheckUtils]: 190: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:59:52,516 INFO L290 TraceCheckUtils]: 191: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:59:52,516 INFO L290 TraceCheckUtils]: 192: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:59:52,516 INFO L290 TraceCheckUtils]: 193: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:59:52,517 INFO L290 TraceCheckUtils]: 194: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:59:52,517 INFO L290 TraceCheckUtils]: 195: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:59:52,517 INFO L290 TraceCheckUtils]: 196: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:59:52,517 INFO L290 TraceCheckUtils]: 197: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:59:52,518 INFO L290 TraceCheckUtils]: 198: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:59:52,518 INFO L290 TraceCheckUtils]: 199: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:59:52,518 INFO L290 TraceCheckUtils]: 200: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:59:52,518 INFO L290 TraceCheckUtils]: 201: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:59:52,519 INFO L290 TraceCheckUtils]: 202: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:59:52,519 INFO L290 TraceCheckUtils]: 203: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:59:52,519 INFO L290 TraceCheckUtils]: 204: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:59:52,520 INFO L290 TraceCheckUtils]: 205: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:59:52,520 INFO L290 TraceCheckUtils]: 206: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:59:52,520 INFO L290 TraceCheckUtils]: 207: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:59:52,520 INFO L290 TraceCheckUtils]: 208: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:59:52,521 INFO L290 TraceCheckUtils]: 209: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:59:52,521 INFO L290 TraceCheckUtils]: 210: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume 8672 == #t~mem79;havoc #t~mem79; {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:59:52,521 INFO L290 TraceCheckUtils]: 211: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:59:52,521 INFO L290 TraceCheckUtils]: 212: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume !(3 == ~blastFlag~0); {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:59:52,522 INFO L290 TraceCheckUtils]: 213: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume 6 == ~blastFlag~0;~blastFlag~0 := 7; {274963#false} is VALID [2022-04-15 11:59:52,522 INFO L290 TraceCheckUtils]: 214: Hoare triple {274963#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); {274963#false} is VALID [2022-04-15 11:59:52,522 INFO L290 TraceCheckUtils]: 215: Hoare triple {274963#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; {274963#false} is VALID [2022-04-15 11:59:52,522 INFO L290 TraceCheckUtils]: 216: Hoare triple {274963#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {274963#false} is VALID [2022-04-15 11:59:52,522 INFO L290 TraceCheckUtils]: 217: Hoare triple {274963#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); {274963#false} is VALID [2022-04-15 11:59:52,522 INFO L290 TraceCheckUtils]: 218: Hoare triple {274963#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {274963#false} is VALID [2022-04-15 11:59:52,522 INFO L290 TraceCheckUtils]: 219: Hoare triple {274963#false} ~skip~0 := 0; {274963#false} is VALID [2022-04-15 11:59:52,522 INFO L290 TraceCheckUtils]: 220: Hoare triple {274963#false} assume !false; {274963#false} is VALID [2022-04-15 11:59:52,522 INFO L290 TraceCheckUtils]: 221: Hoare triple {274963#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); {274963#false} is VALID [2022-04-15 11:59:52,522 INFO L290 TraceCheckUtils]: 222: Hoare triple {274963#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {274963#false} is VALID [2022-04-15 11:59:52,522 INFO L290 TraceCheckUtils]: 223: Hoare triple {274963#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {274963#false} is VALID [2022-04-15 11:59:52,522 INFO L290 TraceCheckUtils]: 224: Hoare triple {274963#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {274963#false} is VALID [2022-04-15 11:59:52,523 INFO L290 TraceCheckUtils]: 225: Hoare triple {274963#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {274963#false} is VALID [2022-04-15 11:59:52,523 INFO L290 TraceCheckUtils]: 226: Hoare triple {274963#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {274963#false} is VALID [2022-04-15 11:59:52,523 INFO L290 TraceCheckUtils]: 227: Hoare triple {274963#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {274963#false} is VALID [2022-04-15 11:59:52,523 INFO L290 TraceCheckUtils]: 228: Hoare triple {274963#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {274963#false} is VALID [2022-04-15 11:59:52,523 INFO L290 TraceCheckUtils]: 229: Hoare triple {274963#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {274963#false} is VALID [2022-04-15 11:59:52,523 INFO L290 TraceCheckUtils]: 230: Hoare triple {274963#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {274963#false} is VALID [2022-04-15 11:59:52,523 INFO L290 TraceCheckUtils]: 231: Hoare triple {274963#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {274963#false} is VALID [2022-04-15 11:59:52,523 INFO L290 TraceCheckUtils]: 232: Hoare triple {274963#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {274963#false} is VALID [2022-04-15 11:59:52,523 INFO L290 TraceCheckUtils]: 233: Hoare triple {274963#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {274963#false} is VALID [2022-04-15 11:59:52,523 INFO L290 TraceCheckUtils]: 234: Hoare triple {274963#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {274963#false} is VALID [2022-04-15 11:59:52,523 INFO L290 TraceCheckUtils]: 235: Hoare triple {274963#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {274963#false} is VALID [2022-04-15 11:59:52,523 INFO L290 TraceCheckUtils]: 236: Hoare triple {274963#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {274963#false} is VALID [2022-04-15 11:59:52,523 INFO L290 TraceCheckUtils]: 237: Hoare triple {274963#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {274963#false} is VALID [2022-04-15 11:59:52,523 INFO L290 TraceCheckUtils]: 238: Hoare triple {274963#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {274963#false} is VALID [2022-04-15 11:59:52,523 INFO L290 TraceCheckUtils]: 239: Hoare triple {274963#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {274963#false} is VALID [2022-04-15 11:59:52,524 INFO L290 TraceCheckUtils]: 240: Hoare triple {274963#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {274963#false} is VALID [2022-04-15 11:59:52,524 INFO L290 TraceCheckUtils]: 241: Hoare triple {274963#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {274963#false} is VALID [2022-04-15 11:59:52,524 INFO L290 TraceCheckUtils]: 242: Hoare triple {274963#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {274963#false} is VALID [2022-04-15 11:59:52,524 INFO L290 TraceCheckUtils]: 243: Hoare triple {274963#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {274963#false} is VALID [2022-04-15 11:59:52,524 INFO L290 TraceCheckUtils]: 244: Hoare triple {274963#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {274963#false} is VALID [2022-04-15 11:59:52,524 INFO L290 TraceCheckUtils]: 245: Hoare triple {274963#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {274963#false} is VALID [2022-04-15 11:59:52,524 INFO L290 TraceCheckUtils]: 246: Hoare triple {274963#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {274963#false} is VALID [2022-04-15 11:59:52,524 INFO L290 TraceCheckUtils]: 247: Hoare triple {274963#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {274963#false} is VALID [2022-04-15 11:59:52,524 INFO L290 TraceCheckUtils]: 248: Hoare triple {274963#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {274963#false} is VALID [2022-04-15 11:59:52,524 INFO L290 TraceCheckUtils]: 249: Hoare triple {274963#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {274963#false} is VALID [2022-04-15 11:59:52,524 INFO L290 TraceCheckUtils]: 250: Hoare triple {274963#false} assume 8640 == #t~mem75;havoc #t~mem75; {274963#false} is VALID [2022-04-15 11:59:52,524 INFO L290 TraceCheckUtils]: 251: Hoare triple {274963#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {274963#false} is VALID [2022-04-15 11:59:52,524 INFO L290 TraceCheckUtils]: 252: Hoare triple {274963#false} assume !(4 == ~blastFlag~0); {274963#false} is VALID [2022-04-15 11:59:52,524 INFO L290 TraceCheckUtils]: 253: Hoare triple {274963#false} assume !(7 == ~blastFlag~0); {274963#false} is VALID [2022-04-15 11:59:52,524 INFO L290 TraceCheckUtils]: 254: Hoare triple {274963#false} assume !(10 == ~blastFlag~0); {274963#false} is VALID [2022-04-15 11:59:52,525 INFO L290 TraceCheckUtils]: 255: Hoare triple {274963#false} assume 13 == ~blastFlag~0; {274963#false} is VALID [2022-04-15 11:59:52,525 INFO L290 TraceCheckUtils]: 256: Hoare triple {274963#false} assume !false; {274963#false} is VALID [2022-04-15 11:59:52,525 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 307 proven. 0 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2022-04-15 11:59:52,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:59:52,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626510669] [2022-04-15 11:59:52,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626510669] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:59:52,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:59:52,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:59:52,526 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:59:52,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [299189869] [2022-04-15 11:59:52,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [299189869] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:59:52,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:59:52,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:59:52,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376380170] [2022-04-15 11:59:52,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:59:52,526 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (3), 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 257 [2022-04-15 11:59:52,526 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:59:52,526 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 39.75) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:59:52,632 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:59:52,632 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:59:52,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:59:52,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:59:52,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:59:52,633 INFO L87 Difference]: Start difference. First operand 2473 states and 3674 transitions. Second operand has 4 states, 4 states have (on average 39.75) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:59:54,693 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-15 12:00:00,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:00:00,369 INFO L93 Difference]: Finished difference Result 4571 states and 6802 transitions. [2022-04-15 12:00:00,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 12:00:00,369 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (3), 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 257 [2022-04-15 12:00:00,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:00:00,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 39.75) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:00:00,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 630 transitions. [2022-04-15 12:00:00,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 39.75) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:00:00,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 630 transitions. [2022-04-15 12:00:00,373 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 630 transitions. [2022-04-15 12:00:00,800 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 630 edges. 630 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:00:01,224 INFO L225 Difference]: With dead ends: 4571 [2022-04-15 12:00:01,224 INFO L226 Difference]: Without dead ends: 2897 [2022-04-15 12:00:01,226 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 12:00:01,226 INFO L913 BasicCegarLoop]: 200 mSDtfsCounter, 155 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 18 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:00:01,226 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [155 Valid, 385 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 263 Invalid, 1 Unknown, 0 Unchecked, 3.0s Time] [2022-04-15 12:00:01,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2897 states. [2022-04-15 12:00:02,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2897 to 2897. [2022-04-15 12:00:02,464 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:00:02,466 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2897 states. Second operand has 2897 states, 2892 states have (on average 1.4878976486860305) internal successors, (4303), 2892 states have internal predecessors, (4303), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:00:02,468 INFO L74 IsIncluded]: Start isIncluded. First operand 2897 states. Second operand has 2897 states, 2892 states have (on average 1.4878976486860305) internal successors, (4303), 2892 states have internal predecessors, (4303), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:00:02,470 INFO L87 Difference]: Start difference. First operand 2897 states. Second operand has 2897 states, 2892 states have (on average 1.4878976486860305) internal successors, (4303), 2892 states have internal predecessors, (4303), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:00:02,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:00:02,680 INFO L93 Difference]: Finished difference Result 2897 states and 4307 transitions. [2022-04-15 12:00:02,681 INFO L276 IsEmpty]: Start isEmpty. Operand 2897 states and 4307 transitions. [2022-04-15 12:00:02,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:00:02,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:00:02,684 INFO L74 IsIncluded]: Start isIncluded. First operand has 2897 states, 2892 states have (on average 1.4878976486860305) internal successors, (4303), 2892 states have internal predecessors, (4303), 3 states have call successors, (3), 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 2897 states. [2022-04-15 12:00:02,685 INFO L87 Difference]: Start difference. First operand has 2897 states, 2892 states have (on average 1.4878976486860305) internal successors, (4303), 2892 states have internal predecessors, (4303), 3 states have call successors, (3), 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 2897 states. [2022-04-15 12:00:02,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:00:02,893 INFO L93 Difference]: Finished difference Result 2897 states and 4307 transitions. [2022-04-15 12:00:02,893 INFO L276 IsEmpty]: Start isEmpty. Operand 2897 states and 4307 transitions. [2022-04-15 12:00:02,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:00:02,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:00:02,895 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:00:02,895 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:00:02,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2897 states, 2892 states have (on average 1.4878976486860305) internal successors, (4303), 2892 states have internal predecessors, (4303), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:00:03,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2897 states to 2897 states and 4307 transitions. [2022-04-15 12:00:03,256 INFO L78 Accepts]: Start accepts. Automaton has 2897 states and 4307 transitions. Word has length 257 [2022-04-15 12:00:03,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:00:03,257 INFO L478 AbstractCegarLoop]: Abstraction has 2897 states and 4307 transitions. [2022-04-15 12:00:03,257 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:00:03,257 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2897 states and 4307 transitions. [2022-04-15 12:00:12,024 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4307 edges. 4306 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 12:00:12,024 INFO L276 IsEmpty]: Start isEmpty. Operand 2897 states and 4307 transitions. [2022-04-15 12:00:12,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2022-04-15 12:00:12,028 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:00:12,028 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 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-15 12:00:12,028 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-04-15 12:00:12,029 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:00:12,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:00:12,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1515482758, now seen corresponding path program 1 times [2022-04-15 12:00:12,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:00:12,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [66081868]