/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/openssl/s3_srvr.blast.10.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 11:42:34,771 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 11:42:34,773 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 11:42:34,808 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 11:42:34,808 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 11:42:34,809 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 11:42:34,810 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 11:42:34,815 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 11:42:34,817 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 11:42:34,821 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 11:42:34,821 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 11:42:34,822 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 11:42:34,823 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 11:42:34,823 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 11:42:34,824 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 11:42:34,825 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 11:42:34,826 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 11:42:34,828 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 11:42:34,831 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 11:42:34,836 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 11:42:34,839 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 11:42:34,840 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 11:42:34,841 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 11:42:34,844 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 11:42:34,845 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 11:42:34,850 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 11:42:34,850 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 11:42:34,850 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 11:42:34,851 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 11:42:34,851 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 11:42:34,852 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 11:42:34,852 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 11:42:34,853 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 11:42:34,853 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 11:42:34,854 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 11:42:34,855 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 11:42:34,855 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 11:42:34,855 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 11:42:34,856 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 11:42:34,856 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 11:42:34,856 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 11:42:34,861 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 11:42:34,862 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:42:34,870 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 11:42:34,870 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 11:42:34,872 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 11:42:34,872 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 11:42:34,872 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 11:42:34,872 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 11:42:34,873 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 11:42:34,873 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 11:42:34,873 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 11:42:34,873 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 11:42:34,874 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 11:42:34,874 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 11:42:34,874 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 11:42:34,874 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 11:42:34,874 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 11:42:34,874 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 11:42:34,874 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 11:42:34,875 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 11:42:34,875 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 11:42:34,875 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 11:42:34,875 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 11:42:34,875 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 11:42:34,875 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 11:42:34,875 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 11:42:34,876 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 11:42:34,876 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:42:35,112 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 11:42:35,134 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 11:42:35,137 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 11:42:35,137 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 11:42:35,138 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 11:42:35,139 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_srvr.blast.10.i.cil-2.c [2022-04-15 11:42:35,206 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d8966ee0/6b571fbd88b243fe87c577e7adde2f5f/FLAGb9266afbe [2022-04-15 11:42:35,718 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 11:42:35,719 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.10.i.cil-2.c [2022-04-15 11:42:35,742 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d8966ee0/6b571fbd88b243fe87c577e7adde2f5f/FLAGb9266afbe [2022-04-15 11:42:36,171 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d8966ee0/6b571fbd88b243fe87c577e7adde2f5f [2022-04-15 11:42:36,174 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 11:42:36,175 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 11:42:36,178 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 11:42:36,178 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 11:42:36,182 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 11:42:36,184 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 11:42:36" (1/1) ... [2022-04-15 11:42:36,193 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bc1fdba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:42:36, skipping insertion in model container [2022-04-15 11:42:36,194 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 11:42:36" (1/1) ... [2022-04-15 11:42:36,200 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 11:42:36,309 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 11:42:36,682 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.10.i.cil-2.c[73311,73324] [2022-04-15 11:42:36,690 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 11:42:36,700 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 11:42:36,798 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.10.i.cil-2.c[73311,73324] [2022-04-15 11:42:36,812 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 11:42:36,828 INFO L208 MainTranslator]: Completed translation [2022-04-15 11:42:36,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:42:36 WrapperNode [2022-04-15 11:42:36,829 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 11:42:36,829 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 11:42:36,830 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 11:42:36,830 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 11:42:36,838 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:42:36" (1/1) ... [2022-04-15 11:42:36,839 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:42:36" (1/1) ... [2022-04-15 11:42:36,872 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:42:36" (1/1) ... [2022-04-15 11:42:36,872 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:42:36" (1/1) ... [2022-04-15 11:42:36,957 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:42:36" (1/1) ... [2022-04-15 11:42:36,979 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:42:36" (1/1) ... [2022-04-15 11:42:36,981 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:42:36" (1/1) ... [2022-04-15 11:42:36,986 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 11:42:36,995 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 11:42:36,995 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 11:42:36,995 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 11:42:36,996 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:42:36" (1/1) ... [2022-04-15 11:42:37,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 11:42:37,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:42:37,020 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:42:37,046 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:42:37,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 11:42:37,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 11:42:37,064 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 11:42:37,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2022-04-15 11:42:37,064 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2022-04-15 11:42:37,064 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 11:42:37,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2022-04-15 11:42:37,064 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-15 11:42:37,065 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-15 11:42:37,065 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-15 11:42:37,065 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 11:42:37,065 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 11:42:37,065 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 11:42:37,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 11:42:37,065 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-15 11:42:37,065 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-15 11:42:37,066 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 11:42:37,066 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-15 11:42:37,066 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-15 11:42:37,066 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-15 11:42:37,066 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2022-04-15 11:42:37,066 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-15 11:42:37,066 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2022-04-15 11:42:37,066 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2022-04-15 11:42:37,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-15 11:42:37,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-15 11:42:37,067 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 11:42:37,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-15 11:42:37,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 11:42:37,067 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-15 11:42:37,067 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 11:42:37,067 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-15 11:42:37,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-15 11:42:37,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 11:42:37,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 11:42:37,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 11:42:37,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-15 11:42:37,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-15 11:42:37,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-15 11:42:37,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-15 11:42:37,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 11:42:37,208 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 11:42:37,209 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 11:42:38,051 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:42:38,678 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2022-04-15 11:42:38,679 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2022-04-15 11:42:38,692 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 11:42:38,702 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 11:42:38,702 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 11:42:38,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 11:42:38 BoogieIcfgContainer [2022-04-15 11:42:38,705 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 11:42:38,707 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 11:42:38,707 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 11:42:38,710 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 11:42:38,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 11:42:36" (1/3) ... [2022-04-15 11:42:38,711 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d55c85c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 11:42:38, skipping insertion in model container [2022-04-15 11:42:38,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:42:36" (2/3) ... [2022-04-15 11:42:38,712 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d55c85c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 11:42:38, skipping insertion in model container [2022-04-15 11:42:38,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 11:42:38" (3/3) ... [2022-04-15 11:42:38,713 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.10.i.cil-2.c [2022-04-15 11:42:38,717 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 11:42:38,717 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 11:42:38,753 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 11:42:38,758 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:42:38,758 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 11:42:38,778 INFO L276 IsEmpty]: Start isEmpty. Operand has 155 states, 147 states have (on average 1.7006802721088434) internal successors, (250), 148 states have internal predecessors, (250), 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:42:38,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-15 11:42:38,787 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:42:38,788 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] [2022-04-15 11:42:38,788 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:42:38,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:42:38,792 INFO L85 PathProgramCache]: Analyzing trace with hash 105535570, now seen corresponding path program 1 times [2022-04-15 11:42:38,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:42:38,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [584848599] [2022-04-15 11:42:38,808 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:42:38,808 INFO L85 PathProgramCache]: Analyzing trace with hash 105535570, now seen corresponding path program 2 times [2022-04-15 11:42:38,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:42:38,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107855682] [2022-04-15 11:42:38,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:42:38,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:42:39,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:42:39,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:42:39,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:42:39,324 INFO L290 TraceCheckUtils]: 0: Hoare triple {165#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {158#true} is VALID [2022-04-15 11:42:39,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {158#true} assume true; {158#true} is VALID [2022-04-15 11:42:39,325 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {158#true} {158#true} #673#return; {158#true} is VALID [2022-04-15 11:42:39,327 INFO L272 TraceCheckUtils]: 0: Hoare triple {158#true} call ULTIMATE.init(); {165#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:42:39,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {165#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {158#true} is VALID [2022-04-15 11:42:39,327 INFO L290 TraceCheckUtils]: 2: Hoare triple {158#true} assume true; {158#true} is VALID [2022-04-15 11:42:39,327 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {158#true} {158#true} #673#return; {158#true} is VALID [2022-04-15 11:42:39,328 INFO L272 TraceCheckUtils]: 4: Hoare triple {158#true} call #t~ret161 := main(); {158#true} is VALID [2022-04-15 11:42:39,328 INFO L290 TraceCheckUtils]: 5: Hoare triple {158#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {158#true} is VALID [2022-04-15 11:42:39,328 INFO L290 TraceCheckUtils]: 6: Hoare triple {158#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {158#true} is VALID [2022-04-15 11:42:39,329 INFO L272 TraceCheckUtils]: 7: Hoare triple {158#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {158#true} is VALID [2022-04-15 11:42:39,332 INFO L290 TraceCheckUtils]: 8: Hoare triple {158#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); {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:39,332 INFO L290 TraceCheckUtils]: 9: Hoare triple {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:39,333 INFO L290 TraceCheckUtils]: 10: Hoare triple {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:39,334 INFO L290 TraceCheckUtils]: 11: Hoare triple {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:39,335 INFO L290 TraceCheckUtils]: 12: Hoare triple {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:39,335 INFO L290 TraceCheckUtils]: 13: Hoare triple {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:39,336 INFO L290 TraceCheckUtils]: 14: Hoare triple {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:39,337 INFO L290 TraceCheckUtils]: 15: Hoare triple {163#(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); {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:39,337 INFO L290 TraceCheckUtils]: 16: Hoare triple {163#(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); {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:39,338 INFO L290 TraceCheckUtils]: 17: Hoare triple {163#(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); {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:39,338 INFO L290 TraceCheckUtils]: 18: Hoare triple {163#(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); {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:39,339 INFO L290 TraceCheckUtils]: 19: Hoare triple {163#(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); {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:39,340 INFO L290 TraceCheckUtils]: 20: Hoare triple {163#(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); {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:39,340 INFO L290 TraceCheckUtils]: 21: Hoare triple {163#(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); {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:39,341 INFO L290 TraceCheckUtils]: 22: Hoare triple {163#(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); {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:39,341 INFO L290 TraceCheckUtils]: 23: Hoare triple {163#(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); {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:39,342 INFO L290 TraceCheckUtils]: 24: Hoare triple {163#(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); {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:39,343 INFO L290 TraceCheckUtils]: 25: Hoare triple {163#(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); {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:39,343 INFO L290 TraceCheckUtils]: 26: Hoare triple {163#(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); {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:39,344 INFO L290 TraceCheckUtils]: 27: Hoare triple {163#(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); {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:39,345 INFO L290 TraceCheckUtils]: 28: Hoare triple {163#(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); {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:39,345 INFO L290 TraceCheckUtils]: 29: Hoare triple {163#(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); {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:39,346 INFO L290 TraceCheckUtils]: 30: Hoare triple {163#(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); {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:39,346 INFO L290 TraceCheckUtils]: 31: Hoare triple {163#(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); {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:39,347 INFO L290 TraceCheckUtils]: 32: Hoare triple {163#(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); {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:39,348 INFO L290 TraceCheckUtils]: 33: Hoare triple {163#(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); {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:39,348 INFO L290 TraceCheckUtils]: 34: Hoare triple {163#(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); {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:39,349 INFO L290 TraceCheckUtils]: 35: Hoare triple {163#(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); {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:39,350 INFO L290 TraceCheckUtils]: 36: Hoare triple {163#(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); {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:39,350 INFO L290 TraceCheckUtils]: 37: Hoare triple {163#(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); {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:39,351 INFO L290 TraceCheckUtils]: 38: Hoare triple {163#(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); {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:39,351 INFO L290 TraceCheckUtils]: 39: Hoare triple {163#(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); {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:39,352 INFO L290 TraceCheckUtils]: 40: Hoare triple {163#(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); {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:39,353 INFO L290 TraceCheckUtils]: 41: Hoare triple {163#(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); {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:39,353 INFO L290 TraceCheckUtils]: 42: Hoare triple {163#(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); {163#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:39,354 INFO L290 TraceCheckUtils]: 43: Hoare triple {163#(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); {164#(not (= |ssl3_accept_#t~mem75| 8640))} is VALID [2022-04-15 11:42:39,354 INFO L290 TraceCheckUtils]: 44: Hoare triple {164#(not (= |ssl3_accept_#t~mem75| 8640))} assume 8640 == #t~mem75;havoc #t~mem75; {159#false} is VALID [2022-04-15 11:42:39,355 INFO L290 TraceCheckUtils]: 45: Hoare triple {159#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {159#false} is VALID [2022-04-15 11:42:39,355 INFO L290 TraceCheckUtils]: 46: Hoare triple {159#false} assume !(4 == ~blastFlag~0); {159#false} is VALID [2022-04-15 11:42:39,355 INFO L290 TraceCheckUtils]: 47: Hoare triple {159#false} assume !false; {159#false} is VALID [2022-04-15 11:42:39,356 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:42:39,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:42:39,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107855682] [2022-04-15 11:42:39,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107855682] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:42:39,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:42:39,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:42:39,360 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:42:39,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [584848599] [2022-04-15 11:42:39,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [584848599] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:42:39,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:42:39,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:42:39,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064470344] [2022-04-15 11:42:39,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:42:39,366 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-04-15 11:42:39,368 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:42:39,370 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:39,423 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:42:39,424 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:42:39,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:42:39,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:42:39,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:42:39,445 INFO L87 Difference]: Start difference. First operand has 155 states, 147 states have (on average 1.7006802721088434) internal successors, (250), 148 states have internal predecessors, (250), 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 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:43,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:42:43,671 INFO L93 Difference]: Finished difference Result 421 states and 708 transitions. [2022-04-15 11:42:43,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:42:43,672 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-04-15 11:42:43,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:42:43,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:43,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 708 transitions. [2022-04-15 11:42:43,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:43,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 708 transitions. [2022-04-15 11:42:43,698 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 708 transitions. [2022-04-15 11:42:44,265 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 708 edges. 708 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:42:44,284 INFO L225 Difference]: With dead ends: 421 [2022-04-15 11:42:44,284 INFO L226 Difference]: Without dead ends: 255 [2022-04-15 11:42:44,287 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:42:44,290 INFO L913 BasicCegarLoop]: 151 mSDtfsCounter, 148 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-04-15 11:42:44,291 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 443 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-04-15 11:42:44,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-04-15 11:42:44,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 179. [2022-04-15 11:42:44,331 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:42:44,333 INFO L82 GeneralOperation]: Start isEquivalent. First operand 255 states. Second operand has 179 states, 174 states have (on average 1.5977011494252873) internal successors, (278), 174 states have internal predecessors, (278), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:44,334 INFO L74 IsIncluded]: Start isIncluded. First operand 255 states. Second operand has 179 states, 174 states have (on average 1.5977011494252873) internal successors, (278), 174 states have internal predecessors, (278), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:44,336 INFO L87 Difference]: Start difference. First operand 255 states. Second operand has 179 states, 174 states have (on average 1.5977011494252873) internal successors, (278), 174 states have internal predecessors, (278), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:44,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:42:44,348 INFO L93 Difference]: Finished difference Result 255 states and 387 transitions. [2022-04-15 11:42:44,348 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 387 transitions. [2022-04-15 11:42:44,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:42:44,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:42:44,351 INFO L74 IsIncluded]: Start isIncluded. First operand has 179 states, 174 states have (on average 1.5977011494252873) internal successors, (278), 174 states have internal predecessors, (278), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 255 states. [2022-04-15 11:42:44,352 INFO L87 Difference]: Start difference. First operand has 179 states, 174 states have (on average 1.5977011494252873) internal successors, (278), 174 states have internal predecessors, (278), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 255 states. [2022-04-15 11:42:44,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:42:44,363 INFO L93 Difference]: Finished difference Result 255 states and 387 transitions. [2022-04-15 11:42:44,364 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 387 transitions. [2022-04-15 11:42:44,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:42:44,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:42:44,365 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:42:44,365 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:42:44,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 174 states have (on average 1.5977011494252873) internal successors, (278), 174 states have internal predecessors, (278), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:44,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 282 transitions. [2022-04-15 11:42:44,374 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 282 transitions. Word has length 48 [2022-04-15 11:42:44,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:42:44,374 INFO L478 AbstractCegarLoop]: Abstraction has 179 states and 282 transitions. [2022-04-15 11:42:44,375 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:44,375 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 179 states and 282 transitions. [2022-04-15 11:42:44,597 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 282 edges. 282 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:42:44,599 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 282 transitions. [2022-04-15 11:42:44,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-15 11:42:44,600 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:42:44,601 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:42:44,601 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 11:42:44,601 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:42:44,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:42:44,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1029867406, now seen corresponding path program 1 times [2022-04-15 11:42:44,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:42:44,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1859873255] [2022-04-15 11:42:44,603 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:42:44,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1029867406, now seen corresponding path program 2 times [2022-04-15 11:42:44,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:42:44,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234925072] [2022-04-15 11:42:44,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:42:44,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:42:44,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:42:44,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:42:44,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:42:44,844 INFO L290 TraceCheckUtils]: 0: Hoare triple {1887#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {1880#true} is VALID [2022-04-15 11:42:44,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {1880#true} assume true; {1880#true} is VALID [2022-04-15 11:42:44,844 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1880#true} {1880#true} #673#return; {1880#true} is VALID [2022-04-15 11:42:44,846 INFO L272 TraceCheckUtils]: 0: Hoare triple {1880#true} call ULTIMATE.init(); {1887#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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:42:44,846 INFO L290 TraceCheckUtils]: 1: Hoare triple {1887#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {1880#true} is VALID [2022-04-15 11:42:44,846 INFO L290 TraceCheckUtils]: 2: Hoare triple {1880#true} assume true; {1880#true} is VALID [2022-04-15 11:42:44,846 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1880#true} {1880#true} #673#return; {1880#true} is VALID [2022-04-15 11:42:44,847 INFO L272 TraceCheckUtils]: 4: Hoare triple {1880#true} call #t~ret161 := main(); {1880#true} is VALID [2022-04-15 11:42:44,847 INFO L290 TraceCheckUtils]: 5: Hoare triple {1880#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; {1880#true} is VALID [2022-04-15 11:42:44,847 INFO L290 TraceCheckUtils]: 6: Hoare triple {1880#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {1880#true} is VALID [2022-04-15 11:42:44,847 INFO L272 TraceCheckUtils]: 7: Hoare triple {1880#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {1880#true} is VALID [2022-04-15 11:42:44,849 INFO L290 TraceCheckUtils]: 8: Hoare triple {1880#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); {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:44,850 INFO L290 TraceCheckUtils]: 9: Hoare triple {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:44,851 INFO L290 TraceCheckUtils]: 10: Hoare triple {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:44,851 INFO L290 TraceCheckUtils]: 11: Hoare triple {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:44,852 INFO L290 TraceCheckUtils]: 12: Hoare triple {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:44,852 INFO L290 TraceCheckUtils]: 13: Hoare triple {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:44,853 INFO L290 TraceCheckUtils]: 14: Hoare triple {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:44,853 INFO L290 TraceCheckUtils]: 15: Hoare triple {1885#(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); {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:44,854 INFO L290 TraceCheckUtils]: 16: Hoare triple {1885#(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); {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:44,854 INFO L290 TraceCheckUtils]: 17: Hoare triple {1885#(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); {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:44,855 INFO L290 TraceCheckUtils]: 18: Hoare triple {1885#(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); {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:44,855 INFO L290 TraceCheckUtils]: 19: Hoare triple {1885#(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); {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:44,856 INFO L290 TraceCheckUtils]: 20: Hoare triple {1885#(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); {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:44,868 INFO L290 TraceCheckUtils]: 21: Hoare triple {1885#(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); {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:44,868 INFO L290 TraceCheckUtils]: 22: Hoare triple {1885#(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); {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:44,869 INFO L290 TraceCheckUtils]: 23: Hoare triple {1885#(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); {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:44,869 INFO L290 TraceCheckUtils]: 24: Hoare triple {1885#(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); {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:44,870 INFO L290 TraceCheckUtils]: 25: Hoare triple {1885#(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); {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:44,870 INFO L290 TraceCheckUtils]: 26: Hoare triple {1885#(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); {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:44,871 INFO L290 TraceCheckUtils]: 27: Hoare triple {1885#(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); {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:44,871 INFO L290 TraceCheckUtils]: 28: Hoare triple {1885#(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); {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:44,872 INFO L290 TraceCheckUtils]: 29: Hoare triple {1885#(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); {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:44,872 INFO L290 TraceCheckUtils]: 30: Hoare triple {1885#(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); {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:44,873 INFO L290 TraceCheckUtils]: 31: Hoare triple {1885#(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); {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:44,873 INFO L290 TraceCheckUtils]: 32: Hoare triple {1885#(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); {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:44,874 INFO L290 TraceCheckUtils]: 33: Hoare triple {1885#(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); {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:44,874 INFO L290 TraceCheckUtils]: 34: Hoare triple {1885#(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); {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:44,875 INFO L290 TraceCheckUtils]: 35: Hoare triple {1885#(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); {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:44,875 INFO L290 TraceCheckUtils]: 36: Hoare triple {1885#(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); {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:44,876 INFO L290 TraceCheckUtils]: 37: Hoare triple {1885#(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); {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:44,876 INFO L290 TraceCheckUtils]: 38: Hoare triple {1885#(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); {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:44,877 INFO L290 TraceCheckUtils]: 39: Hoare triple {1885#(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); {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:44,877 INFO L290 TraceCheckUtils]: 40: Hoare triple {1885#(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); {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:44,878 INFO L290 TraceCheckUtils]: 41: Hoare triple {1885#(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); {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:44,879 INFO L290 TraceCheckUtils]: 42: Hoare triple {1885#(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); {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:44,880 INFO L290 TraceCheckUtils]: 43: Hoare triple {1885#(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); {1885#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:44,882 INFO L290 TraceCheckUtils]: 44: Hoare triple {1885#(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); {1886#(not (= |ssl3_accept_#t~mem76| 8641))} is VALID [2022-04-15 11:42:44,882 INFO L290 TraceCheckUtils]: 45: Hoare triple {1886#(not (= |ssl3_accept_#t~mem76| 8641))} assume 8641 == #t~mem76;havoc #t~mem76; {1881#false} is VALID [2022-04-15 11:42:44,882 INFO L290 TraceCheckUtils]: 46: Hoare triple {1881#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {1881#false} is VALID [2022-04-15 11:42:44,883 INFO L290 TraceCheckUtils]: 47: Hoare triple {1881#false} assume !(4 == ~blastFlag~0); {1881#false} is VALID [2022-04-15 11:42:44,883 INFO L290 TraceCheckUtils]: 48: Hoare triple {1881#false} assume !false; {1881#false} is VALID [2022-04-15 11:42:44,883 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:42:44,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:42:44,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234925072] [2022-04-15 11:42:44,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234925072] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:42:44,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:42:44,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:42:44,884 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:42:44,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1859873255] [2022-04-15 11:42:44,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1859873255] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:42:44,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:42:44,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:42:44,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150181559] [2022-04-15 11:42:44,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:42:44,886 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-15 11:42:44,886 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:42:44,887 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:44,930 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:42:44,930 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:42:44,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:42:44,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:42:44,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:42:44,931 INFO L87 Difference]: Start difference. First operand 179 states and 282 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:46,954 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:42:48,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:42:48,423 INFO L93 Difference]: Finished difference Result 458 states and 723 transitions. [2022-04-15 11:42:48,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:42:48,424 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-15 11:42:48,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:42:48,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:48,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 577 transitions. [2022-04-15 11:42:48,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:48,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 577 transitions. [2022-04-15 11:42:48,435 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 577 transitions. [2022-04-15 11:42:48,918 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:42:48,935 INFO L225 Difference]: With dead ends: 458 [2022-04-15 11:42:48,935 INFO L226 Difference]: Without dead ends: 294 [2022-04-15 11:42:48,936 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:42:48,937 INFO L913 BasicCegarLoop]: 119 mSDtfsCounter, 115 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 62 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-15 11:42:48,938 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 340 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 475 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2022-04-15 11:42:48,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-04-15 11:42:48,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 219. [2022-04-15 11:42:48,955 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:42:48,956 INFO L82 GeneralOperation]: Start isEquivalent. First operand 294 states. Second operand has 219 states, 214 states have (on average 1.644859813084112) internal successors, (352), 214 states have internal predecessors, (352), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:48,957 INFO L74 IsIncluded]: Start isIncluded. First operand 294 states. Second operand has 219 states, 214 states have (on average 1.644859813084112) internal successors, (352), 214 states have internal predecessors, (352), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:48,957 INFO L87 Difference]: Start difference. First operand 294 states. Second operand has 219 states, 214 states have (on average 1.644859813084112) internal successors, (352), 214 states have internal predecessors, (352), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:48,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:42:48,975 INFO L93 Difference]: Finished difference Result 294 states and 459 transitions. [2022-04-15 11:42:48,975 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 459 transitions. [2022-04-15 11:42:48,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:42:48,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:42:48,977 INFO L74 IsIncluded]: Start isIncluded. First operand has 219 states, 214 states have (on average 1.644859813084112) internal successors, (352), 214 states have internal predecessors, (352), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 294 states. [2022-04-15 11:42:48,978 INFO L87 Difference]: Start difference. First operand has 219 states, 214 states have (on average 1.644859813084112) internal successors, (352), 214 states have internal predecessors, (352), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 294 states. [2022-04-15 11:42:48,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:42:48,993 INFO L93 Difference]: Finished difference Result 294 states and 459 transitions. [2022-04-15 11:42:48,993 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 459 transitions. [2022-04-15 11:42:48,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:42:48,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:42:48,994 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:42:48,994 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:42:48,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 214 states have (on average 1.644859813084112) internal successors, (352), 214 states have internal predecessors, (352), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:49,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 356 transitions. [2022-04-15 11:42:49,002 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 356 transitions. Word has length 49 [2022-04-15 11:42:49,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:42:49,003 INFO L478 AbstractCegarLoop]: Abstraction has 219 states and 356 transitions. [2022-04-15 11:42:49,003 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:49,003 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 219 states and 356 transitions. [2022-04-15 11:42:49,288 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 356 edges. 356 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:42:49,289 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 356 transitions. [2022-04-15 11:42:49,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-15 11:42:49,291 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:42:49,292 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:42:49,292 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 11:42:49,292 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:42:49,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:42:49,293 INFO L85 PathProgramCache]: Analyzing trace with hash -556118041, now seen corresponding path program 1 times [2022-04-15 11:42:49,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:42:49,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1877195328] [2022-04-15 11:42:49,342 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:42:49,342 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:42:49,342 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:42:49,342 INFO L85 PathProgramCache]: Analyzing trace with hash -556118041, now seen corresponding path program 2 times [2022-04-15 11:42:49,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:42:49,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774893161] [2022-04-15 11:42:49,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:42:49,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:42:49,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:42:49,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:42:49,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:42:49,520 INFO L290 TraceCheckUtils]: 0: Hoare triple {3841#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {3834#true} is VALID [2022-04-15 11:42:49,521 INFO L290 TraceCheckUtils]: 1: Hoare triple {3834#true} assume true; {3834#true} is VALID [2022-04-15 11:42:49,521 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3834#true} {3834#true} #673#return; {3834#true} is VALID [2022-04-15 11:42:49,524 INFO L272 TraceCheckUtils]: 0: Hoare triple {3834#true} call ULTIMATE.init(); {3841#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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:42:49,524 INFO L290 TraceCheckUtils]: 1: Hoare triple {3841#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {3834#true} is VALID [2022-04-15 11:42:49,525 INFO L290 TraceCheckUtils]: 2: Hoare triple {3834#true} assume true; {3834#true} is VALID [2022-04-15 11:42:49,525 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3834#true} {3834#true} #673#return; {3834#true} is VALID [2022-04-15 11:42:49,525 INFO L272 TraceCheckUtils]: 4: Hoare triple {3834#true} call #t~ret161 := main(); {3834#true} is VALID [2022-04-15 11:42:49,525 INFO L290 TraceCheckUtils]: 5: Hoare triple {3834#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; {3834#true} is VALID [2022-04-15 11:42:49,525 INFO L290 TraceCheckUtils]: 6: Hoare triple {3834#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {3834#true} is VALID [2022-04-15 11:42:49,526 INFO L272 TraceCheckUtils]: 7: Hoare triple {3834#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {3834#true} is VALID [2022-04-15 11:42:49,529 INFO L290 TraceCheckUtils]: 8: Hoare triple {3834#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); {3839#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:42:49,530 INFO L290 TraceCheckUtils]: 9: Hoare triple {3839#(= 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; {3839#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:42:49,531 INFO L290 TraceCheckUtils]: 10: Hoare triple {3839#(= 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; {3839#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:42:49,531 INFO L290 TraceCheckUtils]: 11: Hoare triple {3839#(= 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)))); {3839#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:42:49,532 INFO L290 TraceCheckUtils]: 12: Hoare triple {3839#(= 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); {3839#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:42:49,532 INFO L290 TraceCheckUtils]: 13: Hoare triple {3839#(= 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; {3839#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:42:49,533 INFO L290 TraceCheckUtils]: 14: Hoare triple {3839#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {3839#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:42:49,533 INFO L290 TraceCheckUtils]: 15: Hoare triple {3839#(= 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); {3839#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:42:49,534 INFO L290 TraceCheckUtils]: 16: Hoare triple {3839#(= 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); {3839#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:42:49,535 INFO L290 TraceCheckUtils]: 17: Hoare triple {3839#(= 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); {3839#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:42:49,535 INFO L290 TraceCheckUtils]: 18: Hoare triple {3839#(= 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); {3839#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:42:49,536 INFO L290 TraceCheckUtils]: 19: Hoare triple {3839#(= 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); {3839#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:42:49,536 INFO L290 TraceCheckUtils]: 20: Hoare triple {3839#(= 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); {3839#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:42:49,537 INFO L290 TraceCheckUtils]: 21: Hoare triple {3839#(= 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); {3839#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:42:49,537 INFO L290 TraceCheckUtils]: 22: Hoare triple {3839#(= 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); {3839#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:42:49,538 INFO L290 TraceCheckUtils]: 23: Hoare triple {3839#(= 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); {3840#(= 8464 |ssl3_accept_#t~mem55|)} is VALID [2022-04-15 11:42:49,538 INFO L290 TraceCheckUtils]: 24: Hoare triple {3840#(= 8464 |ssl3_accept_#t~mem55|)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-15 11:42:49,538 INFO L290 TraceCheckUtils]: 25: Hoare triple {3835#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-15 11:42:49,538 INFO L290 TraceCheckUtils]: 26: Hoare triple {3835#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-15 11:42:49,538 INFO L290 TraceCheckUtils]: 27: Hoare triple {3835#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-15 11:42:49,539 INFO L290 TraceCheckUtils]: 28: Hoare triple {3835#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-15 11:42:49,539 INFO L290 TraceCheckUtils]: 29: Hoare triple {3835#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-15 11:42:49,560 INFO L290 TraceCheckUtils]: 30: Hoare triple {3835#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-15 11:42:49,561 INFO L290 TraceCheckUtils]: 31: Hoare triple {3835#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-15 11:42:49,561 INFO L290 TraceCheckUtils]: 32: Hoare triple {3835#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-15 11:42:49,561 INFO L290 TraceCheckUtils]: 33: Hoare triple {3835#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-15 11:42:49,561 INFO L290 TraceCheckUtils]: 34: Hoare triple {3835#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-15 11:42:49,561 INFO L290 TraceCheckUtils]: 35: Hoare triple {3835#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-15 11:42:49,562 INFO L290 TraceCheckUtils]: 36: Hoare triple {3835#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-15 11:42:49,562 INFO L290 TraceCheckUtils]: 37: Hoare triple {3835#false} assume 8448 == #t~mem68;havoc #t~mem68; {3835#false} is VALID [2022-04-15 11:42:49,562 INFO L290 TraceCheckUtils]: 38: Hoare triple {3835#false} assume !(~num1~0 > 0); {3835#false} is VALID [2022-04-15 11:42:49,562 INFO L290 TraceCheckUtils]: 39: Hoare triple {3835#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; {3835#false} is VALID [2022-04-15 11:42:49,562 INFO L290 TraceCheckUtils]: 40: Hoare triple {3835#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); {3835#false} is VALID [2022-04-15 11:42:49,562 INFO L290 TraceCheckUtils]: 41: Hoare triple {3835#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {3835#false} is VALID [2022-04-15 11:42:49,563 INFO L290 TraceCheckUtils]: 42: Hoare triple {3835#false} ~skip~0 := 0; {3835#false} is VALID [2022-04-15 11:42:49,563 INFO L290 TraceCheckUtils]: 43: Hoare triple {3835#false} assume !false; {3835#false} is VALID [2022-04-15 11:42:49,563 INFO L290 TraceCheckUtils]: 44: Hoare triple {3835#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); {3835#false} is VALID [2022-04-15 11:42:49,563 INFO L290 TraceCheckUtils]: 45: Hoare triple {3835#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-15 11:42:49,563 INFO L290 TraceCheckUtils]: 46: Hoare triple {3835#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-15 11:42:49,564 INFO L290 TraceCheckUtils]: 47: Hoare triple {3835#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-15 11:42:49,564 INFO L290 TraceCheckUtils]: 48: Hoare triple {3835#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-15 11:42:49,564 INFO L290 TraceCheckUtils]: 49: Hoare triple {3835#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-15 11:42:49,564 INFO L290 TraceCheckUtils]: 50: Hoare triple {3835#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-15 11:42:49,564 INFO L290 TraceCheckUtils]: 51: Hoare triple {3835#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-15 11:42:49,564 INFO L290 TraceCheckUtils]: 52: Hoare triple {3835#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-15 11:42:49,564 INFO L290 TraceCheckUtils]: 53: Hoare triple {3835#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-15 11:42:49,565 INFO L290 TraceCheckUtils]: 54: Hoare triple {3835#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-15 11:42:49,565 INFO L290 TraceCheckUtils]: 55: Hoare triple {3835#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-15 11:42:49,565 INFO L290 TraceCheckUtils]: 56: Hoare triple {3835#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-15 11:42:49,565 INFO L290 TraceCheckUtils]: 57: Hoare triple {3835#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-15 11:42:49,565 INFO L290 TraceCheckUtils]: 58: Hoare triple {3835#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-15 11:42:49,565 INFO L290 TraceCheckUtils]: 59: Hoare triple {3835#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-15 11:42:49,566 INFO L290 TraceCheckUtils]: 60: Hoare triple {3835#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-15 11:42:49,566 INFO L290 TraceCheckUtils]: 61: Hoare triple {3835#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-15 11:42:49,566 INFO L290 TraceCheckUtils]: 62: Hoare triple {3835#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-15 11:42:49,566 INFO L290 TraceCheckUtils]: 63: Hoare triple {3835#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-15 11:42:49,566 INFO L290 TraceCheckUtils]: 64: Hoare triple {3835#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-15 11:42:49,566 INFO L290 TraceCheckUtils]: 65: Hoare triple {3835#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-15 11:42:49,566 INFO L290 TraceCheckUtils]: 66: Hoare triple {3835#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-15 11:42:49,567 INFO L290 TraceCheckUtils]: 67: Hoare triple {3835#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-15 11:42:49,567 INFO L290 TraceCheckUtils]: 68: Hoare triple {3835#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-15 11:42:49,567 INFO L290 TraceCheckUtils]: 69: Hoare triple {3835#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-15 11:42:49,567 INFO L290 TraceCheckUtils]: 70: Hoare triple {3835#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-15 11:42:49,567 INFO L290 TraceCheckUtils]: 71: Hoare triple {3835#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-15 11:42:49,567 INFO L290 TraceCheckUtils]: 72: Hoare triple {3835#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {3835#false} is VALID [2022-04-15 11:42:49,568 INFO L290 TraceCheckUtils]: 73: Hoare triple {3835#false} assume 8640 == #t~mem75;havoc #t~mem75; {3835#false} is VALID [2022-04-15 11:42:49,568 INFO L290 TraceCheckUtils]: 74: Hoare triple {3835#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {3835#false} is VALID [2022-04-15 11:42:49,568 INFO L290 TraceCheckUtils]: 75: Hoare triple {3835#false} assume !(4 == ~blastFlag~0); {3835#false} is VALID [2022-04-15 11:42:49,568 INFO L290 TraceCheckUtils]: 76: Hoare triple {3835#false} assume !false; {3835#false} is VALID [2022-04-15 11:42:49,569 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-15 11:42:49,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:42:49,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774893161] [2022-04-15 11:42:49,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774893161] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:42:49,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:42:49,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:42:49,570 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:42:49,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1877195328] [2022-04-15 11:42:49,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1877195328] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:42:49,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:42:49,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:42:49,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52851005] [2022-04-15 11:42:49,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:42:49,570 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 77 [2022-04-15 11:42:49,571 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:42:49,571 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:42:49,618 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:42:49,619 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:42:49,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:42:49,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:42:49,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:42:49,620 INFO L87 Difference]: Start difference. First operand 219 states and 356 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:42:52,385 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:42:54,191 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:42:55,927 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:42:57,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:42:57,007 INFO L93 Difference]: Finished difference Result 451 states and 734 transitions. [2022-04-15 11:42:57,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:42:57,007 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 77 [2022-04-15 11:42:57,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:42:57,007 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:42:57,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 440 transitions. [2022-04-15 11:42:57,012 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:42:57,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 440 transitions. [2022-04-15 11:42:57,016 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 440 transitions. [2022-04-15 11:42:57,343 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 440 edges. 440 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:42:57,349 INFO L225 Difference]: With dead ends: 451 [2022-04-15 11:42:57,349 INFO L226 Difference]: Without dead ends: 247 [2022-04-15 11:42:57,350 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:42:57,351 INFO L913 BasicCegarLoop]: 180 mSDtfsCounter, 22 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:42:57,351 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 463 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2022-04-15 11:42:57,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-04-15 11:42:57,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 230. [2022-04-15 11:42:57,367 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:42:57,368 INFO L82 GeneralOperation]: Start isEquivalent. First operand 247 states. Second operand has 230 states, 225 states have (on average 1.6488888888888888) internal successors, (371), 225 states have internal predecessors, (371), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:57,369 INFO L74 IsIncluded]: Start isIncluded. First operand 247 states. Second operand has 230 states, 225 states have (on average 1.6488888888888888) internal successors, (371), 225 states have internal predecessors, (371), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:57,369 INFO L87 Difference]: Start difference. First operand 247 states. Second operand has 230 states, 225 states have (on average 1.6488888888888888) internal successors, (371), 225 states have internal predecessors, (371), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:57,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:42:57,377 INFO L93 Difference]: Finished difference Result 247 states and 396 transitions. [2022-04-15 11:42:57,377 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 396 transitions. [2022-04-15 11:42:57,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:42:57,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:42:57,379 INFO L74 IsIncluded]: Start isIncluded. First operand has 230 states, 225 states have (on average 1.6488888888888888) internal successors, (371), 225 states have internal predecessors, (371), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 247 states. [2022-04-15 11:42:57,379 INFO L87 Difference]: Start difference. First operand has 230 states, 225 states have (on average 1.6488888888888888) internal successors, (371), 225 states have internal predecessors, (371), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 247 states. [2022-04-15 11:42:57,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:42:57,388 INFO L93 Difference]: Finished difference Result 247 states and 396 transitions. [2022-04-15 11:42:57,388 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 396 transitions. [2022-04-15 11:42:57,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:42:57,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:42:57,388 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:42:57,389 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:42:57,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 225 states have (on average 1.6488888888888888) internal successors, (371), 225 states have internal predecessors, (371), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:57,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 375 transitions. [2022-04-15 11:42:57,398 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 375 transitions. Word has length 77 [2022-04-15 11:42:57,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:42:57,398 INFO L478 AbstractCegarLoop]: Abstraction has 230 states and 375 transitions. [2022-04-15 11:42:57,399 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:42:57,399 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 230 states and 375 transitions. [2022-04-15 11:42:57,691 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 375 edges. 375 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:42:57,692 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 375 transitions. [2022-04-15 11:42:57,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-04-15 11:42:57,693 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:42:57,693 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:42:57,693 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 11:42:57,693 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:42:57,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:42:57,694 INFO L85 PathProgramCache]: Analyzing trace with hash -847556179, now seen corresponding path program 1 times [2022-04-15 11:42:57,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:42:57,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [208289980] [2022-04-15 11:42:57,752 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:42:57,752 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:42:57,752 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:42:57,752 INFO L85 PathProgramCache]: Analyzing trace with hash -847556179, now seen corresponding path program 2 times [2022-04-15 11:42:57,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:42:57,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803181260] [2022-04-15 11:42:57,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:42:57,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:42:57,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:42:57,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:42:57,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:42:57,921 INFO L290 TraceCheckUtils]: 0: Hoare triple {5709#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {5702#true} is VALID [2022-04-15 11:42:57,921 INFO L290 TraceCheckUtils]: 1: Hoare triple {5702#true} assume true; {5702#true} is VALID [2022-04-15 11:42:57,921 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5702#true} {5702#true} #673#return; {5702#true} is VALID [2022-04-15 11:42:57,922 INFO L272 TraceCheckUtils]: 0: Hoare triple {5702#true} call ULTIMATE.init(); {5709#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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:42:57,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {5709#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {5702#true} is VALID [2022-04-15 11:42:57,923 INFO L290 TraceCheckUtils]: 2: Hoare triple {5702#true} assume true; {5702#true} is VALID [2022-04-15 11:42:57,923 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5702#true} {5702#true} #673#return; {5702#true} is VALID [2022-04-15 11:42:57,923 INFO L272 TraceCheckUtils]: 4: Hoare triple {5702#true} call #t~ret161 := main(); {5702#true} is VALID [2022-04-15 11:42:57,923 INFO L290 TraceCheckUtils]: 5: Hoare triple {5702#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; {5702#true} is VALID [2022-04-15 11:42:57,924 INFO L290 TraceCheckUtils]: 6: Hoare triple {5702#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {5702#true} is VALID [2022-04-15 11:42:57,924 INFO L272 TraceCheckUtils]: 7: Hoare triple {5702#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {5702#true} is VALID [2022-04-15 11:42:57,925 INFO L290 TraceCheckUtils]: 8: Hoare triple {5702#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); {5707#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:57,926 INFO L290 TraceCheckUtils]: 9: Hoare triple {5707#(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; {5707#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:57,927 INFO L290 TraceCheckUtils]: 10: Hoare triple {5707#(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; {5707#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:57,927 INFO L290 TraceCheckUtils]: 11: Hoare triple {5707#(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)))); {5707#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:57,927 INFO L290 TraceCheckUtils]: 12: Hoare triple {5707#(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); {5707#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:57,928 INFO L290 TraceCheckUtils]: 13: Hoare triple {5707#(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; {5707#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:57,928 INFO L290 TraceCheckUtils]: 14: Hoare triple {5707#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {5707#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:57,929 INFO L290 TraceCheckUtils]: 15: Hoare triple {5707#(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); {5707#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:57,929 INFO L290 TraceCheckUtils]: 16: Hoare triple {5707#(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); {5707#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:57,930 INFO L290 TraceCheckUtils]: 17: Hoare triple {5707#(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); {5707#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:57,930 INFO L290 TraceCheckUtils]: 18: Hoare triple {5707#(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); {5707#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:57,931 INFO L290 TraceCheckUtils]: 19: Hoare triple {5707#(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); {5707#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:57,931 INFO L290 TraceCheckUtils]: 20: Hoare triple {5707#(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); {5708#(not (= |ssl3_accept_#t~mem52| 8480))} is VALID [2022-04-15 11:42:57,931 INFO L290 TraceCheckUtils]: 21: Hoare triple {5708#(not (= |ssl3_accept_#t~mem52| 8480))} assume 8480 == #t~mem52;havoc #t~mem52; {5703#false} is VALID [2022-04-15 11:42:57,932 INFO L290 TraceCheckUtils]: 22: Hoare triple {5703#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; {5703#false} is VALID [2022-04-15 11:42:57,932 INFO L290 TraceCheckUtils]: 23: Hoare triple {5703#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); {5703#false} is VALID [2022-04-15 11:42:57,932 INFO L290 TraceCheckUtils]: 24: Hoare triple {5703#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); {5703#false} is VALID [2022-04-15 11:42:57,932 INFO L290 TraceCheckUtils]: 25: Hoare triple {5703#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {5703#false} is VALID [2022-04-15 11:42:57,932 INFO L290 TraceCheckUtils]: 26: Hoare triple {5703#false} ~skip~0 := 0; {5703#false} is VALID [2022-04-15 11:42:57,932 INFO L290 TraceCheckUtils]: 27: Hoare triple {5703#false} assume !false; {5703#false} is VALID [2022-04-15 11:42:57,932 INFO L290 TraceCheckUtils]: 28: Hoare triple {5703#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); {5703#false} is VALID [2022-04-15 11:42:57,933 INFO L290 TraceCheckUtils]: 29: Hoare triple {5703#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-15 11:42:57,933 INFO L290 TraceCheckUtils]: 30: Hoare triple {5703#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-15 11:42:57,933 INFO L290 TraceCheckUtils]: 31: Hoare triple {5703#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-15 11:42:57,933 INFO L290 TraceCheckUtils]: 32: Hoare triple {5703#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-15 11:42:57,933 INFO L290 TraceCheckUtils]: 33: Hoare triple {5703#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-15 11:42:57,933 INFO L290 TraceCheckUtils]: 34: Hoare triple {5703#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-15 11:42:57,933 INFO L290 TraceCheckUtils]: 35: Hoare triple {5703#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-15 11:42:57,933 INFO L290 TraceCheckUtils]: 36: Hoare triple {5703#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-15 11:42:57,934 INFO L290 TraceCheckUtils]: 37: Hoare triple {5703#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-15 11:42:57,934 INFO L290 TraceCheckUtils]: 38: Hoare triple {5703#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-15 11:42:57,934 INFO L290 TraceCheckUtils]: 39: Hoare triple {5703#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-15 11:42:57,934 INFO L290 TraceCheckUtils]: 40: Hoare triple {5703#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-15 11:42:57,934 INFO L290 TraceCheckUtils]: 41: Hoare triple {5703#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-15 11:42:57,934 INFO L290 TraceCheckUtils]: 42: Hoare triple {5703#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-15 11:42:57,934 INFO L290 TraceCheckUtils]: 43: Hoare triple {5703#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-15 11:42:57,935 INFO L290 TraceCheckUtils]: 44: Hoare triple {5703#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-15 11:42:57,935 INFO L290 TraceCheckUtils]: 45: Hoare triple {5703#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-15 11:42:57,935 INFO L290 TraceCheckUtils]: 46: Hoare triple {5703#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-15 11:42:57,935 INFO L290 TraceCheckUtils]: 47: Hoare triple {5703#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-15 11:42:57,935 INFO L290 TraceCheckUtils]: 48: Hoare triple {5703#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-15 11:42:57,935 INFO L290 TraceCheckUtils]: 49: Hoare triple {5703#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-15 11:42:57,935 INFO L290 TraceCheckUtils]: 50: Hoare triple {5703#false} assume 8448 == #t~mem68;havoc #t~mem68; {5703#false} is VALID [2022-04-15 11:42:57,935 INFO L290 TraceCheckUtils]: 51: Hoare triple {5703#false} assume !(~num1~0 > 0); {5703#false} is VALID [2022-04-15 11:42:57,936 INFO L290 TraceCheckUtils]: 52: Hoare triple {5703#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; {5703#false} is VALID [2022-04-15 11:42:57,936 INFO L290 TraceCheckUtils]: 53: Hoare triple {5703#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); {5703#false} is VALID [2022-04-15 11:42:57,936 INFO L290 TraceCheckUtils]: 54: Hoare triple {5703#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {5703#false} is VALID [2022-04-15 11:42:57,936 INFO L290 TraceCheckUtils]: 55: Hoare triple {5703#false} ~skip~0 := 0; {5703#false} is VALID [2022-04-15 11:42:57,936 INFO L290 TraceCheckUtils]: 56: Hoare triple {5703#false} assume !false; {5703#false} is VALID [2022-04-15 11:42:57,936 INFO L290 TraceCheckUtils]: 57: Hoare triple {5703#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); {5703#false} is VALID [2022-04-15 11:42:57,936 INFO L290 TraceCheckUtils]: 58: Hoare triple {5703#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-15 11:42:57,937 INFO L290 TraceCheckUtils]: 59: Hoare triple {5703#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-15 11:42:57,937 INFO L290 TraceCheckUtils]: 60: Hoare triple {5703#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-15 11:42:57,937 INFO L290 TraceCheckUtils]: 61: Hoare triple {5703#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-15 11:42:57,937 INFO L290 TraceCheckUtils]: 62: Hoare triple {5703#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-15 11:42:57,937 INFO L290 TraceCheckUtils]: 63: Hoare triple {5703#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-15 11:42:57,937 INFO L290 TraceCheckUtils]: 64: Hoare triple {5703#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-15 11:42:57,937 INFO L290 TraceCheckUtils]: 65: Hoare triple {5703#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-15 11:42:57,937 INFO L290 TraceCheckUtils]: 66: Hoare triple {5703#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-15 11:42:57,938 INFO L290 TraceCheckUtils]: 67: Hoare triple {5703#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-15 11:42:57,938 INFO L290 TraceCheckUtils]: 68: Hoare triple {5703#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-15 11:42:57,938 INFO L290 TraceCheckUtils]: 69: Hoare triple {5703#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-15 11:42:57,938 INFO L290 TraceCheckUtils]: 70: Hoare triple {5703#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-15 11:42:57,938 INFO L290 TraceCheckUtils]: 71: Hoare triple {5703#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-15 11:42:57,938 INFO L290 TraceCheckUtils]: 72: Hoare triple {5703#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-15 11:42:57,938 INFO L290 TraceCheckUtils]: 73: Hoare triple {5703#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-15 11:42:57,938 INFO L290 TraceCheckUtils]: 74: Hoare triple {5703#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-15 11:42:57,939 INFO L290 TraceCheckUtils]: 75: Hoare triple {5703#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-15 11:42:57,939 INFO L290 TraceCheckUtils]: 76: Hoare triple {5703#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-15 11:42:57,939 INFO L290 TraceCheckUtils]: 77: Hoare triple {5703#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-15 11:42:57,939 INFO L290 TraceCheckUtils]: 78: Hoare triple {5703#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-15 11:42:57,939 INFO L290 TraceCheckUtils]: 79: Hoare triple {5703#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-15 11:42:57,939 INFO L290 TraceCheckUtils]: 80: Hoare triple {5703#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-15 11:42:57,939 INFO L290 TraceCheckUtils]: 81: Hoare triple {5703#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-15 11:42:57,939 INFO L290 TraceCheckUtils]: 82: Hoare triple {5703#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-15 11:42:57,940 INFO L290 TraceCheckUtils]: 83: Hoare triple {5703#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-15 11:42:57,940 INFO L290 TraceCheckUtils]: 84: Hoare triple {5703#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-15 11:42:57,940 INFO L290 TraceCheckUtils]: 85: Hoare triple {5703#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {5703#false} is VALID [2022-04-15 11:42:57,940 INFO L290 TraceCheckUtils]: 86: Hoare triple {5703#false} assume 8640 == #t~mem75;havoc #t~mem75; {5703#false} is VALID [2022-04-15 11:42:57,940 INFO L290 TraceCheckUtils]: 87: Hoare triple {5703#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {5703#false} is VALID [2022-04-15 11:42:57,940 INFO L290 TraceCheckUtils]: 88: Hoare triple {5703#false} assume !(4 == ~blastFlag~0); {5703#false} is VALID [2022-04-15 11:42:57,940 INFO L290 TraceCheckUtils]: 89: Hoare triple {5703#false} assume !false; {5703#false} is VALID [2022-04-15 11:42:57,941 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-15 11:42:57,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:42:57,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803181260] [2022-04-15 11:42:57,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803181260] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:42:57,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:42:57,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:42:57,942 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:42:57,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [208289980] [2022-04-15 11:42:57,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [208289980] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:42:57,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:42:57,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:42:57,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344340005] [2022-04-15 11:42:57,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:42:57,943 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 90 [2022-04-15 11:42:57,943 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:42:57,943 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:42:57,992 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:42:57,992 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:42:57,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:42:57,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:42:57,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:42:57,993 INFO L87 Difference]: Start difference. First operand 230 states and 375 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:43:02,609 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:43:04,613 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:43:08,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:43:08,664 INFO L93 Difference]: Finished difference Result 549 states and 888 transitions. [2022-04-15 11:43:08,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:43:08,665 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 90 [2022-04-15 11:43:08,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:43:08,665 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:43:08,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 576 transitions. [2022-04-15 11:43:08,669 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:43:08,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 576 transitions. [2022-04-15 11:43:08,673 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 576 transitions. [2022-04-15 11:43:09,130 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:43:09,151 INFO L225 Difference]: With dead ends: 549 [2022-04-15 11:43:09,151 INFO L226 Difference]: Without dead ends: 345 [2022-04-15 11:43:09,152 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:43:09,156 INFO L913 BasicCegarLoop]: 248 mSDtfsCounter, 138 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:43:09,157 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 598 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 610 Invalid, 1 Unknown, 0 Unchecked, 5.2s Time] [2022-04-15 11:43:09,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2022-04-15 11:43:09,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 246. [2022-04-15 11:43:09,202 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:43:09,203 INFO L82 GeneralOperation]: Start isEquivalent. First operand 345 states. Second operand has 246 states, 241 states have (on average 1.6390041493775933) internal successors, (395), 241 states have internal predecessors, (395), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:09,203 INFO L74 IsIncluded]: Start isIncluded. First operand 345 states. Second operand has 246 states, 241 states have (on average 1.6390041493775933) internal successors, (395), 241 states have internal predecessors, (395), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:09,204 INFO L87 Difference]: Start difference. First operand 345 states. Second operand has 246 states, 241 states have (on average 1.6390041493775933) internal successors, (395), 241 states have internal predecessors, (395), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:09,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:43:09,216 INFO L93 Difference]: Finished difference Result 345 states and 548 transitions. [2022-04-15 11:43:09,216 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 548 transitions. [2022-04-15 11:43:09,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:43:09,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:43:09,217 INFO L74 IsIncluded]: Start isIncluded. First operand has 246 states, 241 states have (on average 1.6390041493775933) internal successors, (395), 241 states have internal predecessors, (395), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 345 states. [2022-04-15 11:43:09,218 INFO L87 Difference]: Start difference. First operand has 246 states, 241 states have (on average 1.6390041493775933) internal successors, (395), 241 states have internal predecessors, (395), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 345 states. [2022-04-15 11:43:09,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:43:09,227 INFO L93 Difference]: Finished difference Result 345 states and 548 transitions. [2022-04-15 11:43:09,227 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 548 transitions. [2022-04-15 11:43:09,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:43:09,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:43:09,228 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:43:09,228 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:43:09,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 241 states have (on average 1.6390041493775933) internal successors, (395), 241 states have internal predecessors, (395), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:09,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 399 transitions. [2022-04-15 11:43:09,235 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 399 transitions. Word has length 90 [2022-04-15 11:43:09,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:43:09,235 INFO L478 AbstractCegarLoop]: Abstraction has 246 states and 399 transitions. [2022-04-15 11:43:09,236 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:43:09,236 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 246 states and 399 transitions. [2022-04-15 11:43:09,539 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 399 edges. 399 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:43:09,539 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 399 transitions. [2022-04-15 11:43:09,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-15 11:43:09,540 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:43:09,540 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:43:09,540 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 11:43:09,541 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:43:09,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:43:09,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1839246915, now seen corresponding path program 1 times [2022-04-15 11:43:09,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:43:09,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1599739983] [2022-04-15 11:43:09,592 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:43:09,592 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:43:09,592 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:43:09,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1839246915, now seen corresponding path program 2 times [2022-04-15 11:43:09,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:43:09,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170061315] [2022-04-15 11:43:09,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:43:09,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:43:09,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:43:09,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:43:09,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:43:09,724 INFO L290 TraceCheckUtils]: 0: Hoare triple {8001#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {7994#true} is VALID [2022-04-15 11:43:09,724 INFO L290 TraceCheckUtils]: 1: Hoare triple {7994#true} assume true; {7994#true} is VALID [2022-04-15 11:43:09,725 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7994#true} {7994#true} #673#return; {7994#true} is VALID [2022-04-15 11:43:09,726 INFO L272 TraceCheckUtils]: 0: Hoare triple {7994#true} call ULTIMATE.init(); {8001#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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:43:09,726 INFO L290 TraceCheckUtils]: 1: Hoare triple {8001#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {7994#true} is VALID [2022-04-15 11:43:09,726 INFO L290 TraceCheckUtils]: 2: Hoare triple {7994#true} assume true; {7994#true} is VALID [2022-04-15 11:43:09,726 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7994#true} {7994#true} #673#return; {7994#true} is VALID [2022-04-15 11:43:09,726 INFO L272 TraceCheckUtils]: 4: Hoare triple {7994#true} call #t~ret161 := main(); {7994#true} is VALID [2022-04-15 11:43:09,726 INFO L290 TraceCheckUtils]: 5: Hoare triple {7994#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; {7994#true} is VALID [2022-04-15 11:43:09,726 INFO L290 TraceCheckUtils]: 6: Hoare triple {7994#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {7994#true} is VALID [2022-04-15 11:43:09,726 INFO L272 TraceCheckUtils]: 7: Hoare triple {7994#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {7994#true} is VALID [2022-04-15 11:43:09,728 INFO L290 TraceCheckUtils]: 8: Hoare triple {7994#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); {7999#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:09,729 INFO L290 TraceCheckUtils]: 9: Hoare triple {7999#(= 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; {7999#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:09,729 INFO L290 TraceCheckUtils]: 10: Hoare triple {7999#(= 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; {7999#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:09,730 INFO L290 TraceCheckUtils]: 11: Hoare triple {7999#(= 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)))); {7999#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:09,730 INFO L290 TraceCheckUtils]: 12: Hoare triple {7999#(= 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); {7999#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:09,730 INFO L290 TraceCheckUtils]: 13: Hoare triple {7999#(= 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; {7999#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:09,731 INFO L290 TraceCheckUtils]: 14: Hoare triple {7999#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {7999#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:09,731 INFO L290 TraceCheckUtils]: 15: Hoare triple {7999#(= 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); {8000#(= 8464 |ssl3_accept_#t~mem47|)} is VALID [2022-04-15 11:43:09,732 INFO L290 TraceCheckUtils]: 16: Hoare triple {8000#(= 8464 |ssl3_accept_#t~mem47|)} assume 12292 == #t~mem47;havoc #t~mem47; {7995#false} is VALID [2022-04-15 11:43:09,732 INFO L290 TraceCheckUtils]: 17: Hoare triple {7995#false} call write~int(1, ~s.base, 40 + ~s.offset, 4); {7995#false} is VALID [2022-04-15 11:43:09,732 INFO L290 TraceCheckUtils]: 18: Hoare triple {7995#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {7995#false} is VALID [2022-04-15 11:43:09,732 INFO L290 TraceCheckUtils]: 19: Hoare triple {7995#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {7995#false} is VALID [2022-04-15 11:43:09,732 INFO L290 TraceCheckUtils]: 20: Hoare triple {7995#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {7995#false} is VALID [2022-04-15 11:43:09,732 INFO L290 TraceCheckUtils]: 21: Hoare triple {7995#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); {7995#false} is VALID [2022-04-15 11:43:09,732 INFO L290 TraceCheckUtils]: 22: Hoare triple {7995#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {7995#false} is VALID [2022-04-15 11:43:09,732 INFO L290 TraceCheckUtils]: 23: Hoare triple {7995#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); {7995#false} is VALID [2022-04-15 11:43:09,732 INFO L290 TraceCheckUtils]: 24: Hoare triple {7995#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); {7995#false} is VALID [2022-04-15 11:43:09,732 INFO L290 TraceCheckUtils]: 25: Hoare triple {7995#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); {7995#false} is VALID [2022-04-15 11:43:09,733 INFO L290 TraceCheckUtils]: 26: Hoare triple {7995#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {7995#false} is VALID [2022-04-15 11:43:09,733 INFO L290 TraceCheckUtils]: 27: Hoare triple {7995#false} ~skip~0 := 0; {7995#false} is VALID [2022-04-15 11:43:09,733 INFO L290 TraceCheckUtils]: 28: Hoare triple {7995#false} assume !false; {7995#false} is VALID [2022-04-15 11:43:09,733 INFO L290 TraceCheckUtils]: 29: Hoare triple {7995#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); {7995#false} is VALID [2022-04-15 11:43:09,733 INFO L290 TraceCheckUtils]: 30: Hoare triple {7995#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-15 11:43:09,733 INFO L290 TraceCheckUtils]: 31: Hoare triple {7995#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-15 11:43:09,733 INFO L290 TraceCheckUtils]: 32: Hoare triple {7995#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-15 11:43:09,733 INFO L290 TraceCheckUtils]: 33: Hoare triple {7995#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-15 11:43:09,734 INFO L290 TraceCheckUtils]: 34: Hoare triple {7995#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-15 11:43:09,734 INFO L290 TraceCheckUtils]: 35: Hoare triple {7995#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-15 11:43:09,734 INFO L290 TraceCheckUtils]: 36: Hoare triple {7995#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-15 11:43:09,734 INFO L290 TraceCheckUtils]: 37: Hoare triple {7995#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-15 11:43:09,734 INFO L290 TraceCheckUtils]: 38: Hoare triple {7995#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-15 11:43:09,734 INFO L290 TraceCheckUtils]: 39: Hoare triple {7995#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-15 11:43:09,734 INFO L290 TraceCheckUtils]: 40: Hoare triple {7995#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-15 11:43:09,734 INFO L290 TraceCheckUtils]: 41: Hoare triple {7995#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-15 11:43:09,734 INFO L290 TraceCheckUtils]: 42: Hoare triple {7995#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-15 11:43:09,735 INFO L290 TraceCheckUtils]: 43: Hoare triple {7995#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-15 11:43:09,735 INFO L290 TraceCheckUtils]: 44: Hoare triple {7995#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-15 11:43:09,735 INFO L290 TraceCheckUtils]: 45: Hoare triple {7995#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-15 11:43:09,735 INFO L290 TraceCheckUtils]: 46: Hoare triple {7995#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-15 11:43:09,735 INFO L290 TraceCheckUtils]: 47: Hoare triple {7995#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-15 11:43:09,735 INFO L290 TraceCheckUtils]: 48: Hoare triple {7995#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-15 11:43:09,735 INFO L290 TraceCheckUtils]: 49: Hoare triple {7995#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-15 11:43:09,735 INFO L290 TraceCheckUtils]: 50: Hoare triple {7995#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-15 11:43:09,735 INFO L290 TraceCheckUtils]: 51: Hoare triple {7995#false} assume 8448 == #t~mem68;havoc #t~mem68; {7995#false} is VALID [2022-04-15 11:43:09,735 INFO L290 TraceCheckUtils]: 52: Hoare triple {7995#false} assume !(~num1~0 > 0); {7995#false} is VALID [2022-04-15 11:43:09,735 INFO L290 TraceCheckUtils]: 53: Hoare triple {7995#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; {7995#false} is VALID [2022-04-15 11:43:09,736 INFO L290 TraceCheckUtils]: 54: Hoare triple {7995#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); {7995#false} is VALID [2022-04-15 11:43:09,736 INFO L290 TraceCheckUtils]: 55: Hoare triple {7995#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {7995#false} is VALID [2022-04-15 11:43:09,736 INFO L290 TraceCheckUtils]: 56: Hoare triple {7995#false} ~skip~0 := 0; {7995#false} is VALID [2022-04-15 11:43:09,736 INFO L290 TraceCheckUtils]: 57: Hoare triple {7995#false} assume !false; {7995#false} is VALID [2022-04-15 11:43:09,736 INFO L290 TraceCheckUtils]: 58: Hoare triple {7995#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); {7995#false} is VALID [2022-04-15 11:43:09,736 INFO L290 TraceCheckUtils]: 59: Hoare triple {7995#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-15 11:43:09,736 INFO L290 TraceCheckUtils]: 60: Hoare triple {7995#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-15 11:43:09,736 INFO L290 TraceCheckUtils]: 61: Hoare triple {7995#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-15 11:43:09,736 INFO L290 TraceCheckUtils]: 62: Hoare triple {7995#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-15 11:43:09,736 INFO L290 TraceCheckUtils]: 63: Hoare triple {7995#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-15 11:43:09,737 INFO L290 TraceCheckUtils]: 64: Hoare triple {7995#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-15 11:43:09,737 INFO L290 TraceCheckUtils]: 65: Hoare triple {7995#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-15 11:43:09,737 INFO L290 TraceCheckUtils]: 66: Hoare triple {7995#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-15 11:43:09,737 INFO L290 TraceCheckUtils]: 67: Hoare triple {7995#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-15 11:43:09,737 INFO L290 TraceCheckUtils]: 68: Hoare triple {7995#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-15 11:43:09,737 INFO L290 TraceCheckUtils]: 69: Hoare triple {7995#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-15 11:43:09,737 INFO L290 TraceCheckUtils]: 70: Hoare triple {7995#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-15 11:43:09,737 INFO L290 TraceCheckUtils]: 71: Hoare triple {7995#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-15 11:43:09,738 INFO L290 TraceCheckUtils]: 72: Hoare triple {7995#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-15 11:43:09,738 INFO L290 TraceCheckUtils]: 73: Hoare triple {7995#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-15 11:43:09,738 INFO L290 TraceCheckUtils]: 74: Hoare triple {7995#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-15 11:43:09,738 INFO L290 TraceCheckUtils]: 75: Hoare triple {7995#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-15 11:43:09,738 INFO L290 TraceCheckUtils]: 76: Hoare triple {7995#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-15 11:43:09,738 INFO L290 TraceCheckUtils]: 77: Hoare triple {7995#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-15 11:43:09,738 INFO L290 TraceCheckUtils]: 78: Hoare triple {7995#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-15 11:43:09,738 INFO L290 TraceCheckUtils]: 79: Hoare triple {7995#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-15 11:43:09,739 INFO L290 TraceCheckUtils]: 80: Hoare triple {7995#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-15 11:43:09,739 INFO L290 TraceCheckUtils]: 81: Hoare triple {7995#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-15 11:43:09,739 INFO L290 TraceCheckUtils]: 82: Hoare triple {7995#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-15 11:43:09,739 INFO L290 TraceCheckUtils]: 83: Hoare triple {7995#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-15 11:43:09,739 INFO L290 TraceCheckUtils]: 84: Hoare triple {7995#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-15 11:43:09,739 INFO L290 TraceCheckUtils]: 85: Hoare triple {7995#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-15 11:43:09,739 INFO L290 TraceCheckUtils]: 86: Hoare triple {7995#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {7995#false} is VALID [2022-04-15 11:43:09,739 INFO L290 TraceCheckUtils]: 87: Hoare triple {7995#false} assume 8640 == #t~mem75;havoc #t~mem75; {7995#false} is VALID [2022-04-15 11:43:09,741 INFO L290 TraceCheckUtils]: 88: Hoare triple {7995#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {7995#false} is VALID [2022-04-15 11:43:09,741 INFO L290 TraceCheckUtils]: 89: Hoare triple {7995#false} assume !(4 == ~blastFlag~0); {7995#false} is VALID [2022-04-15 11:43:09,741 INFO L290 TraceCheckUtils]: 90: Hoare triple {7995#false} assume !false; {7995#false} is VALID [2022-04-15 11:43:09,741 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-15 11:43:09,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:43:09,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170061315] [2022-04-15 11:43:09,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170061315] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:43:09,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:43:09,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:43:09,742 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:43:09,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1599739983] [2022-04-15 11:43:09,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1599739983] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:43:09,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:43:09,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:43:09,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221887774] [2022-04-15 11:43:09,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:43:09,744 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 91 [2022-04-15 11:43:09,744 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:43:09,744 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:43:09,790 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:43:09,791 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:43:09,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:43:09,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:43:09,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:43:09,791 INFO L87 Difference]: Start difference. First operand 246 states and 399 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:43:13,549 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:43:15,556 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:43:16,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:43:16,673 INFO L93 Difference]: Finished difference Result 482 states and 781 transitions. [2022-04-15 11:43:16,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:43:16,674 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 91 [2022-04-15 11:43:16,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:43:16,674 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:43:16,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 437 transitions. [2022-04-15 11:43:16,677 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:43:16,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 437 transitions. [2022-04-15 11:43:16,680 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 437 transitions. [2022-04-15 11:43:17,033 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 437 edges. 437 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:43:17,038 INFO L225 Difference]: With dead ends: 482 [2022-04-15 11:43:17,039 INFO L226 Difference]: Without dead ends: 262 [2022-04-15 11:43:17,039 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:43:17,040 INFO L913 BasicCegarLoop]: 182 mSDtfsCounter, 28 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-04-15 11:43:17,040 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 467 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 355 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2022-04-15 11:43:17,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-04-15 11:43:17,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 246. [2022-04-15 11:43:17,059 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:43:17,059 INFO L82 GeneralOperation]: Start isEquivalent. First operand 262 states. Second operand has 246 states, 241 states have (on average 1.6348547717842323) internal successors, (394), 241 states have internal predecessors, (394), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:17,060 INFO L74 IsIncluded]: Start isIncluded. First operand 262 states. Second operand has 246 states, 241 states have (on average 1.6348547717842323) internal successors, (394), 241 states have internal predecessors, (394), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:17,060 INFO L87 Difference]: Start difference. First operand 262 states. Second operand has 246 states, 241 states have (on average 1.6348547717842323) internal successors, (394), 241 states have internal predecessors, (394), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:17,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:43:17,066 INFO L93 Difference]: Finished difference Result 262 states and 418 transitions. [2022-04-15 11:43:17,066 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 418 transitions. [2022-04-15 11:43:17,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:43:17,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:43:17,067 INFO L74 IsIncluded]: Start isIncluded. First operand has 246 states, 241 states have (on average 1.6348547717842323) internal successors, (394), 241 states have internal predecessors, (394), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 262 states. [2022-04-15 11:43:17,068 INFO L87 Difference]: Start difference. First operand has 246 states, 241 states have (on average 1.6348547717842323) internal successors, (394), 241 states have internal predecessors, (394), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 262 states. [2022-04-15 11:43:17,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:43:17,073 INFO L93 Difference]: Finished difference Result 262 states and 418 transitions. [2022-04-15 11:43:17,073 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 418 transitions. [2022-04-15 11:43:17,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:43:17,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:43:17,075 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:43:17,075 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:43:17,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 241 states have (on average 1.6348547717842323) internal successors, (394), 241 states have internal predecessors, (394), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:17,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 398 transitions. [2022-04-15 11:43:17,081 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 398 transitions. Word has length 91 [2022-04-15 11:43:17,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:43:17,082 INFO L478 AbstractCegarLoop]: Abstraction has 246 states and 398 transitions. [2022-04-15 11:43:17,082 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:43:17,082 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 246 states and 398 transitions. [2022-04-15 11:43:17,436 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 398 edges. 398 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:43:17,436 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 398 transitions. [2022-04-15 11:43:17,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-15 11:43:17,437 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:43:17,437 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:43:17,437 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 11:43:17,437 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:43:17,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:43:17,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1790326953, now seen corresponding path program 1 times [2022-04-15 11:43:17,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:43:17,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1557851766] [2022-04-15 11:43:17,494 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:43:17,494 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:43:17,494 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:43:17,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1790326953, now seen corresponding path program 2 times [2022-04-15 11:43:17,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:43:17,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785547891] [2022-04-15 11:43:17,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:43:17,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:43:17,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:43:17,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:43:17,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:43:17,697 INFO L290 TraceCheckUtils]: 0: Hoare triple {9993#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {9986#true} is VALID [2022-04-15 11:43:17,698 INFO L290 TraceCheckUtils]: 1: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-15 11:43:17,698 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9986#true} {9986#true} #673#return; {9986#true} is VALID [2022-04-15 11:43:17,699 INFO L272 TraceCheckUtils]: 0: Hoare triple {9986#true} call ULTIMATE.init(); {9993#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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:43:17,700 INFO L290 TraceCheckUtils]: 1: Hoare triple {9993#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {9986#true} is VALID [2022-04-15 11:43:17,700 INFO L290 TraceCheckUtils]: 2: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-15 11:43:17,701 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9986#true} {9986#true} #673#return; {9986#true} is VALID [2022-04-15 11:43:17,701 INFO L272 TraceCheckUtils]: 4: Hoare triple {9986#true} call #t~ret161 := main(); {9986#true} is VALID [2022-04-15 11:43:17,701 INFO L290 TraceCheckUtils]: 5: Hoare triple {9986#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; {9986#true} is VALID [2022-04-15 11:43:17,701 INFO L290 TraceCheckUtils]: 6: Hoare triple {9986#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {9986#true} is VALID [2022-04-15 11:43:17,701 INFO L272 TraceCheckUtils]: 7: Hoare triple {9986#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {9986#true} is VALID [2022-04-15 11:43:17,704 INFO L290 TraceCheckUtils]: 8: Hoare triple {9986#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); {9991#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:43:17,704 INFO L290 TraceCheckUtils]: 9: Hoare triple {9991#(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; {9991#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:43:17,708 INFO L290 TraceCheckUtils]: 10: Hoare triple {9991#(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; {9991#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:43:17,708 INFO L290 TraceCheckUtils]: 11: Hoare triple {9991#(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)))); {9991#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:43:17,709 INFO L290 TraceCheckUtils]: 12: Hoare triple {9991#(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); {9991#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:43:17,709 INFO L290 TraceCheckUtils]: 13: Hoare triple {9991#(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; {9991#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:43:17,710 INFO L290 TraceCheckUtils]: 14: Hoare triple {9991#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {9991#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:43:17,710 INFO L290 TraceCheckUtils]: 15: Hoare triple {9991#(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); {9991#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:43:17,711 INFO L290 TraceCheckUtils]: 16: Hoare triple {9991#(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); {9992#(not (= |ssl3_accept_#t~mem48| 16384))} is VALID [2022-04-15 11:43:17,711 INFO L290 TraceCheckUtils]: 17: Hoare triple {9992#(not (= |ssl3_accept_#t~mem48| 16384))} assume 16384 == #t~mem48;havoc #t~mem48; {9987#false} is VALID [2022-04-15 11:43:17,711 INFO L290 TraceCheckUtils]: 18: Hoare triple {9987#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {9987#false} is VALID [2022-04-15 11:43:17,711 INFO L290 TraceCheckUtils]: 19: Hoare triple {9987#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {9987#false} is VALID [2022-04-15 11:43:17,711 INFO L290 TraceCheckUtils]: 20: Hoare triple {9987#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {9987#false} is VALID [2022-04-15 11:43:17,712 INFO L290 TraceCheckUtils]: 21: Hoare triple {9987#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); {9987#false} is VALID [2022-04-15 11:43:17,712 INFO L290 TraceCheckUtils]: 22: Hoare triple {9987#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {9987#false} is VALID [2022-04-15 11:43:17,712 INFO L290 TraceCheckUtils]: 23: Hoare triple {9987#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); {9987#false} is VALID [2022-04-15 11:43:17,712 INFO L290 TraceCheckUtils]: 24: Hoare triple {9987#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); {9987#false} is VALID [2022-04-15 11:43:17,712 INFO L290 TraceCheckUtils]: 25: Hoare triple {9987#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); {9987#false} is VALID [2022-04-15 11:43:17,712 INFO L290 TraceCheckUtils]: 26: Hoare triple {9987#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {9987#false} is VALID [2022-04-15 11:43:17,712 INFO L290 TraceCheckUtils]: 27: Hoare triple {9987#false} ~skip~0 := 0; {9987#false} is VALID [2022-04-15 11:43:17,712 INFO L290 TraceCheckUtils]: 28: Hoare triple {9987#false} assume !false; {9987#false} is VALID [2022-04-15 11:43:17,713 INFO L290 TraceCheckUtils]: 29: Hoare triple {9987#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); {9987#false} is VALID [2022-04-15 11:43:17,714 INFO L290 TraceCheckUtils]: 30: Hoare triple {9987#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-15 11:43:17,714 INFO L290 TraceCheckUtils]: 31: Hoare triple {9987#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-15 11:43:17,714 INFO L290 TraceCheckUtils]: 32: Hoare triple {9987#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-15 11:43:17,714 INFO L290 TraceCheckUtils]: 33: Hoare triple {9987#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-15 11:43:17,714 INFO L290 TraceCheckUtils]: 34: Hoare triple {9987#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-15 11:43:17,714 INFO L290 TraceCheckUtils]: 35: Hoare triple {9987#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-15 11:43:17,714 INFO L290 TraceCheckUtils]: 36: Hoare triple {9987#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-15 11:43:17,715 INFO L290 TraceCheckUtils]: 37: Hoare triple {9987#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-15 11:43:17,715 INFO L290 TraceCheckUtils]: 38: Hoare triple {9987#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-15 11:43:17,715 INFO L290 TraceCheckUtils]: 39: Hoare triple {9987#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-15 11:43:17,715 INFO L290 TraceCheckUtils]: 40: Hoare triple {9987#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-15 11:43:17,715 INFO L290 TraceCheckUtils]: 41: Hoare triple {9987#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-15 11:43:17,715 INFO L290 TraceCheckUtils]: 42: Hoare triple {9987#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-15 11:43:17,715 INFO L290 TraceCheckUtils]: 43: Hoare triple {9987#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-15 11:43:17,716 INFO L290 TraceCheckUtils]: 44: Hoare triple {9987#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-15 11:43:17,716 INFO L290 TraceCheckUtils]: 45: Hoare triple {9987#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-15 11:43:17,716 INFO L290 TraceCheckUtils]: 46: Hoare triple {9987#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-15 11:43:17,716 INFO L290 TraceCheckUtils]: 47: Hoare triple {9987#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-15 11:43:17,716 INFO L290 TraceCheckUtils]: 48: Hoare triple {9987#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-15 11:43:17,716 INFO L290 TraceCheckUtils]: 49: Hoare triple {9987#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-15 11:43:17,716 INFO L290 TraceCheckUtils]: 50: Hoare triple {9987#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-15 11:43:17,716 INFO L290 TraceCheckUtils]: 51: Hoare triple {9987#false} assume 8448 == #t~mem68;havoc #t~mem68; {9987#false} is VALID [2022-04-15 11:43:17,716 INFO L290 TraceCheckUtils]: 52: Hoare triple {9987#false} assume !(~num1~0 > 0); {9987#false} is VALID [2022-04-15 11:43:17,716 INFO L290 TraceCheckUtils]: 53: Hoare triple {9987#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; {9987#false} is VALID [2022-04-15 11:43:17,717 INFO L290 TraceCheckUtils]: 54: Hoare triple {9987#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); {9987#false} is VALID [2022-04-15 11:43:17,717 INFO L290 TraceCheckUtils]: 55: Hoare triple {9987#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {9987#false} is VALID [2022-04-15 11:43:17,717 INFO L290 TraceCheckUtils]: 56: Hoare triple {9987#false} ~skip~0 := 0; {9987#false} is VALID [2022-04-15 11:43:17,717 INFO L290 TraceCheckUtils]: 57: Hoare triple {9987#false} assume !false; {9987#false} is VALID [2022-04-15 11:43:17,717 INFO L290 TraceCheckUtils]: 58: Hoare triple {9987#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); {9987#false} is VALID [2022-04-15 11:43:17,717 INFO L290 TraceCheckUtils]: 59: Hoare triple {9987#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-15 11:43:17,717 INFO L290 TraceCheckUtils]: 60: Hoare triple {9987#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-15 11:43:17,717 INFO L290 TraceCheckUtils]: 61: Hoare triple {9987#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-15 11:43:17,717 INFO L290 TraceCheckUtils]: 62: Hoare triple {9987#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-15 11:43:17,718 INFO L290 TraceCheckUtils]: 63: Hoare triple {9987#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-15 11:43:17,718 INFO L290 TraceCheckUtils]: 64: Hoare triple {9987#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-15 11:43:17,718 INFO L290 TraceCheckUtils]: 65: Hoare triple {9987#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-15 11:43:17,718 INFO L290 TraceCheckUtils]: 66: Hoare triple {9987#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-15 11:43:17,718 INFO L290 TraceCheckUtils]: 67: Hoare triple {9987#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-15 11:43:17,718 INFO L290 TraceCheckUtils]: 68: Hoare triple {9987#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-15 11:43:17,718 INFO L290 TraceCheckUtils]: 69: Hoare triple {9987#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-15 11:43:17,719 INFO L290 TraceCheckUtils]: 70: Hoare triple {9987#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-15 11:43:17,719 INFO L290 TraceCheckUtils]: 71: Hoare triple {9987#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-15 11:43:17,719 INFO L290 TraceCheckUtils]: 72: Hoare triple {9987#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-15 11:43:17,719 INFO L290 TraceCheckUtils]: 73: Hoare triple {9987#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-15 11:43:17,719 INFO L290 TraceCheckUtils]: 74: Hoare triple {9987#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-15 11:43:17,719 INFO L290 TraceCheckUtils]: 75: Hoare triple {9987#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-15 11:43:17,719 INFO L290 TraceCheckUtils]: 76: Hoare triple {9987#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-15 11:43:17,719 INFO L290 TraceCheckUtils]: 77: Hoare triple {9987#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-15 11:43:17,719 INFO L290 TraceCheckUtils]: 78: Hoare triple {9987#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-15 11:43:17,720 INFO L290 TraceCheckUtils]: 79: Hoare triple {9987#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-15 11:43:17,720 INFO L290 TraceCheckUtils]: 80: Hoare triple {9987#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-15 11:43:17,720 INFO L290 TraceCheckUtils]: 81: Hoare triple {9987#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-15 11:43:17,720 INFO L290 TraceCheckUtils]: 82: Hoare triple {9987#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-15 11:43:17,720 INFO L290 TraceCheckUtils]: 83: Hoare triple {9987#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-15 11:43:17,720 INFO L290 TraceCheckUtils]: 84: Hoare triple {9987#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-15 11:43:17,720 INFO L290 TraceCheckUtils]: 85: Hoare triple {9987#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-15 11:43:17,720 INFO L290 TraceCheckUtils]: 86: Hoare triple {9987#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {9987#false} is VALID [2022-04-15 11:43:17,720 INFO L290 TraceCheckUtils]: 87: Hoare triple {9987#false} assume 8640 == #t~mem75;havoc #t~mem75; {9987#false} is VALID [2022-04-15 11:43:17,721 INFO L290 TraceCheckUtils]: 88: Hoare triple {9987#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {9987#false} is VALID [2022-04-15 11:43:17,721 INFO L290 TraceCheckUtils]: 89: Hoare triple {9987#false} assume !(4 == ~blastFlag~0); {9987#false} is VALID [2022-04-15 11:43:17,721 INFO L290 TraceCheckUtils]: 90: Hoare triple {9987#false} assume !false; {9987#false} is VALID [2022-04-15 11:43:17,723 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-15 11:43:17,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:43:17,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785547891] [2022-04-15 11:43:17,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785547891] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:43:17,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:43:17,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:43:17,723 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:43:17,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1557851766] [2022-04-15 11:43:17,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1557851766] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:43:17,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:43:17,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:43:17,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224195687] [2022-04-15 11:43:17,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:43:17,725 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 91 [2022-04-15 11:43:17,725 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:43:17,726 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:43:17,781 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:43:17,782 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:43:17,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:43:17,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:43:17,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:43:17,784 INFO L87 Difference]: Start difference. First operand 246 states and 398 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:43:21,455 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:43:23,459 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:43:26,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:43:26,561 INFO L93 Difference]: Finished difference Result 541 states and 863 transitions. [2022-04-15 11:43:26,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:43:26,561 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 91 [2022-04-15 11:43:26,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:43:26,562 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:43:26,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 576 transitions. [2022-04-15 11:43:26,567 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:43:26,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 576 transitions. [2022-04-15 11:43:26,571 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 576 transitions. [2022-04-15 11:43:27,058 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:43:27,064 INFO L225 Difference]: With dead ends: 541 [2022-04-15 11:43:27,064 INFO L226 Difference]: Without dead ends: 321 [2022-04-15 11:43:27,065 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:43:27,066 INFO L913 BasicCegarLoop]: 119 mSDtfsCounter, 142 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 62 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:43:27,067 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 340 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 478 Invalid, 1 Unknown, 0 Unchecked, 5.0s Time] [2022-04-15 11:43:27,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2022-04-15 11:43:27,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 246. [2022-04-15 11:43:27,081 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:43:27,082 INFO L82 GeneralOperation]: Start isEquivalent. First operand 321 states. Second operand has 246 states, 241 states have (on average 1.6182572614107884) internal successors, (390), 241 states have internal predecessors, (390), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:27,083 INFO L74 IsIncluded]: Start isIncluded. First operand 321 states. Second operand has 246 states, 241 states have (on average 1.6182572614107884) internal successors, (390), 241 states have internal predecessors, (390), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:27,083 INFO L87 Difference]: Start difference. First operand 321 states. Second operand has 246 states, 241 states have (on average 1.6182572614107884) internal successors, (390), 241 states have internal predecessors, (390), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:27,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:43:27,090 INFO L93 Difference]: Finished difference Result 321 states and 497 transitions. [2022-04-15 11:43:27,090 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 497 transitions. [2022-04-15 11:43:27,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:43:27,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:43:27,092 INFO L74 IsIncluded]: Start isIncluded. First operand has 246 states, 241 states have (on average 1.6182572614107884) internal successors, (390), 241 states have internal predecessors, (390), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 321 states. [2022-04-15 11:43:27,092 INFO L87 Difference]: Start difference. First operand has 246 states, 241 states have (on average 1.6182572614107884) internal successors, (390), 241 states have internal predecessors, (390), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 321 states. [2022-04-15 11:43:27,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:43:27,099 INFO L93 Difference]: Finished difference Result 321 states and 497 transitions. [2022-04-15 11:43:27,099 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 497 transitions. [2022-04-15 11:43:27,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:43:27,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:43:27,100 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:43:27,100 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:43:27,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 241 states have (on average 1.6182572614107884) internal successors, (390), 241 states have internal predecessors, (390), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:27,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 394 transitions. [2022-04-15 11:43:27,106 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 394 transitions. Word has length 91 [2022-04-15 11:43:27,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:43:27,106 INFO L478 AbstractCegarLoop]: Abstraction has 246 states and 394 transitions. [2022-04-15 11:43:27,107 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:43:27,107 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 246 states and 394 transitions. [2022-04-15 11:43:27,407 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 394 edges. 394 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:43:27,408 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 394 transitions. [2022-04-15 11:43:27,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-15 11:43:27,408 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:43:27,408 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:43:27,409 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 11:43:27,409 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:43:27,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:43:27,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1810194734, now seen corresponding path program 1 times [2022-04-15 11:43:27,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:43:27,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1192808358] [2022-04-15 11:43:27,460 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:43:27,460 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:43:27,460 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:43:27,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1810194734, now seen corresponding path program 2 times [2022-04-15 11:43:27,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:43:27,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326030719] [2022-04-15 11:43:27,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:43:27,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:43:27,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:43:27,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:43:27,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:43:27,581 INFO L290 TraceCheckUtils]: 0: Hoare triple {12221#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {12214#true} is VALID [2022-04-15 11:43:27,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {12214#true} assume true; {12214#true} is VALID [2022-04-15 11:43:27,582 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12214#true} {12214#true} #673#return; {12214#true} is VALID [2022-04-15 11:43:27,582 INFO L272 TraceCheckUtils]: 0: Hoare triple {12214#true} call ULTIMATE.init(); {12221#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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:43:27,583 INFO L290 TraceCheckUtils]: 1: Hoare triple {12221#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {12214#true} is VALID [2022-04-15 11:43:27,583 INFO L290 TraceCheckUtils]: 2: Hoare triple {12214#true} assume true; {12214#true} is VALID [2022-04-15 11:43:27,583 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12214#true} {12214#true} #673#return; {12214#true} is VALID [2022-04-15 11:43:27,583 INFO L272 TraceCheckUtils]: 4: Hoare triple {12214#true} call #t~ret161 := main(); {12214#true} is VALID [2022-04-15 11:43:27,583 INFO L290 TraceCheckUtils]: 5: Hoare triple {12214#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; {12214#true} is VALID [2022-04-15 11:43:27,583 INFO L290 TraceCheckUtils]: 6: Hoare triple {12214#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {12214#true} is VALID [2022-04-15 11:43:27,583 INFO L272 TraceCheckUtils]: 7: Hoare triple {12214#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {12214#true} is VALID [2022-04-15 11:43:27,586 INFO L290 TraceCheckUtils]: 8: Hoare triple {12214#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); {12219#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:27,586 INFO L290 TraceCheckUtils]: 9: Hoare triple {12219#(= 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; {12219#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:27,587 INFO L290 TraceCheckUtils]: 10: Hoare triple {12219#(= 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; {12219#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:27,587 INFO L290 TraceCheckUtils]: 11: Hoare triple {12219#(= 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)))); {12219#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:27,588 INFO L290 TraceCheckUtils]: 12: Hoare triple {12219#(= 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); {12219#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:27,588 INFO L290 TraceCheckUtils]: 13: Hoare triple {12219#(= 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; {12219#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:27,589 INFO L290 TraceCheckUtils]: 14: Hoare triple {12219#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {12219#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:27,589 INFO L290 TraceCheckUtils]: 15: Hoare triple {12219#(= 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); {12219#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:27,589 INFO L290 TraceCheckUtils]: 16: Hoare triple {12219#(= 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); {12219#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:27,590 INFO L290 TraceCheckUtils]: 17: Hoare triple {12219#(= 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); {12219#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:27,590 INFO L290 TraceCheckUtils]: 18: Hoare triple {12219#(= 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); {12219#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:27,591 INFO L290 TraceCheckUtils]: 19: Hoare triple {12219#(= 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); {12219#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:27,591 INFO L290 TraceCheckUtils]: 20: Hoare triple {12219#(= 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); {12219#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:27,592 INFO L290 TraceCheckUtils]: 21: Hoare triple {12219#(= 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); {12220#(= 8464 |ssl3_accept_#t~mem53|)} is VALID [2022-04-15 11:43:27,592 INFO L290 TraceCheckUtils]: 22: Hoare triple {12220#(= 8464 |ssl3_accept_#t~mem53|)} assume 8481 == #t~mem53;havoc #t~mem53; {12215#false} is VALID [2022-04-15 11:43:27,592 INFO L290 TraceCheckUtils]: 23: Hoare triple {12215#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; {12215#false} is VALID [2022-04-15 11:43:27,592 INFO L290 TraceCheckUtils]: 24: Hoare triple {12215#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); {12215#false} is VALID [2022-04-15 11:43:27,592 INFO L290 TraceCheckUtils]: 25: Hoare triple {12215#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); {12215#false} is VALID [2022-04-15 11:43:27,592 INFO L290 TraceCheckUtils]: 26: Hoare triple {12215#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {12215#false} is VALID [2022-04-15 11:43:27,593 INFO L290 TraceCheckUtils]: 27: Hoare triple {12215#false} ~skip~0 := 0; {12215#false} is VALID [2022-04-15 11:43:27,593 INFO L290 TraceCheckUtils]: 28: Hoare triple {12215#false} assume !false; {12215#false} is VALID [2022-04-15 11:43:27,593 INFO L290 TraceCheckUtils]: 29: Hoare triple {12215#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); {12215#false} is VALID [2022-04-15 11:43:27,593 INFO L290 TraceCheckUtils]: 30: Hoare triple {12215#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-15 11:43:27,593 INFO L290 TraceCheckUtils]: 31: Hoare triple {12215#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-15 11:43:27,593 INFO L290 TraceCheckUtils]: 32: Hoare triple {12215#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-15 11:43:27,593 INFO L290 TraceCheckUtils]: 33: Hoare triple {12215#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-15 11:43:27,593 INFO L290 TraceCheckUtils]: 34: Hoare triple {12215#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-15 11:43:27,594 INFO L290 TraceCheckUtils]: 35: Hoare triple {12215#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-15 11:43:27,594 INFO L290 TraceCheckUtils]: 36: Hoare triple {12215#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-15 11:43:27,594 INFO L290 TraceCheckUtils]: 37: Hoare triple {12215#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-15 11:43:27,594 INFO L290 TraceCheckUtils]: 38: Hoare triple {12215#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-15 11:43:27,594 INFO L290 TraceCheckUtils]: 39: Hoare triple {12215#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-15 11:43:27,594 INFO L290 TraceCheckUtils]: 40: Hoare triple {12215#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-15 11:43:27,594 INFO L290 TraceCheckUtils]: 41: Hoare triple {12215#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-15 11:43:27,594 INFO L290 TraceCheckUtils]: 42: Hoare triple {12215#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-15 11:43:27,595 INFO L290 TraceCheckUtils]: 43: Hoare triple {12215#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-15 11:43:27,595 INFO L290 TraceCheckUtils]: 44: Hoare triple {12215#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-15 11:43:27,595 INFO L290 TraceCheckUtils]: 45: Hoare triple {12215#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-15 11:43:27,595 INFO L290 TraceCheckUtils]: 46: Hoare triple {12215#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-15 11:43:27,595 INFO L290 TraceCheckUtils]: 47: Hoare triple {12215#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-15 11:43:27,595 INFO L290 TraceCheckUtils]: 48: Hoare triple {12215#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-15 11:43:27,595 INFO L290 TraceCheckUtils]: 49: Hoare triple {12215#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-15 11:43:27,595 INFO L290 TraceCheckUtils]: 50: Hoare triple {12215#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-15 11:43:27,595 INFO L290 TraceCheckUtils]: 51: Hoare triple {12215#false} assume 8448 == #t~mem68;havoc #t~mem68; {12215#false} is VALID [2022-04-15 11:43:27,596 INFO L290 TraceCheckUtils]: 52: Hoare triple {12215#false} assume !(~num1~0 > 0); {12215#false} is VALID [2022-04-15 11:43:27,596 INFO L290 TraceCheckUtils]: 53: Hoare triple {12215#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; {12215#false} is VALID [2022-04-15 11:43:27,596 INFO L290 TraceCheckUtils]: 54: Hoare triple {12215#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); {12215#false} is VALID [2022-04-15 11:43:27,596 INFO L290 TraceCheckUtils]: 55: Hoare triple {12215#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {12215#false} is VALID [2022-04-15 11:43:27,596 INFO L290 TraceCheckUtils]: 56: Hoare triple {12215#false} ~skip~0 := 0; {12215#false} is VALID [2022-04-15 11:43:27,596 INFO L290 TraceCheckUtils]: 57: Hoare triple {12215#false} assume !false; {12215#false} is VALID [2022-04-15 11:43:27,596 INFO L290 TraceCheckUtils]: 58: Hoare triple {12215#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); {12215#false} is VALID [2022-04-15 11:43:27,596 INFO L290 TraceCheckUtils]: 59: Hoare triple {12215#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-15 11:43:27,597 INFO L290 TraceCheckUtils]: 60: Hoare triple {12215#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-15 11:43:27,597 INFO L290 TraceCheckUtils]: 61: Hoare triple {12215#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-15 11:43:27,597 INFO L290 TraceCheckUtils]: 62: Hoare triple {12215#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-15 11:43:27,597 INFO L290 TraceCheckUtils]: 63: Hoare triple {12215#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-15 11:43:27,597 INFO L290 TraceCheckUtils]: 64: Hoare triple {12215#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-15 11:43:27,597 INFO L290 TraceCheckUtils]: 65: Hoare triple {12215#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-15 11:43:27,597 INFO L290 TraceCheckUtils]: 66: Hoare triple {12215#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-15 11:43:27,597 INFO L290 TraceCheckUtils]: 67: Hoare triple {12215#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-15 11:43:27,597 INFO L290 TraceCheckUtils]: 68: Hoare triple {12215#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-15 11:43:27,598 INFO L290 TraceCheckUtils]: 69: Hoare triple {12215#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-15 11:43:27,598 INFO L290 TraceCheckUtils]: 70: Hoare triple {12215#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-15 11:43:27,598 INFO L290 TraceCheckUtils]: 71: Hoare triple {12215#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-15 11:43:27,598 INFO L290 TraceCheckUtils]: 72: Hoare triple {12215#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-15 11:43:27,598 INFO L290 TraceCheckUtils]: 73: Hoare triple {12215#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-15 11:43:27,598 INFO L290 TraceCheckUtils]: 74: Hoare triple {12215#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-15 11:43:27,598 INFO L290 TraceCheckUtils]: 75: Hoare triple {12215#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-15 11:43:27,598 INFO L290 TraceCheckUtils]: 76: Hoare triple {12215#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-15 11:43:27,598 INFO L290 TraceCheckUtils]: 77: Hoare triple {12215#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-15 11:43:27,599 INFO L290 TraceCheckUtils]: 78: Hoare triple {12215#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-15 11:43:27,599 INFO L290 TraceCheckUtils]: 79: Hoare triple {12215#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-15 11:43:27,599 INFO L290 TraceCheckUtils]: 80: Hoare triple {12215#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-15 11:43:27,599 INFO L290 TraceCheckUtils]: 81: Hoare triple {12215#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-15 11:43:27,599 INFO L290 TraceCheckUtils]: 82: Hoare triple {12215#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-15 11:43:27,599 INFO L290 TraceCheckUtils]: 83: Hoare triple {12215#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-15 11:43:27,599 INFO L290 TraceCheckUtils]: 84: Hoare triple {12215#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-15 11:43:27,599 INFO L290 TraceCheckUtils]: 85: Hoare triple {12215#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-15 11:43:27,599 INFO L290 TraceCheckUtils]: 86: Hoare triple {12215#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {12215#false} is VALID [2022-04-15 11:43:27,600 INFO L290 TraceCheckUtils]: 87: Hoare triple {12215#false} assume 8640 == #t~mem75;havoc #t~mem75; {12215#false} is VALID [2022-04-15 11:43:27,600 INFO L290 TraceCheckUtils]: 88: Hoare triple {12215#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {12215#false} is VALID [2022-04-15 11:43:27,600 INFO L290 TraceCheckUtils]: 89: Hoare triple {12215#false} assume !(4 == ~blastFlag~0); {12215#false} is VALID [2022-04-15 11:43:27,600 INFO L290 TraceCheckUtils]: 90: Hoare triple {12215#false} assume !false; {12215#false} is VALID [2022-04-15 11:43:27,600 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-15 11:43:27,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:43:27,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326030719] [2022-04-15 11:43:27,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326030719] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:43:27,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:43:27,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:43:27,601 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:43:27,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1192808358] [2022-04-15 11:43:27,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1192808358] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:43:27,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:43:27,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:43:27,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955354161] [2022-04-15 11:43:27,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:43:27,602 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 91 [2022-04-15 11:43:27,602 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:43:27,603 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:43:27,657 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:43:27,657 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:43:27,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:43:27,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:43:27,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:43:27,658 INFO L87 Difference]: Start difference. First operand 246 states and 394 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:43:32,029 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:43:33,651 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:43:35,655 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:43:36,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:43:36,548 INFO L93 Difference]: Finished difference Result 480 states and 771 transitions. [2022-04-15 11:43:36,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:43:36,549 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 91 [2022-04-15 11:43:36,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:43:36,549 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:43:36,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 433 transitions. [2022-04-15 11:43:36,552 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:43:36,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 433 transitions. [2022-04-15 11:43:36,555 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 433 transitions. [2022-04-15 11:43:36,905 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 433 edges. 433 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:43:36,910 INFO L225 Difference]: With dead ends: 480 [2022-04-15 11:43:36,910 INFO L226 Difference]: Without dead ends: 260 [2022-04-15 11:43:36,911 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:43:36,912 INFO L913 BasicCegarLoop]: 184 mSDtfsCounter, 20 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:43:36,912 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 471 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 351 Invalid, 1 Unknown, 0 Unchecked, 5.2s Time] [2022-04-15 11:43:36,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-04-15 11:43:36,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 246. [2022-04-15 11:43:36,922 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:43:36,922 INFO L82 GeneralOperation]: Start isEquivalent. First operand 260 states. Second operand has 246 states, 241 states have (on average 1.6141078838174274) internal successors, (389), 241 states have internal predecessors, (389), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:36,924 INFO L74 IsIncluded]: Start isIncluded. First operand 260 states. Second operand has 246 states, 241 states have (on average 1.6141078838174274) internal successors, (389), 241 states have internal predecessors, (389), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:36,924 INFO L87 Difference]: Start difference. First operand 260 states. Second operand has 246 states, 241 states have (on average 1.6141078838174274) internal successors, (389), 241 states have internal predecessors, (389), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:36,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:43:36,931 INFO L93 Difference]: Finished difference Result 260 states and 411 transitions. [2022-04-15 11:43:36,931 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 411 transitions. [2022-04-15 11:43:36,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:43:36,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:43:36,933 INFO L74 IsIncluded]: Start isIncluded. First operand has 246 states, 241 states have (on average 1.6141078838174274) internal successors, (389), 241 states have internal predecessors, (389), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 260 states. [2022-04-15 11:43:36,933 INFO L87 Difference]: Start difference. First operand has 246 states, 241 states have (on average 1.6141078838174274) internal successors, (389), 241 states have internal predecessors, (389), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 260 states. [2022-04-15 11:43:36,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:43:36,940 INFO L93 Difference]: Finished difference Result 260 states and 411 transitions. [2022-04-15 11:43:36,940 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 411 transitions. [2022-04-15 11:43:36,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:43:36,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:43:36,940 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:43:36,940 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:43:36,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 241 states have (on average 1.6141078838174274) internal successors, (389), 241 states have internal predecessors, (389), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:36,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 393 transitions. [2022-04-15 11:43:36,947 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 393 transitions. Word has length 91 [2022-04-15 11:43:36,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:43:36,947 INFO L478 AbstractCegarLoop]: Abstraction has 246 states and 393 transitions. [2022-04-15 11:43:36,947 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:43:36,947 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 246 states and 393 transitions. [2022-04-15 11:43:37,321 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 393 edges. 393 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:43:37,322 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 393 transitions. [2022-04-15 11:43:37,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-15 11:43:37,323 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:43:37,323 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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:43:37,323 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 11:43:37,323 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:43:37,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:43:37,323 INFO L85 PathProgramCache]: Analyzing trace with hash -370582543, now seen corresponding path program 1 times [2022-04-15 11:43:37,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:43:37,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [893755990] [2022-04-15 11:43:37,366 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:43:37,366 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:43:37,366 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:43:37,367 INFO L85 PathProgramCache]: Analyzing trace with hash -370582543, now seen corresponding path program 2 times [2022-04-15 11:43:37,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:43:37,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336478483] [2022-04-15 11:43:37,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:43:37,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:43:37,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:43:37,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:43:37,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:43:37,486 INFO L290 TraceCheckUtils]: 0: Hoare triple {14205#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {14198#true} is VALID [2022-04-15 11:43:37,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {14198#true} assume true; {14198#true} is VALID [2022-04-15 11:43:37,487 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14198#true} {14198#true} #673#return; {14198#true} is VALID [2022-04-15 11:43:37,488 INFO L272 TraceCheckUtils]: 0: Hoare triple {14198#true} call ULTIMATE.init(); {14205#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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:43:37,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {14205#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {14198#true} is VALID [2022-04-15 11:43:37,488 INFO L290 TraceCheckUtils]: 2: Hoare triple {14198#true} assume true; {14198#true} is VALID [2022-04-15 11:43:37,488 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14198#true} {14198#true} #673#return; {14198#true} is VALID [2022-04-15 11:43:37,488 INFO L272 TraceCheckUtils]: 4: Hoare triple {14198#true} call #t~ret161 := main(); {14198#true} is VALID [2022-04-15 11:43:37,488 INFO L290 TraceCheckUtils]: 5: Hoare triple {14198#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; {14198#true} is VALID [2022-04-15 11:43:37,488 INFO L290 TraceCheckUtils]: 6: Hoare triple {14198#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {14198#true} is VALID [2022-04-15 11:43:37,489 INFO L272 TraceCheckUtils]: 7: Hoare triple {14198#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {14198#true} is VALID [2022-04-15 11:43:37,491 INFO L290 TraceCheckUtils]: 8: Hoare triple {14198#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); {14203#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:43:37,491 INFO L290 TraceCheckUtils]: 9: Hoare triple {14203#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {14203#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:43:37,492 INFO L290 TraceCheckUtils]: 10: Hoare triple {14203#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {14203#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:43:37,493 INFO L290 TraceCheckUtils]: 11: Hoare triple {14203#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {14203#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:43:37,493 INFO L290 TraceCheckUtils]: 12: Hoare triple {14203#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {14203#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:43:37,494 INFO L290 TraceCheckUtils]: 13: Hoare triple {14203#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {14203#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:43:37,494 INFO L290 TraceCheckUtils]: 14: Hoare triple {14203#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {14203#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:43:37,494 INFO L290 TraceCheckUtils]: 15: Hoare triple {14203#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {14203#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:43:37,495 INFO L290 TraceCheckUtils]: 16: Hoare triple {14203#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {14203#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:43:37,495 INFO L290 TraceCheckUtils]: 17: Hoare triple {14203#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {14203#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:43:37,496 INFO L290 TraceCheckUtils]: 18: Hoare triple {14203#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {14203#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:43:37,496 INFO L290 TraceCheckUtils]: 19: Hoare triple {14203#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {14203#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:43:37,497 INFO L290 TraceCheckUtils]: 20: Hoare triple {14203#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {14203#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:43:37,497 INFO L290 TraceCheckUtils]: 21: Hoare triple {14203#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {14203#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:43:37,497 INFO L290 TraceCheckUtils]: 22: Hoare triple {14203#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {14204#(not (= |ssl3_accept_#t~mem54| 8482))} is VALID [2022-04-15 11:43:37,498 INFO L290 TraceCheckUtils]: 23: Hoare triple {14204#(not (= |ssl3_accept_#t~mem54| 8482))} assume 8482 == #t~mem54;havoc #t~mem54; {14199#false} is VALID [2022-04-15 11:43:37,498 INFO L290 TraceCheckUtils]: 24: Hoare triple {14199#false} call write~int(3, ~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-15 11:43:37,498 INFO L290 TraceCheckUtils]: 25: Hoare triple {14199#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); {14199#false} is VALID [2022-04-15 11:43:37,498 INFO L290 TraceCheckUtils]: 26: Hoare triple {14199#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {14199#false} is VALID [2022-04-15 11:43:37,498 INFO L290 TraceCheckUtils]: 27: Hoare triple {14199#false} ~skip~0 := 0; {14199#false} is VALID [2022-04-15 11:43:37,498 INFO L290 TraceCheckUtils]: 28: Hoare triple {14199#false} assume !false; {14199#false} is VALID [2022-04-15 11:43:37,499 INFO L290 TraceCheckUtils]: 29: Hoare triple {14199#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); {14199#false} is VALID [2022-04-15 11:43:37,499 INFO L290 TraceCheckUtils]: 30: Hoare triple {14199#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-15 11:43:37,499 INFO L290 TraceCheckUtils]: 31: Hoare triple {14199#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-15 11:43:37,499 INFO L290 TraceCheckUtils]: 32: Hoare triple {14199#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-15 11:43:37,499 INFO L290 TraceCheckUtils]: 33: Hoare triple {14199#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-15 11:43:37,499 INFO L290 TraceCheckUtils]: 34: Hoare triple {14199#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-15 11:43:37,499 INFO L290 TraceCheckUtils]: 35: Hoare triple {14199#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-15 11:43:37,499 INFO L290 TraceCheckUtils]: 36: Hoare triple {14199#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-15 11:43:37,499 INFO L290 TraceCheckUtils]: 37: Hoare triple {14199#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-15 11:43:37,499 INFO L290 TraceCheckUtils]: 38: Hoare triple {14199#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-15 11:43:37,500 INFO L290 TraceCheckUtils]: 39: Hoare triple {14199#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-15 11:43:37,500 INFO L290 TraceCheckUtils]: 40: Hoare triple {14199#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-15 11:43:37,500 INFO L290 TraceCheckUtils]: 41: Hoare triple {14199#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-15 11:43:37,500 INFO L290 TraceCheckUtils]: 42: Hoare triple {14199#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-15 11:43:37,500 INFO L290 TraceCheckUtils]: 43: Hoare triple {14199#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-15 11:43:37,500 INFO L290 TraceCheckUtils]: 44: Hoare triple {14199#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-15 11:43:37,500 INFO L290 TraceCheckUtils]: 45: Hoare triple {14199#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-15 11:43:37,500 INFO L290 TraceCheckUtils]: 46: Hoare triple {14199#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-15 11:43:37,500 INFO L290 TraceCheckUtils]: 47: Hoare triple {14199#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-15 11:43:37,500 INFO L290 TraceCheckUtils]: 48: Hoare triple {14199#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-15 11:43:37,501 INFO L290 TraceCheckUtils]: 49: Hoare triple {14199#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-15 11:43:37,501 INFO L290 TraceCheckUtils]: 50: Hoare triple {14199#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-15 11:43:37,501 INFO L290 TraceCheckUtils]: 51: Hoare triple {14199#false} assume 8448 == #t~mem68;havoc #t~mem68; {14199#false} is VALID [2022-04-15 11:43:37,501 INFO L290 TraceCheckUtils]: 52: Hoare triple {14199#false} assume !(~num1~0 > 0); {14199#false} is VALID [2022-04-15 11:43:37,501 INFO L290 TraceCheckUtils]: 53: Hoare triple {14199#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; {14199#false} is VALID [2022-04-15 11:43:37,501 INFO L290 TraceCheckUtils]: 54: Hoare triple {14199#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); {14199#false} is VALID [2022-04-15 11:43:37,501 INFO L290 TraceCheckUtils]: 55: Hoare triple {14199#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {14199#false} is VALID [2022-04-15 11:43:37,501 INFO L290 TraceCheckUtils]: 56: Hoare triple {14199#false} ~skip~0 := 0; {14199#false} is VALID [2022-04-15 11:43:37,501 INFO L290 TraceCheckUtils]: 57: Hoare triple {14199#false} assume !false; {14199#false} is VALID [2022-04-15 11:43:37,502 INFO L290 TraceCheckUtils]: 58: Hoare triple {14199#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); {14199#false} is VALID [2022-04-15 11:43:37,502 INFO L290 TraceCheckUtils]: 59: Hoare triple {14199#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-15 11:43:37,502 INFO L290 TraceCheckUtils]: 60: Hoare triple {14199#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-15 11:43:37,502 INFO L290 TraceCheckUtils]: 61: Hoare triple {14199#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-15 11:43:37,502 INFO L290 TraceCheckUtils]: 62: Hoare triple {14199#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-15 11:43:37,502 INFO L290 TraceCheckUtils]: 63: Hoare triple {14199#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-15 11:43:37,502 INFO L290 TraceCheckUtils]: 64: Hoare triple {14199#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-15 11:43:37,502 INFO L290 TraceCheckUtils]: 65: Hoare triple {14199#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-15 11:43:37,502 INFO L290 TraceCheckUtils]: 66: Hoare triple {14199#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-15 11:43:37,503 INFO L290 TraceCheckUtils]: 67: Hoare triple {14199#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-15 11:43:37,503 INFO L290 TraceCheckUtils]: 68: Hoare triple {14199#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-15 11:43:37,503 INFO L290 TraceCheckUtils]: 69: Hoare triple {14199#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-15 11:43:37,503 INFO L290 TraceCheckUtils]: 70: Hoare triple {14199#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-15 11:43:37,503 INFO L290 TraceCheckUtils]: 71: Hoare triple {14199#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-15 11:43:37,503 INFO L290 TraceCheckUtils]: 72: Hoare triple {14199#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-15 11:43:37,503 INFO L290 TraceCheckUtils]: 73: Hoare triple {14199#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-15 11:43:37,503 INFO L290 TraceCheckUtils]: 74: Hoare triple {14199#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-15 11:43:37,503 INFO L290 TraceCheckUtils]: 75: Hoare triple {14199#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-15 11:43:37,504 INFO L290 TraceCheckUtils]: 76: Hoare triple {14199#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-15 11:43:37,504 INFO L290 TraceCheckUtils]: 77: Hoare triple {14199#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-15 11:43:37,504 INFO L290 TraceCheckUtils]: 78: Hoare triple {14199#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-15 11:43:37,504 INFO L290 TraceCheckUtils]: 79: Hoare triple {14199#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-15 11:43:37,504 INFO L290 TraceCheckUtils]: 80: Hoare triple {14199#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-15 11:43:37,504 INFO L290 TraceCheckUtils]: 81: Hoare triple {14199#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-15 11:43:37,504 INFO L290 TraceCheckUtils]: 82: Hoare triple {14199#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-15 11:43:37,504 INFO L290 TraceCheckUtils]: 83: Hoare triple {14199#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-15 11:43:37,504 INFO L290 TraceCheckUtils]: 84: Hoare triple {14199#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-15 11:43:37,504 INFO L290 TraceCheckUtils]: 85: Hoare triple {14199#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-15 11:43:37,505 INFO L290 TraceCheckUtils]: 86: Hoare triple {14199#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {14199#false} is VALID [2022-04-15 11:43:37,505 INFO L290 TraceCheckUtils]: 87: Hoare triple {14199#false} assume 8640 == #t~mem75;havoc #t~mem75; {14199#false} is VALID [2022-04-15 11:43:37,505 INFO L290 TraceCheckUtils]: 88: Hoare triple {14199#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {14199#false} is VALID [2022-04-15 11:43:37,505 INFO L290 TraceCheckUtils]: 89: Hoare triple {14199#false} assume !(4 == ~blastFlag~0); {14199#false} is VALID [2022-04-15 11:43:37,505 INFO L290 TraceCheckUtils]: 90: Hoare triple {14199#false} assume !false; {14199#false} is VALID [2022-04-15 11:43:37,505 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-15 11:43:37,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:43:37,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336478483] [2022-04-15 11:43:37,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336478483] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:43:37,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:43:37,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:43:37,506 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:43:37,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [893755990] [2022-04-15 11:43:37,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [893755990] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:43:37,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:43:37,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:43:37,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237456346] [2022-04-15 11:43:37,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:43:37,507 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 91 [2022-04-15 11:43:37,507 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:43:37,508 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:43:37,565 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:43:37,566 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:43:37,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:43:37,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:43:37,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:43:37,567 INFO L87 Difference]: Start difference. First operand 246 states and 393 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:43:41,076 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:43:43,105 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:43:44,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:43:44,269 INFO L93 Difference]: Finished difference Result 540 states and 854 transitions. [2022-04-15 11:43:44,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:43:44,269 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 91 [2022-04-15 11:43:44,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:43:44,269 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:43:44,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 574 transitions. [2022-04-15 11:43:44,273 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:43:44,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 574 transitions. [2022-04-15 11:43:44,279 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 574 transitions. [2022-04-15 11:43:44,761 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 574 edges. 574 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:43:44,767 INFO L225 Difference]: With dead ends: 540 [2022-04-15 11:43:44,767 INFO L226 Difference]: Without dead ends: 320 [2022-04-15 11:43:44,768 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:43:44,768 INFO L913 BasicCegarLoop]: 120 mSDtfsCounter, 135 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 61 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-04-15 11:43:44,768 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 342 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 475 Invalid, 2 Unknown, 0 Unchecked, 5.5s Time] [2022-04-15 11:43:44,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2022-04-15 11:43:44,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 246. [2022-04-15 11:43:44,779 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:43:44,780 INFO L82 GeneralOperation]: Start isEquivalent. First operand 320 states. Second operand has 246 states, 241 states have (on average 1.6016597510373445) internal successors, (386), 241 states have internal predecessors, (386), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:44,781 INFO L74 IsIncluded]: Start isIncluded. First operand 320 states. Second operand has 246 states, 241 states have (on average 1.6016597510373445) internal successors, (386), 241 states have internal predecessors, (386), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:44,781 INFO L87 Difference]: Start difference. First operand 320 states. Second operand has 246 states, 241 states have (on average 1.6016597510373445) internal successors, (386), 241 states have internal predecessors, (386), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:44,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:43:44,788 INFO L93 Difference]: Finished difference Result 320 states and 492 transitions. [2022-04-15 11:43:44,788 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 492 transitions. [2022-04-15 11:43:44,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:43:44,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:43:44,790 INFO L74 IsIncluded]: Start isIncluded. First operand has 246 states, 241 states have (on average 1.6016597510373445) internal successors, (386), 241 states have internal predecessors, (386), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 320 states. [2022-04-15 11:43:44,791 INFO L87 Difference]: Start difference. First operand has 246 states, 241 states have (on average 1.6016597510373445) internal successors, (386), 241 states have internal predecessors, (386), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 320 states. [2022-04-15 11:43:44,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:43:44,797 INFO L93 Difference]: Finished difference Result 320 states and 492 transitions. [2022-04-15 11:43:44,797 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 492 transitions. [2022-04-15 11:43:44,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:43:44,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:43:44,798 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:43:44,798 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:43:44,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 241 states have (on average 1.6016597510373445) internal successors, (386), 241 states have internal predecessors, (386), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:44,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 390 transitions. [2022-04-15 11:43:44,804 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 390 transitions. Word has length 91 [2022-04-15 11:43:44,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:43:44,804 INFO L478 AbstractCegarLoop]: Abstraction has 246 states and 390 transitions. [2022-04-15 11:43:44,804 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:43:44,804 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 246 states and 390 transitions. [2022-04-15 11:43:45,089 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 390 edges. 390 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:43:45,090 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 390 transitions. [2022-04-15 11:43:45,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-04-15 11:43:45,091 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:43:45,091 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:43:45,091 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-15 11:43:45,091 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:43:45,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:43:45,092 INFO L85 PathProgramCache]: Analyzing trace with hash 2098405732, now seen corresponding path program 1 times [2022-04-15 11:43:45,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:43:45,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [497060762] [2022-04-15 11:43:45,365 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:43:45,367 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:43:45,367 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:43:45,368 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 11:43:45,370 INFO L85 PathProgramCache]: Analyzing trace with hash -717890858, now seen corresponding path program 1 times [2022-04-15 11:43:45,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:43:45,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756211339] [2022-04-15 11:43:45,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:43:45,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:43:45,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:43:45,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:43:45,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:43:45,565 INFO L290 TraceCheckUtils]: 0: Hoare triple {16429#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {16422#true} is VALID [2022-04-15 11:43:45,565 INFO L290 TraceCheckUtils]: 1: Hoare triple {16422#true} assume true; {16422#true} is VALID [2022-04-15 11:43:45,565 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16422#true} {16422#true} #673#return; {16422#true} is VALID [2022-04-15 11:43:45,566 INFO L272 TraceCheckUtils]: 0: Hoare triple {16422#true} call ULTIMATE.init(); {16429#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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:43:45,566 INFO L290 TraceCheckUtils]: 1: Hoare triple {16429#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {16422#true} is VALID [2022-04-15 11:43:45,566 INFO L290 TraceCheckUtils]: 2: Hoare triple {16422#true} assume true; {16422#true} is VALID [2022-04-15 11:43:45,566 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16422#true} {16422#true} #673#return; {16422#true} is VALID [2022-04-15 11:43:45,567 INFO L272 TraceCheckUtils]: 4: Hoare triple {16422#true} call #t~ret161 := main(); {16422#true} is VALID [2022-04-15 11:43:45,567 INFO L290 TraceCheckUtils]: 5: Hoare triple {16422#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; {16422#true} is VALID [2022-04-15 11:43:45,567 INFO L290 TraceCheckUtils]: 6: Hoare triple {16422#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {16422#true} is VALID [2022-04-15 11:43:45,567 INFO L272 TraceCheckUtils]: 7: Hoare triple {16422#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {16422#true} is VALID [2022-04-15 11:43:45,569 INFO L290 TraceCheckUtils]: 8: Hoare triple {16422#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); {16427#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:45,570 INFO L290 TraceCheckUtils]: 9: Hoare triple {16427#(= 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; {16427#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:45,571 INFO L290 TraceCheckUtils]: 10: Hoare triple {16427#(= 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; {16427#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:45,571 INFO L290 TraceCheckUtils]: 11: Hoare triple {16427#(= 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)))); {16427#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:45,572 INFO L290 TraceCheckUtils]: 12: Hoare triple {16427#(= 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); {16427#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:45,572 INFO L290 TraceCheckUtils]: 13: Hoare triple {16427#(= 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; {16427#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:45,573 INFO L290 TraceCheckUtils]: 14: Hoare triple {16427#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} [679] L1167-2-->L1168_primed: Formula: (let ((.cse0 (= |v_ssl3_accept_#t~mem46_16| |v_ssl3_accept_#t~mem46_14|)) (.cse1 (= |v_ssl3_accept_#t~mem151_32| |v_ssl3_accept_#t~mem151_28|)) (.cse2 (= |v_ssl3_accept_#t~mem88.offset_6| |v_ssl3_accept_#t~mem88.offset_5|)) (.cse3 (= v_ssl3_accept_~skip~0_26 v_ssl3_accept_~skip~0_24)) (.cse4 (= |v_#memory_$Pointer$.offset_322| |v_#memory_$Pointer$.offset_314|)) (.cse5 (= |v_ssl3_accept_#t~mem88.base_6| |v_ssl3_accept_#t~mem88.base_5|)) (.cse6 (= |v_ssl3_accept_#t~mem83.base_12| |v_ssl3_accept_#t~mem83.base_10|)) (.cse7 (= |v_ssl3_accept_#t~mem82_12| |v_ssl3_accept_#t~mem82_10|)) (.cse8 (= |v_ssl3_accept_#t~mem83.offset_12| |v_ssl3_accept_#t~mem83.offset_10|)) (.cse9 (= |v_ssl3_accept_#t~mem48_30| |v_ssl3_accept_#t~mem48_26|)) (.cse10 (= |v_ssl3_accept_#t~mem85_12| |v_ssl3_accept_#t~mem85_10|)) (.cse11 (= v_ssl3_accept_~state~0_18 v_ssl3_accept_~state~0_16)) (.cse12 (= |v_#memory_$Pointer$.base_322| |v_#memory_$Pointer$.base_314|)) (.cse13 (= |v_ssl3_accept_#t~mem89_6| |v_ssl3_accept_#t~mem89_5|))) (or (and (= |v_#memory_int_310| |v_#memory_int_303|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |v_ssl3_accept_#t~mem150.base_30| |v_ssl3_accept_#t~mem150.base_26|) (= |v_ssl3_accept_#t~mem150.offset_30| |v_ssl3_accept_#t~mem150.offset_26|) .cse6 .cse7 (= |v_ssl3_accept_#t~mem49_28| |v_ssl3_accept_#t~mem49_24|) .cse8 .cse9 .cse10 .cse11 .cse12 (= |v_ssl3_accept_#t~mem47_32| |v_ssl3_accept_#t~mem47_28|) .cse13) (and .cse0 .cse1 .cse2 (= |v_#memory_int_303| |v_#memory_int_310|) .cse3 .cse4 .cse5 (= |v_ssl3_accept_#t~mem150.base_26| |v_ssl3_accept_#t~mem150.base_30|) (= |v_ssl3_accept_#t~mem49_24| |v_ssl3_accept_#t~mem49_28|) .cse6 .cse7 .cse8 (= |v_ssl3_accept_#t~mem47_28| |v_ssl3_accept_#t~mem47_32|) .cse9 (= |v_ssl3_accept_#t~mem150.offset_26| |v_ssl3_accept_#t~mem150.offset_30|) .cse10 .cse11 .cse12 .cse13))) InVars {ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_12|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_322|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_12|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_12|, 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_6|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_12|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_28|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_30|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_30|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_32|, 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_6|, #memory_int=|v_#memory_int_310|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_6|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_322|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_18} OutVars{ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_10|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_314|, 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_28|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_26|, 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~mem49=|v_ssl3_accept_#t~mem49_24|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_26|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_26|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_28|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_14|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_24, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_5|, #memory_int=|v_#memory_int_303|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_5|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_314|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_16} 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] {16427#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:45,574 INFO L290 TraceCheckUtils]: 15: Hoare triple {16427#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} [680] L1168_primed-->L1167-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16427#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:45,575 INFO L290 TraceCheckUtils]: 16: Hoare triple {16427#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} [681] L1167-2-->L1168_primed: Formula: (or (let ((.cse6 (select |v_#memory_int_309| v_ssl3_accept_~s.base_114)) (.cse2 (+ 52 v_ssl3_accept_~s.offset_114))) (let ((.cse3 (select |v_#memory_$Pointer$.base_320| v_ssl3_accept_~s.base_114)) (.cse1 (select |v_#memory_$Pointer$.base_321| v_ssl3_accept_~s.base_114)) (.cse4 (+ 84 v_ssl3_accept_~s.offset_114)) (.cse7 (select |v_#memory_$Pointer$.offset_321| v_ssl3_accept_~s.base_114)) (.cse5 (select |v_#memory_$Pointer$.offset_320| v_ssl3_accept_~s.base_114)) (.cse0 (select .cse6 .cse2))) (and (= 8448 .cse0) (not (= 8465 .cse0)) (not (= 8544 .cse0)) (not (= 8528 .cse0)) (not (= .cse0 8480)) (not (= 8497 .cse0)) (not (= .cse0 8481)) (not (= 8545 .cse0)) (= v_ssl3_accept_~skip~0_25 0) (= (store |v_#memory_$Pointer$.base_321| v_ssl3_accept_~s.base_114 (store .cse1 .cse2 (select .cse3 .cse2))) |v_#memory_$Pointer$.base_320|) (not (= (select (select |v_#memory_int_308| (select .cse3 .cse4)) (+ 848 (select .cse5 .cse4))) 0)) (not (= 8560 .cse0)) (not (= 8496 .cse0)) (not (= .cse0 8561)) (not (= .cse0 8529)) (= (store |v_#memory_int_309| v_ssl3_accept_~s.base_114 (store .cse6 .cse2 (select (select |v_#memory_int_309| (select .cse1 .cse4)) (+ 844 (select .cse7 .cse4))))) |v_#memory_int_308|) (not (< 0 v_ssl3_accept_~num1~0_13)) (not (= 8466 .cse0)) (= (store |v_#memory_$Pointer$.offset_321| v_ssl3_accept_~s.base_114 (store .cse7 .cse2 (select .cse5 .cse2))) |v_#memory_$Pointer$.offset_320|) (not (= .cse0 8512)) (not (= 8195 .cse0)) (not (= 8464 .cse0)) (= .cse0 v_ssl3_accept_~state~0_17) (not (= 8513 .cse0)) (not (= 8192 .cse0)) (not (= .cse0 16384)) (not (= 24576 .cse0)) (not (= 12292 .cse0)) (not (= 8482 .cse0))))) (and (= v_ssl3_accept_~s.base_114 v_ssl3_accept_~s.base_114) (= |v_#memory_int_309| |v_#memory_int_308|) (= |v_#memory_$Pointer$.offset_321| |v_#memory_$Pointer$.offset_320|) (= |v_#memory_$Pointer$.base_321| |v_#memory_$Pointer$.base_320|) (= v_ssl3_accept_~s.offset_114 v_ssl3_accept_~s.offset_114) (= v_ssl3_accept_~num1~0_13 v_ssl3_accept_~num1~0_13))) InVars {ssl3_accept_~s.offset=v_ssl3_accept_~s.offset_114, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_321|, ssl3_accept_~num1~0=v_ssl3_accept_~num1~0_13, #memory_int=|v_#memory_int_309|, ssl3_accept_~s.base=v_ssl3_accept_~s.base_114, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_321|} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_320|, ssl3_accept_~num1~0=v_ssl3_accept_~num1~0_13, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_30|, ssl3_accept_#t~mem52=|v_ssl3_accept_#t~mem52_24|, ssl3_accept_#t~mem51=|v_ssl3_accept_#t~mem51_24|, ssl3_accept_#t~mem50=|v_ssl3_accept_#t~mem50_24|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_28|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_25, ssl3_accept_#t~mem53=|v_ssl3_accept_#t~mem53_22|, ssl3_accept_#t~mem54=|v_ssl3_accept_#t~mem54_20|, ssl3_accept_#t~mem55=|v_ssl3_accept_#t~mem55_18|, ssl3_accept_#t~mem133=|v_ssl3_accept_#t~mem133_9|, ssl3_accept_#t~mem56=|v_ssl3_accept_#t~mem56_18|, ssl3_accept_#t~mem57=|v_ssl3_accept_#t~mem57_18|, ssl3_accept_#t~mem132.offset=|v_ssl3_accept_#t~mem132.offset_9|, ssl3_accept_#t~mem58=|v_ssl3_accept_#t~mem58_18|, ssl3_accept_#t~mem59=|v_ssl3_accept_#t~mem59_18|, ssl3_accept_~s.offset=v_ssl3_accept_~s.offset_114, ssl3_accept_#t~mem60=|v_ssl3_accept_#t~mem60_18|, ssl3_accept_#t~mem61=|v_ssl3_accept_#t~mem61_18|, ssl3_accept_#t~mem62=|v_ssl3_accept_#t~mem62_18|, ssl3_accept_#t~mem132.base=|v_ssl3_accept_#t~mem132.base_9|, ssl3_accept_#t~mem63=|v_ssl3_accept_#t~mem63_18|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_28|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_26|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_28|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_30|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_15|, #memory_int=|v_#memory_int_308|, ssl3_accept_#t~mem64=|v_ssl3_accept_#t~mem64_18|, ssl3_accept_#t~mem65=|v_ssl3_accept_#t~mem65_18|, ssl3_accept_#t~mem66=|v_ssl3_accept_#t~mem66_18|, ssl3_accept_#t~mem67=|v_ssl3_accept_#t~mem67_18|, ssl3_accept_#t~mem68=|v_ssl3_accept_#t~mem68_18|, ssl3_accept_~s.base=v_ssl3_accept_~s.base_114, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_320|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_17} AuxVars[] AssignedVars[#memory_$Pointer$.base, ssl3_accept_#t~mem151, ssl3_accept_#t~mem52, ssl3_accept_#t~mem51, ssl3_accept_#t~mem50, ssl3_accept_#t~mem150.offset, ssl3_accept_~skip~0, ssl3_accept_#t~mem53, ssl3_accept_#t~mem54, ssl3_accept_#t~mem55, ssl3_accept_#t~mem133, ssl3_accept_#t~mem56, ssl3_accept_#t~mem57, ssl3_accept_#t~mem132.offset, ssl3_accept_#t~mem58, ssl3_accept_#t~mem59, ssl3_accept_#t~mem60, ssl3_accept_#t~mem61, ssl3_accept_#t~mem62, ssl3_accept_#t~mem132.base, ssl3_accept_#t~mem63, ssl3_accept_#t~mem150.base, ssl3_accept_#t~mem49, ssl3_accept_#t~mem48, ssl3_accept_#t~mem47, ssl3_accept_#t~mem46, #memory_int, ssl3_accept_#t~mem64, ssl3_accept_#t~mem65, ssl3_accept_#t~mem66, ssl3_accept_#t~mem67, ssl3_accept_#t~mem68, #memory_$Pointer$.offset, ssl3_accept_~state~0] {16427#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:45,576 INFO L290 TraceCheckUtils]: 17: Hoare triple {16427#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} [678] L1168_primed-->L1168: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16427#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:45,576 INFO L290 TraceCheckUtils]: 18: Hoare triple {16427#(= 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); {16427#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:45,577 INFO L290 TraceCheckUtils]: 19: Hoare triple {16427#(= 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); {16427#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:45,577 INFO L290 TraceCheckUtils]: 20: Hoare triple {16427#(= 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); {16427#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:45,578 INFO L290 TraceCheckUtils]: 21: Hoare triple {16427#(= 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); {16427#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:45,578 INFO L290 TraceCheckUtils]: 22: Hoare triple {16427#(= 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); {16427#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:45,581 INFO L290 TraceCheckUtils]: 23: Hoare triple {16427#(= 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); {16427#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:45,582 INFO L290 TraceCheckUtils]: 24: Hoare triple {16427#(= 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); {16427#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:45,582 INFO L290 TraceCheckUtils]: 25: Hoare triple {16427#(= 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); {16427#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:45,583 INFO L290 TraceCheckUtils]: 26: Hoare triple {16427#(= 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); {16428#(= 8464 |ssl3_accept_#t~mem55|)} is VALID [2022-04-15 11:43:45,583 INFO L290 TraceCheckUtils]: 27: Hoare triple {16428#(= 8464 |ssl3_accept_#t~mem55|)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {16423#false} is VALID [2022-04-15 11:43:45,583 INFO L290 TraceCheckUtils]: 28: Hoare triple {16423#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {16423#false} is VALID [2022-04-15 11:43:45,583 INFO L290 TraceCheckUtils]: 29: Hoare triple {16423#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {16423#false} is VALID [2022-04-15 11:43:45,583 INFO L290 TraceCheckUtils]: 30: Hoare triple {16423#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {16423#false} is VALID [2022-04-15 11:43:45,584 INFO L290 TraceCheckUtils]: 31: Hoare triple {16423#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {16423#false} is VALID [2022-04-15 11:43:45,584 INFO L290 TraceCheckUtils]: 32: Hoare triple {16423#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {16423#false} is VALID [2022-04-15 11:43:45,584 INFO L290 TraceCheckUtils]: 33: Hoare triple {16423#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {16423#false} is VALID [2022-04-15 11:43:45,584 INFO L290 TraceCheckUtils]: 34: Hoare triple {16423#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {16423#false} is VALID [2022-04-15 11:43:45,584 INFO L290 TraceCheckUtils]: 35: Hoare triple {16423#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {16423#false} is VALID [2022-04-15 11:43:45,584 INFO L290 TraceCheckUtils]: 36: Hoare triple {16423#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {16423#false} is VALID [2022-04-15 11:43:45,584 INFO L290 TraceCheckUtils]: 37: Hoare triple {16423#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {16423#false} is VALID [2022-04-15 11:43:45,584 INFO L290 TraceCheckUtils]: 38: Hoare triple {16423#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {16423#false} is VALID [2022-04-15 11:43:45,584 INFO L290 TraceCheckUtils]: 39: Hoare triple {16423#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {16423#false} is VALID [2022-04-15 11:43:45,584 INFO L290 TraceCheckUtils]: 40: Hoare triple {16423#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {16423#false} is VALID [2022-04-15 11:43:45,585 INFO L290 TraceCheckUtils]: 41: Hoare triple {16423#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {16423#false} is VALID [2022-04-15 11:43:45,585 INFO L290 TraceCheckUtils]: 42: Hoare triple {16423#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {16423#false} is VALID [2022-04-15 11:43:45,585 INFO L290 TraceCheckUtils]: 43: Hoare triple {16423#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {16423#false} is VALID [2022-04-15 11:43:45,585 INFO L290 TraceCheckUtils]: 44: Hoare triple {16423#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {16423#false} is VALID [2022-04-15 11:43:45,585 INFO L290 TraceCheckUtils]: 45: Hoare triple {16423#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {16423#false} is VALID [2022-04-15 11:43:45,585 INFO L290 TraceCheckUtils]: 46: Hoare triple {16423#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {16423#false} is VALID [2022-04-15 11:43:45,585 INFO L290 TraceCheckUtils]: 47: Hoare triple {16423#false} assume 8640 == #t~mem75;havoc #t~mem75; {16423#false} is VALID [2022-04-15 11:43:45,585 INFO L290 TraceCheckUtils]: 48: Hoare triple {16423#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {16423#false} is VALID [2022-04-15 11:43:45,585 INFO L290 TraceCheckUtils]: 49: Hoare triple {16423#false} assume !(4 == ~blastFlag~0); {16423#false} is VALID [2022-04-15 11:43:45,585 INFO L290 TraceCheckUtils]: 50: Hoare triple {16423#false} assume !false; {16423#false} is VALID [2022-04-15 11:43:45,586 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 11:43:45,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:43:45,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756211339] [2022-04-15 11:43:45,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756211339] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:43:45,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:43:45,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:43:45,702 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:43:45,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [497060762] [2022-04-15 11:43:45,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [497060762] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:43:45,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:43:45,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 11:43:45,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041256765] [2022-04-15 11:43:45,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:43:45,703 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 7 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2022-04-15 11:43:45,703 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:43:45,703 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 9.125) internal successors, (73), 7 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:45,774 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:43:45,774 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 11:43:45,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:43:45,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 11:43:45,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-15 11:43:45,775 INFO L87 Difference]: Start difference. First operand 246 states and 390 transitions. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 7 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:49,010 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:43:51,015 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:43:53,049 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:43:57,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:43:57,914 INFO L93 Difference]: Finished difference Result 479 states and 764 transitions. [2022-04-15 11:43:57,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 11:43:57,914 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 7 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2022-04-15 11:43:57,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:43:57,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 7 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:57,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 430 transitions. [2022-04-15 11:43:57,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 7 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:57,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 430 transitions. [2022-04-15 11:43:57,920 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 430 transitions. [2022-04-15 11:43:58,208 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 430 edges. 430 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:43:58,213 INFO L225 Difference]: With dead ends: 479 [2022-04-15 11:43:58,213 INFO L226 Difference]: Without dead ends: 259 [2022-04-15 11:43:58,213 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-15 11:43:58,214 INFO L913 BasicCegarLoop]: 184 mSDtfsCounter, 16 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-04-15 11:43:58,214 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 698 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 576 Invalid, 2 Unknown, 0 Unchecked, 6.6s Time] [2022-04-15 11:43:58,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-04-15 11:43:58,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 246. [2022-04-15 11:43:58,224 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:43:58,225 INFO L82 GeneralOperation]: Start isEquivalent. First operand 259 states. Second operand has 246 states, 241 states have (on average 1.5975103734439835) internal successors, (385), 241 states have internal predecessors, (385), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:58,225 INFO L74 IsIncluded]: Start isIncluded. First operand 259 states. Second operand has 246 states, 241 states have (on average 1.5975103734439835) internal successors, (385), 241 states have internal predecessors, (385), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:58,226 INFO L87 Difference]: Start difference. First operand 259 states. Second operand has 246 states, 241 states have (on average 1.5975103734439835) internal successors, (385), 241 states have internal predecessors, (385), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:58,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:43:58,230 INFO L93 Difference]: Finished difference Result 259 states and 406 transitions. [2022-04-15 11:43:58,230 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 406 transitions. [2022-04-15 11:43:58,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:43:58,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:43:58,232 INFO L74 IsIncluded]: Start isIncluded. First operand has 246 states, 241 states have (on average 1.5975103734439835) internal successors, (385), 241 states have internal predecessors, (385), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 259 states. [2022-04-15 11:43:58,232 INFO L87 Difference]: Start difference. First operand has 246 states, 241 states have (on average 1.5975103734439835) internal successors, (385), 241 states have internal predecessors, (385), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 259 states. [2022-04-15 11:43:58,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:43:58,237 INFO L93 Difference]: Finished difference Result 259 states and 406 transitions. [2022-04-15 11:43:58,237 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 406 transitions. [2022-04-15 11:43:58,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:43:58,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:43:58,237 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:43:58,237 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:43:58,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 241 states have (on average 1.5975103734439835) internal successors, (385), 241 states have internal predecessors, (385), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:58,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 389 transitions. [2022-04-15 11:43:58,243 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 389 transitions. Word has length 92 [2022-04-15 11:43:58,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:43:58,243 INFO L478 AbstractCegarLoop]: Abstraction has 246 states and 389 transitions. [2022-04-15 11:43:58,243 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 7 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:58,243 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 246 states and 389 transitions. [2022-04-15 11:43:58,541 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 389 edges. 389 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:43:58,541 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 389 transitions. [2022-04-15 11:43:58,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-04-15 11:43:58,542 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:43:58,542 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:43:58,542 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-15 11:43:58,542 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:43:58,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:43:58,543 INFO L85 PathProgramCache]: Analyzing trace with hash 982003108, now seen corresponding path program 1 times [2022-04-15 11:43:58,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:43:58,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1662876984] [2022-04-15 11:43:58,747 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:43:58,748 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:43:58,748 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:43:58,749 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 11:43:58,750 INFO L85 PathProgramCache]: Analyzing trace with hash -2068571690, now seen corresponding path program 1 times [2022-04-15 11:43:58,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:43:58,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848781476] [2022-04-15 11:43:58,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:43:58,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:43:58,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:43:58,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:43:58,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:43:58,897 INFO L290 TraceCheckUtils]: 0: Hoare triple {18412#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {18405#true} is VALID [2022-04-15 11:43:58,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {18405#true} assume true; {18405#true} is VALID [2022-04-15 11:43:58,897 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18405#true} {18405#true} #673#return; {18405#true} is VALID [2022-04-15 11:43:58,898 INFO L272 TraceCheckUtils]: 0: Hoare triple {18405#true} call ULTIMATE.init(); {18412#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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:43:58,898 INFO L290 TraceCheckUtils]: 1: Hoare triple {18412#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {18405#true} is VALID [2022-04-15 11:43:58,898 INFO L290 TraceCheckUtils]: 2: Hoare triple {18405#true} assume true; {18405#true} is VALID [2022-04-15 11:43:58,898 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18405#true} {18405#true} #673#return; {18405#true} is VALID [2022-04-15 11:43:58,898 INFO L272 TraceCheckUtils]: 4: Hoare triple {18405#true} call #t~ret161 := main(); {18405#true} is VALID [2022-04-15 11:43:58,899 INFO L290 TraceCheckUtils]: 5: Hoare triple {18405#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; {18405#true} is VALID [2022-04-15 11:43:58,899 INFO L290 TraceCheckUtils]: 6: Hoare triple {18405#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {18405#true} is VALID [2022-04-15 11:43:58,899 INFO L272 TraceCheckUtils]: 7: Hoare triple {18405#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {18405#true} is VALID [2022-04-15 11:43:58,901 INFO L290 TraceCheckUtils]: 8: Hoare triple {18405#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); {18410#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:58,902 INFO L290 TraceCheckUtils]: 9: Hoare triple {18410#(= 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; {18410#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:58,903 INFO L290 TraceCheckUtils]: 10: Hoare triple {18410#(= 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; {18410#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:58,903 INFO L290 TraceCheckUtils]: 11: Hoare triple {18410#(= 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)))); {18410#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:58,903 INFO L290 TraceCheckUtils]: 12: Hoare triple {18410#(= 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); {18410#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:58,904 INFO L290 TraceCheckUtils]: 13: Hoare triple {18410#(= 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; {18410#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:58,905 INFO L290 TraceCheckUtils]: 14: Hoare triple {18410#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} [683] L1167-2-->L1168_primed: Formula: (let ((.cse0 (= |v_ssl3_accept_#t~mem85_18| |v_ssl3_accept_#t~mem85_16|)) (.cse1 (= v_ssl3_accept_~state~0_24 v_ssl3_accept_~state~0_22)) (.cse2 (= v_ssl3_accept_~skip~0_32 v_ssl3_accept_~skip~0_30)) (.cse3 (= |v_#memory_$Pointer$.offset_341| |v_#memory_$Pointer$.offset_333|)) (.cse4 (= |v_ssl3_accept_#t~mem82_18| |v_ssl3_accept_#t~mem82_16|)) (.cse5 (= |v_ssl3_accept_#t~mem89_11| |v_ssl3_accept_#t~mem89_10|)) (.cse6 (= |v_ssl3_accept_#t~mem47_41| |v_ssl3_accept_#t~mem47_37|)) (.cse7 (= |v_ssl3_accept_#t~mem150.base_38| |v_ssl3_accept_#t~mem150.base_34|)) (.cse8 (= |v_ssl3_accept_#t~mem83.base_18| |v_ssl3_accept_#t~mem83.base_16|)) (.cse9 (= |v_ssl3_accept_#t~mem50_30| |v_ssl3_accept_#t~mem50_26|)) (.cse10 (= |v_ssl3_accept_#t~mem49_37| |v_ssl3_accept_#t~mem49_33|)) (.cse11 (= |v_ssl3_accept_#t~mem88.offset_11| |v_ssl3_accept_#t~mem88.offset_10|)) (.cse12 (= |v_ssl3_accept_#t~mem150.offset_38| |v_ssl3_accept_#t~mem150.offset_34|)) (.cse13 (= |v_ssl3_accept_#t~mem46_22| |v_ssl3_accept_#t~mem46_20|)) (.cse14 (= |v_#memory_$Pointer$.base_341| |v_#memory_$Pointer$.base_333|))) (or (and (= |v_ssl3_accept_#t~mem83.offset_16| |v_ssl3_accept_#t~mem83.offset_18|) .cse0 (= |v_ssl3_accept_#t~mem48_35| |v_ssl3_accept_#t~mem48_39|) (= |v_ssl3_accept_#t~mem88.base_10| |v_ssl3_accept_#t~mem88.base_11|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= |v_#memory_int_321| |v_#memory_int_328|) .cse11 .cse12 .cse13 .cse14 (= |v_ssl3_accept_#t~mem151_36| |v_ssl3_accept_#t~mem151_40|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= |v_#memory_int_328| |v_#memory_int_321|) .cse8 .cse9 .cse10 .cse11 (= |v_ssl3_accept_#t~mem151_40| |v_ssl3_accept_#t~mem151_36|) .cse12 (= |v_ssl3_accept_#t~mem83.offset_18| |v_ssl3_accept_#t~mem83.offset_16|) .cse13 .cse14 (= |v_ssl3_accept_#t~mem88.base_11| |v_ssl3_accept_#t~mem88.base_10|) (= |v_ssl3_accept_#t~mem48_39| |v_ssl3_accept_#t~mem48_35|)))) InVars {ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_18|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_341|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_18|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_18|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_40|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_38|, ssl3_accept_#t~mem50=|v_ssl3_accept_#t~mem50_30|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_11|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_18|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_37|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_39|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_38|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_41|, 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_11|, #memory_int=|v_#memory_int_328|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_11|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_341|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_24} OutVars{ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_16|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_333|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_16|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_16|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_36|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_34|, ssl3_accept_#t~mem50=|v_ssl3_accept_#t~mem50_26|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_10|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_16|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_33|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_35|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_34|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_37|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_20|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_30, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_10|, #memory_int=|v_#memory_int_321|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_10|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_333|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_22} 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] {18410#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:58,905 INFO L290 TraceCheckUtils]: 15: Hoare triple {18410#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} [684] L1168_primed-->L1167-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18410#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:58,907 INFO L290 TraceCheckUtils]: 16: Hoare triple {18410#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} [685] L1167-2-->L1168_primed: Formula: (or (and (= |v_#memory_$Pointer$.base_340| |v_#memory_$Pointer$.base_339|) (= |v_#memory_int_327| |v_#memory_int_326|) (= v_ssl3_accept_~s.offset_116 v_ssl3_accept_~s.offset_116) (= v_ssl3_accept_~num1~0_14 v_ssl3_accept_~num1~0_14) (= |v_#memory_$Pointer$.offset_340| |v_#memory_$Pointer$.offset_339|) (= v_ssl3_accept_~s.base_116 v_ssl3_accept_~s.base_116)) (let ((.cse6 (select |v_#memory_int_327| v_ssl3_accept_~s.base_116)) (.cse4 (+ 52 v_ssl3_accept_~s.offset_116))) (let ((.cse0 (select |v_#memory_$Pointer$.base_339| v_ssl3_accept_~s.base_116)) (.cse3 (select |v_#memory_$Pointer$.base_340| v_ssl3_accept_~s.base_116)) (.cse1 (+ 84 v_ssl3_accept_~s.offset_116)) (.cse7 (select |v_#memory_$Pointer$.offset_340| v_ssl3_accept_~s.base_116)) (.cse2 (select |v_#memory_$Pointer$.offset_339| v_ssl3_accept_~s.base_116)) (.cse5 (select .cse6 .cse4))) (and (not (= (select (select |v_#memory_int_326| (select .cse0 .cse1)) (+ 848 (select .cse2 .cse1))) 0)) (= (store |v_#memory_$Pointer$.base_340| v_ssl3_accept_~s.base_116 (store .cse3 .cse4 (select .cse0 .cse4))) |v_#memory_$Pointer$.base_339|) (not (= 8466 .cse5)) (not (= .cse5 8529)) (not (= 8544 .cse5)) (= (store |v_#memory_int_327| v_ssl3_accept_~s.base_116 (store .cse6 .cse4 (select (select |v_#memory_int_327| (select .cse3 .cse1)) (+ 844 (select .cse7 .cse1))))) |v_#memory_int_326|) (not (= .cse5 8482)) (not (= .cse5 8545)) (not (= .cse5 8512)) (= 8448 .cse5) (= (store |v_#memory_$Pointer$.offset_340| v_ssl3_accept_~s.base_116 (store .cse7 .cse4 (select .cse2 .cse4))) |v_#memory_$Pointer$.offset_339|) (not (= 8497 .cse5)) (= v_ssl3_accept_~skip~0_31 0) (not (= .cse5 8561)) (not (= 8528 .cse5)) (not (= 24576 .cse5)) (not (= 8513 .cse5)) (not (= .cse5 16384)) (not (= 8465 .cse5)) (not (< 0 v_ssl3_accept_~num1~0_14)) (not (= .cse5 8195)) (not (= 8192 .cse5)) (not (= .cse5 8481)) (= .cse5 v_ssl3_accept_~state~0_23) (not (= 8464 .cse5)) (not (= .cse5 8480)) (not (= 8496 .cse5)) (not (= 8560 .cse5)) (not (= 12292 .cse5)))))) InVars {ssl3_accept_~s.offset=v_ssl3_accept_~s.offset_116, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_340|, ssl3_accept_~num1~0=v_ssl3_accept_~num1~0_14, #memory_int=|v_#memory_int_327|, ssl3_accept_~s.base=v_ssl3_accept_~s.base_116, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_340|} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_339|, ssl3_accept_~num1~0=v_ssl3_accept_~num1~0_14, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_38|, ssl3_accept_#t~mem52=|v_ssl3_accept_#t~mem52_26|, ssl3_accept_#t~mem51=|v_ssl3_accept_#t~mem51_26|, ssl3_accept_#t~mem50=|v_ssl3_accept_#t~mem50_28|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_36|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_31, ssl3_accept_#t~mem53=|v_ssl3_accept_#t~mem53_24|, ssl3_accept_#t~mem54=|v_ssl3_accept_#t~mem54_22|, ssl3_accept_#t~mem55=|v_ssl3_accept_#t~mem55_21|, ssl3_accept_#t~mem133=|v_ssl3_accept_#t~mem133_10|, ssl3_accept_#t~mem56=|v_ssl3_accept_#t~mem56_20|, ssl3_accept_#t~mem57=|v_ssl3_accept_#t~mem57_20|, ssl3_accept_#t~mem132.offset=|v_ssl3_accept_#t~mem132.offset_10|, ssl3_accept_#t~mem58=|v_ssl3_accept_#t~mem58_20|, ssl3_accept_#t~mem59=|v_ssl3_accept_#t~mem59_20|, ssl3_accept_~s.offset=v_ssl3_accept_~s.offset_116, ssl3_accept_#t~mem60=|v_ssl3_accept_#t~mem60_20|, ssl3_accept_#t~mem61=|v_ssl3_accept_#t~mem61_20|, ssl3_accept_#t~mem62=|v_ssl3_accept_#t~mem62_20|, ssl3_accept_#t~mem132.base=|v_ssl3_accept_#t~mem132.base_10|, ssl3_accept_#t~mem63=|v_ssl3_accept_#t~mem63_20|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_36|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_35|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_37|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_39|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_21|, #memory_int=|v_#memory_int_326|, ssl3_accept_#t~mem64=|v_ssl3_accept_#t~mem64_20|, ssl3_accept_#t~mem65=|v_ssl3_accept_#t~mem65_20|, ssl3_accept_#t~mem66=|v_ssl3_accept_#t~mem66_20|, ssl3_accept_#t~mem67=|v_ssl3_accept_#t~mem67_20|, ssl3_accept_#t~mem68=|v_ssl3_accept_#t~mem68_20|, ssl3_accept_~s.base=v_ssl3_accept_~s.base_116, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_339|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_23} AuxVars[] AssignedVars[#memory_$Pointer$.base, ssl3_accept_#t~mem151, ssl3_accept_#t~mem52, ssl3_accept_#t~mem51, ssl3_accept_#t~mem50, ssl3_accept_#t~mem150.offset, ssl3_accept_~skip~0, ssl3_accept_#t~mem53, ssl3_accept_#t~mem54, ssl3_accept_#t~mem55, ssl3_accept_#t~mem133, ssl3_accept_#t~mem56, ssl3_accept_#t~mem57, ssl3_accept_#t~mem132.offset, ssl3_accept_#t~mem58, ssl3_accept_#t~mem59, ssl3_accept_#t~mem60, ssl3_accept_#t~mem61, ssl3_accept_#t~mem62, ssl3_accept_#t~mem132.base, ssl3_accept_#t~mem63, ssl3_accept_#t~mem150.base, ssl3_accept_#t~mem49, ssl3_accept_#t~mem48, ssl3_accept_#t~mem47, ssl3_accept_#t~mem46, #memory_int, ssl3_accept_#t~mem64, ssl3_accept_#t~mem65, ssl3_accept_#t~mem66, ssl3_accept_#t~mem67, ssl3_accept_#t~mem68, #memory_$Pointer$.offset, ssl3_accept_~state~0] {18410#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:58,907 INFO L290 TraceCheckUtils]: 17: Hoare triple {18410#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} [682] L1168_primed-->L1168: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18410#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:58,908 INFO L290 TraceCheckUtils]: 18: Hoare triple {18410#(= 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); {18410#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:58,908 INFO L290 TraceCheckUtils]: 19: Hoare triple {18410#(= 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); {18410#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:58,908 INFO L290 TraceCheckUtils]: 20: Hoare triple {18410#(= 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); {18410#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:58,909 INFO L290 TraceCheckUtils]: 21: Hoare triple {18410#(= 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); {18410#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:58,909 INFO L290 TraceCheckUtils]: 22: Hoare triple {18410#(= 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); {18410#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:58,910 INFO L290 TraceCheckUtils]: 23: Hoare triple {18410#(= 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); {18410#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:58,910 INFO L290 TraceCheckUtils]: 24: Hoare triple {18410#(= 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); {18410#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:58,911 INFO L290 TraceCheckUtils]: 25: Hoare triple {18410#(= 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); {18410#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:58,911 INFO L290 TraceCheckUtils]: 26: Hoare triple {18410#(= 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); {18411#(= 8464 |ssl3_accept_#t~mem55|)} is VALID [2022-04-15 11:43:58,911 INFO L290 TraceCheckUtils]: 27: Hoare triple {18411#(= 8464 |ssl3_accept_#t~mem55|)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {18406#false} is VALID [2022-04-15 11:43:58,912 INFO L290 TraceCheckUtils]: 28: Hoare triple {18406#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {18406#false} is VALID [2022-04-15 11:43:58,912 INFO L290 TraceCheckUtils]: 29: Hoare triple {18406#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {18406#false} is VALID [2022-04-15 11:43:58,912 INFO L290 TraceCheckUtils]: 30: Hoare triple {18406#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {18406#false} is VALID [2022-04-15 11:43:58,912 INFO L290 TraceCheckUtils]: 31: Hoare triple {18406#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {18406#false} is VALID [2022-04-15 11:43:58,912 INFO L290 TraceCheckUtils]: 32: Hoare triple {18406#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {18406#false} is VALID [2022-04-15 11:43:58,912 INFO L290 TraceCheckUtils]: 33: Hoare triple {18406#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {18406#false} is VALID [2022-04-15 11:43:58,912 INFO L290 TraceCheckUtils]: 34: Hoare triple {18406#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {18406#false} is VALID [2022-04-15 11:43:58,912 INFO L290 TraceCheckUtils]: 35: Hoare triple {18406#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {18406#false} is VALID [2022-04-15 11:43:58,912 INFO L290 TraceCheckUtils]: 36: Hoare triple {18406#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {18406#false} is VALID [2022-04-15 11:43:58,912 INFO L290 TraceCheckUtils]: 37: Hoare triple {18406#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {18406#false} is VALID [2022-04-15 11:43:58,913 INFO L290 TraceCheckUtils]: 38: Hoare triple {18406#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {18406#false} is VALID [2022-04-15 11:43:58,913 INFO L290 TraceCheckUtils]: 39: Hoare triple {18406#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {18406#false} is VALID [2022-04-15 11:43:58,913 INFO L290 TraceCheckUtils]: 40: Hoare triple {18406#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {18406#false} is VALID [2022-04-15 11:43:58,913 INFO L290 TraceCheckUtils]: 41: Hoare triple {18406#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {18406#false} is VALID [2022-04-15 11:43:58,913 INFO L290 TraceCheckUtils]: 42: Hoare triple {18406#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {18406#false} is VALID [2022-04-15 11:43:58,913 INFO L290 TraceCheckUtils]: 43: Hoare triple {18406#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {18406#false} is VALID [2022-04-15 11:43:58,913 INFO L290 TraceCheckUtils]: 44: Hoare triple {18406#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {18406#false} is VALID [2022-04-15 11:43:58,913 INFO L290 TraceCheckUtils]: 45: Hoare triple {18406#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {18406#false} is VALID [2022-04-15 11:43:58,913 INFO L290 TraceCheckUtils]: 46: Hoare triple {18406#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {18406#false} is VALID [2022-04-15 11:43:58,914 INFO L290 TraceCheckUtils]: 47: Hoare triple {18406#false} assume 8640 == #t~mem75;havoc #t~mem75; {18406#false} is VALID [2022-04-15 11:43:58,914 INFO L290 TraceCheckUtils]: 48: Hoare triple {18406#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {18406#false} is VALID [2022-04-15 11:43:58,914 INFO L290 TraceCheckUtils]: 49: Hoare triple {18406#false} assume !(4 == ~blastFlag~0); {18406#false} is VALID [2022-04-15 11:43:58,914 INFO L290 TraceCheckUtils]: 50: Hoare triple {18406#false} assume !false; {18406#false} is VALID [2022-04-15 11:43:58,914 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 11:43:58,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:43:58,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848781476] [2022-04-15 11:43:58,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848781476] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:43:58,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:43:58,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:43:59,023 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:43:59,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1662876984] [2022-04-15 11:43:59,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1662876984] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:43:59,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:43:59,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 11:43:59,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758033163] [2022-04-15 11:43:59,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:43:59,024 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 8 states have internal predecessors, (74), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2022-04-15 11:43:59,024 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:43:59,024 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 8 states have internal predecessors, (74), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:59,090 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:43:59,090 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 11:43:59,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:43:59,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 11:43:59,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-04-15 11:43:59,091 INFO L87 Difference]: Start difference. First operand 246 states and 389 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 8 states have internal predecessors, (74), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:03,058 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:44:05,063 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:44:06,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:06,274 INFO L93 Difference]: Finished difference Result 479 states and 763 transitions. [2022-04-15 11:44:06,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 11:44:06,274 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 8 states have internal predecessors, (74), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2022-04-15 11:44:06,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:44:06,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 8 states have internal predecessors, (74), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:06,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 429 transitions. [2022-04-15 11:44:06,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 8 states have internal predecessors, (74), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:06,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 429 transitions. [2022-04-15 11:44:06,282 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 429 transitions. [2022-04-15 11:44:06,613 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 429 edges. 429 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:44:06,618 INFO L225 Difference]: With dead ends: 479 [2022-04-15 11:44:06,618 INFO L226 Difference]: Without dead ends: 259 [2022-04-15 11:44:06,619 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-15 11:44:06,619 INFO L913 BasicCegarLoop]: 184 mSDtfsCounter, 15 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:44:06,620 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 535 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 427 Invalid, 1 Unknown, 0 Unchecked, 5.4s Time] [2022-04-15 11:44:06,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-04-15 11:44:06,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 246. [2022-04-15 11:44:06,630 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:44:06,630 INFO L82 GeneralOperation]: Start isEquivalent. First operand 259 states. Second operand has 246 states, 241 states have (on average 1.5933609958506223) internal successors, (384), 241 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:06,631 INFO L74 IsIncluded]: Start isIncluded. First operand 259 states. Second operand has 246 states, 241 states have (on average 1.5933609958506223) internal successors, (384), 241 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:06,631 INFO L87 Difference]: Start difference. First operand 259 states. Second operand has 246 states, 241 states have (on average 1.5933609958506223) internal successors, (384), 241 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:06,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:06,636 INFO L93 Difference]: Finished difference Result 259 states and 405 transitions. [2022-04-15 11:44:06,636 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 405 transitions. [2022-04-15 11:44:06,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:44:06,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:44:06,637 INFO L74 IsIncluded]: Start isIncluded. First operand has 246 states, 241 states have (on average 1.5933609958506223) internal successors, (384), 241 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 259 states. [2022-04-15 11:44:06,637 INFO L87 Difference]: Start difference. First operand has 246 states, 241 states have (on average 1.5933609958506223) internal successors, (384), 241 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 259 states. [2022-04-15 11:44:06,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:06,642 INFO L93 Difference]: Finished difference Result 259 states and 405 transitions. [2022-04-15 11:44:06,642 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 405 transitions. [2022-04-15 11:44:06,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:44:06,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:44:06,643 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:44:06,643 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:44:06,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 241 states have (on average 1.5933609958506223) internal successors, (384), 241 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:06,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 388 transitions. [2022-04-15 11:44:06,648 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 388 transitions. Word has length 93 [2022-04-15 11:44:06,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:44:06,648 INFO L478 AbstractCegarLoop]: Abstraction has 246 states and 388 transitions. [2022-04-15 11:44:06,648 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 8 states have internal predecessors, (74), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:06,649 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 246 states and 388 transitions. [2022-04-15 11:44:06,939 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 388 edges. 388 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:44:06,939 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 388 transitions. [2022-04-15 11:44:06,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-04-15 11:44:06,943 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:44:06,943 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:44:06,944 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-15 11:44:06,944 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:44:06,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:44:06,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1343650049, now seen corresponding path program 1 times [2022-04-15 11:44:06,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:44:06,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [335325204] [2022-04-15 11:44:07,175 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:44:07,176 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:44:07,176 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:44:07,176 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 11:44:07,178 INFO L85 PathProgramCache]: Analyzing trace with hash 875714774, now seen corresponding path program 1 times [2022-04-15 11:44:07,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:44:07,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228700642] [2022-04-15 11:44:07,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:44:07,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:44:07,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:44:07,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:44:07,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:44:07,364 INFO L290 TraceCheckUtils]: 0: Hoare triple {20396#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {20389#true} is VALID [2022-04-15 11:44:07,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {20389#true} assume true; {20389#true} is VALID [2022-04-15 11:44:07,365 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20389#true} {20389#true} #673#return; {20389#true} is VALID [2022-04-15 11:44:07,365 INFO L272 TraceCheckUtils]: 0: Hoare triple {20389#true} call ULTIMATE.init(); {20396#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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:44:07,366 INFO L290 TraceCheckUtils]: 1: Hoare triple {20396#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {20389#true} is VALID [2022-04-15 11:44:07,366 INFO L290 TraceCheckUtils]: 2: Hoare triple {20389#true} assume true; {20389#true} is VALID [2022-04-15 11:44:07,366 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20389#true} {20389#true} #673#return; {20389#true} is VALID [2022-04-15 11:44:07,366 INFO L272 TraceCheckUtils]: 4: Hoare triple {20389#true} call #t~ret161 := main(); {20389#true} is VALID [2022-04-15 11:44:07,366 INFO L290 TraceCheckUtils]: 5: Hoare triple {20389#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; {20389#true} is VALID [2022-04-15 11:44:07,366 INFO L290 TraceCheckUtils]: 6: Hoare triple {20389#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {20389#true} is VALID [2022-04-15 11:44:07,366 INFO L272 TraceCheckUtils]: 7: Hoare triple {20389#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {20389#true} is VALID [2022-04-15 11:44:07,368 INFO L290 TraceCheckUtils]: 8: Hoare triple {20389#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); {20394#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:07,369 INFO L290 TraceCheckUtils]: 9: Hoare triple {20394#(= 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; {20394#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:07,370 INFO L290 TraceCheckUtils]: 10: Hoare triple {20394#(= 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; {20394#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:07,370 INFO L290 TraceCheckUtils]: 11: Hoare triple {20394#(= 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)))); {20394#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:07,371 INFO L290 TraceCheckUtils]: 12: Hoare triple {20394#(= 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); {20394#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:07,371 INFO L290 TraceCheckUtils]: 13: Hoare triple {20394#(= 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; {20394#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:07,372 INFO L290 TraceCheckUtils]: 14: Hoare triple {20394#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} [687] L1167-2-->L1168_primed: Formula: (let ((.cse0 (= |v_ssl3_accept_#t~mem83.base_24| |v_ssl3_accept_#t~mem83.base_22|)) (.cse1 (= |v_ssl3_accept_#t~mem83.offset_24| |v_ssl3_accept_#t~mem83.offset_22|)) (.cse2 (= |v_ssl3_accept_#t~mem88.offset_16| |v_ssl3_accept_#t~mem88.offset_15|)) (.cse3 (= |v_ssl3_accept_#t~mem89_16| |v_ssl3_accept_#t~mem89_15|)) (.cse4 (= |v_ssl3_accept_#t~mem88.base_16| |v_ssl3_accept_#t~mem88.base_15|)) (.cse5 (= |v_ssl3_accept_#t~mem151_48| |v_ssl3_accept_#t~mem151_44|)) (.cse6 (= |v_#memory_$Pointer$.offset_360| |v_#memory_$Pointer$.offset_352|)) (.cse7 (= |v_ssl3_accept_#t~mem48_48| |v_ssl3_accept_#t~mem48_44|)) (.cse8 (= |v_ssl3_accept_#t~mem150.base_46| |v_ssl3_accept_#t~mem150.base_42|)) (.cse9 (= |v_ssl3_accept_#t~mem49_46| |v_ssl3_accept_#t~mem49_42|)) (.cse10 (= |v_#memory_$Pointer$.base_360| |v_#memory_$Pointer$.base_352|)) (.cse11 (= |v_ssl3_accept_#t~mem82_24| |v_ssl3_accept_#t~mem82_22|)) (.cse12 (= |v_ssl3_accept_#t~mem85_24| |v_ssl3_accept_#t~mem85_22|)) (.cse13 (= v_ssl3_accept_~skip~0_38 v_ssl3_accept_~skip~0_36)) (.cse14 (= |v_ssl3_accept_#t~mem150.offset_46| |v_ssl3_accept_#t~mem150.offset_42|)) (.cse15 (= |v_ssl3_accept_#t~mem50_39| |v_ssl3_accept_#t~mem50_35|)) (.cse16 (= |v_ssl3_accept_#t~mem46_28| |v_ssl3_accept_#t~mem46_26|))) (or (and .cse0 .cse1 .cse2 (= |v_ssl3_accept_#t~mem47_46| |v_ssl3_accept_#t~mem47_50|) .cse3 .cse4 .cse5 .cse6 (= |v_ssl3_accept_#t~mem51_28| |v_ssl3_accept_#t~mem51_32|) (= |v_#memory_int_339| |v_#memory_int_346|) .cse7 .cse8 (= v_ssl3_accept_~state~0_28 v_ssl3_accept_~state~0_30) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |v_#memory_int_346| |v_#memory_int_339|) .cse6 (= |v_ssl3_accept_#t~mem47_50| |v_ssl3_accept_#t~mem47_46|) (= v_ssl3_accept_~state~0_30 v_ssl3_accept_~state~0_28) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (= |v_ssl3_accept_#t~mem51_32| |v_ssl3_accept_#t~mem51_28|) .cse16))) InVars {ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_24|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_360|, 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_48|, ssl3_accept_#t~mem51=|v_ssl3_accept_#t~mem51_32|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_46|, ssl3_accept_#t~mem50=|v_ssl3_accept_#t~mem50_39|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_16|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_24|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_46|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_48|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_46|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_50|, 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_16|, #memory_int=|v_#memory_int_346|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_16|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_360|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_30} OutVars{ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_22|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_352|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_22|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_22|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_44|, ssl3_accept_#t~mem51=|v_ssl3_accept_#t~mem51_28|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_42|, ssl3_accept_#t~mem50=|v_ssl3_accept_#t~mem50_35|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_15|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_22|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_42|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_44|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_42|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_46|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_26|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_36, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_15|, #memory_int=|v_#memory_int_339|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_15|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_352|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_28} 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] {20394#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:07,372 INFO L290 TraceCheckUtils]: 15: Hoare triple {20394#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} [688] L1168_primed-->L1167-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20394#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:07,374 INFO L290 TraceCheckUtils]: 16: Hoare triple {20394#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} [689] L1167-2-->L1168_primed: Formula: (or (and (= v_ssl3_accept_~s.offset_118 v_ssl3_accept_~s.offset_118) (= v_ssl3_accept_~s.base_118 v_ssl3_accept_~s.base_118) (= |v_#memory_$Pointer$.base_359| |v_#memory_$Pointer$.base_358|) (= v_ssl3_accept_~num1~0_15 v_ssl3_accept_~num1~0_15) (= |v_#memory_$Pointer$.offset_359| |v_#memory_$Pointer$.offset_358|) (= |v_#memory_int_345| |v_#memory_int_344|)) (let ((.cse4 (select |v_#memory_int_345| v_ssl3_accept_~s.base_118)) (.cse5 (+ 52 v_ssl3_accept_~s.offset_118))) (let ((.cse2 (+ 84 v_ssl3_accept_~s.offset_118)) (.cse7 (select |v_#memory_$Pointer$.offset_359| v_ssl3_accept_~s.base_118)) (.cse3 (select |v_#memory_$Pointer$.offset_358| v_ssl3_accept_~s.base_118)) (.cse6 (select |v_#memory_$Pointer$.base_359| v_ssl3_accept_~s.base_118)) (.cse1 (select |v_#memory_$Pointer$.base_358| v_ssl3_accept_~s.base_118)) (.cse0 (select .cse4 .cse5))) (and (not (= 8545 .cse0)) (not (= 16384 .cse0)) (not (= 8513 .cse0)) (not (= .cse0 8481)) (not (= (select (select |v_#memory_int_344| (select .cse1 .cse2)) (+ 848 (select .cse3 .cse2))) 0)) (= v_ssl3_accept_~skip~0_37 0) (not (= 8497 .cse0)) (not (= 8560 .cse0)) (not (= 8464 .cse0)) (= (store |v_#memory_int_345| v_ssl3_accept_~s.base_118 (store .cse4 .cse5 (select (select |v_#memory_int_345| (select .cse6 .cse2)) (+ (select .cse7 .cse2) 844)))) |v_#memory_int_344|) (not (= 8529 .cse0)) (not (= .cse0 8512)) (not (= 8466 .cse0)) (= v_ssl3_accept_~state~0_29 .cse0) (not (= 12292 .cse0)) (not (= 8465 .cse0)) (not (= 8544 .cse0)) (= (store |v_#memory_$Pointer$.offset_359| v_ssl3_accept_~s.base_118 (store .cse7 .cse5 (select .cse3 .cse5))) |v_#memory_$Pointer$.offset_358|) (not (= 8480 .cse0)) (not (< 0 v_ssl3_accept_~num1~0_15)) (not (= 8528 .cse0)) (not (= 24576 .cse0)) (= |v_#memory_$Pointer$.base_358| (store |v_#memory_$Pointer$.base_359| v_ssl3_accept_~s.base_118 (store .cse6 .cse5 (select .cse1 .cse5)))) (not (= 8496 .cse0)) (= 8448 .cse0) (not (= 8482 .cse0)) (not (= 8195 .cse0)) (not (= 8561 .cse0)) (not (= 8192 .cse0)))))) InVars {ssl3_accept_~s.offset=v_ssl3_accept_~s.offset_118, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_359|, ssl3_accept_~num1~0=v_ssl3_accept_~num1~0_15, #memory_int=|v_#memory_int_345|, ssl3_accept_~s.base=v_ssl3_accept_~s.base_118, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_359|} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_358|, ssl3_accept_~num1~0=v_ssl3_accept_~num1~0_15, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_46|, ssl3_accept_#t~mem52=|v_ssl3_accept_#t~mem52_28|, ssl3_accept_#t~mem51=|v_ssl3_accept_#t~mem51_30|, ssl3_accept_#t~mem50=|v_ssl3_accept_#t~mem50_37|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_44|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_37, ssl3_accept_#t~mem53=|v_ssl3_accept_#t~mem53_26|, ssl3_accept_#t~mem54=|v_ssl3_accept_#t~mem54_24|, ssl3_accept_#t~mem55=|v_ssl3_accept_#t~mem55_24|, ssl3_accept_#t~mem133=|v_ssl3_accept_#t~mem133_11|, ssl3_accept_#t~mem56=|v_ssl3_accept_#t~mem56_22|, ssl3_accept_#t~mem57=|v_ssl3_accept_#t~mem57_22|, ssl3_accept_#t~mem132.offset=|v_ssl3_accept_#t~mem132.offset_11|, ssl3_accept_#t~mem58=|v_ssl3_accept_#t~mem58_22|, ssl3_accept_#t~mem59=|v_ssl3_accept_#t~mem59_22|, ssl3_accept_~s.offset=v_ssl3_accept_~s.offset_118, ssl3_accept_#t~mem60=|v_ssl3_accept_#t~mem60_22|, ssl3_accept_#t~mem61=|v_ssl3_accept_#t~mem61_22|, ssl3_accept_#t~mem62=|v_ssl3_accept_#t~mem62_22|, ssl3_accept_#t~mem132.base=|v_ssl3_accept_#t~mem132.base_11|, ssl3_accept_#t~mem63=|v_ssl3_accept_#t~mem63_22|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_44|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_44|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_46|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_48|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_27|, #memory_int=|v_#memory_int_344|, ssl3_accept_#t~mem64=|v_ssl3_accept_#t~mem64_22|, ssl3_accept_#t~mem65=|v_ssl3_accept_#t~mem65_22|, ssl3_accept_#t~mem66=|v_ssl3_accept_#t~mem66_22|, ssl3_accept_#t~mem67=|v_ssl3_accept_#t~mem67_22|, ssl3_accept_#t~mem68=|v_ssl3_accept_#t~mem68_22|, ssl3_accept_~s.base=v_ssl3_accept_~s.base_118, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_358|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_29} AuxVars[] AssignedVars[#memory_$Pointer$.base, ssl3_accept_#t~mem151, ssl3_accept_#t~mem52, ssl3_accept_#t~mem51, ssl3_accept_#t~mem50, ssl3_accept_#t~mem150.offset, ssl3_accept_~skip~0, ssl3_accept_#t~mem53, ssl3_accept_#t~mem54, ssl3_accept_#t~mem55, ssl3_accept_#t~mem133, ssl3_accept_#t~mem56, ssl3_accept_#t~mem57, ssl3_accept_#t~mem132.offset, ssl3_accept_#t~mem58, ssl3_accept_#t~mem59, ssl3_accept_#t~mem60, ssl3_accept_#t~mem61, ssl3_accept_#t~mem62, ssl3_accept_#t~mem132.base, ssl3_accept_#t~mem63, ssl3_accept_#t~mem150.base, ssl3_accept_#t~mem49, ssl3_accept_#t~mem48, ssl3_accept_#t~mem47, ssl3_accept_#t~mem46, #memory_int, ssl3_accept_#t~mem64, ssl3_accept_#t~mem65, ssl3_accept_#t~mem66, ssl3_accept_#t~mem67, ssl3_accept_#t~mem68, #memory_$Pointer$.offset, ssl3_accept_~state~0] {20394#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:07,374 INFO L290 TraceCheckUtils]: 17: Hoare triple {20394#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} [686] L1168_primed-->L1168: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20394#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:07,375 INFO L290 TraceCheckUtils]: 18: Hoare triple {20394#(= 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); {20394#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:07,375 INFO L290 TraceCheckUtils]: 19: Hoare triple {20394#(= 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); {20394#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:07,375 INFO L290 TraceCheckUtils]: 20: Hoare triple {20394#(= 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); {20394#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:07,376 INFO L290 TraceCheckUtils]: 21: Hoare triple {20394#(= 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); {20394#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:07,376 INFO L290 TraceCheckUtils]: 22: Hoare triple {20394#(= 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); {20394#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:07,377 INFO L290 TraceCheckUtils]: 23: Hoare triple {20394#(= 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); {20394#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:07,377 INFO L290 TraceCheckUtils]: 24: Hoare triple {20394#(= 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); {20394#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:07,378 INFO L290 TraceCheckUtils]: 25: Hoare triple {20394#(= 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); {20394#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:07,378 INFO L290 TraceCheckUtils]: 26: Hoare triple {20394#(= 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); {20395#(= 8464 |ssl3_accept_#t~mem55|)} is VALID [2022-04-15 11:44:07,378 INFO L290 TraceCheckUtils]: 27: Hoare triple {20395#(= 8464 |ssl3_accept_#t~mem55|)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {20390#false} is VALID [2022-04-15 11:44:07,379 INFO L290 TraceCheckUtils]: 28: Hoare triple {20390#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {20390#false} is VALID [2022-04-15 11:44:07,379 INFO L290 TraceCheckUtils]: 29: Hoare triple {20390#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {20390#false} is VALID [2022-04-15 11:44:07,379 INFO L290 TraceCheckUtils]: 30: Hoare triple {20390#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {20390#false} is VALID [2022-04-15 11:44:07,379 INFO L290 TraceCheckUtils]: 31: Hoare triple {20390#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {20390#false} is VALID [2022-04-15 11:44:07,379 INFO L290 TraceCheckUtils]: 32: Hoare triple {20390#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {20390#false} is VALID [2022-04-15 11:44:07,379 INFO L290 TraceCheckUtils]: 33: Hoare triple {20390#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {20390#false} is VALID [2022-04-15 11:44:07,379 INFO L290 TraceCheckUtils]: 34: Hoare triple {20390#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {20390#false} is VALID [2022-04-15 11:44:07,379 INFO L290 TraceCheckUtils]: 35: Hoare triple {20390#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {20390#false} is VALID [2022-04-15 11:44:07,379 INFO L290 TraceCheckUtils]: 36: Hoare triple {20390#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {20390#false} is VALID [2022-04-15 11:44:07,379 INFO L290 TraceCheckUtils]: 37: Hoare triple {20390#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {20390#false} is VALID [2022-04-15 11:44:07,380 INFO L290 TraceCheckUtils]: 38: Hoare triple {20390#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {20390#false} is VALID [2022-04-15 11:44:07,380 INFO L290 TraceCheckUtils]: 39: Hoare triple {20390#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {20390#false} is VALID [2022-04-15 11:44:07,380 INFO L290 TraceCheckUtils]: 40: Hoare triple {20390#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {20390#false} is VALID [2022-04-15 11:44:07,380 INFO L290 TraceCheckUtils]: 41: Hoare triple {20390#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {20390#false} is VALID [2022-04-15 11:44:07,380 INFO L290 TraceCheckUtils]: 42: Hoare triple {20390#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {20390#false} is VALID [2022-04-15 11:44:07,380 INFO L290 TraceCheckUtils]: 43: Hoare triple {20390#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {20390#false} is VALID [2022-04-15 11:44:07,380 INFO L290 TraceCheckUtils]: 44: Hoare triple {20390#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {20390#false} is VALID [2022-04-15 11:44:07,380 INFO L290 TraceCheckUtils]: 45: Hoare triple {20390#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {20390#false} is VALID [2022-04-15 11:44:07,380 INFO L290 TraceCheckUtils]: 46: Hoare triple {20390#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {20390#false} is VALID [2022-04-15 11:44:07,381 INFO L290 TraceCheckUtils]: 47: Hoare triple {20390#false} assume 8640 == #t~mem75;havoc #t~mem75; {20390#false} is VALID [2022-04-15 11:44:07,381 INFO L290 TraceCheckUtils]: 48: Hoare triple {20390#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {20390#false} is VALID [2022-04-15 11:44:07,381 INFO L290 TraceCheckUtils]: 49: Hoare triple {20390#false} assume !(4 == ~blastFlag~0); {20390#false} is VALID [2022-04-15 11:44:07,381 INFO L290 TraceCheckUtils]: 50: Hoare triple {20390#false} assume !false; {20390#false} is VALID [2022-04-15 11:44:07,381 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 11:44:07,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:44:07,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228700642] [2022-04-15 11:44:07,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228700642] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:44:07,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:44:07,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:44:07,526 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:44:07,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [335325204] [2022-04-15 11:44:07,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [335325204] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:44:07,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:44:07,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 11:44:07,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711903754] [2022-04-15 11:44:07,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:44:07,527 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 9 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 94 [2022-04-15 11:44:07,527 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:44:07,527 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 7.5) internal successors, (75), 9 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:07,594 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:44:07,594 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 11:44:07,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:44:07,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 11:44:07,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-15 11:44:07,595 INFO L87 Difference]: Start difference. First operand 246 states and 388 transitions. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 9 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:13,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:13,514 INFO L93 Difference]: Finished difference Result 469 states and 749 transitions. [2022-04-15 11:44:13,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 11:44:13,514 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 9 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 94 [2022-04-15 11:44:13,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:44:13,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 9 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:13,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 415 transitions. [2022-04-15 11:44:13,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 9 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:13,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 415 transitions. [2022-04-15 11:44:13,519 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 415 transitions. [2022-04-15 11:44:13,807 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 415 edges. 415 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:44:13,811 INFO L225 Difference]: With dead ends: 469 [2022-04-15 11:44:13,811 INFO L226 Difference]: Without dead ends: 249 [2022-04-15 11:44:13,811 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-15 11:44:13,812 INFO L913 BasicCegarLoop]: 191 mSDtfsCounter, 7 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:44:13,812 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 530 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-15 11:44:13,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-04-15 11:44:13,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 246. [2022-04-15 11:44:13,822 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:44:13,823 INFO L82 GeneralOperation]: Start isEquivalent. First operand 249 states. Second operand has 246 states, 241 states have (on average 1.5892116182572613) internal successors, (383), 241 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:13,823 INFO L74 IsIncluded]: Start isIncluded. First operand 249 states. Second operand has 246 states, 241 states have (on average 1.5892116182572613) internal successors, (383), 241 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:13,824 INFO L87 Difference]: Start difference. First operand 249 states. Second operand has 246 states, 241 states have (on average 1.5892116182572613) internal successors, (383), 241 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:13,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:13,829 INFO L93 Difference]: Finished difference Result 249 states and 391 transitions. [2022-04-15 11:44:13,829 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 391 transitions. [2022-04-15 11:44:13,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:44:13,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:44:13,830 INFO L74 IsIncluded]: Start isIncluded. First operand has 246 states, 241 states have (on average 1.5892116182572613) internal successors, (383), 241 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 249 states. [2022-04-15 11:44:13,831 INFO L87 Difference]: Start difference. First operand has 246 states, 241 states have (on average 1.5892116182572613) internal successors, (383), 241 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 249 states. [2022-04-15 11:44:13,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:13,835 INFO L93 Difference]: Finished difference Result 249 states and 391 transitions. [2022-04-15 11:44:13,835 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 391 transitions. [2022-04-15 11:44:13,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:44:13,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:44:13,836 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:44:13,836 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:44:13,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 241 states have (on average 1.5892116182572613) internal successors, (383), 241 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:13,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 387 transitions. [2022-04-15 11:44:13,841 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 387 transitions. Word has length 94 [2022-04-15 11:44:13,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:44:13,841 INFO L478 AbstractCegarLoop]: Abstraction has 246 states and 387 transitions. [2022-04-15 11:44:13,841 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 9 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:13,841 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 246 states and 387 transitions. [2022-04-15 11:44:14,123 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 387 edges. 387 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:44:14,123 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 387 transitions. [2022-04-15 11:44:14,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-04-15 11:44:14,124 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:44:14,124 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:44:14,124 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-15 11:44:14,124 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:44:14,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:44:14,124 INFO L85 PathProgramCache]: Analyzing trace with hash 115161398, now seen corresponding path program 1 times [2022-04-15 11:44:14,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:44:14,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1896535149] [2022-04-15 11:44:14,173 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:44:14,173 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:44:14,173 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:44:14,174 INFO L85 PathProgramCache]: Analyzing trace with hash 115161398, now seen corresponding path program 2 times [2022-04-15 11:44:14,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:44:14,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729697193] [2022-04-15 11:44:14,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:44:14,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:44:14,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:44:14,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:44:14,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:44:14,311 INFO L290 TraceCheckUtils]: 0: Hoare triple {22341#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {22334#true} is VALID [2022-04-15 11:44:14,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {22334#true} assume true; {22334#true} is VALID [2022-04-15 11:44:14,311 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22334#true} {22334#true} #673#return; {22334#true} is VALID [2022-04-15 11:44:14,312 INFO L272 TraceCheckUtils]: 0: Hoare triple {22334#true} call ULTIMATE.init(); {22341#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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:44:14,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {22341#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {22334#true} is VALID [2022-04-15 11:44:14,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {22334#true} assume true; {22334#true} is VALID [2022-04-15 11:44:14,313 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22334#true} {22334#true} #673#return; {22334#true} is VALID [2022-04-15 11:44:14,313 INFO L272 TraceCheckUtils]: 4: Hoare triple {22334#true} call #t~ret161 := main(); {22334#true} is VALID [2022-04-15 11:44:14,313 INFO L290 TraceCheckUtils]: 5: Hoare triple {22334#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; {22334#true} is VALID [2022-04-15 11:44:14,313 INFO L290 TraceCheckUtils]: 6: Hoare triple {22334#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {22334#true} is VALID [2022-04-15 11:44:14,313 INFO L272 TraceCheckUtils]: 7: Hoare triple {22334#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {22334#true} is VALID [2022-04-15 11:44:14,313 INFO L290 TraceCheckUtils]: 8: Hoare triple {22334#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); {22334#true} is VALID [2022-04-15 11:44:14,314 INFO L290 TraceCheckUtils]: 9: Hoare triple {22334#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; {22334#true} is VALID [2022-04-15 11:44:14,314 INFO L290 TraceCheckUtils]: 10: Hoare triple {22334#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; {22334#true} is VALID [2022-04-15 11:44:14,314 INFO L290 TraceCheckUtils]: 11: Hoare triple {22334#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {22334#true} is VALID [2022-04-15 11:44:14,314 INFO L290 TraceCheckUtils]: 12: Hoare triple {22334#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {22334#true} is VALID [2022-04-15 11:44:14,314 INFO L290 TraceCheckUtils]: 13: Hoare triple {22334#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {22334#true} is VALID [2022-04-15 11:44:14,314 INFO L290 TraceCheckUtils]: 14: Hoare triple {22334#true} assume !false; {22334#true} is VALID [2022-04-15 11:44:14,314 INFO L290 TraceCheckUtils]: 15: Hoare triple {22334#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); {22334#true} is VALID [2022-04-15 11:44:14,314 INFO L290 TraceCheckUtils]: 16: Hoare triple {22334#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {22334#true} is VALID [2022-04-15 11:44:14,314 INFO L290 TraceCheckUtils]: 17: Hoare triple {22334#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {22334#true} is VALID [2022-04-15 11:44:14,314 INFO L290 TraceCheckUtils]: 18: Hoare triple {22334#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {22334#true} is VALID [2022-04-15 11:44:14,315 INFO L290 TraceCheckUtils]: 19: Hoare triple {22334#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {22334#true} is VALID [2022-04-15 11:44:14,315 INFO L290 TraceCheckUtils]: 20: Hoare triple {22334#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {22334#true} is VALID [2022-04-15 11:44:14,315 INFO L290 TraceCheckUtils]: 21: Hoare triple {22334#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {22334#true} is VALID [2022-04-15 11:44:14,315 INFO L290 TraceCheckUtils]: 22: Hoare triple {22334#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {22334#true} is VALID [2022-04-15 11:44:14,315 INFO L290 TraceCheckUtils]: 23: Hoare triple {22334#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {22334#true} is VALID [2022-04-15 11:44:14,315 INFO L290 TraceCheckUtils]: 24: Hoare triple {22334#true} assume 8464 == #t~mem55;havoc #t~mem55; {22334#true} is VALID [2022-04-15 11:44:14,316 INFO L290 TraceCheckUtils]: 25: Hoare triple {22334#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; {22334#true} is VALID [2022-04-15 11:44:14,316 INFO L290 TraceCheckUtils]: 26: Hoare triple {22334#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {22334#true} is VALID [2022-04-15 11:44:14,317 INFO L290 TraceCheckUtils]: 27: Hoare triple {22334#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); {22339#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:14,318 INFO L290 TraceCheckUtils]: 28: Hoare triple {22339#(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); {22339#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:14,318 INFO L290 TraceCheckUtils]: 29: Hoare triple {22339#(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; {22339#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:14,319 INFO L290 TraceCheckUtils]: 30: Hoare triple {22339#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {22339#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:14,319 INFO L290 TraceCheckUtils]: 31: Hoare triple {22339#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {22339#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:14,319 INFO L290 TraceCheckUtils]: 32: Hoare triple {22339#(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); {22339#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:14,320 INFO L290 TraceCheckUtils]: 33: Hoare triple {22339#(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); {22339#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:14,320 INFO L290 TraceCheckUtils]: 34: Hoare triple {22339#(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); {22339#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:14,321 INFO L290 TraceCheckUtils]: 35: Hoare triple {22339#(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); {22339#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:14,321 INFO L290 TraceCheckUtils]: 36: Hoare triple {22339#(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); {22339#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:14,321 INFO L290 TraceCheckUtils]: 37: Hoare triple {22339#(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); {22339#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:14,322 INFO L290 TraceCheckUtils]: 38: Hoare triple {22339#(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); {22339#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:14,322 INFO L290 TraceCheckUtils]: 39: Hoare triple {22339#(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); {22339#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:14,323 INFO L290 TraceCheckUtils]: 40: Hoare triple {22339#(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); {22339#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:14,323 INFO L290 TraceCheckUtils]: 41: Hoare triple {22339#(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); {22339#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:14,324 INFO L290 TraceCheckUtils]: 42: Hoare triple {22339#(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); {22339#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:14,324 INFO L290 TraceCheckUtils]: 43: Hoare triple {22339#(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); {22339#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:14,324 INFO L290 TraceCheckUtils]: 44: Hoare triple {22339#(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); {22339#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:14,325 INFO L290 TraceCheckUtils]: 45: Hoare triple {22339#(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); {22339#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:14,325 INFO L290 TraceCheckUtils]: 46: Hoare triple {22339#(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); {22339#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:14,326 INFO L290 TraceCheckUtils]: 47: Hoare triple {22339#(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); {22339#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:14,326 INFO L290 TraceCheckUtils]: 48: Hoare triple {22339#(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); {22339#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:14,326 INFO L290 TraceCheckUtils]: 49: Hoare triple {22339#(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); {22339#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:14,327 INFO L290 TraceCheckUtils]: 50: Hoare triple {22339#(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); {22339#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:14,327 INFO L290 TraceCheckUtils]: 51: Hoare triple {22339#(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); {22339#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:14,328 INFO L290 TraceCheckUtils]: 52: Hoare triple {22339#(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); {22339#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:14,328 INFO L290 TraceCheckUtils]: 53: Hoare triple {22339#(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); {22340#(not (= 8448 |ssl3_accept_#t~mem68|))} is VALID [2022-04-15 11:44:14,328 INFO L290 TraceCheckUtils]: 54: Hoare triple {22340#(not (= 8448 |ssl3_accept_#t~mem68|))} assume 8448 == #t~mem68;havoc #t~mem68; {22335#false} is VALID [2022-04-15 11:44:14,328 INFO L290 TraceCheckUtils]: 55: Hoare triple {22335#false} assume !(~num1~0 > 0); {22335#false} is VALID [2022-04-15 11:44:14,329 INFO L290 TraceCheckUtils]: 56: Hoare triple {22335#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; {22335#false} is VALID [2022-04-15 11:44:14,329 INFO L290 TraceCheckUtils]: 57: Hoare triple {22335#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); {22335#false} is VALID [2022-04-15 11:44:14,329 INFO L290 TraceCheckUtils]: 58: Hoare triple {22335#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {22335#false} is VALID [2022-04-15 11:44:14,329 INFO L290 TraceCheckUtils]: 59: Hoare triple {22335#false} ~skip~0 := 0; {22335#false} is VALID [2022-04-15 11:44:14,329 INFO L290 TraceCheckUtils]: 60: Hoare triple {22335#false} assume !false; {22335#false} is VALID [2022-04-15 11:44:14,329 INFO L290 TraceCheckUtils]: 61: Hoare triple {22335#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); {22335#false} is VALID [2022-04-15 11:44:14,329 INFO L290 TraceCheckUtils]: 62: Hoare triple {22335#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {22335#false} is VALID [2022-04-15 11:44:14,329 INFO L290 TraceCheckUtils]: 63: Hoare triple {22335#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {22335#false} is VALID [2022-04-15 11:44:14,329 INFO L290 TraceCheckUtils]: 64: Hoare triple {22335#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {22335#false} is VALID [2022-04-15 11:44:14,329 INFO L290 TraceCheckUtils]: 65: Hoare triple {22335#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {22335#false} is VALID [2022-04-15 11:44:14,330 INFO L290 TraceCheckUtils]: 66: Hoare triple {22335#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {22335#false} is VALID [2022-04-15 11:44:14,330 INFO L290 TraceCheckUtils]: 67: Hoare triple {22335#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {22335#false} is VALID [2022-04-15 11:44:14,330 INFO L290 TraceCheckUtils]: 68: Hoare triple {22335#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {22335#false} is VALID [2022-04-15 11:44:14,330 INFO L290 TraceCheckUtils]: 69: Hoare triple {22335#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {22335#false} is VALID [2022-04-15 11:44:14,330 INFO L290 TraceCheckUtils]: 70: Hoare triple {22335#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {22335#false} is VALID [2022-04-15 11:44:14,330 INFO L290 TraceCheckUtils]: 71: Hoare triple {22335#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {22335#false} is VALID [2022-04-15 11:44:14,330 INFO L290 TraceCheckUtils]: 72: Hoare triple {22335#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {22335#false} is VALID [2022-04-15 11:44:14,330 INFO L290 TraceCheckUtils]: 73: Hoare triple {22335#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {22335#false} is VALID [2022-04-15 11:44:14,330 INFO L290 TraceCheckUtils]: 74: Hoare triple {22335#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {22335#false} is VALID [2022-04-15 11:44:14,330 INFO L290 TraceCheckUtils]: 75: Hoare triple {22335#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {22335#false} is VALID [2022-04-15 11:44:14,330 INFO L290 TraceCheckUtils]: 76: Hoare triple {22335#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {22335#false} is VALID [2022-04-15 11:44:14,331 INFO L290 TraceCheckUtils]: 77: Hoare triple {22335#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {22335#false} is VALID [2022-04-15 11:44:14,331 INFO L290 TraceCheckUtils]: 78: Hoare triple {22335#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {22335#false} is VALID [2022-04-15 11:44:14,331 INFO L290 TraceCheckUtils]: 79: Hoare triple {22335#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {22335#false} is VALID [2022-04-15 11:44:14,331 INFO L290 TraceCheckUtils]: 80: Hoare triple {22335#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {22335#false} is VALID [2022-04-15 11:44:14,331 INFO L290 TraceCheckUtils]: 81: Hoare triple {22335#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {22335#false} is VALID [2022-04-15 11:44:14,331 INFO L290 TraceCheckUtils]: 82: Hoare triple {22335#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {22335#false} is VALID [2022-04-15 11:44:14,331 INFO L290 TraceCheckUtils]: 83: Hoare triple {22335#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {22335#false} is VALID [2022-04-15 11:44:14,331 INFO L290 TraceCheckUtils]: 84: Hoare triple {22335#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {22335#false} is VALID [2022-04-15 11:44:14,331 INFO L290 TraceCheckUtils]: 85: Hoare triple {22335#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {22335#false} is VALID [2022-04-15 11:44:14,332 INFO L290 TraceCheckUtils]: 86: Hoare triple {22335#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {22335#false} is VALID [2022-04-15 11:44:14,332 INFO L290 TraceCheckUtils]: 87: Hoare triple {22335#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {22335#false} is VALID [2022-04-15 11:44:14,332 INFO L290 TraceCheckUtils]: 88: Hoare triple {22335#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {22335#false} is VALID [2022-04-15 11:44:14,332 INFO L290 TraceCheckUtils]: 89: Hoare triple {22335#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {22335#false} is VALID [2022-04-15 11:44:14,332 INFO L290 TraceCheckUtils]: 90: Hoare triple {22335#false} assume 8640 == #t~mem75;havoc #t~mem75; {22335#false} is VALID [2022-04-15 11:44:14,332 INFO L290 TraceCheckUtils]: 91: Hoare triple {22335#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {22335#false} is VALID [2022-04-15 11:44:14,332 INFO L290 TraceCheckUtils]: 92: Hoare triple {22335#false} assume !(4 == ~blastFlag~0); {22335#false} is VALID [2022-04-15 11:44:14,332 INFO L290 TraceCheckUtils]: 93: Hoare triple {22335#false} assume !false; {22335#false} is VALID [2022-04-15 11:44:14,333 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:44:14,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:44:14,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729697193] [2022-04-15 11:44:14,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729697193] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:44:14,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:44:14,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:44:14,333 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:44:14,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1896535149] [2022-04-15 11:44:14,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1896535149] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:44:14,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:44:14,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:44:14,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609112130] [2022-04-15 11:44:14,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:44:14,334 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 94 [2022-04-15 11:44:14,334 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:44:14,335 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:14,409 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:44:14,409 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:44:14,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:44:14,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:44:14,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:44:14,411 INFO L87 Difference]: Start difference. First operand 246 states and 387 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:21,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:21,680 INFO L93 Difference]: Finished difference Result 616 states and 982 transitions. [2022-04-15 11:44:21,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:44:21,680 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 94 [2022-04-15 11:44:21,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:44:21,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:21,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 569 transitions. [2022-04-15 11:44:21,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:21,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 569 transitions. [2022-04-15 11:44:21,686 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 569 transitions. [2022-04-15 11:44:22,066 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 569 edges. 569 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:44:22,077 INFO L225 Difference]: With dead ends: 616 [2022-04-15 11:44:22,077 INFO L226 Difference]: Without dead ends: 396 [2022-04-15 11:44:22,078 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:44:22,078 INFO L913 BasicCegarLoop]: 118 mSDtfsCounter, 120 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:44:22,078 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 338 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-04-15 11:44:22,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2022-04-15 11:44:22,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 310. [2022-04-15 11:44:22,101 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:44:22,101 INFO L82 GeneralOperation]: Start isEquivalent. First operand 396 states. Second operand has 310 states, 305 states have (on average 1.616393442622951) internal successors, (493), 305 states have internal predecessors, (493), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:22,102 INFO L74 IsIncluded]: Start isIncluded. First operand 396 states. Second operand has 310 states, 305 states have (on average 1.616393442622951) internal successors, (493), 305 states have internal predecessors, (493), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:22,102 INFO L87 Difference]: Start difference. First operand 396 states. Second operand has 310 states, 305 states have (on average 1.616393442622951) internal successors, (493), 305 states have internal predecessors, (493), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:22,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:22,111 INFO L93 Difference]: Finished difference Result 396 states and 623 transitions. [2022-04-15 11:44:22,111 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 623 transitions. [2022-04-15 11:44:22,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:44:22,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:44:22,112 INFO L74 IsIncluded]: Start isIncluded. First operand has 310 states, 305 states have (on average 1.616393442622951) internal successors, (493), 305 states have internal predecessors, (493), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 396 states. [2022-04-15 11:44:22,113 INFO L87 Difference]: Start difference. First operand has 310 states, 305 states have (on average 1.616393442622951) internal successors, (493), 305 states have internal predecessors, (493), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 396 states. [2022-04-15 11:44:22,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:22,122 INFO L93 Difference]: Finished difference Result 396 states and 623 transitions. [2022-04-15 11:44:22,122 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 623 transitions. [2022-04-15 11:44:22,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:44:22,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:44:22,123 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:44:22,123 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:44:22,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 305 states have (on average 1.616393442622951) internal successors, (493), 305 states have internal predecessors, (493), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:22,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 497 transitions. [2022-04-15 11:44:22,131 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 497 transitions. Word has length 94 [2022-04-15 11:44:22,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:44:22,131 INFO L478 AbstractCegarLoop]: Abstraction has 310 states and 497 transitions. [2022-04-15 11:44:22,131 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:22,131 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 310 states and 497 transitions. [2022-04-15 11:44:22,503 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 497 edges. 497 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:44:22,504 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 497 transitions. [2022-04-15 11:44:22,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-15 11:44:22,504 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:44:22,505 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:44:22,505 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-15 11:44:22,505 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:44:22,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:44:22,505 INFO L85 PathProgramCache]: Analyzing trace with hash -917913434, now seen corresponding path program 1 times [2022-04-15 11:44:22,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:44:22,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1001780428] [2022-04-15 11:44:22,561 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:44:22,561 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:44:22,562 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:44:22,562 INFO L85 PathProgramCache]: Analyzing trace with hash -917913434, now seen corresponding path program 2 times [2022-04-15 11:44:22,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:44:22,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453646703] [2022-04-15 11:44:22,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:44:22,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:44:22,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:44:22,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:44:22,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:44:22,679 INFO L290 TraceCheckUtils]: 0: Hoare triple {24997#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {24990#true} is VALID [2022-04-15 11:44:22,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {24990#true} assume true; {24990#true} is VALID [2022-04-15 11:44:22,680 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24990#true} {24990#true} #673#return; {24990#true} is VALID [2022-04-15 11:44:22,681 INFO L272 TraceCheckUtils]: 0: Hoare triple {24990#true} call ULTIMATE.init(); {24997#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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:44:22,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {24997#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {24990#true} is VALID [2022-04-15 11:44:22,681 INFO L290 TraceCheckUtils]: 2: Hoare triple {24990#true} assume true; {24990#true} is VALID [2022-04-15 11:44:22,681 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24990#true} {24990#true} #673#return; {24990#true} is VALID [2022-04-15 11:44:22,681 INFO L272 TraceCheckUtils]: 4: Hoare triple {24990#true} call #t~ret161 := main(); {24990#true} is VALID [2022-04-15 11:44:22,681 INFO L290 TraceCheckUtils]: 5: Hoare triple {24990#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; {24990#true} is VALID [2022-04-15 11:44:22,681 INFO L290 TraceCheckUtils]: 6: Hoare triple {24990#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {24990#true} is VALID [2022-04-15 11:44:22,681 INFO L272 TraceCheckUtils]: 7: Hoare triple {24990#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {24990#true} is VALID [2022-04-15 11:44:22,682 INFO L290 TraceCheckUtils]: 8: Hoare triple {24990#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); {24990#true} is VALID [2022-04-15 11:44:22,682 INFO L290 TraceCheckUtils]: 9: Hoare triple {24990#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; {24990#true} is VALID [2022-04-15 11:44:22,682 INFO L290 TraceCheckUtils]: 10: Hoare triple {24990#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; {24990#true} is VALID [2022-04-15 11:44:22,682 INFO L290 TraceCheckUtils]: 11: Hoare triple {24990#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {24990#true} is VALID [2022-04-15 11:44:22,682 INFO L290 TraceCheckUtils]: 12: Hoare triple {24990#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {24990#true} is VALID [2022-04-15 11:44:22,682 INFO L290 TraceCheckUtils]: 13: Hoare triple {24990#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {24990#true} is VALID [2022-04-15 11:44:22,682 INFO L290 TraceCheckUtils]: 14: Hoare triple {24990#true} assume !false; {24990#true} is VALID [2022-04-15 11:44:22,682 INFO L290 TraceCheckUtils]: 15: Hoare triple {24990#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); {24990#true} is VALID [2022-04-15 11:44:22,682 INFO L290 TraceCheckUtils]: 16: Hoare triple {24990#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {24990#true} is VALID [2022-04-15 11:44:22,682 INFO L290 TraceCheckUtils]: 17: Hoare triple {24990#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {24990#true} is VALID [2022-04-15 11:44:22,683 INFO L290 TraceCheckUtils]: 18: Hoare triple {24990#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {24990#true} is VALID [2022-04-15 11:44:22,683 INFO L290 TraceCheckUtils]: 19: Hoare triple {24990#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {24990#true} is VALID [2022-04-15 11:44:22,683 INFO L290 TraceCheckUtils]: 20: Hoare triple {24990#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {24990#true} is VALID [2022-04-15 11:44:22,683 INFO L290 TraceCheckUtils]: 21: Hoare triple {24990#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {24990#true} is VALID [2022-04-15 11:44:22,683 INFO L290 TraceCheckUtils]: 22: Hoare triple {24990#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {24990#true} is VALID [2022-04-15 11:44:22,683 INFO L290 TraceCheckUtils]: 23: Hoare triple {24990#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {24990#true} is VALID [2022-04-15 11:44:22,683 INFO L290 TraceCheckUtils]: 24: Hoare triple {24990#true} assume 8464 == #t~mem55;havoc #t~mem55; {24990#true} is VALID [2022-04-15 11:44:22,683 INFO L290 TraceCheckUtils]: 25: Hoare triple {24990#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; {24990#true} is VALID [2022-04-15 11:44:22,683 INFO L290 TraceCheckUtils]: 26: Hoare triple {24990#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {24990#true} is VALID [2022-04-15 11:44:22,684 INFO L290 TraceCheckUtils]: 27: Hoare triple {24990#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); {24995#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:22,685 INFO L290 TraceCheckUtils]: 28: Hoare triple {24995#(= 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); {24995#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:22,685 INFO L290 TraceCheckUtils]: 29: Hoare triple {24995#(= 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; {24995#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:22,686 INFO L290 TraceCheckUtils]: 30: Hoare triple {24995#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {24995#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:22,686 INFO L290 TraceCheckUtils]: 31: Hoare triple {24995#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {24995#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:22,687 INFO L290 TraceCheckUtils]: 32: Hoare triple {24995#(= 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); {24995#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:22,687 INFO L290 TraceCheckUtils]: 33: Hoare triple {24995#(= 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); {24995#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:22,687 INFO L290 TraceCheckUtils]: 34: Hoare triple {24995#(= 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); {24995#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:22,688 INFO L290 TraceCheckUtils]: 35: Hoare triple {24995#(= 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); {24995#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:22,688 INFO L290 TraceCheckUtils]: 36: Hoare triple {24995#(= 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); {24995#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:22,689 INFO L290 TraceCheckUtils]: 37: Hoare triple {24995#(= 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); {24995#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:22,689 INFO L290 TraceCheckUtils]: 38: Hoare triple {24995#(= 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); {24995#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:22,689 INFO L290 TraceCheckUtils]: 39: Hoare triple {24995#(= 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); {24995#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:22,690 INFO L290 TraceCheckUtils]: 40: Hoare triple {24995#(= 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); {24995#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:22,690 INFO L290 TraceCheckUtils]: 41: Hoare triple {24995#(= 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); {24995#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:22,691 INFO L290 TraceCheckUtils]: 42: Hoare triple {24995#(= 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); {24995#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:22,691 INFO L290 TraceCheckUtils]: 43: Hoare triple {24995#(= 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); {24996#(= |ssl3_accept_#t~mem58| 8496)} is VALID [2022-04-15 11:44:22,691 INFO L290 TraceCheckUtils]: 44: Hoare triple {24996#(= |ssl3_accept_#t~mem58| 8496)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {24991#false} is VALID [2022-04-15 11:44:22,692 INFO L290 TraceCheckUtils]: 45: Hoare triple {24991#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {24991#false} is VALID [2022-04-15 11:44:22,692 INFO L290 TraceCheckUtils]: 46: Hoare triple {24991#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {24991#false} is VALID [2022-04-15 11:44:22,692 INFO L290 TraceCheckUtils]: 47: Hoare triple {24991#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {24991#false} is VALID [2022-04-15 11:44:22,692 INFO L290 TraceCheckUtils]: 48: Hoare triple {24991#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {24991#false} is VALID [2022-04-15 11:44:22,692 INFO L290 TraceCheckUtils]: 49: Hoare triple {24991#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {24991#false} is VALID [2022-04-15 11:44:22,692 INFO L290 TraceCheckUtils]: 50: Hoare triple {24991#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {24991#false} is VALID [2022-04-15 11:44:22,692 INFO L290 TraceCheckUtils]: 51: Hoare triple {24991#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {24991#false} is VALID [2022-04-15 11:44:22,692 INFO L290 TraceCheckUtils]: 52: Hoare triple {24991#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {24991#false} is VALID [2022-04-15 11:44:22,692 INFO L290 TraceCheckUtils]: 53: Hoare triple {24991#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {24991#false} is VALID [2022-04-15 11:44:22,692 INFO L290 TraceCheckUtils]: 54: Hoare triple {24991#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {24991#false} is VALID [2022-04-15 11:44:22,693 INFO L290 TraceCheckUtils]: 55: Hoare triple {24991#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {24991#false} is VALID [2022-04-15 11:44:22,693 INFO L290 TraceCheckUtils]: 56: Hoare triple {24991#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {24991#false} is VALID [2022-04-15 11:44:22,693 INFO L290 TraceCheckUtils]: 57: Hoare triple {24991#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {24991#false} is VALID [2022-04-15 11:44:22,693 INFO L290 TraceCheckUtils]: 58: Hoare triple {24991#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {24991#false} is VALID [2022-04-15 11:44:22,693 INFO L290 TraceCheckUtils]: 59: Hoare triple {24991#false} assume 8608 == #t~mem73;havoc #t~mem73; {24991#false} is VALID [2022-04-15 11:44:22,693 INFO L290 TraceCheckUtils]: 60: Hoare triple {24991#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {24991#false} is VALID [2022-04-15 11:44:22,693 INFO L290 TraceCheckUtils]: 61: Hoare triple {24991#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); {24991#false} is VALID [2022-04-15 11:44:22,693 INFO L290 TraceCheckUtils]: 62: Hoare triple {24991#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); {24991#false} is VALID [2022-04-15 11:44:22,693 INFO L290 TraceCheckUtils]: 63: Hoare triple {24991#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {24991#false} is VALID [2022-04-15 11:44:22,694 INFO L290 TraceCheckUtils]: 64: Hoare triple {24991#false} ~skip~0 := 0; {24991#false} is VALID [2022-04-15 11:44:22,694 INFO L290 TraceCheckUtils]: 65: Hoare triple {24991#false} assume !false; {24991#false} is VALID [2022-04-15 11:44:22,694 INFO L290 TraceCheckUtils]: 66: Hoare triple {24991#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); {24991#false} is VALID [2022-04-15 11:44:22,694 INFO L290 TraceCheckUtils]: 67: Hoare triple {24991#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {24991#false} is VALID [2022-04-15 11:44:22,694 INFO L290 TraceCheckUtils]: 68: Hoare triple {24991#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {24991#false} is VALID [2022-04-15 11:44:22,694 INFO L290 TraceCheckUtils]: 69: Hoare triple {24991#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {24991#false} is VALID [2022-04-15 11:44:22,694 INFO L290 TraceCheckUtils]: 70: Hoare triple {24991#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {24991#false} is VALID [2022-04-15 11:44:22,694 INFO L290 TraceCheckUtils]: 71: Hoare triple {24991#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {24991#false} is VALID [2022-04-15 11:44:22,694 INFO L290 TraceCheckUtils]: 72: Hoare triple {24991#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {24991#false} is VALID [2022-04-15 11:44:22,695 INFO L290 TraceCheckUtils]: 73: Hoare triple {24991#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {24991#false} is VALID [2022-04-15 11:44:22,695 INFO L290 TraceCheckUtils]: 74: Hoare triple {24991#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {24991#false} is VALID [2022-04-15 11:44:22,695 INFO L290 TraceCheckUtils]: 75: Hoare triple {24991#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {24991#false} is VALID [2022-04-15 11:44:22,695 INFO L290 TraceCheckUtils]: 76: Hoare triple {24991#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {24991#false} is VALID [2022-04-15 11:44:22,695 INFO L290 TraceCheckUtils]: 77: Hoare triple {24991#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {24991#false} is VALID [2022-04-15 11:44:22,695 INFO L290 TraceCheckUtils]: 78: Hoare triple {24991#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {24991#false} is VALID [2022-04-15 11:44:22,695 INFO L290 TraceCheckUtils]: 79: Hoare triple {24991#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {24991#false} is VALID [2022-04-15 11:44:22,695 INFO L290 TraceCheckUtils]: 80: Hoare triple {24991#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {24991#false} is VALID [2022-04-15 11:44:22,695 INFO L290 TraceCheckUtils]: 81: Hoare triple {24991#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {24991#false} is VALID [2022-04-15 11:44:22,695 INFO L290 TraceCheckUtils]: 82: Hoare triple {24991#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {24991#false} is VALID [2022-04-15 11:44:22,696 INFO L290 TraceCheckUtils]: 83: Hoare triple {24991#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {24991#false} is VALID [2022-04-15 11:44:22,696 INFO L290 TraceCheckUtils]: 84: Hoare triple {24991#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {24991#false} is VALID [2022-04-15 11:44:22,696 INFO L290 TraceCheckUtils]: 85: Hoare triple {24991#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {24991#false} is VALID [2022-04-15 11:44:22,696 INFO L290 TraceCheckUtils]: 86: Hoare triple {24991#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {24991#false} is VALID [2022-04-15 11:44:22,696 INFO L290 TraceCheckUtils]: 87: Hoare triple {24991#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {24991#false} is VALID [2022-04-15 11:44:22,696 INFO L290 TraceCheckUtils]: 88: Hoare triple {24991#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {24991#false} is VALID [2022-04-15 11:44:22,696 INFO L290 TraceCheckUtils]: 89: Hoare triple {24991#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {24991#false} is VALID [2022-04-15 11:44:22,696 INFO L290 TraceCheckUtils]: 90: Hoare triple {24991#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {24991#false} is VALID [2022-04-15 11:44:22,696 INFO L290 TraceCheckUtils]: 91: Hoare triple {24991#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {24991#false} is VALID [2022-04-15 11:44:22,697 INFO L290 TraceCheckUtils]: 92: Hoare triple {24991#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {24991#false} is VALID [2022-04-15 11:44:22,697 INFO L290 TraceCheckUtils]: 93: Hoare triple {24991#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {24991#false} is VALID [2022-04-15 11:44:22,697 INFO L290 TraceCheckUtils]: 94: Hoare triple {24991#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {24991#false} is VALID [2022-04-15 11:44:22,697 INFO L290 TraceCheckUtils]: 95: Hoare triple {24991#false} assume 8640 == #t~mem75;havoc #t~mem75; {24991#false} is VALID [2022-04-15 11:44:22,697 INFO L290 TraceCheckUtils]: 96: Hoare triple {24991#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {24991#false} is VALID [2022-04-15 11:44:22,697 INFO L290 TraceCheckUtils]: 97: Hoare triple {24991#false} assume !(4 == ~blastFlag~0); {24991#false} is VALID [2022-04-15 11:44:22,697 INFO L290 TraceCheckUtils]: 98: Hoare triple {24991#false} assume !false; {24991#false} is VALID [2022-04-15 11:44:22,698 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-15 11:44:22,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:44:22,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453646703] [2022-04-15 11:44:22,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453646703] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:44:22,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:44:22,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:44:22,698 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:44:22,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1001780428] [2022-04-15 11:44:22,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1001780428] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:44:22,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:44:22,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:44:22,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891713185] [2022-04-15 11:44:22,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:44:22,699 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 99 [2022-04-15 11:44:22,699 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:44:22,700 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:44:22,766 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:44:22,766 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:44:22,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:44:22,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:44:22,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:44:22,767 INFO L87 Difference]: Start difference. First operand 310 states and 497 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:44:24,991 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:44:30,958 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:44:31,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:31,871 INFO L93 Difference]: Finished difference Result 636 states and 1026 transitions. [2022-04-15 11:44:31,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:44:31,871 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 99 [2022-04-15 11:44:31,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:44:31,871 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:44:31,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 461 transitions. [2022-04-15 11:44:31,874 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:44:31,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 461 transitions. [2022-04-15 11:44:31,876 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 461 transitions. [2022-04-15 11:44:32,166 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:44:32,174 INFO L225 Difference]: With dead ends: 636 [2022-04-15 11:44:32,175 INFO L226 Difference]: Without dead ends: 352 [2022-04-15 11:44:32,175 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:44:32,176 INFO L913 BasicCegarLoop]: 189 mSDtfsCounter, 31 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-04-15 11:44:32,176 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 487 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-04-15 11:44:32,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2022-04-15 11:44:32,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 332. [2022-04-15 11:44:32,192 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:44:32,194 INFO L82 GeneralOperation]: Start isEquivalent. First operand 352 states. Second operand has 332 states, 327 states have (on average 1.614678899082569) internal successors, (528), 327 states have internal predecessors, (528), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:32,195 INFO L74 IsIncluded]: Start isIncluded. First operand 352 states. Second operand has 332 states, 327 states have (on average 1.614678899082569) internal successors, (528), 327 states have internal predecessors, (528), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:32,195 INFO L87 Difference]: Start difference. First operand 352 states. Second operand has 332 states, 327 states have (on average 1.614678899082569) internal successors, (528), 327 states have internal predecessors, (528), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:32,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:32,202 INFO L93 Difference]: Finished difference Result 352 states and 558 transitions. [2022-04-15 11:44:32,202 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 558 transitions. [2022-04-15 11:44:32,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:44:32,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:44:32,204 INFO L74 IsIncluded]: Start isIncluded. First operand has 332 states, 327 states have (on average 1.614678899082569) internal successors, (528), 327 states have internal predecessors, (528), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 352 states. [2022-04-15 11:44:32,205 INFO L87 Difference]: Start difference. First operand has 332 states, 327 states have (on average 1.614678899082569) internal successors, (528), 327 states have internal predecessors, (528), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 352 states. [2022-04-15 11:44:32,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:32,212 INFO L93 Difference]: Finished difference Result 352 states and 558 transitions. [2022-04-15 11:44:32,212 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 558 transitions. [2022-04-15 11:44:32,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:44:32,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:44:32,218 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:44:32,218 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:44:32,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 327 states have (on average 1.614678899082569) internal successors, (528), 327 states have internal predecessors, (528), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:32,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 532 transitions. [2022-04-15 11:44:32,226 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 532 transitions. Word has length 99 [2022-04-15 11:44:32,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:44:32,227 INFO L478 AbstractCegarLoop]: Abstraction has 332 states and 532 transitions. [2022-04-15 11:44:32,227 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:44:32,227 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 332 states and 532 transitions. [2022-04-15 11:44:32,645 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 532 edges. 532 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:44:32,646 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 532 transitions. [2022-04-15 11:44:32,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-04-15 11:44:32,646 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:44:32,647 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:44:32,647 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-15 11:44:32,647 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:44:32,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:44:32,647 INFO L85 PathProgramCache]: Analyzing trace with hash -16281119, now seen corresponding path program 1 times [2022-04-15 11:44:32,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:44:32,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1300579542] [2022-04-15 11:44:32,702 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:44:32,703 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:44:32,703 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:44:32,703 INFO L85 PathProgramCache]: Analyzing trace with hash -16281119, now seen corresponding path program 2 times [2022-04-15 11:44:32,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:44:32,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714686358] [2022-04-15 11:44:32,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:44:32,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:44:32,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:44:32,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:44:32,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:44:32,830 INFO L290 TraceCheckUtils]: 0: Hoare triple {27649#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {27642#true} is VALID [2022-04-15 11:44:32,830 INFO L290 TraceCheckUtils]: 1: Hoare triple {27642#true} assume true; {27642#true} is VALID [2022-04-15 11:44:32,830 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27642#true} {27642#true} #673#return; {27642#true} is VALID [2022-04-15 11:44:32,831 INFO L272 TraceCheckUtils]: 0: Hoare triple {27642#true} call ULTIMATE.init(); {27649#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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:44:32,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {27649#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {27642#true} is VALID [2022-04-15 11:44:32,831 INFO L290 TraceCheckUtils]: 2: Hoare triple {27642#true} assume true; {27642#true} is VALID [2022-04-15 11:44:32,831 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27642#true} {27642#true} #673#return; {27642#true} is VALID [2022-04-15 11:44:32,832 INFO L272 TraceCheckUtils]: 4: Hoare triple {27642#true} call #t~ret161 := main(); {27642#true} is VALID [2022-04-15 11:44:32,832 INFO L290 TraceCheckUtils]: 5: Hoare triple {27642#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; {27642#true} is VALID [2022-04-15 11:44:32,832 INFO L290 TraceCheckUtils]: 6: Hoare triple {27642#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {27642#true} is VALID [2022-04-15 11:44:32,832 INFO L272 TraceCheckUtils]: 7: Hoare triple {27642#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {27642#true} is VALID [2022-04-15 11:44:32,832 INFO L290 TraceCheckUtils]: 8: Hoare triple {27642#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); {27642#true} is VALID [2022-04-15 11:44:32,832 INFO L290 TraceCheckUtils]: 9: Hoare triple {27642#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; {27642#true} is VALID [2022-04-15 11:44:32,832 INFO L290 TraceCheckUtils]: 10: Hoare triple {27642#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; {27642#true} is VALID [2022-04-15 11:44:32,832 INFO L290 TraceCheckUtils]: 11: Hoare triple {27642#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {27642#true} is VALID [2022-04-15 11:44:32,832 INFO L290 TraceCheckUtils]: 12: Hoare triple {27642#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {27642#true} is VALID [2022-04-15 11:44:32,832 INFO L290 TraceCheckUtils]: 13: Hoare triple {27642#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {27642#true} is VALID [2022-04-15 11:44:32,833 INFO L290 TraceCheckUtils]: 14: Hoare triple {27642#true} assume !false; {27642#true} is VALID [2022-04-15 11:44:32,833 INFO L290 TraceCheckUtils]: 15: Hoare triple {27642#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); {27642#true} is VALID [2022-04-15 11:44:32,833 INFO L290 TraceCheckUtils]: 16: Hoare triple {27642#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {27642#true} is VALID [2022-04-15 11:44:32,833 INFO L290 TraceCheckUtils]: 17: Hoare triple {27642#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {27642#true} is VALID [2022-04-15 11:44:32,833 INFO L290 TraceCheckUtils]: 18: Hoare triple {27642#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {27642#true} is VALID [2022-04-15 11:44:32,833 INFO L290 TraceCheckUtils]: 19: Hoare triple {27642#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {27642#true} is VALID [2022-04-15 11:44:32,833 INFO L290 TraceCheckUtils]: 20: Hoare triple {27642#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {27642#true} is VALID [2022-04-15 11:44:32,833 INFO L290 TraceCheckUtils]: 21: Hoare triple {27642#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {27642#true} is VALID [2022-04-15 11:44:32,833 INFO L290 TraceCheckUtils]: 22: Hoare triple {27642#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {27642#true} is VALID [2022-04-15 11:44:32,833 INFO L290 TraceCheckUtils]: 23: Hoare triple {27642#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {27642#true} is VALID [2022-04-15 11:44:32,833 INFO L290 TraceCheckUtils]: 24: Hoare triple {27642#true} assume 8464 == #t~mem55;havoc #t~mem55; {27642#true} is VALID [2022-04-15 11:44:32,834 INFO L290 TraceCheckUtils]: 25: Hoare triple {27642#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; {27642#true} is VALID [2022-04-15 11:44:32,834 INFO L290 TraceCheckUtils]: 26: Hoare triple {27642#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {27642#true} is VALID [2022-04-15 11:44:32,835 INFO L290 TraceCheckUtils]: 27: Hoare triple {27642#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); {27647#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:44:32,835 INFO L290 TraceCheckUtils]: 28: Hoare triple {27647#(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); {27647#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:44:32,836 INFO L290 TraceCheckUtils]: 29: Hoare triple {27647#(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; {27647#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:44:32,836 INFO L290 TraceCheckUtils]: 30: Hoare triple {27647#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} ~skip~0 := 0; {27647#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:44:32,836 INFO L290 TraceCheckUtils]: 31: Hoare triple {27647#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !false; {27647#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:44:32,837 INFO L290 TraceCheckUtils]: 32: Hoare triple {27647#(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); {27647#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:44:32,837 INFO L290 TraceCheckUtils]: 33: Hoare triple {27647#(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); {27647#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:44:32,838 INFO L290 TraceCheckUtils]: 34: Hoare triple {27647#(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); {27647#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:44:32,838 INFO L290 TraceCheckUtils]: 35: Hoare triple {27647#(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); {27647#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:44:32,839 INFO L290 TraceCheckUtils]: 36: Hoare triple {27647#(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); {27647#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:44:32,839 INFO L290 TraceCheckUtils]: 37: Hoare triple {27647#(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); {27647#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:44:32,839 INFO L290 TraceCheckUtils]: 38: Hoare triple {27647#(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); {27648#(not (= |ssl3_accept_#t~mem53| 8481))} is VALID [2022-04-15 11:44:32,840 INFO L290 TraceCheckUtils]: 39: Hoare triple {27648#(not (= |ssl3_accept_#t~mem53| 8481))} assume 8481 == #t~mem53;havoc #t~mem53; {27643#false} is VALID [2022-04-15 11:44:32,840 INFO L290 TraceCheckUtils]: 40: Hoare triple {27643#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; {27643#false} is VALID [2022-04-15 11:44:32,840 INFO L290 TraceCheckUtils]: 41: Hoare triple {27643#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); {27643#false} is VALID [2022-04-15 11:44:32,840 INFO L290 TraceCheckUtils]: 42: Hoare triple {27643#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); {27643#false} is VALID [2022-04-15 11:44:32,840 INFO L290 TraceCheckUtils]: 43: Hoare triple {27643#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {27643#false} is VALID [2022-04-15 11:44:32,840 INFO L290 TraceCheckUtils]: 44: Hoare triple {27643#false} ~skip~0 := 0; {27643#false} is VALID [2022-04-15 11:44:32,840 INFO L290 TraceCheckUtils]: 45: Hoare triple {27643#false} assume !false; {27643#false} is VALID [2022-04-15 11:44:32,841 INFO L290 TraceCheckUtils]: 46: Hoare triple {27643#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); {27643#false} is VALID [2022-04-15 11:44:32,841 INFO L290 TraceCheckUtils]: 47: Hoare triple {27643#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {27643#false} is VALID [2022-04-15 11:44:32,841 INFO L290 TraceCheckUtils]: 48: Hoare triple {27643#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {27643#false} is VALID [2022-04-15 11:44:32,841 INFO L290 TraceCheckUtils]: 49: Hoare triple {27643#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {27643#false} is VALID [2022-04-15 11:44:32,841 INFO L290 TraceCheckUtils]: 50: Hoare triple {27643#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {27643#false} is VALID [2022-04-15 11:44:32,841 INFO L290 TraceCheckUtils]: 51: Hoare triple {27643#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {27643#false} is VALID [2022-04-15 11:44:32,841 INFO L290 TraceCheckUtils]: 52: Hoare triple {27643#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {27643#false} is VALID [2022-04-15 11:44:32,841 INFO L290 TraceCheckUtils]: 53: Hoare triple {27643#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {27643#false} is VALID [2022-04-15 11:44:32,841 INFO L290 TraceCheckUtils]: 54: Hoare triple {27643#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {27643#false} is VALID [2022-04-15 11:44:32,841 INFO L290 TraceCheckUtils]: 55: Hoare triple {27643#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {27643#false} is VALID [2022-04-15 11:44:32,842 INFO L290 TraceCheckUtils]: 56: Hoare triple {27643#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {27643#false} is VALID [2022-04-15 11:44:32,842 INFO L290 TraceCheckUtils]: 57: Hoare triple {27643#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {27643#false} is VALID [2022-04-15 11:44:32,842 INFO L290 TraceCheckUtils]: 58: Hoare triple {27643#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {27643#false} is VALID [2022-04-15 11:44:32,842 INFO L290 TraceCheckUtils]: 59: Hoare triple {27643#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {27643#false} is VALID [2022-04-15 11:44:32,842 INFO L290 TraceCheckUtils]: 60: Hoare triple {27643#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {27643#false} is VALID [2022-04-15 11:44:32,842 INFO L290 TraceCheckUtils]: 61: Hoare triple {27643#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {27643#false} is VALID [2022-04-15 11:44:32,842 INFO L290 TraceCheckUtils]: 62: Hoare triple {27643#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {27643#false} is VALID [2022-04-15 11:44:32,842 INFO L290 TraceCheckUtils]: 63: Hoare triple {27643#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {27643#false} is VALID [2022-04-15 11:44:32,842 INFO L290 TraceCheckUtils]: 64: Hoare triple {27643#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {27643#false} is VALID [2022-04-15 11:44:32,842 INFO L290 TraceCheckUtils]: 65: Hoare triple {27643#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {27643#false} is VALID [2022-04-15 11:44:32,843 INFO L290 TraceCheckUtils]: 66: Hoare triple {27643#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {27643#false} is VALID [2022-04-15 11:44:32,843 INFO L290 TraceCheckUtils]: 67: Hoare triple {27643#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {27643#false} is VALID [2022-04-15 11:44:32,843 INFO L290 TraceCheckUtils]: 68: Hoare triple {27643#false} assume 8448 == #t~mem68;havoc #t~mem68; {27643#false} is VALID [2022-04-15 11:44:32,843 INFO L290 TraceCheckUtils]: 69: Hoare triple {27643#false} assume !(~num1~0 > 0); {27643#false} is VALID [2022-04-15 11:44:32,843 INFO L290 TraceCheckUtils]: 70: Hoare triple {27643#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; {27643#false} is VALID [2022-04-15 11:44:32,843 INFO L290 TraceCheckUtils]: 71: Hoare triple {27643#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); {27643#false} is VALID [2022-04-15 11:44:32,843 INFO L290 TraceCheckUtils]: 72: Hoare triple {27643#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {27643#false} is VALID [2022-04-15 11:44:32,843 INFO L290 TraceCheckUtils]: 73: Hoare triple {27643#false} ~skip~0 := 0; {27643#false} is VALID [2022-04-15 11:44:32,843 INFO L290 TraceCheckUtils]: 74: Hoare triple {27643#false} assume !false; {27643#false} is VALID [2022-04-15 11:44:32,844 INFO L290 TraceCheckUtils]: 75: Hoare triple {27643#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); {27643#false} is VALID [2022-04-15 11:44:32,844 INFO L290 TraceCheckUtils]: 76: Hoare triple {27643#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {27643#false} is VALID [2022-04-15 11:44:32,844 INFO L290 TraceCheckUtils]: 77: Hoare triple {27643#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {27643#false} is VALID [2022-04-15 11:44:32,844 INFO L290 TraceCheckUtils]: 78: Hoare triple {27643#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {27643#false} is VALID [2022-04-15 11:44:32,844 INFO L290 TraceCheckUtils]: 79: Hoare triple {27643#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {27643#false} is VALID [2022-04-15 11:44:32,844 INFO L290 TraceCheckUtils]: 80: Hoare triple {27643#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {27643#false} is VALID [2022-04-15 11:44:32,844 INFO L290 TraceCheckUtils]: 81: Hoare triple {27643#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {27643#false} is VALID [2022-04-15 11:44:32,844 INFO L290 TraceCheckUtils]: 82: Hoare triple {27643#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {27643#false} is VALID [2022-04-15 11:44:32,844 INFO L290 TraceCheckUtils]: 83: Hoare triple {27643#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {27643#false} is VALID [2022-04-15 11:44:32,844 INFO L290 TraceCheckUtils]: 84: Hoare triple {27643#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {27643#false} is VALID [2022-04-15 11:44:32,845 INFO L290 TraceCheckUtils]: 85: Hoare triple {27643#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {27643#false} is VALID [2022-04-15 11:44:32,845 INFO L290 TraceCheckUtils]: 86: Hoare triple {27643#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {27643#false} is VALID [2022-04-15 11:44:32,845 INFO L290 TraceCheckUtils]: 87: Hoare triple {27643#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {27643#false} is VALID [2022-04-15 11:44:32,845 INFO L290 TraceCheckUtils]: 88: Hoare triple {27643#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {27643#false} is VALID [2022-04-15 11:44:32,845 INFO L290 TraceCheckUtils]: 89: Hoare triple {27643#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {27643#false} is VALID [2022-04-15 11:44:32,845 INFO L290 TraceCheckUtils]: 90: Hoare triple {27643#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {27643#false} is VALID [2022-04-15 11:44:32,845 INFO L290 TraceCheckUtils]: 91: Hoare triple {27643#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {27643#false} is VALID [2022-04-15 11:44:32,845 INFO L290 TraceCheckUtils]: 92: Hoare triple {27643#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {27643#false} is VALID [2022-04-15 11:44:32,845 INFO L290 TraceCheckUtils]: 93: Hoare triple {27643#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {27643#false} is VALID [2022-04-15 11:44:32,845 INFO L290 TraceCheckUtils]: 94: Hoare triple {27643#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {27643#false} is VALID [2022-04-15 11:44:32,846 INFO L290 TraceCheckUtils]: 95: Hoare triple {27643#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {27643#false} is VALID [2022-04-15 11:44:32,846 INFO L290 TraceCheckUtils]: 96: Hoare triple {27643#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {27643#false} is VALID [2022-04-15 11:44:32,846 INFO L290 TraceCheckUtils]: 97: Hoare triple {27643#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {27643#false} is VALID [2022-04-15 11:44:32,846 INFO L290 TraceCheckUtils]: 98: Hoare triple {27643#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {27643#false} is VALID [2022-04-15 11:44:32,846 INFO L290 TraceCheckUtils]: 99: Hoare triple {27643#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {27643#false} is VALID [2022-04-15 11:44:32,846 INFO L290 TraceCheckUtils]: 100: Hoare triple {27643#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {27643#false} is VALID [2022-04-15 11:44:32,846 INFO L290 TraceCheckUtils]: 101: Hoare triple {27643#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {27643#false} is VALID [2022-04-15 11:44:32,846 INFO L290 TraceCheckUtils]: 102: Hoare triple {27643#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {27643#false} is VALID [2022-04-15 11:44:32,846 INFO L290 TraceCheckUtils]: 103: Hoare triple {27643#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {27643#false} is VALID [2022-04-15 11:44:32,847 INFO L290 TraceCheckUtils]: 104: Hoare triple {27643#false} assume 8640 == #t~mem75;havoc #t~mem75; {27643#false} is VALID [2022-04-15 11:44:32,847 INFO L290 TraceCheckUtils]: 105: Hoare triple {27643#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {27643#false} is VALID [2022-04-15 11:44:32,847 INFO L290 TraceCheckUtils]: 106: Hoare triple {27643#false} assume !(4 == ~blastFlag~0); {27643#false} is VALID [2022-04-15 11:44:32,847 INFO L290 TraceCheckUtils]: 107: Hoare triple {27643#false} assume !false; {27643#false} is VALID [2022-04-15 11:44:32,847 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-15 11:44:32,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:44:32,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714686358] [2022-04-15 11:44:32,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714686358] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:44:32,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:44:32,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:44:32,848 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:44:32,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1300579542] [2022-04-15 11:44:32,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1300579542] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:44:32,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:44:32,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:44:32,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499032709] [2022-04-15 11:44:32,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:44:32,849 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 108 [2022-04-15 11:44:32,849 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:44:32,849 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:44:32,913 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:44:32,913 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:44:32,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:44:32,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:44:32,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:44:32,914 INFO L87 Difference]: Start difference. First operand 332 states and 532 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:44:36,284 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:44:43,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:43,041 INFO L93 Difference]: Finished difference Result 712 states and 1136 transitions. [2022-04-15 11:44:43,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:44:43,041 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 108 [2022-04-15 11:44:43,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:44:43,041 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:44:43,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 573 transitions. [2022-04-15 11:44:43,044 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:44:43,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 573 transitions. [2022-04-15 11:44:43,046 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 573 transitions. [2022-04-15 11:44:43,427 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 573 edges. 573 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:44:43,434 INFO L225 Difference]: With dead ends: 712 [2022-04-15 11:44:43,434 INFO L226 Difference]: Without dead ends: 406 [2022-04-15 11:44:43,435 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:44:43,435 INFO L913 BasicCegarLoop]: 112 mSDtfsCounter, 136 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:44:43,436 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 326 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-04-15 11:44:43,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2022-04-15 11:44:43,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 332. [2022-04-15 11:44:43,453 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:44:43,454 INFO L82 GeneralOperation]: Start isEquivalent. First operand 406 states. Second operand has 332 states, 327 states have (on average 1.599388379204893) internal successors, (523), 327 states have internal predecessors, (523), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:43,454 INFO L74 IsIncluded]: Start isIncluded. First operand 406 states. Second operand has 332 states, 327 states have (on average 1.599388379204893) internal successors, (523), 327 states have internal predecessors, (523), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:43,455 INFO L87 Difference]: Start difference. First operand 406 states. Second operand has 332 states, 327 states have (on average 1.599388379204893) internal successors, (523), 327 states have internal predecessors, (523), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:43,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:43,464 INFO L93 Difference]: Finished difference Result 406 states and 629 transitions. [2022-04-15 11:44:43,464 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 629 transitions. [2022-04-15 11:44:43,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:44:43,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:44:43,466 INFO L74 IsIncluded]: Start isIncluded. First operand has 332 states, 327 states have (on average 1.599388379204893) internal successors, (523), 327 states have internal predecessors, (523), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 406 states. [2022-04-15 11:44:43,466 INFO L87 Difference]: Start difference. First operand has 332 states, 327 states have (on average 1.599388379204893) internal successors, (523), 327 states have internal predecessors, (523), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 406 states. [2022-04-15 11:44:43,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:43,475 INFO L93 Difference]: Finished difference Result 406 states and 629 transitions. [2022-04-15 11:44:43,476 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 629 transitions. [2022-04-15 11:44:43,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:44:43,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:44:43,476 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:44:43,477 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:44:43,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 327 states have (on average 1.599388379204893) internal successors, (523), 327 states have internal predecessors, (523), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:43,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 527 transitions. [2022-04-15 11:44:43,485 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 527 transitions. Word has length 108 [2022-04-15 11:44:43,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:44:43,485 INFO L478 AbstractCegarLoop]: Abstraction has 332 states and 527 transitions. [2022-04-15 11:44:43,486 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:44:43,486 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 332 states and 527 transitions. [2022-04-15 11:44:43,899 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 527 edges. 527 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:44:43,900 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 527 transitions. [2022-04-15 11:44:43,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-04-15 11:44:43,900 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:44:43,900 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:44:43,900 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-15 11:44:43,901 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:44:43,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:44:43,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1166050000, now seen corresponding path program 1 times [2022-04-15 11:44:43,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:44:43,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1630043929] [2022-04-15 11:44:43,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:44:43,964 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:44:43,964 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:44:43,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1166050000, now seen corresponding path program 2 times [2022-04-15 11:44:43,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:44:43,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151131139] [2022-04-15 11:44:43,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:44:43,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:44:44,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:44:44,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:44:44,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:44:44,094 INFO L290 TraceCheckUtils]: 0: Hoare triple {30561#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {30554#true} is VALID [2022-04-15 11:44:44,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {30554#true} assume true; {30554#true} is VALID [2022-04-15 11:44:44,094 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30554#true} {30554#true} #673#return; {30554#true} is VALID [2022-04-15 11:44:44,095 INFO L272 TraceCheckUtils]: 0: Hoare triple {30554#true} call ULTIMATE.init(); {30561#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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:44:44,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {30561#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {30554#true} is VALID [2022-04-15 11:44:44,095 INFO L290 TraceCheckUtils]: 2: Hoare triple {30554#true} assume true; {30554#true} is VALID [2022-04-15 11:44:44,095 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30554#true} {30554#true} #673#return; {30554#true} is VALID [2022-04-15 11:44:44,095 INFO L272 TraceCheckUtils]: 4: Hoare triple {30554#true} call #t~ret161 := main(); {30554#true} is VALID [2022-04-15 11:44:44,095 INFO L290 TraceCheckUtils]: 5: Hoare triple {30554#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; {30554#true} is VALID [2022-04-15 11:44:44,096 INFO L290 TraceCheckUtils]: 6: Hoare triple {30554#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {30554#true} is VALID [2022-04-15 11:44:44,096 INFO L272 TraceCheckUtils]: 7: Hoare triple {30554#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {30554#true} is VALID [2022-04-15 11:44:44,096 INFO L290 TraceCheckUtils]: 8: Hoare triple {30554#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); {30554#true} is VALID [2022-04-15 11:44:44,096 INFO L290 TraceCheckUtils]: 9: Hoare triple {30554#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; {30554#true} is VALID [2022-04-15 11:44:44,096 INFO L290 TraceCheckUtils]: 10: Hoare triple {30554#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; {30554#true} is VALID [2022-04-15 11:44:44,096 INFO L290 TraceCheckUtils]: 11: Hoare triple {30554#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {30554#true} is VALID [2022-04-15 11:44:44,096 INFO L290 TraceCheckUtils]: 12: Hoare triple {30554#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {30554#true} is VALID [2022-04-15 11:44:44,096 INFO L290 TraceCheckUtils]: 13: Hoare triple {30554#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {30554#true} is VALID [2022-04-15 11:44:44,096 INFO L290 TraceCheckUtils]: 14: Hoare triple {30554#true} assume !false; {30554#true} is VALID [2022-04-15 11:44:44,097 INFO L290 TraceCheckUtils]: 15: Hoare triple {30554#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); {30554#true} is VALID [2022-04-15 11:44:44,097 INFO L290 TraceCheckUtils]: 16: Hoare triple {30554#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {30554#true} is VALID [2022-04-15 11:44:44,097 INFO L290 TraceCheckUtils]: 17: Hoare triple {30554#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {30554#true} is VALID [2022-04-15 11:44:44,097 INFO L290 TraceCheckUtils]: 18: Hoare triple {30554#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {30554#true} is VALID [2022-04-15 11:44:44,097 INFO L290 TraceCheckUtils]: 19: Hoare triple {30554#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {30554#true} is VALID [2022-04-15 11:44:44,097 INFO L290 TraceCheckUtils]: 20: Hoare triple {30554#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {30554#true} is VALID [2022-04-15 11:44:44,097 INFO L290 TraceCheckUtils]: 21: Hoare triple {30554#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {30554#true} is VALID [2022-04-15 11:44:44,097 INFO L290 TraceCheckUtils]: 22: Hoare triple {30554#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {30554#true} is VALID [2022-04-15 11:44:44,097 INFO L290 TraceCheckUtils]: 23: Hoare triple {30554#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {30554#true} is VALID [2022-04-15 11:44:44,098 INFO L290 TraceCheckUtils]: 24: Hoare triple {30554#true} assume 8464 == #t~mem55;havoc #t~mem55; {30554#true} is VALID [2022-04-15 11:44:44,098 INFO L290 TraceCheckUtils]: 25: Hoare triple {30554#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; {30554#true} is VALID [2022-04-15 11:44:44,098 INFO L290 TraceCheckUtils]: 26: Hoare triple {30554#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {30554#true} is VALID [2022-04-15 11:44:44,098 INFO L290 TraceCheckUtils]: 27: Hoare triple {30554#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); {30554#true} is VALID [2022-04-15 11:44:44,098 INFO L290 TraceCheckUtils]: 28: Hoare triple {30554#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); {30554#true} is VALID [2022-04-15 11:44:44,098 INFO L290 TraceCheckUtils]: 29: Hoare triple {30554#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {30554#true} is VALID [2022-04-15 11:44:44,098 INFO L290 TraceCheckUtils]: 30: Hoare triple {30554#true} ~skip~0 := 0; {30554#true} is VALID [2022-04-15 11:44:44,098 INFO L290 TraceCheckUtils]: 31: Hoare triple {30554#true} assume !false; {30554#true} is VALID [2022-04-15 11:44:44,098 INFO L290 TraceCheckUtils]: 32: Hoare triple {30554#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); {30554#true} is VALID [2022-04-15 11:44:44,098 INFO L290 TraceCheckUtils]: 33: Hoare triple {30554#true} assume 12292 == #t~mem47;havoc #t~mem47; {30554#true} is VALID [2022-04-15 11:44:44,099 INFO L290 TraceCheckUtils]: 34: Hoare triple {30554#true} call write~int(1, ~s.base, 40 + ~s.offset, 4); {30554#true} is VALID [2022-04-15 11:44:44,099 INFO L290 TraceCheckUtils]: 35: Hoare triple {30554#true} call write~int(1, ~s.base, 36 + ~s.offset, 4); {30554#true} is VALID [2022-04-15 11:44:44,099 INFO L290 TraceCheckUtils]: 36: Hoare triple {30554#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {30554#true} is VALID [2022-04-15 11:44:44,099 INFO L290 TraceCheckUtils]: 37: Hoare triple {30554#true} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {30554#true} is VALID [2022-04-15 11:44:44,099 INFO L290 TraceCheckUtils]: 38: Hoare triple {30554#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); {30554#true} is VALID [2022-04-15 11:44:44,099 INFO L290 TraceCheckUtils]: 39: Hoare triple {30554#true} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {30554#true} is VALID [2022-04-15 11:44:44,099 INFO L290 TraceCheckUtils]: 40: Hoare triple {30554#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); {30554#true} is VALID [2022-04-15 11:44:44,100 INFO L290 TraceCheckUtils]: 41: Hoare triple {30554#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); {30559#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:44,101 INFO L290 TraceCheckUtils]: 42: Hoare triple {30559#(= 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); {30559#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:44,101 INFO L290 TraceCheckUtils]: 43: Hoare triple {30559#(= 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; {30559#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:44,102 INFO L290 TraceCheckUtils]: 44: Hoare triple {30559#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {30559#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:44,102 INFO L290 TraceCheckUtils]: 45: Hoare triple {30559#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {30559#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:44,102 INFO L290 TraceCheckUtils]: 46: Hoare triple {30559#(= 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); {30559#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:44,103 INFO L290 TraceCheckUtils]: 47: Hoare triple {30559#(= 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); {30559#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:44,103 INFO L290 TraceCheckUtils]: 48: Hoare triple {30559#(= 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); {30559#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:44,104 INFO L290 TraceCheckUtils]: 49: Hoare triple {30559#(= 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); {30559#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:44,104 INFO L290 TraceCheckUtils]: 50: Hoare triple {30559#(= 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); {30559#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:44,105 INFO L290 TraceCheckUtils]: 51: Hoare triple {30559#(= 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); {30560#(= |ssl3_accept_#t~mem52| 8480)} is VALID [2022-04-15 11:44:44,105 INFO L290 TraceCheckUtils]: 52: Hoare triple {30560#(= |ssl3_accept_#t~mem52| 8480)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {30555#false} is VALID [2022-04-15 11:44:44,105 INFO L290 TraceCheckUtils]: 53: Hoare triple {30555#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {30555#false} is VALID [2022-04-15 11:44:44,105 INFO L290 TraceCheckUtils]: 54: Hoare triple {30555#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {30555#false} is VALID [2022-04-15 11:44:44,105 INFO L290 TraceCheckUtils]: 55: Hoare triple {30555#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {30555#false} is VALID [2022-04-15 11:44:44,105 INFO L290 TraceCheckUtils]: 56: Hoare triple {30555#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {30555#false} is VALID [2022-04-15 11:44:44,106 INFO L290 TraceCheckUtils]: 57: Hoare triple {30555#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {30555#false} is VALID [2022-04-15 11:44:44,106 INFO L290 TraceCheckUtils]: 58: Hoare triple {30555#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {30555#false} is VALID [2022-04-15 11:44:44,106 INFO L290 TraceCheckUtils]: 59: Hoare triple {30555#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {30555#false} is VALID [2022-04-15 11:44:44,106 INFO L290 TraceCheckUtils]: 60: Hoare triple {30555#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {30555#false} is VALID [2022-04-15 11:44:44,106 INFO L290 TraceCheckUtils]: 61: Hoare triple {30555#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {30555#false} is VALID [2022-04-15 11:44:44,106 INFO L290 TraceCheckUtils]: 62: Hoare triple {30555#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {30555#false} is VALID [2022-04-15 11:44:44,106 INFO L290 TraceCheckUtils]: 63: Hoare triple {30555#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {30555#false} is VALID [2022-04-15 11:44:44,106 INFO L290 TraceCheckUtils]: 64: Hoare triple {30555#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {30555#false} is VALID [2022-04-15 11:44:44,106 INFO L290 TraceCheckUtils]: 65: Hoare triple {30555#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {30555#false} is VALID [2022-04-15 11:44:44,106 INFO L290 TraceCheckUtils]: 66: Hoare triple {30555#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {30555#false} is VALID [2022-04-15 11:44:44,107 INFO L290 TraceCheckUtils]: 67: Hoare triple {30555#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {30555#false} is VALID [2022-04-15 11:44:44,107 INFO L290 TraceCheckUtils]: 68: Hoare triple {30555#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {30555#false} is VALID [2022-04-15 11:44:44,107 INFO L290 TraceCheckUtils]: 69: Hoare triple {30555#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {30555#false} is VALID [2022-04-15 11:44:44,107 INFO L290 TraceCheckUtils]: 70: Hoare triple {30555#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {30555#false} is VALID [2022-04-15 11:44:44,107 INFO L290 TraceCheckUtils]: 71: Hoare triple {30555#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {30555#false} is VALID [2022-04-15 11:44:44,107 INFO L290 TraceCheckUtils]: 72: Hoare triple {30555#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {30555#false} is VALID [2022-04-15 11:44:44,107 INFO L290 TraceCheckUtils]: 73: Hoare triple {30555#false} assume 8608 == #t~mem73;havoc #t~mem73; {30555#false} is VALID [2022-04-15 11:44:44,107 INFO L290 TraceCheckUtils]: 74: Hoare triple {30555#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {30555#false} is VALID [2022-04-15 11:44:44,107 INFO L290 TraceCheckUtils]: 75: Hoare triple {30555#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); {30555#false} is VALID [2022-04-15 11:44:44,108 INFO L290 TraceCheckUtils]: 76: Hoare triple {30555#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); {30555#false} is VALID [2022-04-15 11:44:44,108 INFO L290 TraceCheckUtils]: 77: Hoare triple {30555#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {30555#false} is VALID [2022-04-15 11:44:44,108 INFO L290 TraceCheckUtils]: 78: Hoare triple {30555#false} ~skip~0 := 0; {30555#false} is VALID [2022-04-15 11:44:44,108 INFO L290 TraceCheckUtils]: 79: Hoare triple {30555#false} assume !false; {30555#false} is VALID [2022-04-15 11:44:44,108 INFO L290 TraceCheckUtils]: 80: Hoare triple {30555#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); {30555#false} is VALID [2022-04-15 11:44:44,108 INFO L290 TraceCheckUtils]: 81: Hoare triple {30555#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {30555#false} is VALID [2022-04-15 11:44:44,108 INFO L290 TraceCheckUtils]: 82: Hoare triple {30555#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {30555#false} is VALID [2022-04-15 11:44:44,108 INFO L290 TraceCheckUtils]: 83: Hoare triple {30555#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {30555#false} is VALID [2022-04-15 11:44:44,108 INFO L290 TraceCheckUtils]: 84: Hoare triple {30555#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {30555#false} is VALID [2022-04-15 11:44:44,108 INFO L290 TraceCheckUtils]: 85: Hoare triple {30555#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {30555#false} is VALID [2022-04-15 11:44:44,109 INFO L290 TraceCheckUtils]: 86: Hoare triple {30555#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {30555#false} is VALID [2022-04-15 11:44:44,109 INFO L290 TraceCheckUtils]: 87: Hoare triple {30555#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {30555#false} is VALID [2022-04-15 11:44:44,109 INFO L290 TraceCheckUtils]: 88: Hoare triple {30555#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {30555#false} is VALID [2022-04-15 11:44:44,109 INFO L290 TraceCheckUtils]: 89: Hoare triple {30555#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {30555#false} is VALID [2022-04-15 11:44:44,109 INFO L290 TraceCheckUtils]: 90: Hoare triple {30555#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {30555#false} is VALID [2022-04-15 11:44:44,109 INFO L290 TraceCheckUtils]: 91: Hoare triple {30555#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {30555#false} is VALID [2022-04-15 11:44:44,109 INFO L290 TraceCheckUtils]: 92: Hoare triple {30555#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {30555#false} is VALID [2022-04-15 11:44:44,109 INFO L290 TraceCheckUtils]: 93: Hoare triple {30555#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {30555#false} is VALID [2022-04-15 11:44:44,109 INFO L290 TraceCheckUtils]: 94: Hoare triple {30555#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {30555#false} is VALID [2022-04-15 11:44:44,109 INFO L290 TraceCheckUtils]: 95: Hoare triple {30555#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {30555#false} is VALID [2022-04-15 11:44:44,110 INFO L290 TraceCheckUtils]: 96: Hoare triple {30555#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {30555#false} is VALID [2022-04-15 11:44:44,110 INFO L290 TraceCheckUtils]: 97: Hoare triple {30555#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {30555#false} is VALID [2022-04-15 11:44:44,110 INFO L290 TraceCheckUtils]: 98: Hoare triple {30555#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {30555#false} is VALID [2022-04-15 11:44:44,110 INFO L290 TraceCheckUtils]: 99: Hoare triple {30555#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {30555#false} is VALID [2022-04-15 11:44:44,110 INFO L290 TraceCheckUtils]: 100: Hoare triple {30555#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {30555#false} is VALID [2022-04-15 11:44:44,110 INFO L290 TraceCheckUtils]: 101: Hoare triple {30555#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {30555#false} is VALID [2022-04-15 11:44:44,110 INFO L290 TraceCheckUtils]: 102: Hoare triple {30555#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {30555#false} is VALID [2022-04-15 11:44:44,110 INFO L290 TraceCheckUtils]: 103: Hoare triple {30555#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {30555#false} is VALID [2022-04-15 11:44:44,111 INFO L290 TraceCheckUtils]: 104: Hoare triple {30555#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {30555#false} is VALID [2022-04-15 11:44:44,111 INFO L290 TraceCheckUtils]: 105: Hoare triple {30555#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {30555#false} is VALID [2022-04-15 11:44:44,111 INFO L290 TraceCheckUtils]: 106: Hoare triple {30555#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {30555#false} is VALID [2022-04-15 11:44:44,111 INFO L290 TraceCheckUtils]: 107: Hoare triple {30555#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {30555#false} is VALID [2022-04-15 11:44:44,111 INFO L290 TraceCheckUtils]: 108: Hoare triple {30555#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {30555#false} is VALID [2022-04-15 11:44:44,111 INFO L290 TraceCheckUtils]: 109: Hoare triple {30555#false} assume 8640 == #t~mem75;havoc #t~mem75; {30555#false} is VALID [2022-04-15 11:44:44,111 INFO L290 TraceCheckUtils]: 110: Hoare triple {30555#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {30555#false} is VALID [2022-04-15 11:44:44,111 INFO L290 TraceCheckUtils]: 111: Hoare triple {30555#false} assume !(4 == ~blastFlag~0); {30555#false} is VALID [2022-04-15 11:44:44,111 INFO L290 TraceCheckUtils]: 112: Hoare triple {30555#false} assume !false; {30555#false} is VALID [2022-04-15 11:44:44,112 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-15 11:44:44,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:44:44,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151131139] [2022-04-15 11:44:44,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151131139] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:44:44,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:44:44,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:44:44,113 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:44:44,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1630043929] [2022-04-15 11:44:44,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1630043929] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:44:44,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:44:44,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:44:44,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280579164] [2022-04-15 11:44:44,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:44:44,114 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 113 [2022-04-15 11:44:44,114 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:44:44,114 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:44,191 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:44:44,192 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:44:44,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:44:44,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:44:44,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:44:44,192 INFO L87 Difference]: Start difference. First operand 332 states and 527 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:49,950 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:44:52,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:52,921 INFO L93 Difference]: Finished difference Result 651 states and 1040 transitions. [2022-04-15 11:44:52,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:44:52,921 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 113 [2022-04-15 11:44:52,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:44:52,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:52,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 441 transitions. [2022-04-15 11:44:52,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:52,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 441 transitions. [2022-04-15 11:44:52,926 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 441 transitions. [2022-04-15 11:44:53,202 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 441 edges. 441 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:44:53,208 INFO L225 Difference]: With dead ends: 651 [2022-04-15 11:44:53,208 INFO L226 Difference]: Without dead ends: 345 [2022-04-15 11:44:53,209 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:44:53,209 INFO L913 BasicCegarLoop]: 223 mSDtfsCounter, 21 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:44:53,209 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 554 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-04-15 11:44:53,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2022-04-15 11:44:53,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 332. [2022-04-15 11:44:53,226 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:44:53,227 INFO L82 GeneralOperation]: Start isEquivalent. First operand 345 states. Second operand has 332 states, 327 states have (on average 1.5963302752293578) internal successors, (522), 327 states have internal predecessors, (522), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:53,227 INFO L74 IsIncluded]: Start isIncluded. First operand 345 states. Second operand has 332 states, 327 states have (on average 1.5963302752293578) internal successors, (522), 327 states have internal predecessors, (522), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:53,228 INFO L87 Difference]: Start difference. First operand 345 states. Second operand has 332 states, 327 states have (on average 1.5963302752293578) internal successors, (522), 327 states have internal predecessors, (522), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:53,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:53,234 INFO L93 Difference]: Finished difference Result 345 states and 542 transitions. [2022-04-15 11:44:53,234 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 542 transitions. [2022-04-15 11:44:53,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:44:53,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:44:53,235 INFO L74 IsIncluded]: Start isIncluded. First operand has 332 states, 327 states have (on average 1.5963302752293578) internal successors, (522), 327 states have internal predecessors, (522), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 345 states. [2022-04-15 11:44:53,236 INFO L87 Difference]: Start difference. First operand has 332 states, 327 states have (on average 1.5963302752293578) internal successors, (522), 327 states have internal predecessors, (522), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 345 states. [2022-04-15 11:44:53,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:53,243 INFO L93 Difference]: Finished difference Result 345 states and 542 transitions. [2022-04-15 11:44:53,243 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 542 transitions. [2022-04-15 11:44:53,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:44:53,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:44:53,244 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:44:53,244 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:44:53,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 327 states have (on average 1.5963302752293578) internal successors, (522), 327 states have internal predecessors, (522), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:53,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 526 transitions. [2022-04-15 11:44:53,252 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 526 transitions. Word has length 113 [2022-04-15 11:44:53,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:44:53,253 INFO L478 AbstractCegarLoop]: Abstraction has 332 states and 526 transitions. [2022-04-15 11:44:53,253 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:53,253 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 332 states and 526 transitions. [2022-04-15 11:44:53,755 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 526 edges. 526 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:44:53,755 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 526 transitions. [2022-04-15 11:44:53,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-04-15 11:44:53,756 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:44:53,756 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:44:53,756 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-15 11:44:53,756 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:44:53,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:44:53,756 INFO L85 PathProgramCache]: Analyzing trace with hash 740491119, now seen corresponding path program 1 times [2022-04-15 11:44:53,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:44:53,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1347925084] [2022-04-15 11:44:53,948 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 17 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 11:44:53,949 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:44:53,949 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:44:53,950 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.logic.Theory.term(Theory.java:1603) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:401) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:392) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.term(WrapperScript.java:249) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.term(WrapperScript.java:249) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.PredicateHelper.makeReflexive(PredicateHelper.java:222) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.acceleratedInterpolationCoreIsCorrect(AcceleratedInterpolationCore.java:253) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:195) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAcceleratedInterpolation.construct(IpTcStrategyModuleAcceleratedInterpolation.java:80) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:261) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-15 11:44:53,953 INFO L158 Benchmark]: Toolchain (without parser) took 137777.77ms. Allocated memory was 184.5MB in the beginning and 283.1MB in the end (delta: 98.6MB). Free memory was 134.0MB in the beginning and 188.3MB in the end (delta: -54.4MB). Peak memory consumption was 44.7MB. Max. memory is 8.0GB. [2022-04-15 11:44:53,953 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 184.5MB. Free memory was 152.9MB in the beginning and 152.8MB in the end (delta: 89.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 11:44:53,953 INFO L158 Benchmark]: CACSL2BoogieTranslator took 651.00ms. Allocated memory is still 184.5MB. Free memory was 133.8MB in the beginning and 139.8MB in the end (delta: -6.1MB). Peak memory consumption was 16.7MB. Max. memory is 8.0GB. [2022-04-15 11:44:53,953 INFO L158 Benchmark]: Boogie Preprocessor took 157.15ms. Allocated memory is still 184.5MB. Free memory was 139.8MB in the beginning and 130.0MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-15 11:44:53,953 INFO L158 Benchmark]: RCFGBuilder took 1710.21ms. Allocated memory was 184.5MB in the beginning and 235.9MB in the end (delta: 51.4MB). Free memory was 130.0MB in the beginning and 161.3MB in the end (delta: -31.4MB). Peak memory consumption was 52.4MB. Max. memory is 8.0GB. [2022-04-15 11:44:53,954 INFO L158 Benchmark]: TraceAbstraction took 135244.49ms. Allocated memory was 235.9MB in the beginning and 283.1MB in the end (delta: 47.2MB). Free memory was 160.8MB in the beginning and 188.3MB in the end (delta: -27.5MB). Peak memory consumption was 19.7MB. Max. memory is 8.0GB. [2022-04-15 11:44:53,954 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 184.5MB. Free memory was 152.9MB in the beginning and 152.8MB in the end (delta: 89.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 651.00ms. Allocated memory is still 184.5MB. Free memory was 133.8MB in the beginning and 139.8MB in the end (delta: -6.1MB). Peak memory consumption was 16.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 157.15ms. Allocated memory is still 184.5MB. Free memory was 139.8MB in the beginning and 130.0MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * RCFGBuilder took 1710.21ms. Allocated memory was 184.5MB in the beginning and 235.9MB in the end (delta: 51.4MB). Free memory was 130.0MB in the beginning and 161.3MB in the end (delta: -31.4MB). Peak memory consumption was 52.4MB. Max. memory is 8.0GB. * TraceAbstraction took 135244.49ms. Allocated memory was 235.9MB in the beginning and 283.1MB in the end (delta: 47.2MB). Free memory was 160.8MB in the beginning and 188.3MB in the end (delta: -27.5MB). Peak memory consumption was 19.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.logic.Theory.term(Theory.java:1603) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-15 11:44:53,996 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...