/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.08.i.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 08:39:54,938 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 08:39:54,940 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 08:39:54,968 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 08:39:54,968 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 08:39:54,969 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 08:39:54,970 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 08:39:54,973 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 08:39:54,975 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 08:39:54,979 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 08:39:54,979 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 08:39:54,981 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 08:39:54,981 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 08:39:54,983 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 08:39:54,983 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 08:39:54,985 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 08:39:54,985 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 08:39:54,986 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 08:39:54,989 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 08:39:54,994 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 08:39:54,995 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 08:39:54,996 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 08:39:54,997 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 08:39:54,998 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 08:39:55,000 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 08:39:55,005 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 08:39:55,005 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 08:39:55,005 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 08:39:55,006 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 08:39:55,006 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 08:39:55,007 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 08:39:55,007 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 08:39:55,008 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 08:39:55,008 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 08:39:55,009 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 08:39:55,009 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 08:39:55,009 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 08:39:55,010 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 08:39:55,010 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 08:39:55,010 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 08:39:55,011 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 08:39:55,012 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 08:39:55,012 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 08:39:55,020 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 08:39:55,021 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 08:39:55,022 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 08:39:55,022 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 08:39:55,022 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 08:39:55,022 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 08:39:55,022 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 08:39:55,022 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 08:39:55,022 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 08:39:55,023 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 08:39:55,023 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 08:39:55,023 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 08:39:55,023 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 08:39:55,023 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 08:39:55,023 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 08:39:55,023 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 08:39:55,023 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 08:39:55,023 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 08:39:55,024 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 08:39:55,024 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 08:39:55,024 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 08:39:55,024 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 08:39:55,024 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 08:39:55,024 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 08:39:55,024 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 08:39:55,024 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 08:39:55,190 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 08:39:55,213 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 08:39:55,215 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 08:39:55,216 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 08:39:55,216 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 08:39:55,217 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_srvr.blast.08.i.cil-1.c [2022-04-28 08:39:55,265 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56227844a/14d6905758aa4128be8227b8b3f233a1/FLAGb6cb8c880 [2022-04-28 08:39:55,709 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 08:39:55,709 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.08.i.cil-1.c [2022-04-28 08:39:55,737 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56227844a/14d6905758aa4128be8227b8b3f233a1/FLAGb6cb8c880 [2022-04-28 08:39:56,244 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56227844a/14d6905758aa4128be8227b8b3f233a1 [2022-04-28 08:39:56,245 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 08:39:56,246 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 08:39:56,247 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 08:39:56,247 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 08:39:56,258 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 08:39:56,258 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 08:39:56" (1/1) ... [2022-04-28 08:39:56,259 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3353d97c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:39:56, skipping insertion in model container [2022-04-28 08:39:56,259 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 08:39:56" (1/1) ... [2022-04-28 08:39:56,263 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 08:39:56,317 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 08:39:56,587 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.08.i.cil-1.c[74696,74709] [2022-04-28 08:39:56,593 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 08:39:56,602 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 08:39:56,697 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.08.i.cil-1.c[74696,74709] [2022-04-28 08:39:56,699 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 08:39:56,719 INFO L208 MainTranslator]: Completed translation [2022-04-28 08:39:56,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:39:56 WrapperNode [2022-04-28 08:39:56,719 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 08:39:56,720 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 08:39:56,720 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 08:39:56,720 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 08:39:56,729 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:39:56" (1/1) ... [2022-04-28 08:39:56,729 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:39:56" (1/1) ... [2022-04-28 08:39:56,759 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:39:56" (1/1) ... [2022-04-28 08:39:56,759 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:39:56" (1/1) ... [2022-04-28 08:39:56,825 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:39:56" (1/1) ... [2022-04-28 08:39:56,842 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:39:56" (1/1) ... [2022-04-28 08:39:56,844 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:39:56" (1/1) ... [2022-04-28 08:39:56,848 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 08:39:56,849 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 08:39:56,849 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 08:39:56,849 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 08:39:56,850 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:39:56" (1/1) ... [2022-04-28 08:39:56,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 08:39:56,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 08:39:56,882 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 08:39:56,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 08:39:56,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 08:39:56,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 08:39:56,909 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 08:39:56,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2022-04-28 08:39:56,909 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2022-04-28 08:39:56,909 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 08:39:56,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2022-04-28 08:39:56,910 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-28 08:39:56,910 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-28 08:39:56,910 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-28 08:39:56,911 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 08:39:56,911 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 08:39:56,912 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 08:39:56,912 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 08:39:56,912 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-28 08:39:56,912 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-28 08:39:56,912 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 08:39:56,912 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-28 08:39:56,912 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-28 08:39:56,913 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-28 08:39:56,915 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2022-04-28 08:39:56,915 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-28 08:39:56,915 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2022-04-28 08:39:56,915 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2022-04-28 08:39:56,915 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-28 08:39:56,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-28 08:39:56,915 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 08:39:56,915 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-28 08:39:56,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 08:39:56,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-28 08:39:56,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 08:39:56,916 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-28 08:39:56,916 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-28 08:39:56,916 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 08:39:56,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 08:39:56,916 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 08:39:56,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-28 08:39:56,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-28 08:39:56,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-28 08:39:56,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-28 08:39:56,916 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 08:39:57,103 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 08:39:57,104 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 08:39:57,900 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 08:39:58,392 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2022-04-28 08:39:58,393 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2022-04-28 08:39:58,401 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 08:39:58,415 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 08:39:58,415 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 08:39:58,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 08:39:58 BoogieIcfgContainer [2022-04-28 08:39:58,417 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 08:39:58,418 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 08:39:58,418 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 08:39:58,420 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 08:39:58,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 08:39:56" (1/3) ... [2022-04-28 08:39:58,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d87669e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 08:39:58, skipping insertion in model container [2022-04-28 08:39:58,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:39:56" (2/3) ... [2022-04-28 08:39:58,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d87669e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 08:39:58, skipping insertion in model container [2022-04-28 08:39:58,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 08:39:58" (3/3) ... [2022-04-28 08:39:58,422 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.08.i.cil-1.c [2022-04-28 08:39:58,434 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 08:39:58,434 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 08:39:58,483 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 08:39:58,487 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@139ff164, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@153172a9 [2022-04-28 08:39:58,487 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 08:39:58,503 INFO L276 IsEmpty]: Start isEmpty. Operand has 159 states, 151 states have (on average 1.7086092715231789) internal successors, (258), 152 states have internal predecessors, (258), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 08:39:58,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-28 08:39:58,511 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:39:58,511 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:39:58,512 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:39:58,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:39:58,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1930935805, now seen corresponding path program 1 times [2022-04-28 08:39:58,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:39:58,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1093086548] [2022-04-28 08:39:58,534 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:39:58,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1930935805, now seen corresponding path program 2 times [2022-04-28 08:39:58,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:39:58,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584144392] [2022-04-28 08:39:58,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:39:58,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:39:58,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:39:59,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:39:59,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:39:59,062 INFO L290 TraceCheckUtils]: 0: Hoare triple {169#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {162#true} is VALID [2022-04-28 08:39:59,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {162#true} assume true; {162#true} is VALID [2022-04-28 08:39:59,062 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {162#true} {162#true} #693#return; {162#true} is VALID [2022-04-28 08:39:59,064 INFO L272 TraceCheckUtils]: 0: Hoare triple {162#true} call ULTIMATE.init(); {169#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:39:59,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {169#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {162#true} is VALID [2022-04-28 08:39:59,064 INFO L290 TraceCheckUtils]: 2: Hoare triple {162#true} assume true; {162#true} is VALID [2022-04-28 08:39:59,064 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {162#true} {162#true} #693#return; {162#true} is VALID [2022-04-28 08:39:59,064 INFO L272 TraceCheckUtils]: 4: Hoare triple {162#true} call #t~ret161 := main(); {162#true} is VALID [2022-04-28 08:39:59,065 INFO L290 TraceCheckUtils]: 5: Hoare triple {162#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; {162#true} is VALID [2022-04-28 08:39:59,065 INFO L290 TraceCheckUtils]: 6: Hoare triple {162#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {162#true} is VALID [2022-04-28 08:39:59,065 INFO L272 TraceCheckUtils]: 7: Hoare triple {162#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {162#true} is VALID [2022-04-28 08:39:59,072 INFO L290 TraceCheckUtils]: 8: Hoare triple {162#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;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);~blastFlag~0 := 0;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); {167#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:39:59,073 INFO L290 TraceCheckUtils]: 9: Hoare triple {167#(= 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; {167#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:39:59,075 INFO L290 TraceCheckUtils]: 10: Hoare triple {167#(= 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; {167#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:39:59,075 INFO L290 TraceCheckUtils]: 11: Hoare triple {167#(= 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)))); {167#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:39:59,076 INFO L290 TraceCheckUtils]: 12: Hoare triple {167#(= 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); {167#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:39:59,076 INFO L290 TraceCheckUtils]: 13: Hoare triple {167#(= 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; {167#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:39:59,077 INFO L290 TraceCheckUtils]: 14: Hoare triple {167#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {167#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:39:59,077 INFO L290 TraceCheckUtils]: 15: Hoare triple {167#(= 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); {167#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:39:59,078 INFO L290 TraceCheckUtils]: 16: Hoare triple {167#(= 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); {167#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:39:59,078 INFO L290 TraceCheckUtils]: 17: Hoare triple {167#(= 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); {167#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:39:59,079 INFO L290 TraceCheckUtils]: 18: Hoare triple {167#(= 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); {167#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:39:59,080 INFO L290 TraceCheckUtils]: 19: Hoare triple {167#(= 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); {167#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:39:59,081 INFO L290 TraceCheckUtils]: 20: Hoare triple {167#(= 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); {167#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:39:59,081 INFO L290 TraceCheckUtils]: 21: Hoare triple {167#(= 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); {167#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:39:59,082 INFO L290 TraceCheckUtils]: 22: Hoare triple {167#(= 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); {167#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:39:59,083 INFO L290 TraceCheckUtils]: 23: Hoare triple {167#(= 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); {168#(= 8464 |ssl3_accept_#t~mem55|)} is VALID [2022-04-28 08:39:59,083 INFO L290 TraceCheckUtils]: 24: Hoare triple {168#(= 8464 |ssl3_accept_#t~mem55|)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {163#false} is VALID [2022-04-28 08:39:59,084 INFO L290 TraceCheckUtils]: 25: Hoare triple {163#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {163#false} is VALID [2022-04-28 08:39:59,084 INFO L290 TraceCheckUtils]: 26: Hoare triple {163#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {163#false} is VALID [2022-04-28 08:39:59,084 INFO L290 TraceCheckUtils]: 27: Hoare triple {163#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {163#false} is VALID [2022-04-28 08:39:59,084 INFO L290 TraceCheckUtils]: 28: Hoare triple {163#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {163#false} is VALID [2022-04-28 08:39:59,084 INFO L290 TraceCheckUtils]: 29: Hoare triple {163#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {163#false} is VALID [2022-04-28 08:39:59,084 INFO L290 TraceCheckUtils]: 30: Hoare triple {163#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {163#false} is VALID [2022-04-28 08:39:59,085 INFO L290 TraceCheckUtils]: 31: Hoare triple {163#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {163#false} is VALID [2022-04-28 08:39:59,085 INFO L290 TraceCheckUtils]: 32: Hoare triple {163#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {163#false} is VALID [2022-04-28 08:39:59,085 INFO L290 TraceCheckUtils]: 33: Hoare triple {163#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {163#false} is VALID [2022-04-28 08:39:59,085 INFO L290 TraceCheckUtils]: 34: Hoare triple {163#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {163#false} is VALID [2022-04-28 08:39:59,085 INFO L290 TraceCheckUtils]: 35: Hoare triple {163#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {163#false} is VALID [2022-04-28 08:39:59,085 INFO L290 TraceCheckUtils]: 36: Hoare triple {163#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {163#false} is VALID [2022-04-28 08:39:59,086 INFO L290 TraceCheckUtils]: 37: Hoare triple {163#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {163#false} is VALID [2022-04-28 08:39:59,086 INFO L290 TraceCheckUtils]: 38: Hoare triple {163#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {163#false} is VALID [2022-04-28 08:39:59,086 INFO L290 TraceCheckUtils]: 39: Hoare triple {163#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {163#false} is VALID [2022-04-28 08:39:59,086 INFO L290 TraceCheckUtils]: 40: Hoare triple {163#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {163#false} is VALID [2022-04-28 08:39:59,086 INFO L290 TraceCheckUtils]: 41: Hoare triple {163#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {163#false} is VALID [2022-04-28 08:39:59,086 INFO L290 TraceCheckUtils]: 42: Hoare triple {163#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {163#false} is VALID [2022-04-28 08:39:59,086 INFO L290 TraceCheckUtils]: 43: Hoare triple {163#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {163#false} is VALID [2022-04-28 08:39:59,087 INFO L290 TraceCheckUtils]: 44: Hoare triple {163#false} assume 8640 == #t~mem75;havoc #t~mem75; {163#false} is VALID [2022-04-28 08:39:59,087 INFO L290 TraceCheckUtils]: 45: Hoare triple {163#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {163#false} is VALID [2022-04-28 08:39:59,087 INFO L290 TraceCheckUtils]: 46: Hoare triple {163#false} assume !(4 == ~blastFlag~0); {163#false} is VALID [2022-04-28 08:39:59,087 INFO L290 TraceCheckUtils]: 47: Hoare triple {163#false} assume !(7 == ~blastFlag~0); {163#false} is VALID [2022-04-28 08:39:59,087 INFO L290 TraceCheckUtils]: 48: Hoare triple {163#false} assume 10 == ~blastFlag~0; {163#false} is VALID [2022-04-28 08:39:59,087 INFO L290 TraceCheckUtils]: 49: Hoare triple {163#false} assume !false; {163#false} is VALID [2022-04-28 08:39:59,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:39:59,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:39:59,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584144392] [2022-04-28 08:39:59,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584144392] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:39:59,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:39:59,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:39:59,091 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:39:59,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1093086548] [2022-04-28 08:39:59,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1093086548] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:39:59,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:39:59,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:39:59,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808731022] [2022-04-28 08:39:59,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:39:59,096 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2022-04-28 08:39:59,097 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:39:59,099 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:59,175 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:39:59,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:39:59,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:39:59,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:39:59,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:39:59,197 INFO L87 Difference]: Start difference. First operand has 159 states, 151 states have (on average 1.7086092715231789) internal successors, (258), 152 states have internal predecessors, (258), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:02,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:40:02,948 INFO L93 Difference]: Finished difference Result 336 states and 564 transitions. [2022-04-28 08:40:02,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:40:02,948 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2022-04-28 08:40:02,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:40:02,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:02,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 564 transitions. [2022-04-28 08:40:02,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:02,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 564 transitions. [2022-04-28 08:40:02,966 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 564 transitions. [2022-04-28 08:40:03,328 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 564 edges. 564 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:40:03,343 INFO L225 Difference]: With dead ends: 336 [2022-04-28 08:40:03,343 INFO L226 Difference]: Without dead ends: 171 [2022-04-28 08:40:03,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:40:03,348 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 34 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-04-28 08:40:03,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 613 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-04-28 08:40:03,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-04-28 08:40:03,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 154. [2022-04-28 08:40:03,375 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:40:03,376 INFO L82 GeneralOperation]: Start isEquivalent. First operand 171 states. Second operand has 154 states, 149 states have (on average 1.5570469798657718) internal successors, (232), 149 states have internal predecessors, (232), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:03,377 INFO L74 IsIncluded]: Start isIncluded. First operand 171 states. Second operand has 154 states, 149 states have (on average 1.5570469798657718) internal successors, (232), 149 states have internal predecessors, (232), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:03,377 INFO L87 Difference]: Start difference. First operand 171 states. Second operand has 154 states, 149 states have (on average 1.5570469798657718) internal successors, (232), 149 states have internal predecessors, (232), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:03,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:40:03,383 INFO L93 Difference]: Finished difference Result 171 states and 257 transitions. [2022-04-28 08:40:03,383 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 257 transitions. [2022-04-28 08:40:03,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:40:03,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:40:03,384 INFO L74 IsIncluded]: Start isIncluded. First operand has 154 states, 149 states have (on average 1.5570469798657718) internal successors, (232), 149 states have internal predecessors, (232), 3 states have call successors, (3), 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 171 states. [2022-04-28 08:40:03,385 INFO L87 Difference]: Start difference. First operand has 154 states, 149 states have (on average 1.5570469798657718) internal successors, (232), 149 states have internal predecessors, (232), 3 states have call successors, (3), 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 171 states. [2022-04-28 08:40:03,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:40:03,390 INFO L93 Difference]: Finished difference Result 171 states and 257 transitions. [2022-04-28 08:40:03,390 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 257 transitions. [2022-04-28 08:40:03,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:40:03,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:40:03,391 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:40:03,391 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:40:03,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 149 states have (on average 1.5570469798657718) internal successors, (232), 149 states have internal predecessors, (232), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:03,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 236 transitions. [2022-04-28 08:40:03,396 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 236 transitions. Word has length 50 [2022-04-28 08:40:03,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:40:03,397 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 236 transitions. [2022-04-28 08:40:03,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:03,397 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 154 states and 236 transitions. [2022-04-28 08:40:03,557 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 236 edges. 236 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:40:03,558 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 236 transitions. [2022-04-28 08:40:03,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-28 08:40:03,559 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:40:03,559 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:40:03,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 08:40:03,560 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:40:03,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:40:03,560 INFO L85 PathProgramCache]: Analyzing trace with hash -213156207, now seen corresponding path program 1 times [2022-04-28 08:40:03,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:40:03,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [982887264] [2022-04-28 08:40:03,588 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:40:03,589 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:40:03,589 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:40:03,589 INFO L85 PathProgramCache]: Analyzing trace with hash -213156207, now seen corresponding path program 2 times [2022-04-28 08:40:03,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:40:03,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58853033] [2022-04-28 08:40:03,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:40:03,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:40:03,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:40:03,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:40:03,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:40:03,785 INFO L290 TraceCheckUtils]: 0: Hoare triple {1503#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {1496#true} is VALID [2022-04-28 08:40:03,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {1496#true} assume true; {1496#true} is VALID [2022-04-28 08:40:03,786 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1496#true} {1496#true} #693#return; {1496#true} is VALID [2022-04-28 08:40:03,787 INFO L272 TraceCheckUtils]: 0: Hoare triple {1496#true} call ULTIMATE.init(); {1503#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:40:03,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {1503#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {1496#true} is VALID [2022-04-28 08:40:03,787 INFO L290 TraceCheckUtils]: 2: Hoare triple {1496#true} assume true; {1496#true} is VALID [2022-04-28 08:40:03,787 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1496#true} {1496#true} #693#return; {1496#true} is VALID [2022-04-28 08:40:03,788 INFO L272 TraceCheckUtils]: 4: Hoare triple {1496#true} call #t~ret161 := main(); {1496#true} is VALID [2022-04-28 08:40:03,788 INFO L290 TraceCheckUtils]: 5: Hoare triple {1496#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; {1496#true} is VALID [2022-04-28 08:40:03,788 INFO L290 TraceCheckUtils]: 6: Hoare triple {1496#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {1496#true} is VALID [2022-04-28 08:40:03,788 INFO L272 TraceCheckUtils]: 7: Hoare triple {1496#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {1496#true} is VALID [2022-04-28 08:40:03,791 INFO L290 TraceCheckUtils]: 8: Hoare triple {1496#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;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);~blastFlag~0 := 0;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); {1501#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:40:03,803 INFO L290 TraceCheckUtils]: 9: Hoare triple {1501#(= 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; {1501#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:40:03,804 INFO L290 TraceCheckUtils]: 10: Hoare triple {1501#(= 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; {1501#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:40:03,805 INFO L290 TraceCheckUtils]: 11: Hoare triple {1501#(= 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)))); {1501#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:40:03,805 INFO L290 TraceCheckUtils]: 12: Hoare triple {1501#(= 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); {1501#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:40:03,806 INFO L290 TraceCheckUtils]: 13: Hoare triple {1501#(= 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; {1501#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:40:03,806 INFO L290 TraceCheckUtils]: 14: Hoare triple {1501#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {1501#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:40:03,807 INFO L290 TraceCheckUtils]: 15: Hoare triple {1501#(= 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); {1501#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:40:03,807 INFO L290 TraceCheckUtils]: 16: Hoare triple {1501#(= 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); {1501#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:40:03,808 INFO L290 TraceCheckUtils]: 17: Hoare triple {1501#(= 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); {1501#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:40:03,810 INFO L290 TraceCheckUtils]: 18: Hoare triple {1501#(= 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); {1501#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:40:03,811 INFO L290 TraceCheckUtils]: 19: Hoare triple {1501#(= 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); {1501#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:40:03,811 INFO L290 TraceCheckUtils]: 20: Hoare triple {1501#(= 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); {1502#(= 8464 |ssl3_accept_#t~mem52|)} is VALID [2022-04-28 08:40:03,812 INFO L290 TraceCheckUtils]: 21: Hoare triple {1502#(= 8464 |ssl3_accept_#t~mem52|)} assume 8480 == #t~mem52;havoc #t~mem52; {1497#false} is VALID [2022-04-28 08:40:03,812 INFO L290 TraceCheckUtils]: 22: Hoare triple {1497#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; {1497#false} is VALID [2022-04-28 08:40:03,812 INFO L290 TraceCheckUtils]: 23: Hoare triple {1497#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); {1497#false} is VALID [2022-04-28 08:40:03,812 INFO L290 TraceCheckUtils]: 24: Hoare triple {1497#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); {1497#false} is VALID [2022-04-28 08:40:03,814 INFO L290 TraceCheckUtils]: 25: Hoare triple {1497#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {1497#false} is VALID [2022-04-28 08:40:03,814 INFO L290 TraceCheckUtils]: 26: Hoare triple {1497#false} ~skip~0 := 0; {1497#false} is VALID [2022-04-28 08:40:03,814 INFO L290 TraceCheckUtils]: 27: Hoare triple {1497#false} assume !false; {1497#false} is VALID [2022-04-28 08:40:03,814 INFO L290 TraceCheckUtils]: 28: Hoare triple {1497#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); {1497#false} is VALID [2022-04-28 08:40:03,814 INFO L290 TraceCheckUtils]: 29: Hoare triple {1497#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {1497#false} is VALID [2022-04-28 08:40:03,814 INFO L290 TraceCheckUtils]: 30: Hoare triple {1497#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {1497#false} is VALID [2022-04-28 08:40:03,814 INFO L290 TraceCheckUtils]: 31: Hoare triple {1497#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {1497#false} is VALID [2022-04-28 08:40:03,815 INFO L290 TraceCheckUtils]: 32: Hoare triple {1497#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {1497#false} is VALID [2022-04-28 08:40:03,815 INFO L290 TraceCheckUtils]: 33: Hoare triple {1497#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {1497#false} is VALID [2022-04-28 08:40:03,815 INFO L290 TraceCheckUtils]: 34: Hoare triple {1497#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {1497#false} is VALID [2022-04-28 08:40:03,815 INFO L290 TraceCheckUtils]: 35: Hoare triple {1497#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {1497#false} is VALID [2022-04-28 08:40:03,815 INFO L290 TraceCheckUtils]: 36: Hoare triple {1497#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {1497#false} is VALID [2022-04-28 08:40:03,815 INFO L290 TraceCheckUtils]: 37: Hoare triple {1497#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {1497#false} is VALID [2022-04-28 08:40:03,816 INFO L290 TraceCheckUtils]: 38: Hoare triple {1497#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {1497#false} is VALID [2022-04-28 08:40:03,816 INFO L290 TraceCheckUtils]: 39: Hoare triple {1497#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {1497#false} is VALID [2022-04-28 08:40:03,818 INFO L290 TraceCheckUtils]: 40: Hoare triple {1497#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {1497#false} is VALID [2022-04-28 08:40:03,818 INFO L290 TraceCheckUtils]: 41: Hoare triple {1497#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {1497#false} is VALID [2022-04-28 08:40:03,820 INFO L290 TraceCheckUtils]: 42: Hoare triple {1497#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {1497#false} is VALID [2022-04-28 08:40:03,821 INFO L290 TraceCheckUtils]: 43: Hoare triple {1497#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {1497#false} is VALID [2022-04-28 08:40:03,821 INFO L290 TraceCheckUtils]: 44: Hoare triple {1497#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {1497#false} is VALID [2022-04-28 08:40:03,821 INFO L290 TraceCheckUtils]: 45: Hoare triple {1497#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {1497#false} is VALID [2022-04-28 08:40:03,821 INFO L290 TraceCheckUtils]: 46: Hoare triple {1497#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {1497#false} is VALID [2022-04-28 08:40:03,821 INFO L290 TraceCheckUtils]: 47: Hoare triple {1497#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {1497#false} is VALID [2022-04-28 08:40:03,821 INFO L290 TraceCheckUtils]: 48: Hoare triple {1497#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {1497#false} is VALID [2022-04-28 08:40:03,821 INFO L290 TraceCheckUtils]: 49: Hoare triple {1497#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {1497#false} is VALID [2022-04-28 08:40:03,821 INFO L290 TraceCheckUtils]: 50: Hoare triple {1497#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {1497#false} is VALID [2022-04-28 08:40:03,822 INFO L290 TraceCheckUtils]: 51: Hoare triple {1497#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {1497#false} is VALID [2022-04-28 08:40:03,822 INFO L290 TraceCheckUtils]: 52: Hoare triple {1497#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {1497#false} is VALID [2022-04-28 08:40:03,822 INFO L290 TraceCheckUtils]: 53: Hoare triple {1497#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {1497#false} is VALID [2022-04-28 08:40:03,822 INFO L290 TraceCheckUtils]: 54: Hoare triple {1497#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {1497#false} is VALID [2022-04-28 08:40:03,822 INFO L290 TraceCheckUtils]: 55: Hoare triple {1497#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {1497#false} is VALID [2022-04-28 08:40:03,822 INFO L290 TraceCheckUtils]: 56: Hoare triple {1497#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {1497#false} is VALID [2022-04-28 08:40:03,822 INFO L290 TraceCheckUtils]: 57: Hoare triple {1497#false} assume 8640 == #t~mem75;havoc #t~mem75; {1497#false} is VALID [2022-04-28 08:40:03,822 INFO L290 TraceCheckUtils]: 58: Hoare triple {1497#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {1497#false} is VALID [2022-04-28 08:40:03,822 INFO L290 TraceCheckUtils]: 59: Hoare triple {1497#false} assume !(4 == ~blastFlag~0); {1497#false} is VALID [2022-04-28 08:40:03,823 INFO L290 TraceCheckUtils]: 60: Hoare triple {1497#false} assume !(7 == ~blastFlag~0); {1497#false} is VALID [2022-04-28 08:40:03,823 INFO L290 TraceCheckUtils]: 61: Hoare triple {1497#false} assume 10 == ~blastFlag~0; {1497#false} is VALID [2022-04-28 08:40:03,823 INFO L290 TraceCheckUtils]: 62: Hoare triple {1497#false} assume !false; {1497#false} is VALID [2022-04-28 08:40:03,823 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:40:03,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:40:03,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58853033] [2022-04-28 08:40:03,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58853033] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:40:03,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:40:03,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:40:03,824 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:40:03,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [982887264] [2022-04-28 08:40:03,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [982887264] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:40:03,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:40:03,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:40:03,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358545796] [2022-04-28 08:40:03,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:40:03,825 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2022-04-28 08:40:03,825 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:40:03,826 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:03,873 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:40:03,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:40:03,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:40:03,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:40:03,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:40:03,875 INFO L87 Difference]: Start difference. First operand 154 states and 236 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:11,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:40:11,069 INFO L93 Difference]: Finished difference Result 299 states and 455 transitions. [2022-04-28 08:40:11,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:40:11,069 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2022-04-28 08:40:11,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:40:11,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:11,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 455 transitions. [2022-04-28 08:40:11,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:11,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 455 transitions. [2022-04-28 08:40:11,081 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 455 transitions. [2022-04-28 08:40:11,383 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 455 edges. 455 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:40:11,388 INFO L225 Difference]: With dead ends: 299 [2022-04-28 08:40:11,388 INFO L226 Difference]: Without dead ends: 171 [2022-04-28 08:40:11,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:40:11,390 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 24 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:40:11,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 489 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-04-28 08:40:11,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-04-28 08:40:11,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 154. [2022-04-28 08:40:11,401 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:40:11,401 INFO L82 GeneralOperation]: Start isEquivalent. First operand 171 states. Second operand has 154 states, 149 states have (on average 1.5503355704697988) internal successors, (231), 149 states have internal predecessors, (231), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:11,402 INFO L74 IsIncluded]: Start isIncluded. First operand 171 states. Second operand has 154 states, 149 states have (on average 1.5503355704697988) internal successors, (231), 149 states have internal predecessors, (231), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:11,402 INFO L87 Difference]: Start difference. First operand 171 states. Second operand has 154 states, 149 states have (on average 1.5503355704697988) internal successors, (231), 149 states have internal predecessors, (231), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:11,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:40:11,406 INFO L93 Difference]: Finished difference Result 171 states and 256 transitions. [2022-04-28 08:40:11,406 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 256 transitions. [2022-04-28 08:40:11,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:40:11,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:40:11,407 INFO L74 IsIncluded]: Start isIncluded. First operand has 154 states, 149 states have (on average 1.5503355704697988) internal successors, (231), 149 states have internal predecessors, (231), 3 states have call successors, (3), 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 171 states. [2022-04-28 08:40:11,407 INFO L87 Difference]: Start difference. First operand has 154 states, 149 states have (on average 1.5503355704697988) internal successors, (231), 149 states have internal predecessors, (231), 3 states have call successors, (3), 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 171 states. [2022-04-28 08:40:11,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:40:11,411 INFO L93 Difference]: Finished difference Result 171 states and 256 transitions. [2022-04-28 08:40:11,411 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 256 transitions. [2022-04-28 08:40:11,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:40:11,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:40:11,413 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:40:11,413 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:40:11,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 149 states have (on average 1.5503355704697988) internal successors, (231), 149 states have internal predecessors, (231), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:11,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 235 transitions. [2022-04-28 08:40:11,417 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 235 transitions. Word has length 63 [2022-04-28 08:40:11,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:40:11,418 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 235 transitions. [2022-04-28 08:40:11,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:11,419 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 154 states and 235 transitions. [2022-04-28 08:40:11,567 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 235 edges. 235 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:40:11,568 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 235 transitions. [2022-04-28 08:40:11,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-28 08:40:11,569 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:40:11,569 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:40:11,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 08:40:11,569 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:40:11,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:40:11,569 INFO L85 PathProgramCache]: Analyzing trace with hash 369840513, now seen corresponding path program 1 times [2022-04-28 08:40:11,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:40:11,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [313724996] [2022-04-28 08:40:11,604 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:40:11,604 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:40:11,604 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:40:11,604 INFO L85 PathProgramCache]: Analyzing trace with hash 369840513, now seen corresponding path program 2 times [2022-04-28 08:40:11,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:40:11,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815794457] [2022-04-28 08:40:11,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:40:11,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:40:11,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:40:11,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:40:11,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:40:11,769 INFO L290 TraceCheckUtils]: 0: Hoare triple {2763#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {2756#true} is VALID [2022-04-28 08:40:11,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {2756#true} assume true; {2756#true} is VALID [2022-04-28 08:40:11,770 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2756#true} {2756#true} #693#return; {2756#true} is VALID [2022-04-28 08:40:11,771 INFO L272 TraceCheckUtils]: 0: Hoare triple {2756#true} call ULTIMATE.init(); {2763#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:40:11,771 INFO L290 TraceCheckUtils]: 1: Hoare triple {2763#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {2756#true} is VALID [2022-04-28 08:40:11,773 INFO L290 TraceCheckUtils]: 2: Hoare triple {2756#true} assume true; {2756#true} is VALID [2022-04-28 08:40:11,773 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2756#true} {2756#true} #693#return; {2756#true} is VALID [2022-04-28 08:40:11,773 INFO L272 TraceCheckUtils]: 4: Hoare triple {2756#true} call #t~ret161 := main(); {2756#true} is VALID [2022-04-28 08:40:11,773 INFO L290 TraceCheckUtils]: 5: Hoare triple {2756#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; {2756#true} is VALID [2022-04-28 08:40:11,774 INFO L290 TraceCheckUtils]: 6: Hoare triple {2756#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {2756#true} is VALID [2022-04-28 08:40:11,774 INFO L272 TraceCheckUtils]: 7: Hoare triple {2756#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {2756#true} is VALID [2022-04-28 08:40:11,776 INFO L290 TraceCheckUtils]: 8: Hoare triple {2756#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;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);~blastFlag~0 := 0;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); {2761#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:11,776 INFO L290 TraceCheckUtils]: 9: Hoare triple {2761#(not (= 12292 (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; {2761#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:11,777 INFO L290 TraceCheckUtils]: 10: Hoare triple {2761#(not (= 12292 (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; {2761#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:11,777 INFO L290 TraceCheckUtils]: 11: Hoare triple {2761#(not (= 12292 (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)))); {2761#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:11,778 INFO L290 TraceCheckUtils]: 12: Hoare triple {2761#(not (= 12292 (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); {2761#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:11,778 INFO L290 TraceCheckUtils]: 13: Hoare triple {2761#(not (= 12292 (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; {2761#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:11,780 INFO L290 TraceCheckUtils]: 14: Hoare triple {2761#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {2761#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:11,780 INFO L290 TraceCheckUtils]: 15: Hoare triple {2761#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {2762#(not (= 12292 |ssl3_accept_#t~mem47|))} is VALID [2022-04-28 08:40:11,781 INFO L290 TraceCheckUtils]: 16: Hoare triple {2762#(not (= 12292 |ssl3_accept_#t~mem47|))} assume 12292 == #t~mem47;havoc #t~mem47; {2757#false} is VALID [2022-04-28 08:40:11,783 INFO L290 TraceCheckUtils]: 17: Hoare triple {2757#false} call write~int(1, ~s.base, 40 + ~s.offset, 4); {2757#false} is VALID [2022-04-28 08:40:11,783 INFO L290 TraceCheckUtils]: 18: Hoare triple {2757#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {2757#false} is VALID [2022-04-28 08:40:11,783 INFO L290 TraceCheckUtils]: 19: Hoare triple {2757#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {2757#false} is VALID [2022-04-28 08:40:11,783 INFO L290 TraceCheckUtils]: 20: Hoare triple {2757#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {2757#false} is VALID [2022-04-28 08:40:11,783 INFO L290 TraceCheckUtils]: 21: Hoare triple {2757#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); {2757#false} is VALID [2022-04-28 08:40:11,783 INFO L290 TraceCheckUtils]: 22: Hoare triple {2757#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {2757#false} is VALID [2022-04-28 08:40:11,783 INFO L290 TraceCheckUtils]: 23: Hoare triple {2757#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); {2757#false} is VALID [2022-04-28 08:40:11,783 INFO L290 TraceCheckUtils]: 24: Hoare triple {2757#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); {2757#false} is VALID [2022-04-28 08:40:11,784 INFO L290 TraceCheckUtils]: 25: Hoare triple {2757#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); {2757#false} is VALID [2022-04-28 08:40:11,784 INFO L290 TraceCheckUtils]: 26: Hoare triple {2757#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {2757#false} is VALID [2022-04-28 08:40:11,784 INFO L290 TraceCheckUtils]: 27: Hoare triple {2757#false} ~skip~0 := 0; {2757#false} is VALID [2022-04-28 08:40:11,784 INFO L290 TraceCheckUtils]: 28: Hoare triple {2757#false} assume !false; {2757#false} is VALID [2022-04-28 08:40:11,784 INFO L290 TraceCheckUtils]: 29: Hoare triple {2757#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); {2757#false} is VALID [2022-04-28 08:40:11,784 INFO L290 TraceCheckUtils]: 30: Hoare triple {2757#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {2757#false} is VALID [2022-04-28 08:40:11,784 INFO L290 TraceCheckUtils]: 31: Hoare triple {2757#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {2757#false} is VALID [2022-04-28 08:40:11,784 INFO L290 TraceCheckUtils]: 32: Hoare triple {2757#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {2757#false} is VALID [2022-04-28 08:40:11,784 INFO L290 TraceCheckUtils]: 33: Hoare triple {2757#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {2757#false} is VALID [2022-04-28 08:40:11,784 INFO L290 TraceCheckUtils]: 34: Hoare triple {2757#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {2757#false} is VALID [2022-04-28 08:40:11,784 INFO L290 TraceCheckUtils]: 35: Hoare triple {2757#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {2757#false} is VALID [2022-04-28 08:40:11,785 INFO L290 TraceCheckUtils]: 36: Hoare triple {2757#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {2757#false} is VALID [2022-04-28 08:40:11,785 INFO L290 TraceCheckUtils]: 37: Hoare triple {2757#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {2757#false} is VALID [2022-04-28 08:40:11,785 INFO L290 TraceCheckUtils]: 38: Hoare triple {2757#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {2757#false} is VALID [2022-04-28 08:40:11,785 INFO L290 TraceCheckUtils]: 39: Hoare triple {2757#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {2757#false} is VALID [2022-04-28 08:40:11,786 INFO L290 TraceCheckUtils]: 40: Hoare triple {2757#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {2757#false} is VALID [2022-04-28 08:40:11,786 INFO L290 TraceCheckUtils]: 41: Hoare triple {2757#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {2757#false} is VALID [2022-04-28 08:40:11,786 INFO L290 TraceCheckUtils]: 42: Hoare triple {2757#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {2757#false} is VALID [2022-04-28 08:40:11,786 INFO L290 TraceCheckUtils]: 43: Hoare triple {2757#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {2757#false} is VALID [2022-04-28 08:40:11,786 INFO L290 TraceCheckUtils]: 44: Hoare triple {2757#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {2757#false} is VALID [2022-04-28 08:40:11,786 INFO L290 TraceCheckUtils]: 45: Hoare triple {2757#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {2757#false} is VALID [2022-04-28 08:40:11,786 INFO L290 TraceCheckUtils]: 46: Hoare triple {2757#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {2757#false} is VALID [2022-04-28 08:40:11,786 INFO L290 TraceCheckUtils]: 47: Hoare triple {2757#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {2757#false} is VALID [2022-04-28 08:40:11,787 INFO L290 TraceCheckUtils]: 48: Hoare triple {2757#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {2757#false} is VALID [2022-04-28 08:40:11,787 INFO L290 TraceCheckUtils]: 49: Hoare triple {2757#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {2757#false} is VALID [2022-04-28 08:40:11,788 INFO L290 TraceCheckUtils]: 50: Hoare triple {2757#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {2757#false} is VALID [2022-04-28 08:40:11,788 INFO L290 TraceCheckUtils]: 51: Hoare triple {2757#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {2757#false} is VALID [2022-04-28 08:40:11,788 INFO L290 TraceCheckUtils]: 52: Hoare triple {2757#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {2757#false} is VALID [2022-04-28 08:40:11,789 INFO L290 TraceCheckUtils]: 53: Hoare triple {2757#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {2757#false} is VALID [2022-04-28 08:40:11,789 INFO L290 TraceCheckUtils]: 54: Hoare triple {2757#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {2757#false} is VALID [2022-04-28 08:40:11,789 INFO L290 TraceCheckUtils]: 55: Hoare triple {2757#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {2757#false} is VALID [2022-04-28 08:40:11,791 INFO L290 TraceCheckUtils]: 56: Hoare triple {2757#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {2757#false} is VALID [2022-04-28 08:40:11,791 INFO L290 TraceCheckUtils]: 57: Hoare triple {2757#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {2757#false} is VALID [2022-04-28 08:40:11,791 INFO L290 TraceCheckUtils]: 58: Hoare triple {2757#false} assume 8640 == #t~mem75;havoc #t~mem75; {2757#false} is VALID [2022-04-28 08:40:11,791 INFO L290 TraceCheckUtils]: 59: Hoare triple {2757#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {2757#false} is VALID [2022-04-28 08:40:11,792 INFO L290 TraceCheckUtils]: 60: Hoare triple {2757#false} assume !(4 == ~blastFlag~0); {2757#false} is VALID [2022-04-28 08:40:11,792 INFO L290 TraceCheckUtils]: 61: Hoare triple {2757#false} assume !(7 == ~blastFlag~0); {2757#false} is VALID [2022-04-28 08:40:11,792 INFO L290 TraceCheckUtils]: 62: Hoare triple {2757#false} assume 10 == ~blastFlag~0; {2757#false} is VALID [2022-04-28 08:40:11,792 INFO L290 TraceCheckUtils]: 63: Hoare triple {2757#false} assume !false; {2757#false} is VALID [2022-04-28 08:40:11,793 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:40:11,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:40:11,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815794457] [2022-04-28 08:40:11,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815794457] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:40:11,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:40:11,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:40:11,794 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:40:11,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [313724996] [2022-04-28 08:40:11,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [313724996] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:40:11,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:40:11,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:40:11,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744342711] [2022-04-28 08:40:11,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:40:11,795 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-28 08:40:11,795 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:40:11,796 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-28 08:40:11,843 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-28 08:40:11,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:40:11,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:40:11,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:40:11,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:40:11,845 INFO L87 Difference]: Start difference. First operand 154 states and 235 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-28 08:40:17,526 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:40:18,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:40:18,641 INFO L93 Difference]: Finished difference Result 399 states and 616 transitions. [2022-04-28 08:40:18,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:40:18,642 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-28 08:40:18,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:40:18,642 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-28 08:40:18,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 598 transitions. [2022-04-28 08:40:18,646 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-28 08:40:18,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 598 transitions. [2022-04-28 08:40:18,650 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 598 transitions. [2022-04-28 08:40:19,029 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 598 edges. 598 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:40:19,034 INFO L225 Difference]: With dead ends: 399 [2022-04-28 08:40:19,034 INFO L226 Difference]: Without dead ends: 271 [2022-04-28 08:40:19,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:40:19,035 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 150 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-04-28 08:40:19,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 350 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-04-28 08:40:19,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2022-04-28 08:40:19,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 165. [2022-04-28 08:40:19,052 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:40:19,052 INFO L82 GeneralOperation]: Start isEquivalent. First operand 271 states. Second operand has 165 states, 160 states have (on average 1.5375) internal successors, (246), 160 states have internal predecessors, (246), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:19,052 INFO L74 IsIncluded]: Start isIncluded. First operand 271 states. Second operand has 165 states, 160 states have (on average 1.5375) internal successors, (246), 160 states have internal predecessors, (246), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:19,053 INFO L87 Difference]: Start difference. First operand 271 states. Second operand has 165 states, 160 states have (on average 1.5375) internal successors, (246), 160 states have internal predecessors, (246), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:19,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:40:19,060 INFO L93 Difference]: Finished difference Result 271 states and 416 transitions. [2022-04-28 08:40:19,060 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 416 transitions. [2022-04-28 08:40:19,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:40:19,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:40:19,060 INFO L74 IsIncluded]: Start isIncluded. First operand has 165 states, 160 states have (on average 1.5375) internal successors, (246), 160 states have internal predecessors, (246), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 271 states. [2022-04-28 08:40:19,061 INFO L87 Difference]: Start difference. First operand has 165 states, 160 states have (on average 1.5375) internal successors, (246), 160 states have internal predecessors, (246), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 271 states. [2022-04-28 08:40:19,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:40:19,066 INFO L93 Difference]: Finished difference Result 271 states and 416 transitions. [2022-04-28 08:40:19,067 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 416 transitions. [2022-04-28 08:40:19,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:40:19,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:40:19,067 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:40:19,067 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:40:19,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 160 states have (on average 1.5375) internal successors, (246), 160 states have internal predecessors, (246), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:19,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 250 transitions. [2022-04-28 08:40:19,070 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 250 transitions. Word has length 64 [2022-04-28 08:40:19,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:40:19,071 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 250 transitions. [2022-04-28 08:40:19,071 INFO L496 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-28 08:40:19,071 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 165 states and 250 transitions. [2022-04-28 08:40:19,234 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 250 edges. 250 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:40:19,235 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 250 transitions. [2022-04-28 08:40:19,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-28 08:40:19,235 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:40:19,235 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:40:19,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 08:40:19,236 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:40:19,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:40:19,236 INFO L85 PathProgramCache]: Analyzing trace with hash -2038223339, now seen corresponding path program 1 times [2022-04-28 08:40:19,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:40:19,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1920834248] [2022-04-28 08:40:19,393 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 18 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 08:40:19,394 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 08:40:19,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1395713082, now seen corresponding path program 1 times [2022-04-28 08:40:19,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:40:19,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459532623] [2022-04-28 08:40:19,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:40:19,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:40:19,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:40:19,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:40:19,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:40:19,508 INFO L290 TraceCheckUtils]: 0: Hoare triple {4444#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {4438#true} is VALID [2022-04-28 08:40:19,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {4438#true} assume true; {4438#true} is VALID [2022-04-28 08:40:19,508 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4438#true} {4438#true} #693#return; {4438#true} is VALID [2022-04-28 08:40:19,509 INFO L272 TraceCheckUtils]: 0: Hoare triple {4438#true} call ULTIMATE.init(); {4444#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:40:19,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {4444#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {4438#true} is VALID [2022-04-28 08:40:19,509 INFO L290 TraceCheckUtils]: 2: Hoare triple {4438#true} assume true; {4438#true} is VALID [2022-04-28 08:40:19,509 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4438#true} {4438#true} #693#return; {4438#true} is VALID [2022-04-28 08:40:19,509 INFO L272 TraceCheckUtils]: 4: Hoare triple {4438#true} call #t~ret161 := main(); {4438#true} is VALID [2022-04-28 08:40:19,509 INFO L290 TraceCheckUtils]: 5: Hoare triple {4438#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; {4438#true} is VALID [2022-04-28 08:40:19,509 INFO L290 TraceCheckUtils]: 6: Hoare triple {4438#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {4438#true} is VALID [2022-04-28 08:40:19,510 INFO L272 TraceCheckUtils]: 7: Hoare triple {4438#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {4438#true} is VALID [2022-04-28 08:40:19,510 INFO L290 TraceCheckUtils]: 8: Hoare triple {4438#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;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);~blastFlag~0 := 0;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); {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:19,510 INFO L290 TraceCheckUtils]: 9: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:19,510 INFO L290 TraceCheckUtils]: 10: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:19,511 INFO L290 TraceCheckUtils]: 11: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:19,515 INFO L290 TraceCheckUtils]: 12: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:19,515 INFO L290 TraceCheckUtils]: 13: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:19,516 INFO L290 TraceCheckUtils]: 14: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} [699] L1167-2-->L1168_primed: Formula: (let ((.cse0 (= |v_ssl3_accept_#t~mem85_10| |v_ssl3_accept_#t~mem85_8|)) (.cse1 (= v_ssl3_accept_~skip~0_16 v_ssl3_accept_~skip~0_15)) (.cse2 (= |v_ssl3_accept_#t~mem47_12| |v_ssl3_accept_#t~mem47_10|)) (.cse3 (= |v_ssl3_accept_#t~mem150.base_10| |v_ssl3_accept_#t~mem150.base_8|)) (.cse4 (= v_ssl3_accept_~state~0_8 v_ssl3_accept_~state~0_7)) (.cse5 (= |v_ssl3_accept_#t~mem88.base_5| |v_ssl3_accept_#t~mem88.base_4|)) (.cse6 (= |v_ssl3_accept_#t~mem48_10| |v_ssl3_accept_#t~mem48_8|)) (.cse7 (= |v_ssl3_accept_#t~mem88.offset_5| |v_ssl3_accept_#t~mem88.offset_4|)) (.cse8 (= |v_ssl3_accept_#t~mem46_6| |v_ssl3_accept_#t~mem46_5|)) (.cse9 (= |v_ssl3_accept_#t~mem151_12| |v_ssl3_accept_#t~mem151_10|)) (.cse10 (= |v_ssl3_accept_#t~mem89_5| |v_ssl3_accept_#t~mem89_4|)) (.cse11 (= |v_ssl3_accept_#t~mem82_10| |v_ssl3_accept_#t~mem82_8|))) (or (and (= |v_#memory_$Pointer$.offset_250| |v_#memory_$Pointer$.offset_256|) .cse0 (= |v_ssl3_accept_#t~mem83.offset_8| |v_ssl3_accept_#t~mem83.offset_10|) .cse1 .cse2 .cse3 .cse4 (= |v_ssl3_accept_#t~mem150.offset_8| |v_ssl3_accept_#t~mem150.offset_10|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= |v_#memory_int_251| |v_#memory_int_256|) (= |v_#memory_$Pointer$.base_250| |v_#memory_$Pointer$.base_256|) (= |v_ssl3_accept_#t~mem83.base_8| |v_ssl3_accept_#t~mem83.base_10|)) (and (= |v_#memory_int_256| |v_#memory_int_251|) .cse0 .cse1 (= |v_#memory_$Pointer$.offset_256| |v_#memory_$Pointer$.offset_250|) .cse2 (= |v_#memory_$Pointer$.base_256| |v_#memory_$Pointer$.base_250|) .cse3 .cse4 (= |v_ssl3_accept_#t~mem150.offset_10| |v_ssl3_accept_#t~mem150.offset_8|) (= |v_ssl3_accept_#t~mem83.base_10| |v_ssl3_accept_#t~mem83.base_8|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= |v_ssl3_accept_#t~mem83.offset_10| |v_ssl3_accept_#t~mem83.offset_8|)))) InVars {ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_10|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_256|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_10|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_10|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_12|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_10|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_5|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_10|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_10|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_10|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_12|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_6|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_16, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_5|, #memory_int=|v_#memory_int_256|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_5|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_256|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_8} OutVars{ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_8|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_250|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_8|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_8|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_10|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_8|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_4|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_8|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_8|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_8|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_10|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_5|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_15, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_4|, #memory_int=|v_#memory_int_251|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_4|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_250|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_7} AuxVars[] AssignedVars[ssl3_accept_#t~mem83.base, #memory_$Pointer$.base, ssl3_accept_#t~mem82, ssl3_accept_#t~mem85, ssl3_accept_#t~mem151, ssl3_accept_#t~mem150.base, ssl3_accept_#t~mem88.base, ssl3_accept_#t~mem83.offset, ssl3_accept_#t~mem48, ssl3_accept_#t~mem150.offset, ssl3_accept_#t~mem47, ssl3_accept_#t~mem46, ssl3_accept_~skip~0, ssl3_accept_#t~mem88.offset, #memory_int, ssl3_accept_#t~mem89, #memory_$Pointer$.offset, ssl3_accept_~state~0] {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:19,516 INFO L290 TraceCheckUtils]: 15: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} [698] L1168_primed-->L1168: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:19,516 INFO L290 TraceCheckUtils]: 16: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:19,516 INFO L290 TraceCheckUtils]: 17: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:19,517 INFO L290 TraceCheckUtils]: 18: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:19,517 INFO L290 TraceCheckUtils]: 19: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:19,517 INFO L290 TraceCheckUtils]: 20: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:19,517 INFO L290 TraceCheckUtils]: 21: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:19,518 INFO L290 TraceCheckUtils]: 22: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:19,518 INFO L290 TraceCheckUtils]: 23: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:19,518 INFO L290 TraceCheckUtils]: 24: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:19,518 INFO L290 TraceCheckUtils]: 25: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:19,519 INFO L290 TraceCheckUtils]: 26: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:19,519 INFO L290 TraceCheckUtils]: 27: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:19,519 INFO L290 TraceCheckUtils]: 28: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:19,519 INFO L290 TraceCheckUtils]: 29: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:19,520 INFO L290 TraceCheckUtils]: 30: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:19,520 INFO L290 TraceCheckUtils]: 31: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:19,520 INFO L290 TraceCheckUtils]: 32: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:19,520 INFO L290 TraceCheckUtils]: 33: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:19,521 INFO L290 TraceCheckUtils]: 34: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:19,521 INFO L290 TraceCheckUtils]: 35: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:19,521 INFO L290 TraceCheckUtils]: 36: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:19,521 INFO L290 TraceCheckUtils]: 37: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:19,522 INFO L290 TraceCheckUtils]: 38: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:19,522 INFO L290 TraceCheckUtils]: 39: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:19,522 INFO L290 TraceCheckUtils]: 40: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:19,522 INFO L290 TraceCheckUtils]: 41: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:19,523 INFO L290 TraceCheckUtils]: 42: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:19,523 INFO L290 TraceCheckUtils]: 43: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:19,523 INFO L290 TraceCheckUtils]: 44: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:19,523 INFO L290 TraceCheckUtils]: 45: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} assume 8640 == #t~mem75;havoc #t~mem75; {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:19,524 INFO L290 TraceCheckUtils]: 46: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:19,527 INFO L290 TraceCheckUtils]: 47: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} assume !(4 == ~blastFlag~0); {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:19,528 INFO L290 TraceCheckUtils]: 48: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} assume !(7 == ~blastFlag~0); {4443#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:19,528 INFO L290 TraceCheckUtils]: 49: Hoare triple {4443#(= ssl3_accept_~blastFlag~0 0)} assume 10 == ~blastFlag~0; {4439#false} is VALID [2022-04-28 08:40:19,529 INFO L290 TraceCheckUtils]: 50: Hoare triple {4439#false} assume !false; {4439#false} is VALID [2022-04-28 08:40:19,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:40:19,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:40:19,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459532623] [2022-04-28 08:40:19,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459532623] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:40:19,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:40:19,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:40:22,538 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:40:22,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1920834248] [2022-04-28 08:40:22,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1920834248] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:40:22,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:40:22,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 08:40:22,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476597020] [2022-04-28 08:40:22,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:40:22,542 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-28 08:40:22,543 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:40:22,543 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 12 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-28 08:40:22,601 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-28 08:40:22,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 08:40:22,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:40:22,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 08:40:22,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=106, Unknown=2, NotChecked=0, Total=156 [2022-04-28 08:40:22,602 INFO L87 Difference]: Start difference. First operand 165 states and 250 transitions. Second operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 12 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-28 08:40:26,313 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:40:28,923 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:40:30,523 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:40:32,340 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:40:34,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:40:34,730 INFO L93 Difference]: Finished difference Result 440 states and 677 transitions. [2022-04-28 08:40:34,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 08:40:34,730 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-28 08:40:34,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:40:34,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 12 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-28 08:40:34,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 612 transitions. [2022-04-28 08:40:34,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 12 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-28 08:40:34,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 612 transitions. [2022-04-28 08:40:34,738 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 612 transitions. [2022-04-28 08:40:35,134 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 612 edges. 612 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:40:35,139 INFO L225 Difference]: With dead ends: 440 [2022-04-28 08:40:35,140 INFO L226 Difference]: Without dead ends: 301 [2022-04-28 08:40:35,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=48, Invalid=106, Unknown=2, NotChecked=0, Total=156 [2022-04-28 08:40:35,141 INFO L413 NwaCegarLoop]: 342 mSDtfsCounter, 144 mSDsluCounter, 1019 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 1361 SdHoareTripleChecker+Invalid, 1534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 709 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-04-28 08:40:35,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 1361 Invalid, 1534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 810 Invalid, 0 Unknown, 709 Unchecked, 6.8s Time] [2022-04-28 08:40:35,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2022-04-28 08:40:35,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 297. [2022-04-28 08:40:35,161 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:40:35,162 INFO L82 GeneralOperation]: Start isEquivalent. First operand 301 states. Second operand has 297 states, 292 states have (on average 1.5136986301369864) internal successors, (442), 292 states have internal predecessors, (442), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:35,163 INFO L74 IsIncluded]: Start isIncluded. First operand 301 states. Second operand has 297 states, 292 states have (on average 1.5136986301369864) internal successors, (442), 292 states have internal predecessors, (442), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:35,170 INFO L87 Difference]: Start difference. First operand 301 states. Second operand has 297 states, 292 states have (on average 1.5136986301369864) internal successors, (442), 292 states have internal predecessors, (442), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:35,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:40:35,181 INFO L93 Difference]: Finished difference Result 301 states and 451 transitions. [2022-04-28 08:40:35,181 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 451 transitions. [2022-04-28 08:40:35,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:40:35,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:40:35,182 INFO L74 IsIncluded]: Start isIncluded. First operand has 297 states, 292 states have (on average 1.5136986301369864) internal successors, (442), 292 states have internal predecessors, (442), 3 states have call successors, (3), 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 301 states. [2022-04-28 08:40:35,183 INFO L87 Difference]: Start difference. First operand has 297 states, 292 states have (on average 1.5136986301369864) internal successors, (442), 292 states have internal predecessors, (442), 3 states have call successors, (3), 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 301 states. [2022-04-28 08:40:35,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:40:35,188 INFO L93 Difference]: Finished difference Result 301 states and 451 transitions. [2022-04-28 08:40:35,188 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 451 transitions. [2022-04-28 08:40:35,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:40:35,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:40:35,189 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:40:35,189 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:40:35,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 292 states have (on average 1.5136986301369864) internal successors, (442), 292 states have internal predecessors, (442), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:35,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 446 transitions. [2022-04-28 08:40:35,194 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 446 transitions. Word has length 64 [2022-04-28 08:40:35,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:40:35,195 INFO L495 AbstractCegarLoop]: Abstraction has 297 states and 446 transitions. [2022-04-28 08:40:35,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 12 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-28 08:40:35,195 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 297 states and 446 transitions. [2022-04-28 08:40:35,513 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 446 edges. 446 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:40:35,514 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 446 transitions. [2022-04-28 08:40:35,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-28 08:40:35,517 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:40:35,517 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:40:35,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 08:40:35,517 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:40:35,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:40:35,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1144737001, now seen corresponding path program 1 times [2022-04-28 08:40:35,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:40:35,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [79281526] [2022-04-28 08:40:35,637 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 18 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 08:40:35,638 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 08:40:35,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1130548346, now seen corresponding path program 1 times [2022-04-28 08:40:35,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:40:35,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346262548] [2022-04-28 08:40:35,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:40:35,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:40:35,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:40:35,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:40:35,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:40:35,763 INFO L290 TraceCheckUtils]: 0: Hoare triple {6538#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {6532#true} is VALID [2022-04-28 08:40:35,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {6532#true} assume true; {6532#true} is VALID [2022-04-28 08:40:35,764 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6532#true} {6532#true} #693#return; {6532#true} is VALID [2022-04-28 08:40:35,765 INFO L272 TraceCheckUtils]: 0: Hoare triple {6532#true} call ULTIMATE.init(); {6538#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:40:35,765 INFO L290 TraceCheckUtils]: 1: Hoare triple {6538#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {6532#true} is VALID [2022-04-28 08:40:35,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {6532#true} assume true; {6532#true} is VALID [2022-04-28 08:40:35,766 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6532#true} {6532#true} #693#return; {6532#true} is VALID [2022-04-28 08:40:35,767 INFO L272 TraceCheckUtils]: 4: Hoare triple {6532#true} call #t~ret161 := main(); {6532#true} is VALID [2022-04-28 08:40:35,767 INFO L290 TraceCheckUtils]: 5: Hoare triple {6532#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; {6532#true} is VALID [2022-04-28 08:40:35,767 INFO L290 TraceCheckUtils]: 6: Hoare triple {6532#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {6532#true} is VALID [2022-04-28 08:40:35,767 INFO L272 TraceCheckUtils]: 7: Hoare triple {6532#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {6532#true} is VALID [2022-04-28 08:40:35,768 INFO L290 TraceCheckUtils]: 8: Hoare triple {6532#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;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);~blastFlag~0 := 0;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); {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:35,768 INFO L290 TraceCheckUtils]: 9: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:35,768 INFO L290 TraceCheckUtils]: 10: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:35,769 INFO L290 TraceCheckUtils]: 11: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:35,770 INFO L290 TraceCheckUtils]: 12: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:35,771 INFO L290 TraceCheckUtils]: 13: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:35,771 INFO L290 TraceCheckUtils]: 14: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} [701] L1167-2-->L1168_primed: Formula: (let ((.cse0 (= |v_ssl3_accept_#t~mem88.offset_10| |v_ssl3_accept_#t~mem88.offset_9|)) (.cse1 (= |v_ssl3_accept_#t~mem150.offset_16| |v_ssl3_accept_#t~mem150.offset_14|)) (.cse2 (= v_ssl3_accept_~skip~0_21 v_ssl3_accept_~skip~0_20)) (.cse3 (= |v_ssl3_accept_#t~mem82_17| |v_ssl3_accept_#t~mem82_15|)) (.cse4 (= |v_ssl3_accept_#t~mem151_18| |v_ssl3_accept_#t~mem151_16|)) (.cse5 (= |v_ssl3_accept_#t~mem47_19| |v_ssl3_accept_#t~mem47_17|)) (.cse6 (= |v_ssl3_accept_#t~mem83.offset_17| |v_ssl3_accept_#t~mem83.offset_15|)) (.cse7 (= |v_ssl3_accept_#t~mem85_17| |v_ssl3_accept_#t~mem85_15|)) (.cse8 (= v_ssl3_accept_~state~0_13 v_ssl3_accept_~state~0_12)) (.cse9 (= |v_ssl3_accept_#t~mem89_10| |v_ssl3_accept_#t~mem89_9|)) (.cse10 (= |v_ssl3_accept_#t~mem150.base_16| |v_ssl3_accept_#t~mem150.base_14|)) (.cse11 (= |v_ssl3_accept_#t~mem46_11| |v_ssl3_accept_#t~mem46_10|))) (or (and .cse0 (= |v_ssl3_accept_#t~mem88.base_9| |v_ssl3_accept_#t~mem88.base_10|) .cse1 .cse2 .cse3 .cse4 (= |v_#memory_$Pointer$.base_270| |v_#memory_$Pointer$.base_276|) .cse5 (= |v_#memory_int_270| |v_#memory_int_275|) .cse6 .cse7 (= |v_#memory_$Pointer$.offset_270| |v_#memory_$Pointer$.offset_276|) .cse8 .cse9 .cse10 (= |v_ssl3_accept_#t~mem48_15| |v_ssl3_accept_#t~mem48_17|) .cse11 (= |v_ssl3_accept_#t~mem83.base_15| |v_ssl3_accept_#t~mem83.base_17|)) (and .cse0 .cse1 (= |v_#memory_$Pointer$.base_276| |v_#memory_$Pointer$.base_270|) .cse2 .cse3 (= |v_ssl3_accept_#t~mem83.base_17| |v_ssl3_accept_#t~mem83.base_15|) .cse4 (= |v_ssl3_accept_#t~mem48_17| |v_ssl3_accept_#t~mem48_15|) .cse5 .cse6 .cse7 (= |v_#memory_int_275| |v_#memory_int_270|) .cse8 (= |v_ssl3_accept_#t~mem88.base_10| |v_ssl3_accept_#t~mem88.base_9|) .cse9 .cse10 .cse11 (= |v_#memory_$Pointer$.offset_276| |v_#memory_$Pointer$.offset_270|)))) InVars {ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_17|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_276|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_17|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_17|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_18|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_16|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_10|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_17|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_17|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_16|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_19|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_11|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_21, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_10|, #memory_int=|v_#memory_int_275|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_10|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_276|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_13} OutVars{ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_15|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_270|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_15|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_15|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_16|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_14|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_9|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_15|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_15|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_14|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_17|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_10|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_20, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_9|, #memory_int=|v_#memory_int_270|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_9|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_270|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_12} AuxVars[] AssignedVars[ssl3_accept_#t~mem83.base, #memory_$Pointer$.base, ssl3_accept_#t~mem82, ssl3_accept_#t~mem85, ssl3_accept_#t~mem151, ssl3_accept_#t~mem150.base, ssl3_accept_#t~mem88.base, ssl3_accept_#t~mem83.offset, ssl3_accept_#t~mem48, ssl3_accept_#t~mem150.offset, ssl3_accept_#t~mem47, ssl3_accept_#t~mem46, ssl3_accept_~skip~0, ssl3_accept_#t~mem88.offset, #memory_int, ssl3_accept_#t~mem89, #memory_$Pointer$.offset, ssl3_accept_~state~0] {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:35,771 INFO L290 TraceCheckUtils]: 15: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} [700] L1168_primed-->L1168: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:35,772 INFO L290 TraceCheckUtils]: 16: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:35,772 INFO L290 TraceCheckUtils]: 17: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:35,772 INFO L290 TraceCheckUtils]: 18: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:35,772 INFO L290 TraceCheckUtils]: 19: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:35,773 INFO L290 TraceCheckUtils]: 20: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:35,773 INFO L290 TraceCheckUtils]: 21: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:35,773 INFO L290 TraceCheckUtils]: 22: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:35,773 INFO L290 TraceCheckUtils]: 23: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:35,774 INFO L290 TraceCheckUtils]: 24: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:35,774 INFO L290 TraceCheckUtils]: 25: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:35,774 INFO L290 TraceCheckUtils]: 26: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:35,774 INFO L290 TraceCheckUtils]: 27: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:35,775 INFO L290 TraceCheckUtils]: 28: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:35,775 INFO L290 TraceCheckUtils]: 29: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:35,776 INFO L290 TraceCheckUtils]: 30: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:35,777 INFO L290 TraceCheckUtils]: 31: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:35,777 INFO L290 TraceCheckUtils]: 32: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:35,777 INFO L290 TraceCheckUtils]: 33: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:35,777 INFO L290 TraceCheckUtils]: 34: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:35,778 INFO L290 TraceCheckUtils]: 35: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:35,778 INFO L290 TraceCheckUtils]: 36: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:35,778 INFO L290 TraceCheckUtils]: 37: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:35,778 INFO L290 TraceCheckUtils]: 38: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:35,779 INFO L290 TraceCheckUtils]: 39: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:35,779 INFO L290 TraceCheckUtils]: 40: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:35,779 INFO L290 TraceCheckUtils]: 41: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:35,780 INFO L290 TraceCheckUtils]: 42: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:35,780 INFO L290 TraceCheckUtils]: 43: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:35,780 INFO L290 TraceCheckUtils]: 44: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:35,780 INFO L290 TraceCheckUtils]: 45: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} assume 8640 == #t~mem75;havoc #t~mem75; {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:35,781 INFO L290 TraceCheckUtils]: 46: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:35,781 INFO L290 TraceCheckUtils]: 47: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} assume !(4 == ~blastFlag~0); {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:35,781 INFO L290 TraceCheckUtils]: 48: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} assume !(7 == ~blastFlag~0); {6537#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:40:35,781 INFO L290 TraceCheckUtils]: 49: Hoare triple {6537#(= ssl3_accept_~blastFlag~0 0)} assume 10 == ~blastFlag~0; {6533#false} is VALID [2022-04-28 08:40:35,781 INFO L290 TraceCheckUtils]: 50: Hoare triple {6533#false} assume !false; {6533#false} is VALID [2022-04-28 08:40:35,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:40:35,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:40:35,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346262548] [2022-04-28 08:40:35,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346262548] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:40:35,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:40:35,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:40:38,681 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:40:38,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [79281526] [2022-04-28 08:40:38,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [79281526] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:40:38,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:40:38,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 08:40:38,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674465685] [2022-04-28 08:40:38,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:40:38,682 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-28 08:40:38,682 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:40:38,683 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 12 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-28 08:40:38,747 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-28 08:40:38,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 08:40:38,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:40:38,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 08:40:38,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=107, Unknown=1, NotChecked=0, Total=156 [2022-04-28 08:40:38,748 INFO L87 Difference]: Start difference. First operand 297 states and 446 transitions. Second operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 12 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-28 08:40:44,060 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:40:46,066 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:40:47,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:40:47,623 INFO L93 Difference]: Finished difference Result 579 states and 882 transitions. [2022-04-28 08:40:47,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 08:40:47,624 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-28 08:40:47,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:40:47,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 12 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-28 08:40:47,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 621 transitions. [2022-04-28 08:40:47,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 12 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-28 08:40:47,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 621 transitions. [2022-04-28 08:40:47,629 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 621 transitions. [2022-04-28 08:40:48,032 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 621 edges. 621 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:40:48,041 INFO L225 Difference]: With dead ends: 579 [2022-04-28 08:40:48,041 INFO L226 Difference]: Without dead ends: 440 [2022-04-28 08:40:48,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=48, Invalid=107, Unknown=1, NotChecked=0, Total=156 [2022-04-28 08:40:48,042 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 154 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 15 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 272 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-04-28 08:40:48,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 808 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 486 Invalid, 1 Unknown, 272 Unchecked, 5.2s Time] [2022-04-28 08:40:48,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2022-04-28 08:40:48,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 433. [2022-04-28 08:40:48,067 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:40:48,068 INFO L82 GeneralOperation]: Start isEquivalent. First operand 440 states. Second operand has 433 states, 428 states have (on average 1.5046728971962617) internal successors, (644), 428 states have internal predecessors, (644), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:48,069 INFO L74 IsIncluded]: Start isIncluded. First operand 440 states. Second operand has 433 states, 428 states have (on average 1.5046728971962617) internal successors, (644), 428 states have internal predecessors, (644), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:48,069 INFO L87 Difference]: Start difference. First operand 440 states. Second operand has 433 states, 428 states have (on average 1.5046728971962617) internal successors, (644), 428 states have internal predecessors, (644), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:48,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:40:48,077 INFO L93 Difference]: Finished difference Result 440 states and 656 transitions. [2022-04-28 08:40:48,077 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 656 transitions. [2022-04-28 08:40:48,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:40:48,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:40:48,078 INFO L74 IsIncluded]: Start isIncluded. First operand has 433 states, 428 states have (on average 1.5046728971962617) internal successors, (644), 428 states have internal predecessors, (644), 3 states have call successors, (3), 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 440 states. [2022-04-28 08:40:48,079 INFO L87 Difference]: Start difference. First operand has 433 states, 428 states have (on average 1.5046728971962617) internal successors, (644), 428 states have internal predecessors, (644), 3 states have call successors, (3), 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 440 states. [2022-04-28 08:40:48,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:40:48,087 INFO L93 Difference]: Finished difference Result 440 states and 656 transitions. [2022-04-28 08:40:48,087 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 656 transitions. [2022-04-28 08:40:48,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:40:48,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:40:48,087 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:40:48,087 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:40:48,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 428 states have (on average 1.5046728971962617) internal successors, (644), 428 states have internal predecessors, (644), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:48,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 648 transitions. [2022-04-28 08:40:48,097 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 648 transitions. Word has length 64 [2022-04-28 08:40:48,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:40:48,097 INFO L495 AbstractCegarLoop]: Abstraction has 433 states and 648 transitions. [2022-04-28 08:40:48,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 12 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-28 08:40:48,098 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 433 states and 648 transitions. [2022-04-28 08:40:48,570 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 648 edges. 648 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:40:48,570 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 648 transitions. [2022-04-28 08:40:48,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-28 08:40:48,571 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:40:48,571 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:40:48,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 08:40:48,571 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:40:48,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:40:48,572 INFO L85 PathProgramCache]: Analyzing trace with hash 415908008, now seen corresponding path program 1 times [2022-04-28 08:40:48,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:40:48,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [718028881] [2022-04-28 08:40:48,586 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:40:48,586 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:40:48,586 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:40:48,587 INFO L85 PathProgramCache]: Analyzing trace with hash 415908008, now seen corresponding path program 2 times [2022-04-28 08:40:48,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:40:48,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427240652] [2022-04-28 08:40:48,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:40:48,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:40:48,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:40:48,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:40:48,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:40:48,719 INFO L290 TraceCheckUtils]: 0: Hoare triple {9461#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {9454#true} is VALID [2022-04-28 08:40:48,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {9454#true} assume true; {9454#true} is VALID [2022-04-28 08:40:48,719 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9454#true} {9454#true} #693#return; {9454#true} is VALID [2022-04-28 08:40:48,720 INFO L272 TraceCheckUtils]: 0: Hoare triple {9454#true} call ULTIMATE.init(); {9461#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:40:48,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {9461#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {9454#true} is VALID [2022-04-28 08:40:48,720 INFO L290 TraceCheckUtils]: 2: Hoare triple {9454#true} assume true; {9454#true} is VALID [2022-04-28 08:40:48,721 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9454#true} {9454#true} #693#return; {9454#true} is VALID [2022-04-28 08:40:48,721 INFO L272 TraceCheckUtils]: 4: Hoare triple {9454#true} call #t~ret161 := main(); {9454#true} is VALID [2022-04-28 08:40:48,721 INFO L290 TraceCheckUtils]: 5: Hoare triple {9454#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; {9454#true} is VALID [2022-04-28 08:40:48,721 INFO L290 TraceCheckUtils]: 6: Hoare triple {9454#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {9454#true} is VALID [2022-04-28 08:40:48,721 INFO L272 TraceCheckUtils]: 7: Hoare triple {9454#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {9454#true} is VALID [2022-04-28 08:40:48,721 INFO L290 TraceCheckUtils]: 8: Hoare triple {9454#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;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);~blastFlag~0 := 0;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); {9454#true} is VALID [2022-04-28 08:40:48,721 INFO L290 TraceCheckUtils]: 9: Hoare triple {9454#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; {9454#true} is VALID [2022-04-28 08:40:48,721 INFO L290 TraceCheckUtils]: 10: Hoare triple {9454#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; {9454#true} is VALID [2022-04-28 08:40:48,721 INFO L290 TraceCheckUtils]: 11: Hoare triple {9454#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {9454#true} is VALID [2022-04-28 08:40:48,721 INFO L290 TraceCheckUtils]: 12: Hoare triple {9454#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {9454#true} is VALID [2022-04-28 08:40:48,721 INFO L290 TraceCheckUtils]: 13: Hoare triple {9454#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {9454#true} is VALID [2022-04-28 08:40:48,721 INFO L290 TraceCheckUtils]: 14: Hoare triple {9454#true} assume !false; {9454#true} is VALID [2022-04-28 08:40:48,722 INFO L290 TraceCheckUtils]: 15: Hoare triple {9454#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); {9454#true} is VALID [2022-04-28 08:40:48,722 INFO L290 TraceCheckUtils]: 16: Hoare triple {9454#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {9454#true} is VALID [2022-04-28 08:40:48,722 INFO L290 TraceCheckUtils]: 17: Hoare triple {9454#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {9454#true} is VALID [2022-04-28 08:40:48,722 INFO L290 TraceCheckUtils]: 18: Hoare triple {9454#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {9454#true} is VALID [2022-04-28 08:40:48,722 INFO L290 TraceCheckUtils]: 19: Hoare triple {9454#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {9454#true} is VALID [2022-04-28 08:40:48,722 INFO L290 TraceCheckUtils]: 20: Hoare triple {9454#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {9454#true} is VALID [2022-04-28 08:40:48,722 INFO L290 TraceCheckUtils]: 21: Hoare triple {9454#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {9454#true} is VALID [2022-04-28 08:40:48,722 INFO L290 TraceCheckUtils]: 22: Hoare triple {9454#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {9454#true} is VALID [2022-04-28 08:40:48,722 INFO L290 TraceCheckUtils]: 23: Hoare triple {9454#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {9454#true} is VALID [2022-04-28 08:40:48,722 INFO L290 TraceCheckUtils]: 24: Hoare triple {9454#true} assume 8464 == #t~mem55;havoc #t~mem55; {9454#true} is VALID [2022-04-28 08:40:48,722 INFO L290 TraceCheckUtils]: 25: Hoare triple {9454#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; {9454#true} is VALID [2022-04-28 08:40:48,722 INFO L290 TraceCheckUtils]: 26: Hoare triple {9454#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {9454#true} is VALID [2022-04-28 08:40:48,723 INFO L290 TraceCheckUtils]: 27: Hoare triple {9454#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); {9459#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:40:48,724 INFO L290 TraceCheckUtils]: 28: Hoare triple {9459#(= 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); {9459#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:40:48,724 INFO L290 TraceCheckUtils]: 29: Hoare triple {9459#(= 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; {9459#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:40:48,724 INFO L290 TraceCheckUtils]: 30: Hoare triple {9459#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {9459#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:40:48,725 INFO L290 TraceCheckUtils]: 31: Hoare triple {9459#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {9459#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:40:48,725 INFO L290 TraceCheckUtils]: 32: Hoare triple {9459#(= 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); {9459#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:40:48,725 INFO L290 TraceCheckUtils]: 33: Hoare triple {9459#(= 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); {9459#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:40:48,726 INFO L290 TraceCheckUtils]: 34: Hoare triple {9459#(= 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); {9459#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:40:48,726 INFO L290 TraceCheckUtils]: 35: Hoare triple {9459#(= 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); {9459#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:40:48,726 INFO L290 TraceCheckUtils]: 36: Hoare triple {9459#(= 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); {9459#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:40:48,727 INFO L290 TraceCheckUtils]: 37: Hoare triple {9459#(= 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); {9459#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:40:48,727 INFO L290 TraceCheckUtils]: 38: Hoare triple {9459#(= 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); {9459#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:40:48,727 INFO L290 TraceCheckUtils]: 39: Hoare triple {9459#(= 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); {9459#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:40:48,728 INFO L290 TraceCheckUtils]: 40: Hoare triple {9459#(= 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); {9459#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:40:48,730 INFO L290 TraceCheckUtils]: 41: Hoare triple {9459#(= 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); {9459#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:40:48,731 INFO L290 TraceCheckUtils]: 42: Hoare triple {9459#(= 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); {9459#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:40:48,731 INFO L290 TraceCheckUtils]: 43: Hoare triple {9459#(= 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); {9460#(= |ssl3_accept_#t~mem58| 8496)} is VALID [2022-04-28 08:40:48,731 INFO L290 TraceCheckUtils]: 44: Hoare triple {9460#(= |ssl3_accept_#t~mem58| 8496)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {9455#false} is VALID [2022-04-28 08:40:48,731 INFO L290 TraceCheckUtils]: 45: Hoare triple {9455#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {9455#false} is VALID [2022-04-28 08:40:48,731 INFO L290 TraceCheckUtils]: 46: Hoare triple {9455#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {9455#false} is VALID [2022-04-28 08:40:48,732 INFO L290 TraceCheckUtils]: 47: Hoare triple {9455#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {9455#false} is VALID [2022-04-28 08:40:48,732 INFO L290 TraceCheckUtils]: 48: Hoare triple {9455#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {9455#false} is VALID [2022-04-28 08:40:48,732 INFO L290 TraceCheckUtils]: 49: Hoare triple {9455#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {9455#false} is VALID [2022-04-28 08:40:48,732 INFO L290 TraceCheckUtils]: 50: Hoare triple {9455#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {9455#false} is VALID [2022-04-28 08:40:48,732 INFO L290 TraceCheckUtils]: 51: Hoare triple {9455#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {9455#false} is VALID [2022-04-28 08:40:48,732 INFO L290 TraceCheckUtils]: 52: Hoare triple {9455#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {9455#false} is VALID [2022-04-28 08:40:48,732 INFO L290 TraceCheckUtils]: 53: Hoare triple {9455#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {9455#false} is VALID [2022-04-28 08:40:48,732 INFO L290 TraceCheckUtils]: 54: Hoare triple {9455#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {9455#false} is VALID [2022-04-28 08:40:48,732 INFO L290 TraceCheckUtils]: 55: Hoare triple {9455#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {9455#false} is VALID [2022-04-28 08:40:48,732 INFO L290 TraceCheckUtils]: 56: Hoare triple {9455#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {9455#false} is VALID [2022-04-28 08:40:48,732 INFO L290 TraceCheckUtils]: 57: Hoare triple {9455#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {9455#false} is VALID [2022-04-28 08:40:48,732 INFO L290 TraceCheckUtils]: 58: Hoare triple {9455#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {9455#false} is VALID [2022-04-28 08:40:48,732 INFO L290 TraceCheckUtils]: 59: Hoare triple {9455#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {9455#false} is VALID [2022-04-28 08:40:48,732 INFO L290 TraceCheckUtils]: 60: Hoare triple {9455#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {9455#false} is VALID [2022-04-28 08:40:48,732 INFO L290 TraceCheckUtils]: 61: Hoare triple {9455#false} assume 8640 == #t~mem75;havoc #t~mem75; {9455#false} is VALID [2022-04-28 08:40:48,732 INFO L290 TraceCheckUtils]: 62: Hoare triple {9455#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {9455#false} is VALID [2022-04-28 08:40:48,732 INFO L290 TraceCheckUtils]: 63: Hoare triple {9455#false} assume !(4 == ~blastFlag~0); {9455#false} is VALID [2022-04-28 08:40:48,733 INFO L290 TraceCheckUtils]: 64: Hoare triple {9455#false} assume !(7 == ~blastFlag~0); {9455#false} is VALID [2022-04-28 08:40:48,733 INFO L290 TraceCheckUtils]: 65: Hoare triple {9455#false} assume 10 == ~blastFlag~0; {9455#false} is VALID [2022-04-28 08:40:48,733 INFO L290 TraceCheckUtils]: 66: Hoare triple {9455#false} assume !false; {9455#false} is VALID [2022-04-28 08:40:48,733 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:40:48,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:40:48,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427240652] [2022-04-28 08:40:48,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427240652] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:40:48,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:40:48,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:40:48,734 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:40:48,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [718028881] [2022-04-28 08:40:48,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [718028881] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:40:48,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:40:48,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:40:48,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302815479] [2022-04-28 08:40:48,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:40:48,735 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-28 08:40:48,735 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:40:48,735 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:48,779 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:40:48,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:40:48,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:40:48,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:40:48,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:40:48,781 INFO L87 Difference]: Start difference. First operand 433 states and 648 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:50,324 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:40:57,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:40:57,000 INFO L93 Difference]: Finished difference Result 614 states and 926 transitions. [2022-04-28 08:40:57,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:40:57,000 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-28 08:40:57,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:40:57,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:57,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 479 transitions. [2022-04-28 08:40:57,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:57,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 479 transitions. [2022-04-28 08:40:57,006 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 479 transitions. [2022-04-28 08:40:57,332 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 479 edges. 479 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:40:57,365 INFO L225 Difference]: With dead ends: 614 [2022-04-28 08:40:57,365 INFO L226 Difference]: Without dead ends: 475 [2022-04-28 08:40:57,366 INFO L412 NwaCegarLoop]: 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-28 08:40:57,367 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 33 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:40:57,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 601 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-04-28 08:40:57,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2022-04-28 08:40:57,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 455. [2022-04-28 08:40:57,379 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:40:57,380 INFO L82 GeneralOperation]: Start isEquivalent. First operand 475 states. Second operand has 455 states, 450 states have (on average 1.5133333333333334) internal successors, (681), 450 states have internal predecessors, (681), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:57,380 INFO L74 IsIncluded]: Start isIncluded. First operand 475 states. Second operand has 455 states, 450 states have (on average 1.5133333333333334) internal successors, (681), 450 states have internal predecessors, (681), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:57,381 INFO L87 Difference]: Start difference. First operand 475 states. Second operand has 455 states, 450 states have (on average 1.5133333333333334) internal successors, (681), 450 states have internal predecessors, (681), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:57,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:40:57,390 INFO L93 Difference]: Finished difference Result 475 states and 711 transitions. [2022-04-28 08:40:57,390 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 711 transitions. [2022-04-28 08:40:57,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:40:57,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:40:57,391 INFO L74 IsIncluded]: Start isIncluded. First operand has 455 states, 450 states have (on average 1.5133333333333334) internal successors, (681), 450 states have internal predecessors, (681), 3 states have call successors, (3), 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 475 states. [2022-04-28 08:40:57,392 INFO L87 Difference]: Start difference. First operand has 455 states, 450 states have (on average 1.5133333333333334) internal successors, (681), 450 states have internal predecessors, (681), 3 states have call successors, (3), 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 475 states. [2022-04-28 08:40:57,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:40:57,401 INFO L93 Difference]: Finished difference Result 475 states and 711 transitions. [2022-04-28 08:40:57,401 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 711 transitions. [2022-04-28 08:40:57,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:40:57,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:40:57,402 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:40:57,402 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:40:57,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 450 states have (on average 1.5133333333333334) internal successors, (681), 450 states have internal predecessors, (681), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:57,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 685 transitions. [2022-04-28 08:40:57,413 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 685 transitions. Word has length 67 [2022-04-28 08:40:57,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:40:57,413 INFO L495 AbstractCegarLoop]: Abstraction has 455 states and 685 transitions. [2022-04-28 08:40:57,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:57,413 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 455 states and 685 transitions. [2022-04-28 08:40:57,941 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 685 edges. 685 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:40:57,941 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 685 transitions. [2022-04-28 08:40:57,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-28 08:40:57,943 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:40:57,943 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:40:57,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 08:40:57,943 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:40:57,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:40:57,943 INFO L85 PathProgramCache]: Analyzing trace with hash 520696844, now seen corresponding path program 1 times [2022-04-28 08:40:57,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:40:57,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1372416822] [2022-04-28 08:40:57,979 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:40:57,980 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:40:57,980 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:40:57,980 INFO L85 PathProgramCache]: Analyzing trace with hash 520696844, now seen corresponding path program 2 times [2022-04-28 08:40:57,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:40:57,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764009075] [2022-04-28 08:40:57,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:40:57,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:40:58,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:40:58,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:40:58,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:40:58,131 INFO L290 TraceCheckUtils]: 0: Hoare triple {12561#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {12554#true} is VALID [2022-04-28 08:40:58,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {12554#true} assume true; {12554#true} is VALID [2022-04-28 08:40:58,132 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12554#true} {12554#true} #693#return; {12554#true} is VALID [2022-04-28 08:40:58,134 INFO L272 TraceCheckUtils]: 0: Hoare triple {12554#true} call ULTIMATE.init(); {12561#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:40:58,135 INFO L290 TraceCheckUtils]: 1: Hoare triple {12561#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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); {12554#true} is VALID [2022-04-28 08:40:58,135 INFO L290 TraceCheckUtils]: 2: Hoare triple {12554#true} assume true; {12554#true} is VALID [2022-04-28 08:40:58,135 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12554#true} {12554#true} #693#return; {12554#true} is VALID [2022-04-28 08:40:58,135 INFO L272 TraceCheckUtils]: 4: Hoare triple {12554#true} call #t~ret161 := main(); {12554#true} is VALID [2022-04-28 08:40:58,136 INFO L290 TraceCheckUtils]: 5: Hoare triple {12554#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; {12554#true} is VALID [2022-04-28 08:40:58,136 INFO L290 TraceCheckUtils]: 6: Hoare triple {12554#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {12554#true} is VALID [2022-04-28 08:40:58,136 INFO L272 TraceCheckUtils]: 7: Hoare triple {12554#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {12554#true} is VALID [2022-04-28 08:40:58,136 INFO L290 TraceCheckUtils]: 8: Hoare triple {12554#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;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);~blastFlag~0 := 0;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); {12554#true} is VALID [2022-04-28 08:40:58,136 INFO L290 TraceCheckUtils]: 9: Hoare triple {12554#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; {12554#true} is VALID [2022-04-28 08:40:58,136 INFO L290 TraceCheckUtils]: 10: Hoare triple {12554#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; {12554#true} is VALID [2022-04-28 08:40:58,136 INFO L290 TraceCheckUtils]: 11: Hoare triple {12554#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {12554#true} is VALID [2022-04-28 08:40:58,136 INFO L290 TraceCheckUtils]: 12: Hoare triple {12554#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {12554#true} is VALID [2022-04-28 08:40:58,136 INFO L290 TraceCheckUtils]: 13: Hoare triple {12554#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {12554#true} is VALID [2022-04-28 08:40:58,136 INFO L290 TraceCheckUtils]: 14: Hoare triple {12554#true} assume !false; {12554#true} is VALID [2022-04-28 08:40:58,136 INFO L290 TraceCheckUtils]: 15: Hoare triple {12554#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); {12554#true} is VALID [2022-04-28 08:40:58,136 INFO L290 TraceCheckUtils]: 16: Hoare triple {12554#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {12554#true} is VALID [2022-04-28 08:40:58,136 INFO L290 TraceCheckUtils]: 17: Hoare triple {12554#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {12554#true} is VALID [2022-04-28 08:40:58,136 INFO L290 TraceCheckUtils]: 18: Hoare triple {12554#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {12554#true} is VALID [2022-04-28 08:40:58,136 INFO L290 TraceCheckUtils]: 19: Hoare triple {12554#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {12554#true} is VALID [2022-04-28 08:40:58,136 INFO L290 TraceCheckUtils]: 20: Hoare triple {12554#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {12554#true} is VALID [2022-04-28 08:40:58,136 INFO L290 TraceCheckUtils]: 21: Hoare triple {12554#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {12554#true} is VALID [2022-04-28 08:40:58,137 INFO L290 TraceCheckUtils]: 22: Hoare triple {12554#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {12554#true} is VALID [2022-04-28 08:40:58,137 INFO L290 TraceCheckUtils]: 23: Hoare triple {12554#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {12554#true} is VALID [2022-04-28 08:40:58,137 INFO L290 TraceCheckUtils]: 24: Hoare triple {12554#true} assume 8464 == #t~mem55;havoc #t~mem55; {12554#true} is VALID [2022-04-28 08:40:58,137 INFO L290 TraceCheckUtils]: 25: Hoare triple {12554#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; {12554#true} is VALID [2022-04-28 08:40:58,137 INFO L290 TraceCheckUtils]: 26: Hoare triple {12554#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {12554#true} is VALID [2022-04-28 08:40:58,138 INFO L290 TraceCheckUtils]: 27: Hoare triple {12554#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); {12559#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:40:58,138 INFO L290 TraceCheckUtils]: 28: Hoare triple {12559#(= 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); {12559#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:40:58,138 INFO L290 TraceCheckUtils]: 29: Hoare triple {12559#(= 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; {12559#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:40:58,139 INFO L290 TraceCheckUtils]: 30: Hoare triple {12559#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {12559#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:40:58,139 INFO L290 TraceCheckUtils]: 31: Hoare triple {12559#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {12559#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:40:58,139 INFO L290 TraceCheckUtils]: 32: Hoare triple {12559#(= 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); {12559#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:40:58,140 INFO L290 TraceCheckUtils]: 33: Hoare triple {12559#(= 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); {12559#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:40:58,140 INFO L290 TraceCheckUtils]: 34: Hoare triple {12559#(= 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); {12559#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:40:58,140 INFO L290 TraceCheckUtils]: 35: Hoare triple {12559#(= 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); {12559#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:40:58,141 INFO L290 TraceCheckUtils]: 36: Hoare triple {12559#(= 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); {12559#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:40:58,141 INFO L290 TraceCheckUtils]: 37: Hoare triple {12559#(= 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); {12560#(= |ssl3_accept_#t~mem52| 8496)} is VALID [2022-04-28 08:40:58,141 INFO L290 TraceCheckUtils]: 38: Hoare triple {12560#(= |ssl3_accept_#t~mem52| 8496)} assume 8480 == #t~mem52;havoc #t~mem52; {12555#false} is VALID [2022-04-28 08:40:58,141 INFO L290 TraceCheckUtils]: 39: Hoare triple {12555#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; {12555#false} is VALID [2022-04-28 08:40:58,141 INFO L290 TraceCheckUtils]: 40: Hoare triple {12555#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); {12555#false} is VALID [2022-04-28 08:40:58,141 INFO L290 TraceCheckUtils]: 41: Hoare triple {12555#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); {12555#false} is VALID [2022-04-28 08:40:58,141 INFO L290 TraceCheckUtils]: 42: Hoare triple {12555#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {12555#false} is VALID [2022-04-28 08:40:58,141 INFO L290 TraceCheckUtils]: 43: Hoare triple {12555#false} ~skip~0 := 0; {12555#false} is VALID [2022-04-28 08:40:58,141 INFO L290 TraceCheckUtils]: 44: Hoare triple {12555#false} assume !false; {12555#false} is VALID [2022-04-28 08:40:58,142 INFO L290 TraceCheckUtils]: 45: Hoare triple {12555#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); {12555#false} is VALID [2022-04-28 08:40:58,142 INFO L290 TraceCheckUtils]: 46: Hoare triple {12555#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {12555#false} is VALID [2022-04-28 08:40:58,142 INFO L290 TraceCheckUtils]: 47: Hoare triple {12555#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {12555#false} is VALID [2022-04-28 08:40:58,142 INFO L290 TraceCheckUtils]: 48: Hoare triple {12555#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {12555#false} is VALID [2022-04-28 08:40:58,142 INFO L290 TraceCheckUtils]: 49: Hoare triple {12555#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {12555#false} is VALID [2022-04-28 08:40:58,142 INFO L290 TraceCheckUtils]: 50: Hoare triple {12555#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {12555#false} is VALID [2022-04-28 08:40:58,142 INFO L290 TraceCheckUtils]: 51: Hoare triple {12555#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {12555#false} is VALID [2022-04-28 08:40:58,142 INFO L290 TraceCheckUtils]: 52: Hoare triple {12555#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {12555#false} is VALID [2022-04-28 08:40:58,142 INFO L290 TraceCheckUtils]: 53: Hoare triple {12555#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {12555#false} is VALID [2022-04-28 08:40:58,143 INFO L290 TraceCheckUtils]: 54: Hoare triple {12555#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {12555#false} is VALID [2022-04-28 08:40:58,143 INFO L290 TraceCheckUtils]: 55: Hoare triple {12555#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {12555#false} is VALID [2022-04-28 08:40:58,143 INFO L290 TraceCheckUtils]: 56: Hoare triple {12555#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {12555#false} is VALID [2022-04-28 08:40:58,143 INFO L290 TraceCheckUtils]: 57: Hoare triple {12555#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {12555#false} is VALID [2022-04-28 08:40:58,143 INFO L290 TraceCheckUtils]: 58: Hoare triple {12555#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {12555#false} is VALID [2022-04-28 08:40:58,143 INFO L290 TraceCheckUtils]: 59: Hoare triple {12555#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {12555#false} is VALID [2022-04-28 08:40:58,143 INFO L290 TraceCheckUtils]: 60: Hoare triple {12555#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {12555#false} is VALID [2022-04-28 08:40:58,143 INFO L290 TraceCheckUtils]: 61: Hoare triple {12555#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {12555#false} is VALID [2022-04-28 08:40:58,143 INFO L290 TraceCheckUtils]: 62: Hoare triple {12555#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {12555#false} is VALID [2022-04-28 08:40:58,143 INFO L290 TraceCheckUtils]: 63: Hoare triple {12555#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {12555#false} is VALID [2022-04-28 08:40:58,143 INFO L290 TraceCheckUtils]: 64: Hoare triple {12555#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {12555#false} is VALID [2022-04-28 08:40:58,143 INFO L290 TraceCheckUtils]: 65: Hoare triple {12555#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {12555#false} is VALID [2022-04-28 08:40:58,143 INFO L290 TraceCheckUtils]: 66: Hoare triple {12555#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {12555#false} is VALID [2022-04-28 08:40:58,143 INFO L290 TraceCheckUtils]: 67: Hoare triple {12555#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {12555#false} is VALID [2022-04-28 08:40:58,143 INFO L290 TraceCheckUtils]: 68: Hoare triple {12555#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {12555#false} is VALID [2022-04-28 08:40:58,143 INFO L290 TraceCheckUtils]: 69: Hoare triple {12555#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {12555#false} is VALID [2022-04-28 08:40:58,143 INFO L290 TraceCheckUtils]: 70: Hoare triple {12555#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {12555#false} is VALID [2022-04-28 08:40:58,143 INFO L290 TraceCheckUtils]: 71: Hoare triple {12555#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {12555#false} is VALID [2022-04-28 08:40:58,144 INFO L290 TraceCheckUtils]: 72: Hoare triple {12555#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {12555#false} is VALID [2022-04-28 08:40:58,144 INFO L290 TraceCheckUtils]: 73: Hoare triple {12555#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {12555#false} is VALID [2022-04-28 08:40:58,144 INFO L290 TraceCheckUtils]: 74: Hoare triple {12555#false} assume 8640 == #t~mem75;havoc #t~mem75; {12555#false} is VALID [2022-04-28 08:40:58,144 INFO L290 TraceCheckUtils]: 75: Hoare triple {12555#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {12555#false} is VALID [2022-04-28 08:40:58,144 INFO L290 TraceCheckUtils]: 76: Hoare triple {12555#false} assume !(4 == ~blastFlag~0); {12555#false} is VALID [2022-04-28 08:40:58,144 INFO L290 TraceCheckUtils]: 77: Hoare triple {12555#false} assume !(7 == ~blastFlag~0); {12555#false} is VALID [2022-04-28 08:40:58,144 INFO L290 TraceCheckUtils]: 78: Hoare triple {12555#false} assume 10 == ~blastFlag~0; {12555#false} is VALID [2022-04-28 08:40:58,144 INFO L290 TraceCheckUtils]: 79: Hoare triple {12555#false} assume !false; {12555#false} is VALID [2022-04-28 08:40:58,144 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:40:58,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:40:58,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764009075] [2022-04-28 08:40:58,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764009075] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:40:58,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:40:58,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:40:58,145 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:40:58,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1372416822] [2022-04-28 08:40:58,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1372416822] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:40:58,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:40:58,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:40:58,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107205549] [2022-04-28 08:40:58,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:40:58,146 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 80 [2022-04-28 08:40:58,146 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:40:58,147 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:58,199 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:40:58,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:40:58,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:40:58,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:40:58,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:40:58,200 INFO L87 Difference]: Start difference. First operand 455 states and 685 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:59,824 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:41:03,443 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:41:05,455 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-28 08:41:06,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:41:06,573 INFO L93 Difference]: Finished difference Result 636 states and 962 transitions. [2022-04-28 08:41:06,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:41:06,573 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 80 [2022-04-28 08:41:06,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:41:06,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:06,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 478 transitions. [2022-04-28 08:41:06,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:06,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 478 transitions. [2022-04-28 08:41:06,580 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 478 transitions. [2022-04-28 08:41:06,907 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 478 edges. 478 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:41:06,918 INFO L225 Difference]: With dead ends: 636 [2022-04-28 08:41:06,918 INFO L226 Difference]: Without dead ends: 475 [2022-04-28 08:41:06,918 INFO L412 NwaCegarLoop]: 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-28 08:41:06,919 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 38 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:41:06,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 601 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 447 Invalid, 1 Unknown, 0 Unchecked, 6.1s Time] [2022-04-28 08:41:06,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2022-04-28 08:41:06,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 455. [2022-04-28 08:41:06,938 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:41:06,939 INFO L82 GeneralOperation]: Start isEquivalent. First operand 475 states. Second operand has 455 states, 450 states have (on average 1.511111111111111) internal successors, (680), 450 states have internal predecessors, (680), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:06,940 INFO L74 IsIncluded]: Start isIncluded. First operand 475 states. Second operand has 455 states, 450 states have (on average 1.511111111111111) internal successors, (680), 450 states have internal predecessors, (680), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:06,941 INFO L87 Difference]: Start difference. First operand 475 states. Second operand has 455 states, 450 states have (on average 1.511111111111111) internal successors, (680), 450 states have internal predecessors, (680), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:06,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:41:06,949 INFO L93 Difference]: Finished difference Result 475 states and 710 transitions. [2022-04-28 08:41:06,949 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 710 transitions. [2022-04-28 08:41:06,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:41:06,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:41:06,950 INFO L74 IsIncluded]: Start isIncluded. First operand has 455 states, 450 states have (on average 1.511111111111111) internal successors, (680), 450 states have internal predecessors, (680), 3 states have call successors, (3), 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 475 states. [2022-04-28 08:41:06,951 INFO L87 Difference]: Start difference. First operand has 455 states, 450 states have (on average 1.511111111111111) internal successors, (680), 450 states have internal predecessors, (680), 3 states have call successors, (3), 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 475 states. [2022-04-28 08:41:06,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:41:06,959 INFO L93 Difference]: Finished difference Result 475 states and 710 transitions. [2022-04-28 08:41:06,959 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 710 transitions. [2022-04-28 08:41:06,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:41:06,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:41:06,960 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:41:06,960 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:41:06,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 450 states have (on average 1.511111111111111) internal successors, (680), 450 states have internal predecessors, (680), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:06,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 684 transitions. [2022-04-28 08:41:06,970 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 684 transitions. Word has length 80 [2022-04-28 08:41:06,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:41:06,970 INFO L495 AbstractCegarLoop]: Abstraction has 455 states and 684 transitions. [2022-04-28 08:41:06,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:41:06,971 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 455 states and 684 transitions. [2022-04-28 08:41:07,502 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 684 edges. 684 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:41:07,502 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 684 transitions. [2022-04-28 08:41:07,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-04-28 08:41:07,503 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:41:07,504 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:41:07,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-28 08:41:07,504 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:41:07,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:41:07,504 INFO L85 PathProgramCache]: Analyzing trace with hash -763615238, now seen corresponding path program 1 times [2022-04-28 08:41:07,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:41:07,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1528304594] [2022-04-28 08:41:07,645 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 18 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 08:41:07,645 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:41:07,645 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:41:07,646 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.logic.Theory.term(Theory.java:1603) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:401) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:392) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.term(WrapperScript.java:249) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.term(WrapperScript.java:249) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.PredicateHelper.makeReflexive(PredicateHelper.java:222) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.acceleratedInterpolationCoreIsCorrect(AcceleratedInterpolationCore.java:253) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:195) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAcceleratedInterpolation.construct(IpTcStrategyModuleAcceleratedInterpolation.java:80) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-28 08:41:07,652 INFO L158 Benchmark]: Toolchain (without parser) took 71406.06ms. Allocated memory was 178.3MB in the beginning and 213.9MB in the end (delta: 35.7MB). Free memory was 126.0MB in the beginning and 140.7MB in the end (delta: -14.7MB). Peak memory consumption was 21.9MB. Max. memory is 8.0GB. [2022-04-28 08:41:07,652 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 178.3MB. Free memory is still 145.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 08:41:07,653 INFO L158 Benchmark]: CACSL2BoogieTranslator took 472.65ms. Allocated memory was 178.3MB in the beginning and 213.9MB in the end (delta: 35.7MB). Free memory was 125.7MB in the beginning and 167.4MB in the end (delta: -41.6MB). Peak memory consumption was 17.3MB. Max. memory is 8.0GB. [2022-04-28 08:41:07,653 INFO L158 Benchmark]: Boogie Preprocessor took 128.16ms. Allocated memory is still 213.9MB. Free memory was 167.4MB in the beginning and 157.4MB in the end (delta: 10.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-28 08:41:07,653 INFO L158 Benchmark]: RCFGBuilder took 1568.37ms. Allocated memory is still 213.9MB. Free memory was 157.4MB in the beginning and 135.6MB in the end (delta: 21.8MB). Peak memory consumption was 50.3MB. Max. memory is 8.0GB. [2022-04-28 08:41:07,653 INFO L158 Benchmark]: TraceAbstraction took 69233.34ms. Allocated memory is still 213.9MB. Free memory was 135.1MB in the beginning and 140.7MB in the end (delta: -5.7MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 08:41:07,654 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.10ms. Allocated memory is still 178.3MB. Free memory is still 145.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 472.65ms. Allocated memory was 178.3MB in the beginning and 213.9MB in the end (delta: 35.7MB). Free memory was 125.7MB in the beginning and 167.4MB in the end (delta: -41.6MB). Peak memory consumption was 17.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 128.16ms. Allocated memory is still 213.9MB. Free memory was 167.4MB in the beginning and 157.4MB in the end (delta: 10.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * RCFGBuilder took 1568.37ms. Allocated memory is still 213.9MB. Free memory was 157.4MB in the beginning and 135.6MB in the end (delta: 21.8MB). Peak memory consumption was 50.3MB. Max. memory is 8.0GB. * TraceAbstraction took 69233.34ms. Allocated memory is still 213.9MB. Free memory was 135.1MB in the beginning and 140.7MB in the end (delta: -5.7MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.logic.Theory.term(Theory.java:1603) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-28 08:41:07,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...